HazeRemoval

说明：  基于块分割的图像拼接，将图像按块拼接，缺点是速度很慢，算法有待改善(Block-based segmentation of the image mosaic, mosaic images by block, the disadvantage is very slow, the algorithm needs to be improved)

基于分块的人脸图像超分辨率学习算法实验平台，利用学习到的训练集图像信息对低分辨率图像超分辨率，并可以查看超分辨率后的图像块匹配结果（用鼠标双击结果显示窗口中的实验图像），可以设置实验参数。(Block-based face image super-resolution algorithm for the experimental platform to learn, learning to use the training set of low-resolution image information super-resolution images and can view the image super-resolution block-matching results (double-click with the mouse results display window of the experimental images), the experimental parameters can be set.)

DIX公式优化求解层速度，使得速度变得更加平滑。(DIX formula optimization solution velocity, making speed becomes smoother.)

对两幅图像进行配准，分别提取两幅图像的surf特征点以及描述子，得到粗匹配结果，然后根据粗匹配结果，采用ransac方法计算基础矩阵，并去除误匹配点，得到较准确匹配结果(Two image registration, surf was extracted from the feature points in two images to get the coarse matching and descriptor, then according to the results, the coarse matching results, using RANSAC method to calculate the fundamental matrix, and eliminate the error matching, gain a more accurate matching results)

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

自己编写的数字图像处理程序，包括打开bmp图像，直方图，阈值分割，形态学处理等功能。(digital image processing procedures, including open bmp image, histogram, threshold segmentation, morphological processing and other functions.)

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

超像素分割程序，既有原码，也有可执行程序，验证过，好用。(Super-pixel segmentation procedure, both the original code, there are executable programs, proven, easy to use.)

图像简单处理小程序，带有测试图片，比较实用的小冬冬 (Simple procedures to deal with small images, with the test pictures, more practical small Dongdong)