Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
International Journal of Computer Vision
A Level-Set Approach to 3D Reconstruction from Range Data
International Journal of Computer Vision
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Level Set Model for Image Classification
International Journal of Computer Vision
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
International Journal of Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Coupled Geodesic Active Regions for Image Segmentation: A Level Set Approach
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part II
Medical Image Processing, Analysis & Visualization in Clinical Research
CBMS '01 Proceedings of the Fourteenth IEEE Symposium on Computer-Based Medical Systems
ACM SIGGRAPH 2006 Papers
International Journal of Computer Vision
Journal of Cognitive Neuroscience
A work-efficient GPU algorithm for level set segmentation
Proceedings of the Conference on High Performance Graphics
Snakes, shapes, and gradient vector flow
IEEE Transactions on Image Processing
A binary level set model and some applications to Mumford-Shah image segmentation
IEEE Transactions on Image Processing
Multi-object spring level sets (MUSCLE)
MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Hi-index | 0.00 |
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^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.