yuzhibianhua

实现人体跟踪的源代码，实现对视频中目标人物的跟踪(The human tracking source code, the video of the target person tracking)

这是基于VC++编写的对遥感影像分析的程序，主要是对遥感影像进行PCA变换，使得对影响分析不仅可以依托于现成软件，我们自己也可以开发(This is written in VC++ based on remote sensing image analysis program, mainly for remote sensing images PCA transform, makes impact analysis can not only rely on ready-made software, we can also develop their own)

数字散斑相关程序，能够计算2副图片的位移，简单的例子，对初学者也许有用。(Digital speckle correlation program can calculate the displacement of two images, a simple example, may be useful for beginners.)

在VC6.0环境下，借助openCV函数库，对视频中的人脸进行检测，并实时跟踪，然后用Haar特征的分类器定位人脸，并检测瞳孔存在与否，提取关于眼睛的疲劳信息(In VC6.0 environment, with the aid of openCV function library, to detect human faces in video, and real-time tracking, positioning and use characteristics of Haar classifier faces, and examine the pupil existence, to extract the information about the fatigue of the eye)

HOG adaboost pedestrian-detect

说明：  数字图像处理的常用算法总结，比如，直方图，直方图均衡化，均值滤波，中值滤波，平滑滤波等。(Commonly used digital image processing algorithms summarized, for example, histogram, histogram equalization, mean filtering, median filtering, filtering and so on.)

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

ORB和FREAK局部特征对比实验ORB_FREAK(ORB and FREAK local features of comparative experiments ORB_FREAK)

基于AdaBoost的人脸检测程序代码(是用c++编写的)(AdaBoost-based face detection program code (written with c++))

VC和OpenGL实现的点云读取界面，需要的朋友可以下载参考(VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference)