StereoRegion

说明：  细胞跟踪算法.文件中有细胞的运动模拟视频,说明文件.内容比较复杂,适合于研究生以上的研究人员揣摩.(Tracking Algorithm: Object Delineation Method Multiparticle.)

用图切分（Graph_Cut）分割图像彩色图像、灰度图像及二值图像，效果较好，尤其是金相组织图像的分割更加有效。(Graph_Cut)

MATLAB版小波分析小程序，能有效去除图像中噪声(MATLAB version wavelet analysis applet can effectively remove the image noise)

k-均值聚类法用于各种图像的聚类、分割问题，希望可以对您有利(k-means clustering method for a variety of image clustering, segmentation)

Contra Harmonic Mean and Alpha Trimmed Filter alpha剪枝滤波器(Contra Harmonic Mean and Alpha Trimmed Filter alpha pruning filter)

张正友标定算法，包含自己的测试图片以及实验分析。(Zhang Zhengyou calibration algorithm, contains its own test images and experimental analysis.)

在自动化生产线VC开发的运动控制机器视觉程序，XYZ三个轴有PCI板卡控制，视频卡采集图像后经算法处理找到图像的点，VC控制步进电机到加胶位置加胶，在机器上运行每日点胶100000次无故障(VC development in automated production lines motion control machine vision program, XYZ three-axis control with a PCI card, video card capture images after processing algorithm to find the image of the point, VC controlled stepper motor to position plus plus glue glue on the machine run the daily dispensing 100,000 times without failure)

基于遗传算法的图像分割算法。实现图像的分割，显示原图及处理结果图像。(Based on genetic algorithm image segmentation algorithm. Realize image segmentation, and processing results show the image. )

人脸图像质量评价体系介绍，非常全面，此方面研究的不错入门资料(Face image quality assessment system introduced, very comprehensive study in this regard a good introductory information)

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