Abstract
In this work we propose a topology-preserving registration method based on a discrete Markov random field of deformations and a block-matching procedure. For that purpose, the fidelity of a given deformation to the data is established by a block-matching strategy, the smoothness of the transformation is favored by an appropriate prior on the field and topology preservation is guaranteed by imposing some hard-constraints on the local configurations of the field. The resulting deformation is defined as the maximum a posteriori of the field and it is estimated via graph cuts. Results on medical images show the efficiency of using graph cuts based fusion moves for the optimization of the field even though its potentials are neither sparse nor separable and the reduced fused problem turns to be non-submodular.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ashburner, J., Andersson, J.L.R., Friston, K.J.: High-dimensional image registration using symmetric priors. NeuroIm. 9, 619–628 (1999)
Avants, B.B., Epstein, C.L., Grossman, M., Gee, J.C.: Symmetric diffeomorphic image registration with cross-correlation: Evaluating automated labeling of elderly and neurodegenerative brain. Med. Image Anal. 12, 26–41 (2008)
Besag, J.: On the statistical analysis of dirty pictures. J. Roy. Stat. Soc. B. Met. 48(3), 259–302 (1986)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222–1239 (2001)
Brown, E.S., Chan, T.F., Bresson, X.: A convex relaxation method for a class of Vector-valued Minimization Problems with applications to Mumford-Shah segmentation. Technical report. Univ. California, Los Angeles, pp. 10-43 (2010)
Christensen, G.E., Rabbitt, R.D., Miller, M.I.: Deformable templates using large deformation kinematics. IEEE Trans. Image Process. 5(10), 1435–1447 (1996)
Chun, S.Y., Fessler, J.A.: A simple regularizer for B-spline nonrigid image registration that encourages local invertibility. IEEE J. Sel. Top. Signal Process. 3(1), 159–169 (2009)
Glocker, B., Komodakis, N., Tziritas, G., Navab, N., Paragios, N.: Dense image registration through MRFs and efficient linear programming. Med. Image Anal. 12, 731–741 (2008)
Haber, E., Modersitzki, J.: Image registration with guaranteed displacement regularity. Int. J. Comput. Vis. 71(3), 361–372 (2007)
Hammersley, J., Clifford, P.: Markov Fields on Finite Graphs and Lattices (1971), http://www.statslab.cam.ac.uk/~grg/books/hammfest/hamm-cliff.pdf
Hernandez, M., Bossa, M.N., Olmos, S.: Registration of anatomical images using paths of diffeomorphisms parameterized with stationary vector field flows. Int. J. Comput. Vis. 85, 291–306 (2009)
Karaçalı, B., Davatzikos, C.: Estimating topology preserving and smooth displacement fields. IEEE Trans. Med. Imag. 23(7), 868–880 (2004)
Kolmogorov, V., Rother, C.: Minimizing Nonsubmodular Functions with Graph Cuts—A Review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274–1279 (2007)
Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147–159 (2004)
Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2985–2992. IEEE Press, New York (2009)
Lempitsky, V., Rother, C., Roth, S., Blake, A.: Fusion moves for Markov random field optimization. IEEE Trans. Pattern Anal. Mach. Intell. 32(8), 1392–1405 (2010)
Li, S.Z.: Markov random field modeling in image analysis. Springer, London (2009)
Miller, M.I., Trouvé, A., Younes, L.: On the metrics and Euler-Lagrange equations of computational anatomy. Annu. Rev. Biomed. Eng. 4, 375–405 (2002)
Musse, O., Heitz, F., Armspach, J.-P.: Topology preserving deformable image matching using constrained hierarchical parametric models. IEEE Trans. Image Process. 10(7), 1081–1093 (2001)
Paget, R., Longstaff, D.: Extracting the cliques from a neighbourhood system. IEE Proc. Vis. Image Signal Process. 144(3), 168–170 (1997)
Penney, G.P., Schnabel, J.A., Rueckert, D., Viergever, M.A., Niessen, W.J.: Registration-based interpolation. IEEE Trans. Med. Imag. 23(7), 922–926 (2004)
Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE Press, New York (2007)
Rueckert, D., Aljabar, P., Heckemann, R.A., Hajnal, J.V., Hammers, A.: Diffeomorphic registration using B-splines. In: Larsen, R., Nielsen, M., Sporring, J. (eds.) MICCAI 2006. LNCS, vol. 4191, pp. 702–709. Springer, Heidelberg (2006)
Shekhovtsov, A., Kovtun, I., Hlaváč, V.: Efficient MRF Deformation Model for Non-Rigid Image Matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–6. IEEE Press, New York (2007)
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(6), 1068–1080 (2008)
Vercauteren, T., Pennec, X., Perchant, A., Ayache, N.: Diffeomorphic demons: efficient non-parametric image registration. NeuroIm. 45, 61–72 (2009)
Younes, L.: Combining geodesic interpolating splines and affine transformations. IEEE Trans. Med. Imag. 15(5), 1111–1119 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cordero-Grande, L., Vegas-Sánchez-Ferrero, G., Casaseca-de-la-Higuera, P., Alberola-López, C. (2011). Topology-Preserving Registration: A Solution via Graph Cuts. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds) Combinatorial Image Analysis. IWCIA 2011. Lecture Notes in Computer Science, vol 6636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21073-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-21073-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21072-3
Online ISBN: 978-3-642-21073-0
eBook Packages: Computer ScienceComputer Science (R0)