Asymmetric Image-Template Registration
Author(s)
Sabuncu, Mert R.; Yeo, B. T. Thomas; Van Leemput, Koen; Vercauteren, Tom; Golland, Polina
DownloadGolland_Asymmetric Image.pdf (1013.Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
A natural requirement in pairwise image registration is that the resulting deformation is independent of the order of the images. This constraint is typically achieved via a symmetric cost function and has been shown to reduce the effects of local optima. Consequently, symmetric registration has been successfully applied to pairwise image registration as well as the spatial alignment of individual images with a template. However, recent work has shown that the relationship between an image and a template is fundamentally asymmetric. In this paper, we develop a method that reconciles the practical advantages of symmetric registration with the asymmetric nature of image-template registration by adding a simple correction factor to the symmetric cost function. We instantiate our model within a log-domain diffeomorphic registration framework. Our experiments show exploiting the asymmetry in image-template registration improves alignment in the image coordinates.
Description
Authors Manuscript received: 2010 May 4. 12th International Conference, London, UK, September 20-24, 2009, Proceedings, Part I
Date issued
2009-10Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Asymmetric Image-Template Registration
Publisher
Springer Berlin / Heidelberg
Citation
Sabuncu, Mert R. et al. “Asymmetric Image-Template Registration.” Medical Image Computing and Computer-Assisted Intervention – MICCAI 2009. Ed. Guang-Zhong Yang et al. LNCS Vol. 5761. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 565–573.
Version: Author's final manuscript
ISBN
978-3-642-04267-6
ISSN
0302-9743
1611-3349