NCSR_for-SR

说明：  sift和surf特征点提取，然后进行配准，通过ransac进行提纯(Sift and surf feature points are extracted, then registered and purified by RANSAC)

完成了对车道线进行了识别，主要流程为灰度化，边缘检测，hough变换。(We completed the lane line identification, the main process of graying, edge detection, hough transform.)

在matlab环境下基于数学形态学的图像去噪，传统去噪只选用一种结构元素，去噪效果并不理想，这种去噪方法实现简单，功能强大，无论对于高斯、椒盐、维纳等噪声都去有很强的去噪效果，且算法简单。(In the matlab environment based on mathematical morphology image denoising, denoising only use traditional elements of a structure, de-noising effect is not ideal, this denoising method is simple and powerful, both for the Gaussian, salt and pepper, Wiener such noise are to have a strong denoising effect, and the algorithm is simple.)

说明：  

本压缩文件利用Matlab制作了一个能识别居民身份证号码的系统，使用图像处理技术，实现了计算机识别数字的功能。(The compressed file using the Matlab made a system can identify the identity card number, using image processing technology, realized the function of the digital computer identification. )

说明：  利用matlab对多光谱遥感影像进行水体指数（ndwi）以及植被指数（ndvi）提取(Extraction of Water body Index (ndwi) and vegetation Index (ndvi) from Multispectral remote Sensing Images by matlab)

简单的帧间差分法，不过可以和其他方法结合来改进算法(A simple inter-frame difference method, but other methods can be combined to improve the algorithm for)

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

VC的图形处理以及简单的程序设计，简单易懂(VC graphics processing and simple program design, simple and understandable )

简易二值化演示易语言源码，例程程序使用嵌套循环改变画板颜色演示了图像二值化的简单过程。(Simple binary demonstrate easy language source code , a routine procedure uses nested loop Sketchpad color change demonstrates the binary image of a simple process .)