搜索资源列表
mintwo-C
- * 本算法用最小二乘法依据指定的M个基函数及N个已知数据进行曲线拟和 * 输入: m--已知数据点的个数M * f--M维基函数向量 * n--已知数据点的个数N-1 * x--已知数据点第一坐标的N维列向量 * y--已知数据点第二坐标的N维列向量 * a--无用 * 输出: 函数返回值为曲线拟和的均方误差 * a为用基函数进行曲线拟和的系数, * 即a[0]f[0]+a[1]f[1]+...+a[M]f[M]. -* The alg
snake.m
- snakes are a variational technique to find the best contour that aligns with an image. The basic routine, snake.m, aligns a sequence of points along a contour to the maximum of an array or image. Provide it with an image, a set of starting points, li
snake_demo.m
- The m-file is a demonstration scr ipt. Using your own array of image data, or a built-in default, a demo window is displayed where you can click to indicate points and see the snake program in action.
描述:把M个同样的苹果放在N个同样的盘子里
- 描述:把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。 输入:第一行是测试数据的数目t(0 <= t <= 20)。以下每行均包含二个整数M和N,以空格分开。1<=M,N<=10。 输出:对输入的每组数据M和N,用一行输出相应的K。 输入实例: 1 7 3 输出实例:8 -Descr iption: The same apples to the
fit_ellipse.m.zip
- Its a Ellipse fitting algorithm for fitting Ellipses to a set of points in a image.,Its a Ellipse fitting algorithm for fitting Ellipses to a set of points in a image.
StereoImage1.0
- 这是我用Delphi和Matlab写的一个程序,可以生成立体图像(3DS Max 脚本)、将平面图像立体化、基本矩阵计算、极线校正。作者保留所有权利。请勿用于商业用途。欢迎大家对它进行完善。-This is what I use Delphi and a program written in Matlab, can generate three-dimensional images (3DS Max scr ipt), will be three-dimensional planar image
fingerprint
- Type Classification Code: main.m (program control) discretize.m (converts image to discrete values) plotimg.m (plots images) dirImg.m (computes the directional image) extract.m (extracts square portion of image - called by di
m
- Mean Shift 这个概念最早是由Fukunaga等人[1]于1975年在一篇关于概率密度梯度函数的估计中提出来的,其最初含义正如其名,就是偏移的均值向量,在这里Mean Shift是一个名词,它指代的是一个向量,但随着Mean Shift理论的发展,Mean Shift的含义也发生了变化,如果我们说Mean Shift算法,一般是指一个迭代的步骤,即先算出当前点的偏移均值,移动该点到其偏移均值,然后以此为新的起始点,继续移动,直到满足一定的条件结束.-Mean Shift the conc
OFDMSimulationUsingMatlab
- OFDM仿真利用MATLAB。M语言编写。很适合新手。连赚点积分。-OFDM simulation using MATLAB. M language. Very fit novice. Even earn points.
saveFigures.m
- Function saveFigures inputs: fighandle Handle of the figure to save path Path under which the figure is to be saved name File name under which the figure is to be saved optionals: width [cm] default 13 height [cm] def
imageResampling.m
- This function resamples the images at the new grid points defined by the new pixel sizes. It assumes that intensities are defined at the pixel centers
EndPointDetector
- End point detector Implementation of "An Algorithm for Determining the Endpoints of Isolated Utterances, L. R. Rabiner and M. R.Sambur
ImageMosaicCode
- 老外编的的程序,可以成功运行,推荐下载学习-mosaic.m Code Descr iption The mosaic.m scr ipt operates as follows: First, it converts the values of the images from unsigned int to double. This is done because most of the MATLAB operations use double as default type. Th
Multi-travelingsalesmanproblem
- 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提 出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题, 并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of pra
1
- 任务:参加运动会有n个学校,学校编号为1……n。比赛分成m个男子项目,和w个女子项目。项目编号为男子1……m,女子m+1……m+w。不同的项目取前五名或前三名积分;取前五名的积分分别为:7、5、3、2、1,前三名的积分分别为:5、3、2;哪些取前五名或前三名由学生自己设定。(m<=20,n<=20) 功能要求: 1)可以输入各个项目的前三名或前五名的成绩; 2)能统计各学校总分, 3)可以按学校编号或名称、学校总分、男女团体总分排序输出; 4)可以按学校编号查询学
imgkmeans
- 将K均值算法用于图像分割,输入的是彩色图像,转换为灰度图像进行分割,输出结果为灰度图像.利用灰度做为特征对每个像素进行聚类,由于光照等原因,有时应该属于一个物体的像素,其灰度值也会有很大的差别,可能导致对该像素的聚类发生错误.在分割结果中,该物体表面会出现一些不同于其它像素的噪声点,因此,算法的最后,对结果进行一次中值滤波,以消除噪声,达到平滑图像的作用-The K means algorithm for image segmentation, the input is a color imag
window.m
- This scr ipt calculate the Fourier transform of a Rectangular window of 64 points using an aproximation with a DFT of 1024 points,as well as calculates for differents values of f0 and f1 the module of the frecuency response of the windowed signal.
test1.m.tar
- 读图片,从图片中选取一点,计算该点与相邻四点的色彩相关系数。-Reading images, select one point from the picture and calculate its color correlation coefficient with the adjacent four points.
TSPga.m
- 应用遗传算法来解决多个点的遍历且满足距离最短问题-Application of genetic algorithm to solve the multiple points of traversing the shortest distance problems and meet
ACATSP.m
- 应用蚁群算法来解决所有点的遍历且距离最短的问题-Ant colony algorithm to solve all the points of the traversal and shortest distance problems