DocumentCode
1932702
Title
Using contour information for image segmentation
Author
Nguyen Duong Trung Dung ; Huynh Thi Thanh Binh
Author_Institution
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore, Singapore
fYear
2013
fDate
15-18 Dec. 2013
Firstpage
258
Lastpage
263
Abstract
This paper proposes an algorithm for image segmentation that improves the graph-based segmentation algorithm by exploiting contour information. The graph-based image segmentation [9] is a fast and efficient method of generating a set of segments from an image. However, its drawback is neglecting the contour information of pixels. Contour can provide significant cues to facilitate the efficient segmentation. We propose an improved weight function that incorporates contour feature into the dissimilarity measure of pixels. We performed experiments on the Berkeley image dataset. Our proposed approach attains significant performance. The experimental results show that our proposed approach is comparable to or even outperforms some state-of-the-art algorithms. In term of global consistency error, our method gives better result while other measures including Probabilistic Rand Index, Variation of Information, and Boundary Displacement Error are close to the best result given by state-of-the-art algorithms.
Keywords
graph theory; image segmentation; Berkeley image dataset; contour feature; contour information; global consistency error; graph-based image segmentation; weight function; Algorithm design and analysis; Image color analysis; Image edge detection; Image segmentation; Partitioning algorithms; Pattern recognition; Shape; Image segmentation; bottom-up approach; contour information; graph-based segmentation; orientation energy; top-down approach;
fLanguage
English
Publisher
ieee
Conference_Titel
Soft Computing and Pattern Recognition (SoCPaR), 2013 International Conference of
Conference_Location
Hanoi
Print_ISBN
978-1-4799-3399-0
Type
conf
DOI
10.1109/SOCPAR.2013.7054139
Filename
7054139
Link To Document