openvc2.4.10配置方法

polsarpro软件的使用说明，适合处理极化SAR图像。(polsarpro the software instructions for dealing with polarization SAR images.)

高分辨率遥感图像道路提取算法实现，主要思路是利用道路中心点，得到道路中心线。(Road Extraction from High Resolution Images algorithm, the main idea is to use the center of the road, get the road centerline.)

VisualC++数字图像处理技术详解第2版光盘，第十二章(VisualC++ digital image processing technology Detailed Version 2 discs, Chapter XII)

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

实现图像的滤波、锐化、边缘检测、微分处理及图像平滑(Image filtering, sharpening, edge detection, differential processing and image smoothing)

基于VC++的图像处理类，可以用于bmp文件的读写，显示(Based on the image processing VC++ classes that can be used to read and write bmp files, display)

本程序实现位图的读写，均衡化，滤波，LBP，LTP特征提取以及基于LBP，LTP和卡方距离，最近邻分类的人脸识别，批量给图片改名等功能(The program can read and write a bitmap, equalization, filtering, LBP, LTP feature extraction and nearest neighbor classifier for face recognition based on LBP, LTP and chi-square distance, rename picture and some other functions.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

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

使用Visual C++编写的生成三次Hermite曲线的源代码。(Bicubic Hermite code in Visual C++.)