Name
Abstract | ||
|---|---|---|
This paper presents a new algorithm for partitioning a gray-level image into connected homogeneous regions. The novelty of this algorithm lies in the fact that, by constructing a minimum spanning tree representation of a gray-level image, it reduces a region partitioning problem to a minimum spanning tree partitioning problem, and hence reduces the computational complexity of the region partitioning problem. The tree-partitioning algorithm, in essence, partitions a minimum spanning tree into subtrees, representing different homogeneous regions, by minimizing the sum of variations of gray levels over all subtrees under the constraints that each subtree should have at least a specified number of nodes, and two adjacent subtrees should have significantly different average gray-levels. Two (faster) heuristic implementations are also given for large-scale region partitioning problems. Test results have shown that the segmentation results are satisfactory and insensitive to noise. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0262-8856(96)01105-5 | Image and Vision Computing |
Keywords | Field | DocType |
Image segmentation,Minimum spanning trees,Tree partitioning,Dynamic programming | Combinatorics,Distributed minimum spanning tree,Tree (data structure),Spanning tree,Reverse-delete algorithm,Mathematics,Kruskal's algorithm,Minimum spanning tree-based segmentation,Search tree,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
15 | 1 | 0262-8856 |
Citations | PageRank | References |
24 | 2.81 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y Xu | 1 | 93 | 46.16 |
| Edward C. Uberbacher | 2 | 221 | 86.43 |