Sparse finite element Level-Sets for anisotropic boundary detection in 3D images

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Level-Set methods have been successfully applied to 2D and 3D boundary detection problems. The geodesic active contour model has been particularly successful. Several algorithms for the discretisation have been proposed and the banded approach has been used to improve efficiency, which is crucial in 3D boundary detection. In this paper we propose a new scheme to numerically represent and evolve surfaces in 3D. With the new scheme, efficiency and accuracy are further improved. For the representation, space is partitioned into tetrahedra and finite elements are used to define the level-set function. Extreme sparsity is obtained by maintaining data only for tetrahedra that contain the zero level-set. We formulate the evolution PDE in weak form and incorporate a normalisation term. We obtain a stable scheme with consistent subgrid accuracy without having to rely on any re-initialisation procedure. Boundary detection is performed using an anisotropic extension of the isotropic geodesic model. With the sparse representation, the anisotropic model is computationally feasible. We present experimental results on volumetric data sets including images with a significant amount of noise. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Weber, M., Blake, A., & Cipolla, R. (2005). Sparse finite element Level-Sets for anisotropic boundary detection in 3D images. In Lecture Notes in Computer Science (Vol. 3459, pp. 548–560). Springer Verlag. https://doi.org/10.1007/11408031_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free