A new marching cubes algorithm for interactive level set with application to MR image segmentation

Authors:
David Feltell;Li Bai
Affiliations:
School of Computer Science, University of Nottingham, UK;School of Computer Science, University of Nottingham, UK
Venue:
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Year:
2010

Citing 4
Cited 0

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

Journal of Computational Physics
A fast level set method for propagating interfaces

Journal of Computational Physics
A Level-Set Approach to 3D Reconstruction from Range Data

International Journal of Computer Vision
A streaming narrow-band algorithm: interactive computation and visualization of level sets

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend the classical marching cubes algorithm in computer graphics for isosurface polygonisation to make use of new developments in the sparse field level set method, which allows localised updates to the implicit level set surface. This is then applied to an example medical image analysis and visualisation problem, using user-guided intelligent agent swarms to correct holes in the surface of a brain cortex, where level set segmentation has failed to reconstruct the local surface geometry correctly from a magnetic resonance image. The segmentation system is real-time and fully interactive.