A fast algorithm for level set-like active contours

Authors:
Björn Nilsson;Anders Heyden
Affiliations:
Cellavision AB, Ideon Research Park, 22370 Lund, Sweden;Centre for Mathematical Sciences, Box 118, 22100 Lund, Sweden
Venue:
Pattern Recognition Letters
Year:
2003

Citing 9
Cited 9

Algorithms

Algorithms
Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations

Journal of Computational Physics
Computing minimal surfaces via level set curvature flow

Journal of Computational Physics
Evolutionary fronts for topology-independent shape modeling and recovery

ECCV '94 Proceedings of the third European conference on Computer vision (vol. 1)
A fast level set method for propagating interfaces

Journal of Computational Physics
Level set methods: an overview and some recent results

Journal of Computational Physics
Gradient flows and geometric active contour models

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Geodesic active contours

ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Segmentation of Dense Leukocyte Clusters

MMBIA '01 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA'01)

Semi-automatic computer aided lesion detection in dental X-rays using variational level set

Pattern Recognition
A Two-Phase Segmentation of Cell Nuclei Using Fast Level Set-Like Algorithms

SCIA '09 Proceedings of the 16th Scandinavian Conference on Image Analysis
On simulating 3D fluorescent microscope images

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
A comparison of fast level set-like algorithms for image segmentation in fluorescence microscopy

ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II
A fast level set-like algorithm for region-based active contours

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part III
Generation of 3D digital phantoms of colon tissue

ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part II
Segmentation of medical images of different modalities using distance weighted C-V model

MBIA'11 Proceedings of the First international conference on Multimodal brain image analysis
Feasibility of patient specific aortic blood flow CFD simulation

MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Comparison of methods for splitting of touching and overlapping macrophages in fluorescent micrographs

ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part II

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper describes a fast algorithm for topology independent tracking of moving interfaces under curvature- and velocity field-dependent speed laws. This is usually done in the level set framework using the narrow-band algorithm, which accurately solves the level set equation but is too slow to use in real-time or near real-time image segmentation applications. In this paper we introduce a fast algorithm for tracking moving interfaces in a level set-like manner. The algorithm relies on two key components: First, it tracks the interface by scheduling point-wise propagation events using a heap sorted queue. Second, the local geometric properties of the interface are defined so that they can be efficiently updated in an incremental manner and so that they do not require the presence of the signed distance function. Finally examples are given that indicate that the algorithm is fast and accurate enough for near real-time segmentation applications.