0502：图像的欧拉数计算，适合初学者…

现在我们给定两幅ALV路标的捕捉图像，我们实际工作中首先要捕获路标（这里我们假定环境中已经有路标），而此时的景象是难以预知的：我们不知道路标在什么位置、是什么路标、除了路标还有那些图像模式？ 基本要求：使用本章学习的K－平均算法，以颜色分量（或几何性状）作为坐标参数，对景象图进行聚类分析，要求最后的分类结果将路标（可能包括少量相似区域）聚类为一个模式类别。试验报告同前面一样，要求给出样本模式点，绘制坐标图（标出各个聚类中心的迭代移动轨迹） ，绘制算法框图，给出结论。并检查上机结果。 -err

一套图像处理程序(vc++)，支持JPEG、GIF

有关人脸检测的程序，对于给定的图像进行自动人脸检测，挺好用的。-The face detection procedure for a given facial image auto-detection, quite good use.

vc6.0中的MFC下一个opencv的例子，比较经典的学习资料-MFC in vc6.0 next opencv example, compare the classic learning materials

多种聚类方法比较,非常全,包括kmeans等-A variety of clustering methods, is very wide, including such kmeans

多边形的扫描填充算法-filled polygon scan algorithm

use the dct in watermark

针对传统方法难以可靠估计图像中纹理单一区域像素点视差的问题,将纹理分析应用于立体匹配中,提 出图像分块整体匹配的方法。首先用LBP/C纹理分析方法对图像纹理进行描述 然后进行基于区域生长的扩张检 测,得到纹理单一图像块 最后对图像块进行整体匹配,得到纹理单一区域的稠密视差图。对国际标准图像进行测试, 结果表明该算法能提高纹理单一区域稠密视差图的精度,具有实用价值 -Due to the difficulty of getting disparity of less textured pixels with traditional approach, block matching algorithm with texture analysis was put forward. First, the images were described by LBP/C texture analysis. Then the expansion detection based on region growing was performed, and the less textured blocks were acquired. Finally the dense disparitymap of less textured area was obtained through block matching. The proposed algorithm was tested with the international standard image data and comparedwith some existing algorithms. The experimental results show that the proposed algorithm can improve the accuracy of disparitywhen handling less textured areas and can be used in practic

用matlab编写的一个程序， 很好啊，大家多下载一下-Using a program written in matlab, well ah, we look more to download

这是俄罗斯的一个博士的博士论文的配套源码，实现了GRAPH CUT用于立体视觉的匹配，它改善了传统GRAPH CUT计算耗时的缺点，他还因此称为微软一员，专门从事GRAPH CUT在图像处理上的应用。程序写的很精简，写的很好，反复学过很多遍，这也是C/C++爱好者提高编程能力的一个很好的学习样本，很值得仔细反复阅读。-This is a Russian doctoral thesis, Dr. supporting source, realize the GRAPH CUT for stereovision matching, which improves the calculation of time-consuming traditional GRAPH CUT shortcomings, he also is why they are called a Microsoft, which specializes in GRAPH CUT in image processing applications. Procedures written in very concise, well written, repeatedly studied many times before, this is C/C++ Lovers programming ability to enhance a good learning samples, it is worth reading carefully repeated.