Biomedical subjects

Vincent LeDigarcher

Publications and source records attributed to Vincent LeDigarcher.

3 recordsLinked to original sources

PubMed2005

Comparison of vessel segmentations using staple.

We propose a novel method for the validation of vascular segmentations. Our technique combines morphological operators and the TAPLE algorithm to obtain ground truth of centerline extractions as well as a measure of accuracy of the methods to be compared. Moreover, ur method can be extended to the validation of any open-curves. We also present a comparison study of three vascular segmentation methods: ridge traversal, statistical and curves level set. They are compared with manual segmentations from five experts.

Algorithms↗

PubMed2005

Spatial graphs for intra-cranial vascular network characterization, generation, and discrimination.

Graph methods that summarize vasculature by its branching topology are not sufficient for the statistical characterization of a population of intra-cranial vascular networks. Intra-cranial vascular networks are typified by topological variations and long, wandering paths between branch points. We present a graph-based representation, called spatial graphs, that captures both the branching patterns and the spatial locations of vascular networks. Furthermore, we present companion methods that allow spatial graphs to (1) statistically characterize populations of vascular networks, (2) generate the central vascular network of a population of vascular networks, and (3) distinguish between populations of vascular networks. We evaluate spatial graphs by using them to distinguish the gender and handedness of individuals based on their intra-cranial vascular networks.

Algorithms↗

PubMed2005

Automatic vascular tree formation using the Mahalanobis distance.

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.

Algorithms↗