搜索资源列表
ImageSegmentation
- 用MFC编写的图像分割处理程序，采用了FCM和最小生成树两种方法来对图像进行分割-MFC prepared with the process of image segmentation using the FCM and the minimum spanning tree in two ways to partition images
ArffSearcher
- 使用Weka分析环境开发的基于Java的图像分割及基于内容检索程序，分割采用最小生成树分割法，检索利用的是小波和共生矩阵提取的特征。-Analysis using the Weka environment for the development of Java-based content-based image segmentation and retrieval procedures, division of segmentation using minimum spanning tree,
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
mintree
- 一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。-An n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom.
Prim
- 实现图的显示，最小生成树的动态演示，及最终显示-Achieve chart shows the minimum spanning tree dynamic presentation, and final display
graph-based-image-segmentation
- 五种当前主要的基于图的图像分割方法（normalized cut, min-cut/max-flow, isoperimetric partitioning, minimum spanning tree and random walker）的论文原文。-The original papers of five main graph-based image segmentation methods. They are normalized cut, min-cut/max-flow, isoperi
chengxu
- 图论中最小生成树Kruskal算法 及画图程序 M-函数-Kruskal minimum spanning tree in graph theory, algorithms and functions for M-Drawing
Kruskal
- VC++代码实现连通图最小生成树的Kruskal算法-VC++ code connected graph Kruskal minimum spanning tree algorithm
shengchengshu
- 一个最小生成树程序，用C++语言编写的，希望对你有帮助-A minimum spanning tree program, written C++ language you want to
Salesman
- 最小生成树的代码。解决经典Salesman问题-Minimum spanning tree code. Solve the classic Salesman
zuixiaoshengchengshu
- 这是两个用matlab实现最小生成树的算法源代码，希望对大家有帮助。-This is a two matlab to achieve the minimum spanning tree algorithm source code, we hope to help.
Krusf
- 求最小生成树的Kruskal算法 边权矩阵的产生方法： 1)一般的边权矩阵，为nxn维。调用方式[T c]=Krusf(d) 2）边权矩阵的前两行分别记录图上所有边的起始顶点和终止顶点， 无向边不重复记录。第三行记录对应边的权值。调用方式为[T c]=Krusf(d,1) c:生成树的费用 T:生成树的边集合 -The Kruskal minimum spanning tree algorithm
senior
- 基于最小生成树的图像分割，并分配深度。最小生成树算法可以选择避圈法和破圈法，深度分配采用上远下近的假设。-Image segmentation based on minimum spanning tree, and assign depth. Minimum spanning tree algorithm may choose to avoid the law and break the circle circle method, depth distribution using a far l
ihwun
- Rapid expansion of random spanning tree algorithm, Mainly for data analysis and statistics, Six degrees of freedom to achieve inverse kinematics algorithm.
hai_v15
- It describes the application of load forecasting, Rapid expansion of random spanning tree algorithm, Pisarenko harmonic decomposition algorithm.
uvemf
- Rapid expansion of random spanning tree algorithm, Algorithm for researchers to do reference, Matching Pursuit and orthogonal matching pursuit.
btdcw
- Rapid expansion of random spanning tree algorithm, For time-frequency analysis algorithm, Realization of 10 digital audio recognition progra.
图像程序
- 相关图像算法包括大律法分割，梯度分割，分水岭分割，活动轮廓，最小生成树，相关基因算法(Great Law Segmentation, Gradient Segmentation, Watershed Segmentation, Active Contour, Minimum Spanning Tree, Related Gene Algorithms)