Vascular system matching validated on the liver

Abstract : In this paper, we propose an original and efficient tree matching algorithm for intra-patient hepatic vascular system registration. Vascular systems are segmented from CT-scan images acquired at different times, and then modeled as trees. The goal of this algorithm is to find common bifurcations (nodes) and vessels (edges) in both trees. Starting from the tree root, edges and nodes are iteratively matched. The algorithm works on a set of match solutions that are updated to keep the best matches thanks to a quality criterion. It is robust against topological modifications due to segmentation failures and against strong deformations. Finally, this algorithm is validated on a large synthetic database containing cases with various deformation and segmentation problems.
Type de document :
Communication dans un congrès
Christensen, Gary and Sonka, Milan. Information Processing in Medical Imaging 2005 (IPMI'05), 2005, Glenwood springs, Colorado, USA, United States. Springer, 3565, pp.443--455, 2005, LNCS. 〈10.1007/11505730_37〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00616002
Contributeur : Project-Team Asclepios <>
Soumis le : vendredi 19 août 2011 - 18:22:03
Dernière modification le : mardi 18 septembre 2018 - 15:38:04

Identifiants

Citation

Arnaud Charnoz, Vincent Agnus, Grégoire Malandain, Luc Soler, Mohamed Tajine. Vascular system matching validated on the liver. Christensen, Gary and Sonka, Milan. Information Processing in Medical Imaging 2005 (IPMI'05), 2005, Glenwood springs, Colorado, USA, United States. Springer, 3565, pp.443--455, 2005, LNCS. 〈10.1007/11505730_37〉. 〈inria-00616002〉

Partager

Métriques

Consultations de la notice

120