picture3

一个简单的虚线类，绘制各种虚线的C++类库，请看效果截图，可绘制出各种彩色的虚线效果。画横向或竖向虚线，以及对角线的虚线框效果，都是可以的，带有一个演示程序。(A simple dashed class, draw various dashed C++ library, see the effects shots, you can draw a variety of color dotted effect. Draw horizontal or vertical dashed line, as well as the effect of diagonal dashed box, are possible with a demo program.)

高光谱图像的地物分类技术，对光谱分析并对比检测出地景的算法(Fifth hyperspectral image classification techniques, algorithms for spectral analysis and contrast detect landscapes)

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

基于VC的各种火焰真实模拟,有效的显示了火焰的效果.(fire)

基于图像处理，vc++平台的水果识别。通过亮度调整，梯度处理，边缘图像，边界跟踪，计算颜色形状等，计算出结果。(Based on image processing, fruit recognition vc++ platform. Through the brightness adjustment, gradient, edge image, boundary tracking, calculation of color shape, the calculated results. )

是关于图像的基础操作，包括图像倾斜矫正，图像增强，去除噪声，图像压缩等技术(It is on the image on the basis of operations, including image tilt correction, image enhancement, noise removal, image compression technology)

表面张力CSF模型，用于计算微重力条件下的两相流问题。(Comtinum Saface tension Force)

Application of the Fourier-Mellin transform to translation-, rotationand scale-invariant plant leaf identification

2维的基于互信息的图像配准算法，使用powell法作为优化算法(2-dimensional mutual information based image registration algorithms, the use of law as the optimization algorithm powell)

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