Cerebrovascular network registration via an efficient attributed graph matching technique
•A novel approach that registers vasculatures of arbitrary form from a graph matching-based perspective is presented.•We build abstract graphs from piece-wise linear approximations of the vascular networks’ tubular shape that represent their global connection scheme among the bifurcations and leaves...
Saved in:
Published in | Medical image analysis Vol. 46; pp. 118 - 129 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Netherlands
Elsevier B.V
01.05.2018
Elsevier BV |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •A novel approach that registers vasculatures of arbitrary form from a graph matching-based perspective is presented.•We build abstract graphs from piece-wise linear approximations of the vascular networks’ tubular shape that represent their global connection scheme among the bifurcations and leaves.•To ensure the scalability and computational efficiency of the registration method, we developed a novel feature, termed the “signature,” that captures geometrical attributes of bifurcations and vessel branches in a topologically encoded form.•Using a novel “signature” feature, the graph-based registration method is posed as a Linear Assignment Problem (LAP) rather than the NP-hard quadratic assignment problem (QAP) common in the graph matching literature.•The proposed method’s performance is tested and validated using clinical 3-D angiography images of the human cerebrovasculature. Synthetic data sets are produced from the clinical datasets and have been used to show the robustness of method against structural inclusiveness and deformation.
[Display omitted]
Registration of vascular networks is an indispensable element of prognostic and diagnostic studies that require structural analysis and comparison over time, among different samples, and to a gold standard. However, vascular networks manifest low spatial texture and sparse structural content so that even small variations in their location can make the intensity-based registration inefficient and prone to errors. Motivated by geometrical graph-based models developed in our prior work, we use the shape information in the graph topology sense to enhance the registration performance. An efficient feature-based registration is presented that seeks correspondence of the bifurcations and branches in a graph matching scheme. Since the graph matching is originally posed a NP-hard quadratic assignment problem (QAP) in the literature, we have designed a node signature that incorporates edge correspondences indirectly. This allows removing the quadratic term in the QAP to recast the problem as a linear assignment problem (LAP) to relieve the computational burden. The LAP is efficiently solvable and is scalable to data with graph representation of larger size. The performance is tested and validated using clinical 3-D angiography images of the human cerebrovasculature as well as synthetic datasets. This method proves to be robust in the face of different structural and algorithm’s parameters. Quality of inter-subject and multimodal matching of clinical data has also been confirmed. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 1361-8415 1361-8423 1361-8423 |
DOI: | 10.1016/j.media.2018.02.007 |