Efficient Segmentation Using Feature-based Graph Partitioning Active Contours.
Graph partitioning active contours (GPAC) is a recently introduced approach that elegantly embeds the graph-based image segmentation problem within a continuous optimization framework. GPAC can be used within parametric snake-based or implicit level set-based active contour continuous paradigms for image partitioning. However, GPAC similar to many other graph-based approaches has quadratic memory requirements which severely limits the scalability of the algorithm to practical problem domains. An N xN image requires O(N(4)) computation and memory to create and store the full graph of pixel inter-relationships even before the start of the contour optimization process. For example, an 1024x1024 grayscale image needs over one terabyte of memory. Approximations using tile/block-based or superpixel-based multiscale grouping of the pixels reduces this complexity by trading off accuracy. This paper describes a new algorithm that implements the exact GPAC algorithm using a constant memory requirement of a few kilobytes, independent of image size.
Bunyak
Filiz
F
Department of Computer Science, University of Missouri-Columbia, Columbia, MO, USA.
Palaniappan
Kannappan
K
IEEE Trans Image Process. 2006 Oct;15(10):3213-8
17022283
IEEE Trans Image Process. 2001;10(2):266-77
18249617
Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit. 2008;:1-8
23680693
IEEE Trans Image Process. 1998;7(3):421-32
18276262
J Multimed. 2007 Aug;2(4):20-33
19096530
IEEE Trans Pattern Anal Mach Intell. 2006 Apr;28(4):509-21
16566501
Proc IEEE Int Symp Biomed Imaging. 2006 Apr 6;:1040-1043
19578557
IEEE Trans Pattern Anal Mach Intell. 2008 Aug;30(8):1400-14
18566494
IEEE Trans Pattern Anal Mach Intell. 2004 Feb;26(2):147-59
15376891
Med Image Comput Comput Assist Interv. 2009;12(Pt 2):617-24
20426163
IEEE Trans Image Process. 2005 Oct;14(10):1486-502
16238055
IEEE Trans Pattern Anal Mach Intell. 2005 Feb;27(2):282-7
15688566