Spectral Demons - Image Registration via Global Spectral Correspondence

Image registration is a building block for many applications in computer vision and medical imaging. However the current methods are limited when large and highly non-local deformations are present. In this paper, we introduce a new direct feature matching technique for non-parametric image registration where efficient nearest-neighbor searches find global correspondences between intensity, spatial and geometric information. We exploit graph spectral representations that are invariant to isometry under complex deformations. Our direct feature matching technique is used within the established Demons framework for diffeomorphic image registration. Our method, called Spectral Demons, can capture very large, complex and highly non-local deformations between images. We evaluate the improvements of our method on 2D and 3D images and demonstrate substantial improvement over the conventional Demons algorithm for large deformations.

[1]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Tom Vercauteren,et al.  Diffeomorphic demons: Efficient non-parametric image registration , 2009, NeuroImage.

[3]  Ramsay Dyer,et al.  Spectral Mesh Processing , 2010, Comput. Graph. Forum.

[4]  H. C. Longuet-Higgins,et al.  An algorithm for associating the features of two images , 1991, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[5]  Alain Trouvé,et al.  Registration, atlas estimation and variability analysis of white matter fiber bundles modeled as currents , 2011, NeuroImage.

[6]  Y. Amit,et al.  Towards a coherent statistical framework for dense deformable template estimation , 2007 .

[7]  D. Hill,et al.  Non-rigid image registration: theory and practice. , 2004, The British journal of radiology.

[8]  Tsvi Tlusty,et al.  A RELATION BETWEEN THE MULTIPLICITY OF THE SECOND EIGENVALUE OF A GRAPH LAPLACIAN, COURANT'S NODAL LINE THEOREM AND THE SUBSTANTIAL DIMENSION OF TIGHT POLYHEDRAL SURFACES ∗ , 2010, 1007.4132.

[9]  Anand Rangarajan,et al.  A new algorithm for non-rigid point matching , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[10]  Antonio Robles-Kelly,et al.  Segmentation via Graph-Spectral Methods and Riemannian Geometry , 2005, CAIP.

[11]  L. Younes,et al.  On the metrics and euler-lagrange equations of computational anatomy. , 2002, Annual review of biomedical engineering.

[12]  A. Dale,et al.  High‐resolution intersubject averaging and a coordinate system for the cortical surface , 1999, Human brain mapping.

[13]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[14]  Petros Drineas,et al.  On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..

[15]  Yosi Keller,et al.  Improving Shape Retrieval by Spectral Matching and Meta Similarity , 2010 .

[16]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

[18]  Nicholas Ayache,et al.  Iconic feature based nonrigid registration: the PASHA algorithm , 2003, Comput. Vis. Image Underst..

[19]  Daniel Rueckert,et al.  Nonrigid registration using free-form deformations: application to breast MR images , 1999, IEEE Transactions on Medical Imaging.

[20]  Jianbo Shi,et al.  Learning Segmentation by Random Walks , 2000, NIPS.

[21]  Nicholas Ayache,et al.  Symmetric Log-Domain Diffeomorphic Registration: A Demons-Based Approach , 2008, MICCAI.

[22]  Nicholas Ayache,et al.  Non-parametric Diffeomorphic Image Registration with the Demons Algorithm , 2007, MICCAI.

[23]  Radu Horaud,et al.  Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[24]  Ghassan Hamarneh,et al.  A Survey on Shape Correspondence , 2011, Comput. Graph. Forum.

[25]  Leo Grady,et al.  Discrete Calculus - Applied Analysis on Graphs for Computational Science , 2010 .

[26]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[27]  Martin Reuter,et al.  Hierarchical Shape Segmentation and Registration via Topological Features of Laplace-Beltrami Eigenfunctions , 2010, International Journal of Computer Vision.

[28]  Monica Hernandez,et al.  Contributions to 3D Diffeomorphic Atlas Estimation: Application to Brain Images , 2007, MICCAI.

[29]  Nicholas Ayache,et al.  Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration , 2010, IEEE Transactions on Medical Imaging.

[30]  Alain Trouvé,et al.  Computing Large Deformation Metric Mappings via Geodesic Flows of Diffeomorphisms , 2005, International Journal of Computer Vision.

[31]  Leo Grady,et al.  Fast Brain Matching with Spectral Correspondence , 2011, IPMI.

[32]  Nicholas Ayache,et al.  Medical Image Computing and Computer-Assisted Intervention - MICCAI 2007, 10th International Conference, Brisbane, Australia, October 29 - November 2, 2007, Proceedings, Part I , 2007, MICCAI.

[33]  Gabor Fichtinger,et al.  Medical Image Computing and Computer-Assisted Intervention - MICCAI 2008, 11th International Conference, New York, NY, USA, September 6-10, 2008, Proceedings, Part I , 2008, International Conference on Medical Image Computing and Computer-Assisted Intervention.

[34]  Hao Zhang,et al.  Robust 3D Shape Correspondence in the Spectral Domain , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).