3253befc9e5c

画矩形的代码，包含各种算法，具体的自己看吧，这是图形处理的作业之一(Draw a rectangle of the code, contains a variety of algorithms, specifically for yourself, this is one of the graphics processing jobs)

张正友标定法,标定图像，将图像进行校正，是当今用的最多的方式方法(This method is so good, I have transferred through this. And it is very useful for the IT workers. This is my first code. Thank you every one.)

一个盲去卷积程序，可以实现去除图像的各类模糊，同时可进行相关参数的自适应调整。(A blind deconvolution process can be achieved to remove all kinds of image blur, while the relevant parameters can be adaptive.)

说明：  机载合成孔径雷达自聚焦算法，没有实测数据，用的是点目标仿真(Airborne synthetic aperture radar algorithm for self-focusing, there is no measured data, using a point-target simulation)

针对大尺度图像配准和不同传感器图像配准问题, 介绍了一种基于 SIFT 的图像配准方 法。(For large-scale image registration and image registration problem from different sensors, introduces a SIFT-based image registration method.)

2012年的压缩感知跟踪算法，修改了部分程序源码，可以运行。(2012 of compressed sensing tracking algorithm, modify some program source code, you can run.)

视频目标跟踪中的人脸检测，包括文章加程序(Video target tracking in the face detection, including procedures for the article plus)

适合初学小波的同志，小波图像增强原理底层。严格高低频分解重构，没有使用小波工具库。(Suitable for beginners wavelet comrades, the underlying principle of wavelet image enhancement. Strict high-low-frequency decomposition of reconstruction, did not use the wavelet tool library.)

说明：  QC-LDPC的BP译码算法，MATLAB实现，简单易懂，已成功(Various encoding and decoding methods of LDPC)

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