cubicfive

著名专家写的计算机视觉方面的原著，希望对大家有所帮助(Writing a well-known experts in the computer vision aspects of the original, and they hope to help everyone)

用hough变换提取直线的C++代码，效果比较好，可以灵活改变可提取直线的条数，适用于提取多条直线。(line detecting using hough tranaformation)

可以打开各种图像格式，并显示，很好很强大(Can open a variety of image formats)

基于遗传模拟退火和Otsu法的图像分割。采用一种基于模拟退火算法(SA)的混合遗传算法(GASA),来进行Otsu方法选择阈值，其中进行求解时是非线性的遗传算法（GA）的应用优化了求阈值过程，并尽可能地减少其运算量,而加入SA则避免了遗传算法(GA)常见的早熟收敛现象,从而实现有效简单的图像分割。 (adopt hybrid genetic algorithm(GASA) based on simulated annealing algorithm,choose threshold by Ostu method,which applicated the non-linear genetic algorithm(GA) allows us to optimize the process of threshold. And, where possible, to reduce the computation. in order to achieve effectivly and simply image segmentation. Combination SA is to avoid the common phenomenon about premature convergence in genetic algorithm (GA) to achieve a simple and effective image segmentation.)

本程序是对24位图片进行灰度化，并进行去边缘的，二值化(This program is to 24 bits images of gray, and go to the edge, binary )

Retinex理论的基础理论是物体的颜色是由物体对长波（红色）、中波（绿色）、短波（蓝色）光线的反射能力来决定的，而不是由反射光强度的绝对值来决定的，物体的色彩不受光照非均匀性的影响，具有一致性，即retinex是以色感一致性（颜色恒常性）为基础的。不同于传统的线性、非线性的只能增强图像某一类特征的方法，Retinex可以在动态范围压缩、边缘增强和颜色恒常三个方面打到平衡，因此可以对各种不同类型的图像进行自适应的增强。(The basic theory of Retinex theory is the color of the object by object for the long wavelength (red), medium (green), short wave (blue) light reflection ability to decide, rather than by the intensity of reflected light of the absolute value to decide, the color of the object under illumination nonuniformity effects, consistent with the Retinex, that is based on color constancy (color constancy based). Different from the traditional linear, nonlinear image enhancement method of only one kind of features, Retinex can be in dynamic range compression, edge enhancement and three aspects of color constancy hit the balance, thus enhancing adaptive to a variety of different types of images can be.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

最小二乘法拟合圆vc实现，最小二乘法(least squares analysis)是一种 数学 优化 技术，它通过 最小化 误差 的平方和找到一组数据的最佳 函数 匹配。 最小二乘法是用最简的方法求得一些绝对不可知的真值，而令误差平方之和为最小。(least squares fitting round vc realized, least-squares method (least squares analysis) is a mathematical optimization techniques, It error by minimizing the square and a group of data to find the best matching function. Least-squares method is the most simple method to derive absolutely true value unknown, and so the sum of squared errors to the minimum.)

说明：  可以实现旋转，错切，各种投影图，透视图。是学习三维变换很好的原始参考资料(Can rotate, shear, a variety of projection, perspective. Is to learn the original three-dimensional transform good reference)

影像仿射变换特征提取，结合 sift 等局部特征可以处理较大视角变化下的图像匹配。(This is an implementation of Hessian-Affine detector. )