lane-detection

《VC++数字图像识别技术典型案例》第九章光学字符识别技术，包括预处理、边缘跟踪和特征提取算法("VC Digital Image Recognition Technology typical case," the ninth chapter of optical character recognition technologies, including pretreatment, Edge tracking and feature extraction algorithm)

实现鱼眼图 圆形视场和全视场的校正、分为2幅图像、4幅图像、任意角度、任意位置的校正、全景图拼接等(Fish eye diagram of a circular field of view and full field calibration is divided into two images, four images at any angle, any position of the correction, and panoramic stitching.)

经典的文本水印算法，实现了别人实现不了的功能，希望大家有所用！(The classic text watermarking algorithm to achieve the functions of others fail to realize, I hope you all have a use!)

灰度图生成程序 可以生成BMP/JPG格式的灰度图 大家可以随便使用下载(Grayscale generator can generate BMP/JPG format, you can easily use the download grayscale)

该代码，利用GDAL 1.4.2库实现遥感图像的几何校正、图像配准等，vs 2010实现。(The code GDAL 1.4.2 library implementation of remote sensing image geometric correction, image registration, vs 2010.)

图像处理的指针式仪表识别，利用OPENCV库，MFC对话框程序(Image processing pointer instrument identification, the OPENCV libraries, MFC dialog program)

改程序就代码可以找出从不同角度或区间的两幅遥感影像的同名点(Change the program code can find it from different angles of the same name point or interval of two remote sensing images)

基于openCV的gabor函数,一位牛人编写的。希望对大家有用(gabor function based on openCV)

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

一种求解电大平台天线互耦的时域积分方程快速算法(Solving the Antenna TV platform stie fast algorithm)