007654

精心收集的几个去噪算法，包括基于视觉的非线性去噪、BLS_GSM算法、NL-Bayes图像去噪、KSVD去噪等，内容为核心代码，需要配置完善。 (Denoising algorithm of several carefully collected, including visual based nonlinear denoising, BLS_GSM algorithm, NL-Bayes image denoising, KSVD denoising, the content as the core code, the need to improve the allocation of. )

实现原始的JPEG图片编解码，不借助任何的第三方库，纯C++。(To achieve the original JPEG image decoding, without using any third-party libraries, pure C++.)

一种简单高效地基于压缩感知的跟踪算法。首先利用符合压缩感知RIP条件的随机感知矩对多尺度图像特征进行降维，然后在降维后的特征上采用简单的朴素贝叶斯分类器进行分类。该跟踪算法非常简单，但是实验结果很鲁棒，速度大概能到达40帧/秒(A simple and efficient tracking algorithm based on compressed sensing. Firstly, with the random sensing matrix compressed sensing RIP conditions for multi-scale image feature dimension reduction, and then use the naive Bias classifier simple classification in the feature reduction after the. The tracking algorithm is very simple, but the results are robust, speed can reach 40 frames per second)

图像检索的一个检索算法基于内容,不错的源码 不错的(A retri algorithm of image retri based on content, good source of good)

图片处理 去噪音，去模糊为了实现较好保留图像边缘特征的有效去噪,提出了一种基于边缘检测的Contourlet 变换去噪方法(Picture Deal)

数字图像处理和图像识别的vc++编程方法(Digital image processing and image recognition of the vc++ Programming)

SEISPLOT 可以弥补FIMAGE软件带来的不足，即可以实时地显示更多剖面。而且还可以进行其它格式的转换。(seisplot is a software for seismic profile viewing.)

VTK教程－英文版，详细介绍了VTK的相关知识和在医学图像处理方面的应用(VTK BOOK-english edition,introduce VTK install、context、application in medical image anylasis in details)

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

说明：   图形学编程，界面很漂亮，转载(graphics programming interface is very beautiful, reprinted)