ART

螺旋轨迹重建的一种实现方法，是解析算法的典型案例(An implementation method of spiral trajectory reconstruction is an analytical algorithm)

用CUDA并行处理方法改写的图像降噪算法，包括KNN,NLM,以及改进的NLM方法。配置环境适合VS2010+CUDA5.0,对使用CUDA的同学来说是很好的教材。(Image denoising algorithms including KNN,NLM and refined NLM run on CUDA, useful demo for who learns CUDA based parallel programming.)

VIBE用于视频背景建模，经典算法，C++和matlab代码都有，文件是全的。(VIBE for video background modeling, classical algorithms, C++ and matlab code has a file is complete.)

图像拼接源码实现，包括多频率图像融合，sift特征点配准算法(Image Stitching source implementation, including multi-frequency image fusion, sift feature points matching algorithm)

使用GDAL库，用于遥感影像的特征点提取(Using the GDAL library, used for remote sensing image feature point extraction)

本程序利用SIFT算法实现影像匹配的基础上，实现全景图的拼接，实用性很强，大家可以把拍摄的相邻的几张有重叠度的照片拼接成一张全景图。(The program uses SIFT image matching algorithm based on the realization of panorama stitching, very practical, we can put a few have taken the overlap of adjacent photos into a panoramic mosaic map.)

说明：  自己写的位图三态按钮还添加了按钮声音,对自己制作图形界面有很大帮助(Write your own bitmap three-state buttons to add the button sounds right to produce their own graphical interface helps a lot)

小波学习资料 供初学者和小波爱好者参考用()

这是一个应用VC++编写的基于摄像头读取人脸的人脸识别和人脸检测软件，其中引用了MATLAB的系统函数，是一个非常不错的人脸识别软件，这个系统在我校论文答辩审核中获得了优秀的成绩。希望对大家有用(This is an application-based VC prepared to read camera Face to Face Recognition and face detection software. cited in the MATLAB system function, is a very good face recognition software. The system in my school examination papers reply obtained outstanding achievements. We hope to useful)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)