mainjj

图像倒频谱生成并分析，可以用于运动模糊图像的PSF参数估计(Cepstrum image generation and analysis, can be used for motion-blurred image PSF parameter estimation)

FCM源代码，专门用于图像分割的，速度很快(FCM source code, specifically for image segmentation, very fast)

说明：  边缘检测是图像处理和计算机视觉中的基本问题，边缘检测的目的是标识数字图像中亮度变化明显的点。图像属性中的显著变化通常反映了属性的重要事件和变化。这些包括（i）深度上的不连续、（ii）表面方向不连续、（iii）物质属性变化和（iv）场景照明变化。边缘检测是图像处理和计算机视觉中，尤其是特征提取中的一个研究领域。 一阶:?Roberts Cross算子，Prewitt算子，Sobel算子， Kirsch算子，罗盘算子； 二阶： Marr-Hildreth，在梯度方向的二阶导数过零点，Canny算子，Laplacian算子。(Edge detection is a basic problem in image processing and computer vision. Significant changes in image attributes usually reflect significant events and changes in attributes. These include (I) discontinuities in depth, (ii) discontinuities in surface orientation, (iii) changes in material properties, and (iv) changes in scene lighting. Edge detection is a research field in image processing and computer vision, especially in feature extraction.)

说明：  高光谱遥感图像异常检测算法经典算法-RX算法(Hyperspectral image anomaly detection algorithm algorithm classical algorithm-RX)

对ccd图像进行解码采集，并通过VGA输出(Ccd image decoding of the collection, and through the VGA output)

图片的旋转、截图、灰度、翻转、滤波、去噪等基本处理(Image rotation, screenshots, gray, flip, filtering, noise and other basic processing)

这是一个matlab写的输出图像直方图的程序！能让你充分理直方图的原理！(this is a matlab produce of image histogram! you can undertand the the histogram algorithm easy! )

建立了混合高斯模型，可以对静止背景下运动目标进行检测。(Gaussian mixture model is established, you can still detect moving target in the background.)

特征点匹配时，采用构造KD-tree，用最优节点优先法寻找最佳匹配点(Matching feature points, the tectonic KD-tree, with the optimal node is preferred method to search for the optimal matching point)

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