Multi-object geodesic active contours (MOGAC)
An emerging topic is to build image segmentation systems that can segment hundreds to thousands of objects (i.e. cell segmentation\tracking, full brain parcellation, full body segmentation, etc.). Multi-object Level Set Methods (MLSM) perform this task with the benefit of sub-pixel precision. Howeve...
Saved in:
Published in | Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention Vol. 15; no. Pt 2; p. 404 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Germany
2012
|
Subjects | |
Online Access | Get more information |
Cover
Loading…
Summary: | An emerging topic is to build image segmentation systems that can segment hundreds to thousands of objects (i.e. cell segmentation\tracking, full brain parcellation, full body segmentation, etc.). Multi-object Level Set Methods (MLSM) perform this task with the benefit of sub-pixel precision. However, current implementations of MLSM are not as computationally or memory efficient as their region growing and graph cut counterparts which lack sub-pixel precision. To address this performance gap, we present a novel parallel implementation of MLSM that leverages the sparse properties of the 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 mask image and unsigned distance field. The time complexity of the algorithm is shown to be O((M (power)d)/P) for M (power)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. |
---|---|
DOI: | 10.1007/978-3-642-33418-4_50 |