150

遗传算法+FCM 用于SAR图像分类问题中，讲图分为两类或者三类~~~~~~~~~。(Genetic algorithm is used to SAR+ FCM image classification problem, speak figure divided into two classes or three kinds of ~ ~ ~ ~ ~ ~ ~ ~ ~.)

说明：  jm软件源码，用于流媒体编码标准H264的性能评测(jm-source software for streaming media encoding standard of the performance evaluation H264)

基于模板匹配的人眼定位算法，代码简单易懂，定位精度高(The eye location algorithm based on template matching, the code simple, high positioning accuracy)

labview基础视觉识别的东西，讲的很细(The basic visual recognition course of LabVIEW is very detailed.)

快速角点检测算法，本算法针对图像中存在的线和点进行检测，算法通过matlab程序实现，结果表明具有很好的效果(Fast corner detection algorithm, the algorithm for images that exist in the line and point detection algorithm matlab program, results show that with good results)

说明：  图像处理所涉及的256转灰度，二值化等等，每个部分都是独立可执行的工程文件，很方面的代码复用(256 involved in image processing turn gray, binary, etc., are independent of each part of the project executable file, it' s code reuse)

matlab_基于象素的图像配准程序,很好使用,精度也很高,要用的就下载吧!(matlab_ pixel-based image registration procedures, a very good use, accuracy is also high on the download you want to use!)

汉字识别,可以识别图片中的汉字，进行图像处理，本科毕业设计的资料(Chinese character recognition)

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

各种非监督分类遥感算法的IDL代码，包括K均值，ISO聚类(Remote sensing of various non-supervised classification algorithms IDL code, including K-means, ISO clustering)