Non-local graph-based regularization for deformable image registration

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Deformable image registration aims to deliver a plausible spatial transformation between two or more images by solving a highly dimensional, ill-posed optimization problem. Covering the complexity of physiological motion has so far been limited to either generic physical models or local motion regularization models. This paper presents an alternative, graphical regularization model, which captures well the non-local scale of motion, and thus enables to incorporate complex regularization models directly into deformable image registration. In order to build the proposed graph-based regularization, a Minimum Spanning Tree (MST), which represents the underlying tissue physiology in a perceptually meaningful way, is computed first. This is followed by a fast non-local cost aggregation algorithm that performs regularization of the estimated displacement field using the precomputed MST. To demonstrate the advantage of the presented regularization, we embed it into the widely used Demons registration framework. The presented method is shown to improve the accuracy for exhale-inhale CT data pairs.

Cite

CITATION STYLE

APA

Papież, B. W., Szmul, A., Grau, V., Brady, J. M., & Schnabel, J. A. (2017). Non-local graph-based regularization for deformable image registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10081 LNCS, pp. 199–207). Springer Verlag. https://doi.org/10.1007/978-3-319-61188-4_18

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