datamining

超像素分割程序，既有原码，也有可执行程序，验证过，好用。(Super-pixel segmentation procedure, both the original code, there are executable programs, proven, easy to use.)

GDI 绘图实例

说明：  基于matlab的车牌识别，预处理。定位。识别.qiege(License plate recognition system based on MATLAB)

针对杂波环境下的多个机动目标跟踪问题, 本文将多模型概率假设密度 (Multiple-model probability hypothesis density, MM-PHD) 滤波器和平滑算法相结合, 提出了 MM-PHD 前向 – 后向平滑器. 为了避免引入复杂的随机有限集 (Random finite set, RFS) 理论, 本文根据 PHD 的物理空间 (Physical space) 描述法推导得到了 MM-PHD 平滑器的后向更 新公式. 由于 MM-PHD 前向–后向平滑器的递推公式中包含有多个积分(By integrating the multiple-model probability hypothesis density (MM-PHD) filter with the smoothing al- gorithms, an MM-PHD forward-backward smoother is proposed in this paper for tracking multiple maneuvering targets in clutter. To avoid use of complex random finite set (RFS) theory, the backward updated equation of the MM-PHD smoother can be derived according to the physical-space explanation of the PHD)

说明：  <基于Matlab的数字图像相关法的程序实现> 数字图像相关法是对全场位移和应变进行分析的一种新的实验力学方法。图像处理是其核心之一。本文探讨了根据相关技术寻 求位移场的基本原理,并编制了基于Matlab的数字图像相关法程序。程序验证结果表明本程序处理速度快,精度高,可以满足基于相关技 术的图像处理的要求。(err)

Harris角点检测程序（内附示例图像），利用鼠标在图像上选择提取交点的区域，进行角点提取。程序语言简洁，利于初学者学习。(Harris corner detection procedures (with sample images), using the mouse in the image on the choice of extraction point of intersection of the region, for Corner Detection. Programming language is simple and conducive to learning for beginners.)

基于颜色的图像检索，将RGB转化成ＨＳＶ的方法(Color-based image retrieval, the method of RGB into HSV)

针对图像进行快速傅里叶变换，方便进行频频分析与处理。(Fast Fourier transform for the image, to facilitate frequent analysis and processing.)

利用彩色图像的处理方法和数学形态学方法，编程计算荔枝果实的质心点的图像坐标(The use of color image processing method and mathematical morphology, image coordinates programmed to calculate the centroid of litchi fruit points)

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