MATLABPPC

图像扭曲变形程序，可以对图像进行扭曲变形。 功能：旋转扭曲/球面镜变形，B样条网格变形，TPS网格变形 (Image distortion program, the image may be distorted. Function: Twirl/spherical mirror deformation, B-spline morphing, TPS morphing)

计算机图形学 c语言实现的直线段裁剪算法(Computer graphics c language to achieve a straight line segment clipping algorithm)

灰度图像的属性计算：利用bwlabel和regionprops函数对度量二值图像中目标对象的属性。(Attribute gray image: Using bwlabel and regionprops function measure binary image of the target object attributes.)

本程序能够综合地实现图像边缘细化，而且程序够复杂。(This procedure can be integrated to achieve the Image Edge thinning, and the procedures complex enough.)

说明：  缺陷检测，定位缺陷位置。主要用于工业之中螺帽的螺纹线的检测(Defect detection, location of defect location. Detection of screw thread for nuts in industry)

无极卡尔玛滤波在6维状态非线性目标跟踪中的应用，代码不错哦！(Promise Kalmar Nonlinear Filtering in the six-dimensional target tracking application, the code is good oh!)

演示了点阵字符的绘制方法，visual c++源码(Demonstrates a dot matrix characters drawing method, c++ source code)

运用最小二乘和一范数约束求解低分辨率多光谱图像和高分辨率全色图像融合成高分辨率多光谱图像，程序附带主流的图像融合评价标准，需要融合的图像，对比图像；以及附带程序所需的稀疏包(Using least squares and a norm constraint solving low-resolution multi-spectral image and panchromatic image fusion into a high-resolution multi-spectral images, the program comes with mainstream image fusion uation criteria require the integration of image contrast image and Sparse package comes with the program required)

说明：  基于傅立叶梅林变换的图像配准算法可以控制旋转缩放参数实现配准(Fourier Mellin transform based image registration algorithm can control the rotation scaling parameters to achieve registration)

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