搜索资源列表
滤波处理
- 滤波处理，包括最大值滤波、最小值滤波、中值滤波和平均值滤波！-filter processing, including filtering maximum and the minimum of filtering, median filtering and filtering average!
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
fdgetnew
- 将原始图象分成eXe大小的子块，找出每块中的最大值和最小值，计算差值并量化，再用rXr大小的子块计算分形值-original image will be divided into eXe size of the block to identify every piece of the maximum and minimum, margin calculations and quantified, and then rXr size of the block-value calculation F
maxminestimate
- 最大最小值估计，适合学习统计理论和模糊方面的结合应用，尤其是在模式识别方面的分类。-largest minimum estimate for statistical learning theory and fuzzy combination of the application, especially in regard to the classification of pattern recognition.
CGMEC013395
- 最小覆盖圆，很多点，然后找一个最小覆盖他们这些点的圆，有算法。-coverage of the smallest circle, many of the points, and then look for a minimum coverage of these points they won, algorithm.
PQP
- PQP is a library for performing three types of proximity queries on a pair of geometric models composed of triangles: collision detection - detecting whether the two models overlap, and optionally, all of the triangles that overlap. distance co
minarea
- 本程序主要实现在输入的随机点集中，找到能够包含该点集的最小方形和圆形！本程序是基于OpenCV的，使用前请安装此软件-the main procedures in the importation of random focus that can contain the point set the minimum square and round! This procedure is based on OpenCV, before using the installation software
quickbag
- 快速求解离散点集的最小闭包，用于构建delaunay三角形中-discrete point set the minimum closure, used to build nodes Triangle
3_MinCut.rar
- 一个经典的求解最大流最小割代码 VC++版本,A classical solution of maximum flow minimum cut code VC++ Version
kolmog
- 给定任意一个子波，通过克基霍夫变换返回最小相位子波。-Kolmogoroff spectral factorization. Given an arbitrary wavelet this function retrieves the minimum phase wavelet using Kolmogoroff factorization
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
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
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi
minimum-Euclidean-Distance
- minimum Euclidean Distance
Graph-theory-Kruskal-minimum-spanning-tree-algori
- Graph theory Kruskal minimum spanning tree algorithm and Paint program
Minimum-bounding-rectangle
- 使用VC编写的处理图像中的目标的最小外接矩形的求取，以及自动圈取目标，结合OpenCV显示结果。-VC prepared by processing images of the target minimum bounding rectangle of the strike, as well as automatic lap to take target, combined with the OpenCV display results.
FINDING-THE-GLOBAL-MINIMUM
- FINDING THE GLOBAL MINIMUM FOR BINARY IMAGE RESTORATION
STREAMING-MAXIMUM-MINIMUM
- 这是一个复杂度为O（1）的最小滤波方法，文中思想实现后，计算速度快，可以减少程序运行时间。-This is a complexity of O (1) the minimum filtering method, later in ideology, calculation speed, can reduce the running time of the program.
Minimum-circumscribed-quadrilateral
- 求解不规则图形的最小外接四边形的面积，在图向形态特征提取领域有很好的使用价值。-For solving the minimum circumscribed quadrilateral irregular graphics area, in the field of figure to form feature extraction has very good use value.
minimum-bounding-rectangle-of--mulitiobject___by-
- in object detection mission, we usually need to bound the object with rectangle, which is called minimum bounding rectangle(MBR). My code can bound objects in the .bmp image with MBRs in any direction and Draw them.