Otsu image processing

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

灰度图生成程序 可以生成BMP/JPG格式的灰度图 大家可以随便使用下载(Grayscale generator can generate BMP/JPG format, you can easily use the download grayscale)

利用直方图双峰法选取适当阈值对图像进行二值化处理。此法只适用于直方图为双峰状图像。(Using the Shuangfeng method to the appropriate threshold histogram of image processing two values. This method is only applicable to the histogram of image of Shuangfeng.)

使用MFC以及Gabor小波处理进行图像的特征纹理提取(Using MFC and Gabor wavelet to extract texture features for image)

图像处理方面，用VC++实现的连通区域标记的程序。(Image processing, with VC++ implementation of the procedures connected region markers.)

针对空间发光点缩成光斑图像中心的高精度提取问题，本文提出一种亚像素提取方法。该方法简历了具有高斯能量分布的空间发光点的透视投影光斑图像灰度分部数学模型，证明了空间发光点能量中心的透视投影不变性。(Light-emitting points of space shrunk to spot high-precision center of the image extraction problem, we propose a subpixel extraction method. This method resumes a space with Gaussian energy distribution points of perspective projection spot light gray segment mathematical model to prove the energy center of the space light-emitting point perspective projection invariance.)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)

图像平移处理，可以图片进行平移变换处理，提供演示图片(Image translation process, it can image pan transformation process provides demonstration image)

对图像（Bmp）的智能读入界面设计，源代码(Read image (BMP), intelligent interface design, source code)

对话框以及树控件的描述及应用,很值得初学者学习，代码可以直接运行(Dialog boxes, and a description of the tree control and application, it is worth learning for beginners, the code can be run directly)