zernikeCT

图像球面化，对于输入的图片进行球面变换达到图形变形的效果(Spherical image of, for input images to spherical transformation to achieve the effect of graph distortion)

信号处理的小波导引：稀疏方法（原书第3版） 《信号处理的小波导引：稀疏方法（原书第3版）》全面论述了稀疏表示的重要概念、技术和应用，反映了该主题在当今信号处理领域所起的关键作用。作者在解释了稀疏的主要概念后将其运用于信号压缩、噪声衰减和逆问题，同时给出了冗余字典、超分辨率和压缩感知中的稀疏表示。 　　本书既可以让应用数学系的学生了解数学公式的工程意义，也可以让计算机及电子工程系的学生了解工程问题的数学描述。对于小波理论与应用的研究人员，本书更是一本极具价值的参考书。(a Wavelet Tour of Signal Processing(Third Edition.The Sparse Way))

车道偏离识别的程序，采用的是动态规划算法，对弯道也有比较高的识别率(lane departure algorithm, which has good performance even for curve lane.)

Image processing using sobel operator

视频车辆检测，主要是介绍视频中的车辆运动目标的检测和跟踪计数(The detection of video vehicle mainly introduces the detection and tracking of moving targets in video)

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

设置位置断点跟踪程序，VC++精选编程源码，很好的参考资料。(Set breakpoint location tracking procedures, VC++ programming source code, a good reference.)

本程序利用SIFT算法实现影像匹配的基础上，实现全景图的拼接，实用性很强，大家可以把拍摄的相邻的几张有重叠度的照片拼接成一张全景图。(The program uses SIFT image matching algorithm based on the realization of panorama stitching, very practical, we can put a few have taken the overlap of adjacent photos into a panoramic mosaic map.)

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

克里金插值的3D算法，forrtran源代码。 可直接使用。 (Kriging 3D algorithm, forrtran the source code. Can be used directly.)