VisualSFM_windows_cuda_64bit

说明：  最二小乘影像匹配，精度可以达到0.01个像素，也可以最二小乘影像模板匹配。经过修改后可以直接用，只要调用一个函数就搞定，函数参数的说明很清楚，绝对不会有任何困难，非常好用。(Most two Theravada image matching accuracy can reach 0.01 pixel images can also be the most two Theravada template matching. After modifications can be directly used, as long as is you call a function, function parameters, the description is clear and will not have any difficulties, very easy to use.)

基于双目视觉的三维重建，包含了重建过程中的基本步骤。(Binocular vision-based three-dimensional reconstruction, including the reconstruction of the basic steps of the process.)

实现巴特沃斯低通滤波器的小程序，大家看看能不能参考一下。(Butterworth low-pass filter program, see if you can refer to.)

基于样本的纹理合成加速方法，MRF，基于Li-Yi Wei的论文。(Acceleration method based on texture synthesis samples, MRF, based on Li-Yi Wei of paper.)

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

计算机图形学基础算法z-buffer， 实现隐藏面消除(Computer graphics based algorithm z-buffer, to achieve hidden surface removal)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

行人检测HOG+SVM进行图片中行人检测，提供训练用的pos和neg样本，效果还可以；没有SVM工具箱的，压缩包里已经提供了，安装一下即可(Pedestrian detection HOG + SVM for pedestrian detection in pictures, providing POS and neg samples for training, the effect is good; without SVM toolbox, the compression package has been provided, just install it.)

图像处理程序中图像处理多运动目标程序，完整程序。下载就能用(Image processing program, image processing of multiple moving targets program, complete the program. Download will be able to use)

模式识别中相似度-豪斯多夫距离源码,可用于对比算法相似度，也可直接作为函数调用(Hausdorff distance for pattern recognition similarity calculating)