Hausdorff-Distance

polsarpro软件的使用说明，适合处理极化SAR图像。(polsarpro the software instructions for dealing with polarization SAR images.)

裁剪以RGB565格式保存的BMP文件，涉及位图掩码内容(imagecut of the BMP picture which saved with RGB565 format and mask)

说明：  很好用的三维重建软件，VisualSFM软件允许上传一系列图像，它从这些图像中找到每一个图像的特定特征，利用这些特征信息重建出3D模型的稀疏点云，而后还可进行稠密点云重建。(The VisualSFM software, a good 3D reconstruction software, allows uploading a series of images. It finds the specific features of each image from these images, and USES these feature information to reconstruct the sparse point cloud of the 3D model, and then it can reconstruct the dense point cloud.)

说明：  多边形裁剪是逐次多边裁剪法，它的基本思想是以窗口的四条边界线单一逐次对多边形裁剪(polygon clipping is Successive multilateral cutting, its basic idea is a window four successive boundaries of a single polygon clipping)

张正友经典论文，灵活的相机标定法，内附图片+源码，可以直接使用(zhangzhengyou,image+program, A Flexible New Technique for Camera Calibration)

VC图像处理中阈值变换，计算图像面积等适合初学者，有一定的指导意义(VC image processing threshold transform, calculating image size suitable for beginners, must have guiding significance)

说明：  很有用的图像显示的源程序，是图像处理方面比较好用的程序！(very useful images of the source, the image processing is more user-friendly procedures.)

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

halcon代码 ，对图像添加高斯噪声 椒盐噪声(halcon code, add the image Gaussian noise impulse noise)

矢量区域填充算法（包括汉字提取生成） 算法(Vector area filling algorithm (including the extraction of Chinese characters generated) algorithm)