HazeRemoval

数字图像处理，C语言，功能是打开一幅位图，实现几何变换。(Digital image processing, C language function is to open a bitmap, to achieve geometric transform.)

本文以自主驾驶车辆为实际应用背景．提出了一种改进的ＲＲＴ（快速随机搜索树）路径规划算法．该路 径规划算法将非完整性约束条件与双向多步扩展ＲＲＴ搜索算法相结合，在提高搜索效率的同时保证了规划路径的可 行性．同时将路径点作为Ｂ样条基函数的控制点，用三次Ｂ样条函数来拟合控制点生成平滑可跟踪的路径．通过在平 面障碍物环境下实验，验证了该算法的有效性．(ＡｉｍｉｎｇａｔｔｈｅａｐｐｌｉｃａｔｉｏｎｏｆＡＬＶ（ａｕｔｏｍａｔｉｃｌａｎｄｖｅｈｉｃｌｅ），ａｎｉｍｐｒｏｖｅｄＲＲＴ（ＲａｐｉｄｌｙＲａｎｄｏｍ?ｅｘｐｌｏｒｉｎｇ Ｔｒｅｅｓ）ｐａｔｈｐｌａｎｎｉｎｇａｌｇｏｒｉｔｈｍ ｉｓｐｒｏｐｏｓｅｄ．Ｔｈｅａｌｇｏｒｉｔｈｍ ｃｏｍｂｉｎｅｓｔｈｅｎｏｈｏｌｏｎｏｍｉｃｃｏｎｓｔｒａｉｎｔｓｏｆｖｅｈｉｃｌｅｗｉｔｈｄｏｕｂｌｅｅｘｔｅｎｄ ＲＲＴｓ，ｗｈｉｃｈｎｏｔｏｎｌｙｉｍｐｒｏｖｅｓｔｈｅｅｆｆｉｃｉｅｎｃｙｏｆｓｅａｒｃｈｉｎｇｂｕｔａｌｓｏｇｕａｒａｎｔｅｅｓｔｈｅｆｅａｓｉｂｉｌｉｔｙｏｆｔｈｅｐａｔｈａｔｔｈｅｓａｍｅｔｉｍｅ．Ｔｈｅｐａｔｈ ｐｏｉｎｔｓａｒｅｔａｋｅｎａｓｒｅｆｅｒｅｎｃｅｐｏｉｎｔｓｆｏｒｔｈｅＢ?ｓｐｌｉｎｅｂａｓｉｃｆｕｎｃｔｉｏｎ，ａｐｐｒｏａｃｈａｎｄｃｒｅａｔｅａｎｅｗｓｍｏｏｔｈｒｏｕｔｅｗｈｉｃｈｓｕｉｔｓｆｏｒｔｈｅｖｅｈｉ? ｃｌｅｔｏｆｏｌｌｏｗ．Ｔｈｅｓｉｍｕｌａｔｉｏｎｏｕｔｃｏｍｅｓａｎｄｆｉｅｌｄｔｅｓｔｓｖｅｒｉｆｙｔｈｅｅｆｆｅｃｔｉｖｅｎｅｓｓｏｆｔｈｅｍｅｔｈｏｄｐｒｏｐｏｓｅｄ．)

灰度图像的二维傅里叶变换(cv_gray_fft2)，二维傅里叶变换结果的幅值计算(cv_abs)，频谱平移(cv_gray_fft2shift)，将数值归一化到0到255区间(cv_range_0to255)是非常常用的四个功能！所以写成四个函数，方便将来调用！附运行截图~并附对应的MATLAB程序！(Dimensional Fourier transform of the grayscale image (cv_gray fft2), two-dimensional Fourier transform results to calculate the amplitude (cv_abs), spectral translation (cv_gray_fft2shift), the value normalized to range 0 to 255 (cv_range_0to255) is very common four function! so written as four function to facilitate future calls! attached run shot- along with the corresponding MATLAB program!)

本文针对多光谱图像配准中不同光谱图像间存在较大的灰度差异、同一景物在不同波段表现的特征也各不相同等问题，提出了基于互信息相似性测度的多光谱图像配准算法。(In this paper, multi-spectral image registration between different spectral image there is a big difference in gray scale, the same scene in different bands performance characteristics are different questions, we present a similarity measure based on mutual information of multi-spectral image registration algorithm .)

VC++Digital image processing

openCV+MFC（VS2008）canny边缘检测，能用滑动条调节参数(openCV+MFC (VS2008) canny edge detection, use the slider to adjust parameters)

对于二值图像进行labeling,求的对象个数，每个对象的像素数，中心点，长宽高矮值等(labeling for bianry image)

meanshift算法，及其在图像处理方面的应用(meanshift algorithm)

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

关于MC三维重建算法的二义性消除的文章，很好的消除了MC算法中的二义性(it s the article about Three-dimensional reconstruction algorithm to eliminate ambiguity in MC)