A new graph cut-based multiple active contour algorithm without initial contours and seed points
SCIE
SCOPUS
- Title
- A new graph cut-based multiple active contour algorithm without initial contours and seed points
- Authors
- Kim, JS; Hong, KS
- Date Issued
- 2008-05
- Publisher
- SPRINGER
- Abstract
- This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm.
- Keywords
- multiple active contours; graph cuts; divisive partitioning; image segmentation; IMAGE SEGMENTATION; UNKNOWN NUMBER; COMPONENTS; MIXTURES; TEXTURE; COLOR
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/22896
- DOI
- 10.1007/S00138-007-0
- ISSN
- 0932-8092
- Article Type
- Article
- Citation
- MACHINE VISION AND APPLICATIONS, vol. 19, no. 3, page. 181 - 193, 2008-05
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.