BDFTT4_doublea

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

基于meanshift算法的目标跟踪，主要是基于opencv车辆跟踪！！！程序当中进行简单的图像分割(Based on the meanshift algorithm of image segmentation and target tracking.)

图像处理的KMP算法源程序，KMP算法是一种基本的、实用的字符串比较算法，广泛应用于图像处理和模式识别。(Image processing algorithms source KMP, KMP algorithm is a basic, practical string comparison algorithm, widely used in image processing and pattern recognition.)

实现了读取一个bmp图片的傅里叶变换 使用C语言实现 读取一个 24位 图 转换为8位灰度图后，进行傅里叶变换处理（二维） 采用快速傅里叶变换——蝶形算法 北航图像处理作业~需要进一步交流 请联系qq 422563357(Reads a bmp image to achieve a Fourier transform using C language Northern image processing operations)

说明：  编程实现对bmp图像最大值，最小值，标准差，熵，各灰度值频率的计算(Programming to calculate the maximum value, minimum value, standard deviation, entropy and gray value frequency of BMP image)

28个vc++图像处理原程序之--对比度拉伸(28 vc++ Image processing of the original procedure- contrast stretching)

小波包去噪C + +源代码，包括信号小波包分解，，最优树的选择，并重建一个,可以直接使用。 (Wavelet packet denoising C++ source code, including the signal wavelet packet decomposition, the optimal choice of the tree, and rebuild a can be used directly.)

这个是图像处理中的hough变换的C++源代码，工需要的同学参考学习。(This is the image processing hough transform C++ source code, engineering students need to learn.)

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

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