Abstract
Deformable image registration poses a highly non-convex optimisation problem. Conventionally, medical image registration techniques rely on continuous optimisation, which is prone to local minima. Recent advances in the mathematics and new programming methods enable these disadvantages to be overcome using discrete optimisation. In this paper, we present a new technique deeds, which employs a discrete dense displacement sampling for the deformable registration of high resolution CT volumes. The image grid is represented as a minimum spanning tree. Given these constraints a global optimum of the cost function can be found efficiently using dynamic programming, which enforces the smoothness of the deformations. Experimental results demonstrate the advantages of deeds: the registration error for the challenging registration of inhale and exhale pulmonary CT scans is significantly lower than for two state-of-the-art registration techniques, especially in the presence of large deformations and sliding motion at lung surfaces.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Murphy, K., van Ginneken, B., Reinhardt, J., Kabus, S., Ding, K., Deng, X., Pluim, J.: Evaluation of registration methods on thoracic CT: The EMPIRE10 challenge. IEEE Trans. Med. Imag. 30(11), 1901–1920 (2011)
Glocker, B., Komodakis, N., Tziritas, G., Navab, N., Paragios, N.: Dense image registrations through MRFs and efficient linear programming. Med. Imag. Anal. 12(6), 731–741 (2008)
Veksler, O.: Stereo correspondence by dynamic programming on a tree. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 384–390. IEEE Computer Society (2005)
Felzenszwalb, P., Huttenlocher, D.: Efficient belief propagation for early vision. Int. J. Comp. Vis. 70(1), 41–54 (2006)
Avants, B., Epstein, C., Grossman, M., Gee, J.: Symmetric diffeomorphic image registration with cross-correlation: Evaluating automated labeling of elderly and neurodegenerative brain. Med. Imag. Anal. 12(1), 26–41 (2008)
So, R., Tang, T., Chung, A.: Non-rigid image registration of brain magnetic resonance images using graph-cuts. Pattern Recogn. 44(10), 2450–2467 (2011)
Prim, R.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Chen, M., Lu, W., Chen, Q., Ruchala, K., Olivera, G.: A simple fixed-point approach to invert a deformation field. Medical Physics 35, 81 (2007)
Arsigny, V., Commowick, O., Pennec, X., Ayache, N.: A Log-Euclidean Framework for Statistics on Diffeomorphisms. In: Larsen, R., Nielsen, M., Sporring, J. (eds.) MICCAI 2006. LNCS, vol. 4190, pp. 924–931. Springer, Heidelberg (2006)
Castillo, R., Castillo, E., Guerra, R., Johnson, V., McPhail, T., Garg, A., Guerrero, T.: A framework for evaluation of deformable image registration spatial accuracy using large landmark point sets. Phy. Med. Biol. 54(7), 1849 (2009)
Schmidt-Richberg, A., Werner, R., Handels, H., Ehrhardt, J.: Estimation of slipping organ motion by registration with direction-dependent regularization. Med. Imag. Anal. 16(1), 150–159 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heinrich, M.P., Jenkinson, M., Brady, S.M., Schnabel, J.A. (2012). Globally Optimal Deformable Registration on a Minimum Spanning Tree Using Dense Displacement Sampling. In: Ayache, N., Delingette, H., Golland, P., Mori, K. (eds) Medical Image Computing and Computer-Assisted Intervention – MICCAI 2012. MICCAI 2012. Lecture Notes in Computer Science, vol 7512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33454-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-33454-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33453-5
Online ISBN: 978-3-642-33454-2
eBook Packages: Computer ScienceComputer Science (R0)