搜索资源列表
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
CGMEC013395
- 最小覆盖圆，很多点，然后找一个最小覆盖他们这些点的圆，有算法。-coverage of the smallest circle, many of the points, and then look for a minimum coverage of these points they won, algorithm.
RLine
- 通过一系列点利用最小2乘法拟合直线，还包含画和计算法线平行线一些小函数-through a series of points with a minimum two multiplication fitting straight line, also includes paintings and calculating normal parallel lines some small function
Statisticalparameterscalculatedimage
- 有四个单独的MATLAB程序，是对一幅256的单色图像进行最大值计算，最小值计算，均值计算，还有一个是画出其直方图-four separate MATLAB program is to a 256 monochrome image maximum, minimum, mean, there is a painted its histogram
cp_ofc_vb
- A radar chart example with VB.NET :: Draw a radar chart with minimum knowledge of ASP.NET (VB.NET)
blossom5-v2.01.src.tar
- 基于文献“一种新的最小割完美匹配算法”的最小割匹配算法-An implementation of a minimum cost perfect matching algorithm described in Blossom V: A new implementation of a minimum cost perfect matching algorithm. Vladimir Kolmogorov. To appear in Mathema
MinAreaRectangle
- 对平面上的点集，寻找它的最小面积包围矩形，最小周长包围矩形，以及最大距离点对。算法采用了游标卡尺的思想，在找到凸包后时间复杂度为线性。-for finding the minimum area encasing rectangle and the maximum distance pair. The complexity of this algorithm is O(n),so it s very fast.
L0
- 最小范数 最小二乘解 国外源码 希望对大家有用-Minimum norm least squares solution of foreign source
3step
- This algorithm was introduced by Koga et al in 1981. It became very popular because of its simplicity and also robust and near optimal performance. It searches for the best motion vectors in a coarse to fine search pattern. The algorithm may be descr
MLS
- 基于最小移动二乘算法的图像变形算法，效果非常好-Moving least square algorithm based on the minimum image deformation algorithm, the effect is very good
MINTREE
- 用各种求解最小生成树的算法实现最小生成树的动态演示-Solving the minimum spanning tree algorithm to achieve the dynamic presentation of the minimum spanning tree
LowpassFIR
- 选择hamming窗来实现最小阻带衰减为50dB的一个低通FIR滤波器-Select hamming window to achieve the minimum stopband attenuation of 50dB, a low-pass FIR filter
face
- 人脸检测C源程序，主要是最小外接矩形算法和椒盐去噪，中值滤波的实现程序。-Face Detection C source, minimum bounding rectangle algorithm and salt and pepper denoising, the realization of the program of the median filter.
max-and-min-filter
- 图像的最大值和最小值滤波，利用opencv实现-The image of the maximum and minimum value filtering, the use of opencv realization
MinRecArea
- c 实现了以点阵表示的多边形的最小外接矩形，并求出其的面积。-c to achieve a in order to dot-matrix expressed of polygons of the minimum bounding rectangle, and calculated its of the area.
lsphasingunwrapiing
- 最小二程相位解包裹，可以很好的得到解包裹图像，挺好的 -Minimum two-way phase unwrapping, can get unwrapped image is very good, very good
test
- 绘制二维密度散点图，根据x，y的最大最小值将坐标分成若干小格，然后统计落在每个小格里的点数，最后形成的就是一个矩阵，然后直接出图-Drawing two-dimensional density scatter plot, according to the x, y minimum and maximum values of the coordinates into a number of small cells, then every little statistic
algorithm
- This paper presents a new algorithm for partitioning a gray-level image into connected homogeneous regions. The novelty of this algorithm lies in the fact that, by constructing a minimum spanning tree representation of a gray-level image, it reduce
functsyn-several
- BNB20 Finds the constrained minimum of a function of several