Random Walks with Efficient Search and Contextually Adapted Image Similarity for Deformable Registration
We develop a random walk-based image registration method  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.
KeywordsSearch Space Image Registration Discretization Error Registration Error Registration Accuracy
- 4.Heinrich, M.P., Jenkinson, M., Brady, S.M., Schnabel, J.A.: Globally optimal deformable registration on a minimum spanning tree using dense displacement sampling. In: Ayache, N., Delingette, H., Golland, P., Mori, K. (eds.) MICCAI 2012, Part III. LNCS, vol. 7512, pp. 115–122. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 5.Tang, L., Hero, A., Hamarneh, G.: Locally-adaptive similarity metric for deformable medical image registration. In: ISBI, pp. 728–731 (2012)Google Scholar
- 6.Glocker, B., Paragios, N., Komodakis, N., Tziritas, G., Navab, N.: Optical flow estimation with uncertainties through dynamic MRFs. In: CVPR (2008)Google Scholar
- 7.Bagon, S., Galun, M.: A unified multiscale framework for discrete energy minimization. CoRR, vol. 4867 (2012)Google Scholar