YiJunRSexperiment_2005

使用K近邻算法对一个2维德样本集进行分类，样本集的分布为混合高斯分布。(K nearest neighbor to use a 2 Verde sample set for classification, the distribution of sample set for mixed Gaussian distribution.)

KLT point match:Detection and Tracking of Point Features.

高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，高斯计算程序，(Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program, Gaussian calculation program,)

用C++编写的产生文章的程序，方便有需要的人(C generated articles prepared by the procedures that are accessible to people in need)

圆锥盒子工具，包括交互功能，可以实现放大缩小旋转等功能。(Tapered tool box, including the interaction capabilities)

介绍Opencv这个图像处理库环境下的GMM建模与EM算法，从数学的角度深入分析高斯建模和EM算法(Introduce the the Opencv this image processing GMM modeling the EM algorithm in the library environment, in-depth analysis from a mathematical point of the Gaussian model and the EM algorithm)

使用VC++编程，自动检测角点，实现图像配准，代码可用。(Automatically detect the corner points, for image registration, the code is available.)

MC算法实现CT医学图像的三维重建，面绘制技术(MC algorithm CT medical image reconstruction, surface rendering technology)

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

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