A new graph cut-based multiple active contour algorithm without initial contours and seed points

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 topdownwaythroughaswapmoveof binarylabels. Asplit 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 Mu...

• Type: Journal
• Year: 2008
• Where: MVA
• Authors: Jong-Sung Kim, Ki-Sang Hong
• Keywords: Initial Contours, Multiple Active Contours, MVA 2007, MVA 2008, Partitioning Problem