Random walks with efficient search and contextually adapted image similarity for deformable registration

13Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We develop a random walk-based image registration method [1] that incorporates two novelties: 1) a progressive optimization scheme that conducts the solution search efficiently via a novel use of information derived from the obtained probabilistic solution, and 2) a data-likelihood re-weighting step that contextually performs feature selection in a spatially adaptive manner so that the data costs are based primarily on trusted information sources. Synthetic experiments on three public datasets of different anatomical regions and modalities showed that our method performed efficient search without sacrificing registration accuracy. Experiments performed on 60 real brain image pairs from a public dataset also demonstrated our method's better performance over existing non-probabilistic image registration methods. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Tang, L. Y. W., & Hamarneh, G. (2013). Random walks with efficient search and contextually adapted image similarity for deformable registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8150 LNCS, pp. 43–50). https://doi.org/10.1007/978-3-642-40763-5_6

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