IBP

Calculate the Laplacian of an image, can be accelerated by the GPU.

图像中数字水印matlab编码，水印的嵌入提取及嵌入强度(Digital watermark image matlab coding, the embedded watermark extraction and embedding strength)

经典的Tarel去雾算法，可用于图像去雾的指标性能对比。(It is the classical dehazing algorithm, and it is can be used comparison with other algorithms.)

多个函数的曲线拟合，里面统计有最小二乘、非线性回归(Curve fitting for multiple functions)

有关于求取图像平均梯度的matlab M 文件；可以为你省去那么一点时间。 ———共享改变未来！———(To strike the image on the average gradient matlab M documents can save you a bit of time.--- Shared change the future!---)

几个将图像分块，将分块图像拼接，和裁减图像的实用小程序(several image block to block image mosaic, and the reduction of small images of practical procedures)

中值滤波程序 对图象选定区域进行排列中值 滤波(median filtering of images selected procedures region with median filtering)

本人用matlab自己做的图像分裂合并程序，主要对印章图像进行处理．(own image split the merger process, mainly to seal image processing.)

维纳滤波与盲卷积算法代码，用于图像处理去燥 清晰化处理，自带图像还有附录讲解(Wiener filter and blind convolution algorithm code for image processing to dry clear processing, comes with the image there are appendix to explain)

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