DocumentCode :
478497
Title :
Fast Minimum-Spanning-Tree-like Based Image Segmentation
Author :
Cha, Byungki ; Kawano, Hideaki ; Suetake, Noriaki ; Aso, Takashi
Author_Institution :
Fac. of Manage. & Inf. Sci., Kyushu Inst. of Inf. Sci., Kitakyushu
Volume :
6
fYear :
2008
fDate :
18-20 Oct. 2008
Firstpage :
152
Lastpage :
156
Abstract :
We propose a fast segmentation technique for segmenting natural images into meaningful regions based on a minimum spanning tree (MST) principle. The main idea of the technique comes from the redundancy of MST based image segmentation process. We compared the performance of the proposed technique with the performance of depth first search (DFS) and of the traditional MST. Finally, the simple split and merge method based on the proposed technique is proposed with some natural images of the Berkeley segmentation dataset and compared with our results with human´s handi-labeled segmentation results.
Keywords :
image segmentation; trees (mathematics); depth first search; image segmentation; minimum-spanning-tree; split-and-merge method; Clustering algorithms; Conference management; Costs; Digital images; Engineering management; Humans; Image segmentation; Information management; Technology management; Tree graphs; MST-like; image segementation; merge; minimum spanning tree;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-0-7695-3304-9
Type :
conf
DOI :
10.1109/ICNC.2008.1
Filename :
4667820
Link To Document :
بازگشت