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

Authors:
Jong-Sung Kim;Ki-Sang Hong
Affiliations:
POSTECH, Division of Electrical and Computer Engineering, San 31 Hyoja-Dong, 790-784, Pohang, South Korea;POSTECH, Division of Electrical and Computer Engineering, San 31 Hyoja-Dong, 790-784, Pohang, South Korea
Venue:
Machine Vision and Applications
Year:
2008

Citing 16
Cited 4

Geodesic Active Contours

International Journal of Computer Vision
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model

International Journal of Computer Vision
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Multiclass Spectral Clustering

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Computing Geodesics and Minimal Surfaces via Graph Cuts

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues

IEEE Transactions on Pattern Analysis and Machine Intelligence
Lazy snapping

ACM SIGGRAPH 2004 Papers
"GrabCut": interactive foreground extraction using iterated graph cuts

ACM SIGGRAPH 2004 Papers
Multivariate mixtures of normals with unknown number of components

Statistics and Computing
Graph Cuts and Efficient N-D Image Segmentation

International Journal of Computer Vision
A Review of Statistical Approaches to Level Set Segmentation: Integrating Color, Texture, Motion and Shape

International Journal of Computer Vision
A comparative study of energy minimization methods for markov random fields

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Active contours without edges

IEEE Transactions on Image Processing

Color-texture segmentation using unsupervised graph cuts

Pattern Recognition
Image segmentation by a contrario simulation

Pattern Recognition
Hierarchical vibrations for part-based recognition of complex objects

Pattern Recognition
An embedded software-reconfigurable color segmentation architecture for image processing systems

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

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.