2D image segmentation using minimum spanning trees

doi:10.1016/S0262-8856(96)01105-5

2D image segmentation using minimum spanning trees

1997-01-01

68

OA

AI

许莹 (Ying Xu) *

E

Edward C. Uberbacher

DOI：10.1016/S0262-8856(96)01105-5

原文链接

查看原文

摘要

En 中文

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.

Keyword:

image segmentation

minimum spanning trees

tree partitioning

dynamic programming

2D image segmentation using minimum spanning trees

摘要

AI总结

期刊

机构

引用论文