Automatic vascular tree formation using the Mahalanobis distance

12Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimization criterion of the Mahalanobis distance. First, a multivariate class of connected junctions is defined using a set of trained vascular trees and their corresponding image volumes. Second, a minimum spanning tree algorithm forms the tree using the Mahalanobis distance of each connection from the "connected" class as a cost function. Our technique allows for the best combination of the discrimination criteria between connected and non-connected junctions and is also modality, organ and segmentation specific. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jomier, J., LeDigarcher, V., & Aylward, S. R. (2005). Automatic vascular tree formation using the Mahalanobis distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3750 LNCS, pp. 806–812). https://doi.org/10.1007/11566489_99

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