differential-operation

小波处理，滤波，复原，融合等VC源代码.(Wavelet processing, filtering, recovery, integration VC source code.)

mean shift功能演示，实现图像分割，具体请看效果(the demonstration of the mean shift algorithm)

说明：  基于LBP纹理特征的运动目标检测算法.rar(Moving target detection algorithm based on LBP texture features. Rar)

利用SIFT检测两图片的相同点，并获取两幅图像的视差。(SIFT detection using the same picture two points, and to obtain two images of the parallax.)

运动目标检测与跟踪，包括目标定位，匹配与跟踪!(moving target detection and tracking, including Target, matching and tracking!)

asyDraw是一个简单的绘图软件，这个实例会综合运用本章所介绍了Visual C++ 2005的基础知识(this program for paint)

数字图像处理边缘检测算法VC源码，里面包括多种检测算子(Digital image processing edge detection algorithm VC source code,Which includes a variety of detection operator )

基于菲涅耳全息图和离散余弦变换的_盲数字水印_技术(Blind digital watermarking _ technology based on the Fresnel hologram and the discrete cosine transform _)

说明：  使用gpu、cpu并行进行sift算子计算匹配，能够在原来的基础上加速处理，但对显卡要求较高，具体环境配置使用方法可以参照mannual(SiftGPU is an implementation of SIFT [1] for GPU. SiftGPU processes pixels parallely to build Gaussian pyramids and detect DoG Keypoints. Based on GPU list generation[3], SiftGPU then uses a GPU/CPU mixed method to efficiently build compact keypoint lists. Finally keypoints are processed parallely to get their orientations and descriptors. SiftGPU is inspired by Andrea Vedaldi s sift++[2] and Sudipta N Sinha et al s GPU-SIFT[4] . Many parameters of sift++ ( for example, number of octaves, number of DOG levels, edge threshold, etc) are also available in SiftGPU. The shader programs are dynamically generated according to the parameters that user specified. SiftGPU also includes a GPU exhaustive/guided sift matcher SiftMatchGPU. It basically multiplies the descriptor matrix on GPU and find closest feature matches on GPU. Both GLSL and CUDA implementations are provided. )

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