CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - matlab finds
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - matlab finds - List
[
matlab
]
gafmax
DL : 0
% [BestPop,Trace]=fmaxga(FUN,LB,UB,eranum,popsize,pcross,pmutation) % Finds a maximum of a function of several variables. % fmaxga solves problems of the form: % max F(X) subject to: LB <= X <= UB % BestPop--------最优的群体即为最优的染色体群 % Trace----------最佳染色体所对应的目标函数值 % FUN------------目标函数 % LB-------------自变量下限 % UB-------------自变量上限 % eranum---------种群的代数,取100--1000(默认1000) % popsize--------每一代种群的规模;此可取50--100(默认50) % pcross---------交叉的概率,此概率一般取0.5--0.85之间较好(默认0.8) % pmutation------变异的概率,该概率一般取0.05-0.2左右较好(默认0.1) % options--------1×2矩阵,options(1)=0二进制编码(默认0),option(1)~=0十进制编码,option(2)设定求解精度(默认1e-4)- [BestPop, Trace] = fmaxga (FUN, LB, UB, eranum, popsize, pcross, pmutation) Finds a maximum of a function of several variables. Fmaxga solves problems of the form: max F (X) subject to : LB <= X <= UB BestPop-------- optimal chromosome groups is the best group Trace---------- chromosome corresponding to the best objective function value FUN------------ objective function LB------------- variable lower limit since the UB------------- variable upper limit eranum--------- populations algebra, take 100- 1000 (default 1000) popsize-------- population size of each generation this desirable 50- 100 (default 50) pcross--------- crossover probability, the probability of a general check 0.5- 0.85 between the better (default 0.8) pmutation------ mutation probability, the probability of 0.05 general admission better about-0.2 (default 0.1) options-------- 1 × 2 matrix, options (1) = 0 binary code (default 0), option (1) ~ = 0 decimal coding, option (2 ) set accuracy (default 1e-4)
Update
: 2025-02-17
Size
: 3kb
Publisher
:
mmcc
[
Other
]
geneticalgrithmprogram
DL : 0
BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [errmsg,Z,X,t,c,fail] = % BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) % % BNB solves problems of the form: % Minimize F(x) subject to: xlb <= x0 <=xub % A*x <= B Aeq*x=Beq % C(x)<=0 Ceq(x)=0 % x(i) is continuous for xstatus(i)=0 % x(i) integer for xstatus(i)= 1 % x(i) fixed for xstatus(i)=2 %-BNB20 Finds the constrained minimum of a fu nction of several possibly integer variables. % Usage : [errmsg, Z, X, t, c, fail] =% BNB20 (fun, x0, xstatus, xlb, xub, A, B, Aeq, Beq, nonlcon. settings, options, P1, P2, ...)%% BNB solves problems of the form : Minimize% F (x) subject to : xlb
Update
: 2025-02-17
Size
: 6kb
Publisher
:
冯颖
[
assembly language
]
matlabAdjustment
DL : 0
利用MATLAB实现了对测量中的平面网,高程网和边角网的平差,是测量中比不可少的程序.-Realize the use of MATLAB on the measurement plane net, nets and corner elevation adjustment network is the measurement procedures than indispensable.
Update
: 2025-02-17
Size
: 430kb
Publisher
:
luozhongquan
[
Video Capture
]
TSsear
DL : 0
1. this function is for image (width=176, hight=144) only. but you can modify the related value to fit yours. 2. it is used to evaluate the motion vector between the Nth image and N-1th image. 3. it use Three Steps search algorithm. 4. this algorithm finds the closest pixel near the original pixel in three times.-1. This function is for image (width = 176, hight = 144) only. But you can modify the related value to fit yours.2. It is used to evaluate the motion vector between the Nth image and N-1th image.3 . it use Three Steps search algorithm.4. this algorithm finds the closest pixel near the original pixel in three times.
Update
: 2025-02-17
Size
: 92kb
Publisher
:
samk
[
Documents
]
OFDM-basedWirelessBroadBandSystemSimulator
DL : 0
基于OFDM的无线宽带系统仿真It contains mainly two parts, i.e. link-level simulator and system-level simulator. Link-level simulator focus on a single-cell single-user scenario, where signal is transmitted from tx, and estimated at rx. Comparing the difference in tx/rx signal, the error rate can be found out. The output of the link-level simulator is the BLER/BER vs. SNR mapping table, that can be used for the system-level simulation. System-level simulator focus on a multi-cell multi-user scenario. For the sake of simplicity, it takes the mapping table aquired in the link-level simulation, measure the actural SNR, and finds the corresponding error rate.-OFDM-based wireless broadband system simulation It contains mainly two parts, ie link-level simulator and system-level simulator.Link-level simulator focus on a single-cell single-user scenario, where signal is transmitted from tx, and estimated at rx . Comparing the difference in tx/rx signal, the error rate can be found out. The output of the link-level simulator is the BLER/BER vs. SNR mapping table, that can be used for the system-level simulation.System- level simulator focus on a multi-cell multi-user scenario. For the sake of simplicity, it takes the mapping table aquired in the link-level simulation, measure the actural SNR, and finds the corresponding error rate.
Update
: 2025-02-17
Size
: 250kb
Publisher
:
zhangli
[
Special Effects
]
Findedgesofacolorimage
DL : 0
This program finds the edges of a color image by converting the original image to YCbCr color space. Basic edge detection technique used is canny. -This program finds the edges of a color image by converting the original image to YCbCr color space. Basic edge detection technique used is canny.
Update
: 2025-02-17
Size
: 7kb
Publisher
:
zhangpeng
[
GPS develop
]
calculatePseudoranges-trial
DL : 0
This GPS in matlab calculatePseudoranges finds relative pseudoranges for all satellites listed in CHANNELLIST at the specified millisecond of the processed signal. The pseudoranges contain unknown receiver clock offset. It can be found by the least squares position search procedure. -This is GPS in matlab calculatePseudoranges finds relative pseudoranges for all satellites listed in CHANNELLIST at the specified millisecond of the processed signal. The pseudoranges contain unknown receiver clock offset. It can be found by the least squares position search procedure.
Update
: 2025-02-17
Size
: 1kb
Publisher
:
Nelson Loh
[
Windows Develop
]
my_codes1
DL : 0
简单的模板程序配准,匹配的效果基本上可以满足一般的要求。实用,简单。-two functions used to implement template matching. the program finds the template image inside the target image using correlation.
Update
: 2025-02-17
Size
: 9kb
Publisher
:
wangwei
[
Communication-Mobile
]
ACF_of_PN_Sequence
DL : 0
This m-file finds the periodic ACF of all the m-sequences of length 31.In this program m-sequences of length 31 are generated and its periodic Autocorrelation function is plotted-This m-file finds the periodic ACF of all the m-sequences of length 31.In this program m-sequences of length 31 are generated and its periodic Autocorrelation function is plotted..
Update
: 2025-02-17
Size
: 2kb
Publisher
:
Rafal
[
Windows Develop
]
green
DL : 0
Program that finds the 16 green dots in a 3d grid for camera calibration and assossiotes with the metric measures in a txt file, for later use in calibration procedure
Update
: 2025-02-17
Size
: 19.72mb
Publisher
:
Guilherme
[
Graph program
]
Prims_Algorithm
DL : 0
Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Update
: 2025-02-17
Size
: 1kb
Publisher
:
kenny
[
Algorithm
]
leastsquareellipse
DL : 0
至少输入五个点,得到最小二乘模拟椭圆,最后得到椭圆左右焦点以及主轴与x轴夹角等具体参数-[Xc,Yc,A,B,Phi,P]=ELLIPSEFIT(X,Y) finds the least squares ellipse that best fits the data in X and Y. X and Y must have at least 5 data points. Xc and Yc are the x- and y-axis center of the ellipse respectively.
Update
: 2025-02-17
Size
: 2kb
Publisher
:
nancy
[
AI-NN-PR
]
tsp_ga
DL : 0
SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to the starting city) -SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to the starting city)
Update
: 2025-02-17
Size
: 3kb
Publisher
:
gao
[
Graph Recognize
]
Edge_Detection
DL : 0
Edge Detection This demo finds the edges of objects in a video stream using the Prewitt method. You can double-click the Edge Detection block and adjust the Threshold parameter while the simulation is running. The higher you make the threshold, the smaller the amount of edges the demo finds in the video. This demo also illustrates how to use the Compositing block to overlay the edges on the original video frames.
Update
: 2025-02-17
Size
: 6kb
Publisher
:
radim.rh
[
matlab
]
Size_of_nano_particle
DL : 0
This finds size of nano particle, via some image processing technique. we have to enter the minimum and maximum diameter of particles to get download-This finds size of nano particle, via some image processing technique. we have to enter the minimum and maximum diameter of particles to get download....
Update
: 2025-02-17
Size
: 4.69mb
Publisher
:
pulak
[
matlab
]
find_pmarks
DL : 0
Function used by PSOLA speech modification technique. Finds exact point of pitch pulses in speech.
Update
: 2025-02-17
Size
: 2kb
Publisher
:
zxMaca
[
matlab
]
BlockMatchingAlgoMPEG
DL : 0
Block Matching Algorithms for Motion Estimation This project contains the project report and source code by Aroh Barjatya for Digital Image Processing Class at Utah State University. Following is a short description of the m files in this zip motionsEstAnalysis.m Script to execute all Algorithms motionEstES.m Exhaustive Search Algorithm motionEstTSS.m Three Step Search Algorithm motionEstNTSS.m New Three Step Search Algorithm motionEstSESTSS.m Simple And Efficient Search Algorithm motionEst4SS.m Four Step Search Algorithm motionEstDS.m Diamond Search Algorithm motionEstARPSm Adaptive Root Pattern Search Algorithm costFuncMAD.m Mean Absolute Difference Function minCost.m minimum cost among macro blocks motionComp.m motion compensated image creator imgPSNR.m finds image PSNR w.r.t. reference image The test images can be found at http://cc.usu.edu/~arohb/caltrain.zip-Block Matching Algorithms for Motion Estimation This project contains the project report and source code by Aroh Barjatya for Digital Image Processing Class at Utah State University. Following is a short description of the m files in this zip motionsEstAnalysis.m Script to execute all Algorithms motionEstES.m Exhaustive Search Algorithm motionEstTSS.m Three Step Search Algorithm motionEstNTSS.m New Three Step Search Algorithm motionEstSESTSS.m Simple And Efficient Search Algorithm motionEst4SS.m Four Step Search Algorithm motionEstDS.m Diamond Search Algorithm motionEstARPSm Adaptive Root Pattern Search Algorithm costFuncMAD.m Mean Absolute Difference Function minCost.m minimum cost among macro blocks motionComp.m motion compensated image creator imgPSNR.m finds image PSNR w.r.t. reference image The test images can be found at http://cc.usu.edu/~arohb/caltrain.zip
Update
: 2025-02-17
Size
: 116kb
Publisher
:
Yashil
[
Communication-Mobile
]
velocity_triangulation
DL : 0
Description This function finds the velocity of a 2-dimensional planar wave from at least 2 sensors, by specifying its location (x,y) or (lon,lat) and its respective arrival time. It returns the speed and direction (or tracking if coordinates were given): >> [VEL,DIR] = velocity_triangulation(x,y,time,TOL) where TOL is a tolerance time. You may get a figure with the results, like the one shown in the screenshot. Just take a look to the optional arguments. Enjoy it! Any comments and bugs reports will be very appreciated! MATLAB release MATLAB 7.7 (R2008b) -Description This function finds the velocity of a 2-dimensional planar wave from at least 2 sensors, by specifying its location (x,y) or (lon,lat) and its respective arrival time. It returns the speed and direction (or tracking if coordinates were given): >> [VEL,DIR] = velocity_triangulation(x,y,time,TOL) where TOL is a tolerance time. You may get a figure with the results, like the one shown in the screenshot. Just take a look to the optional arguments. Enjoy it! Any comments and bugs reports will be very appreciated! MATLAB release MATLAB 7.7 (R2008b)
Update
: 2025-02-17
Size
: 7kb
Publisher
:
Józef
[
Special Effects
]
ASM_version1b
DL : 0
ASM是由Cootes和泰勒推出的多分辨率方法的一个例子。 基本思想: 在ASM模型训练,训练从手工绘制的图像轮廓。发现的ASM模型在训练使用主成分分析(PCA),使该模型自动识别数据的主要变化是,如果可能的轮廓/好的对象的轮廓。还包含了ASM模型的协方差矩阵描述行垂直纹理口岸时,在正确的位置。 -Description This is an example of the basic Active Shape Model (ASM) as introduced by Cootes and Taylor, with multi-resolution approach. Basic idea: The ASM model is trained from manually drawn contours in training images. The ASM model finds the main variations in the training data using Principal Component Analysis (PCA), which enables the model to automatically recognize if a contour is a possible/good object contour. Also the ASM models contains covariance matrices describing the texture of the lines perpendicular to the control points when in the correct positions. After creating the ASM model, an initial contour is deformed by finding the best texture match for the control points. This is an iterative process, in which the movement of the control points is limited by what the ASM model recognizes from the training data as a "normal" object contour. Literature: - Ginneken B. et al. "Active Shape Model Segmentation with Optimal Features", IEEE Transactions on Medical I
Update
: 2025-02-17
Size
: 9.72mb
Publisher
:
谢冉
[
Software Engineering
]
distancerelay
DL : 2
distance relay- finds impedance value of transmission line
Update
: 2025-02-17
Size
: 9kb
Publisher
:
manish
«
1
2
3
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.