Minimal paths in 3D images and application to virtual endoscopy

18Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D images using Fast Marching [4]. Our original contribution is to extend this technique to 3D, and give new improvements of the approach that are relevant in 2D as well as in 3D. We also introduce several methods to reduce the computation cost and the user interaction. This work finds its motivation in the particular case of 3D medical images. We show that this technique can be efficiently applied to the problem of finding a centered path in tubular anatomical structures with minimum interactivity, and we apply it to path construction for virtual endoscopy. Synthetic and real medical images are used to illustrate each contribution.

Cite

CITATION STYLE

APA

Deschamps, T. (2000). Minimal paths in 3D images and application to virtual endoscopy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1843, pp. 543–557). Springer Verlag. https://doi.org/10.1007/3-540-45053-x_35

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