Multi-Object Geodesic Active Contours (MOGAC): A Parallel Sparse-Field Algorithm for Image Segmentation

Blake C. Lucas, Michael Kazhdan, Russell H. Taylor
Johns Hopkins University, Baltimore, MD
Johns Hopkins University Department of Computer Science;Technical Report 12-01, 2012


   title={Multi-Object Geodesic Active Contours (MOGAC): A Parallel Sparse-Field Algorithm for Image Segmentation},

   author={Taylor, R. and Kazhdan, M. and Lucas, B.},



Download Download (PDF)   View View   Source Source   



An important task for computer vision systems is to segment adjacent structures in images without producing gaps or overlaps. Multi-object Level Set Methods (MLSM) perform this task with the benefit of sub-pixel accuracy. However, current implementations of MLSM are not as computationally or memory efficient as their region growing and graph cut counterparts which lack sub-pixel accuracy. To address this performance gap, we present a novel parallel implementation of MLSM that leverages the sparse properties of the segmentation algorithm to minimize its memory footprint for multiple objects. The new method, Multi-Object Geodesic Active Contours (MOGAC), can represent N objects with just two functions: a label image and unsigned distance field. The time complexity of the algorithm is shown to be O((M^d)/P) for M^d pixels and P processing units in dimension d={2,3}, independent of the number of objects. Results are presented for 2D and 3D image segmentation problems.
No votes yet.
Please wait...

* * *

* * *

* * *

HGPU group © 2010-2022 hgpu.org

All rights belong to the respective authors

Contact us: