edgelinking_shengzhang

图像增强图像增强 对比度增强 视觉增强对比度增强 视觉增强(image Enhanceme)

一款VC++图像开场加载效果，向大家演示了几种图像装载的特效实现的方法，比如扫描显示、滑动显示、渐入显示和马赛克显示等，大家在使用一些幻灯片软件的时候，经学会看到类似的效果，如果你有一定的VC++基础，你可以借鉴一下本效果的具体方法，再次扩展，可以制作出一款带特效的图像查看器(The opening loading effect of a VC++ image to demonstrate the effects achieved in several image loading, such as scanning, slide show, getting into the display and mosaic display, we learn to look at some slides software to similar effect, if you have certain VC++ basis, you can learn about the effects of specific methods, extended again, can create the image of a band effects Viewer)

基于8×8分块得数字水印嵌入和提取算法。此算法已经通过调试，可以直接运行(Based on 8 × 8 sub-blocks have digital watermark embedding and extraction algorithm. This algorithm has been through debugging, you can directly run)

基于不精确拉格郞日算子法的低秩矩阵重构程序，可以用于图像分割，将目标图像分割为背景和前景，从而将前景分离出来。(Lagrangian method based on imprecise low rank matrix reconstruction procedures can be used for image segmentation, the target image into background and foreground, which will separate the foreground.)

图像延拓 求极大值极小值图像 并找到极值点所在的位置(Image continuation for maximum minimum image and find extreme value point s location)

说明：  一种基于粒子滤波的测向定位跟踪算法，一种基于粒子滤波的测向定位跟踪算法。(A particle filter based on the finding and location tracking algorithm, a particle filter based on the finding and location tracking algorithm.)

本程序主要实现暗背景下含高斯噪声的光斑滤除噪声，实现光斑中心提取。采用了sobel算子和梯度倒数加权滤噪、最大类间方差法（Otsu）确定阈值、质心法提取光斑中心坐标。(The program is mainly realized under a dark background Gaussian noise spot containing noise filtering, to achieve spot center extraction. Using sobel operator and gradient inverse weighting filter noise, Otsu method (Otsu) to determine the threshold, the center coordinates of the spot centroid extraction.)

图像处理中用于边缘检测图像的边缘连接和边缘拟合的代码(link edge)

图像处理基本算法其中之一的yuzhibianhua (Image processing one of the basic algorithm yuzhibianhua)

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