Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part II
Tracking 3-D Pulmonary Tree Structures
MMBIA '96 Proceedings of the 1996 Workshop on Mathematical Methods in Biomedical Image Analysis (MMBIA '96)
Registration and Analysis of Vascular Images
International Journal of Computer Vision - Special Issue on Research at the University of North Carolina Medical Image Display Analysis Group (MIDAG)
Liver registration for the follow-up of hepatic tumors
MICCAI'05 Proceedings of the 8th international conference on Medical image computing and computer-assisted intervention - Volume Part II
| Hi-index | 0.00 |
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.