TY - GEN
T1 - A contextual maximum likelihood framework for modeling image registration
AU - Wachinger, Christian
AU - Navab, Nassir
PY - 2012
Y1 - 2012
N2 - We introduce a novel probabilistic framework for image registration. This framework considers, in contrast to previous ones, local neighborhood information. We integrate the neighborhood information into the framework by adding layers of latent random variables, characterizing the descriptive information of each image. This extension has multiple advantages. It allows for a unified description of geometric and iconic registration, with the consequential analysis of similarities. It enables to arrange registration techniques in a continuum, limited by pure intensity-and feature-based registration. With this wide spectrum of techniques combined, we can model hybrid registration approaches. The probabilistic coupling allows further to deduce optimal descriptors and to model the adaptation of description layers during the process, as it is done for joint registration/segmentation. Finally, we deduce a new registration algorithm that allows for a dynamic adaptation of the description layers during the registration. Excellent results confirm the advantages of the new registration method, the major contribution of this article lies, however, in the theoretical analysis.
AB - We introduce a novel probabilistic framework for image registration. This framework considers, in contrast to previous ones, local neighborhood information. We integrate the neighborhood information into the framework by adding layers of latent random variables, characterizing the descriptive information of each image. This extension has multiple advantages. It allows for a unified description of geometric and iconic registration, with the consequential analysis of similarities. It enables to arrange registration techniques in a continuum, limited by pure intensity-and feature-based registration. With this wide spectrum of techniques combined, we can model hybrid registration approaches. The probabilistic coupling allows further to deduce optimal descriptors and to model the adaptation of description layers during the process, as it is done for joint registration/segmentation. Finally, we deduce a new registration algorithm that allows for a dynamic adaptation of the description layers during the registration. Excellent results confirm the advantages of the new registration method, the major contribution of this article lies, however, in the theoretical analysis.
UR - http://www.scopus.com/inward/record.url?scp=84866704179&partnerID=8YFLogxK
U2 - 10.1109/CVPR.2012.6247902
DO - 10.1109/CVPR.2012.6247902
M3 - Conference contribution
AN - SCOPUS:84866704179
SN - 9781467312264
T3 - Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
SP - 1995
EP - 2002
BT - 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
T2 - 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012
Y2 - 16 June 2012 through 21 June 2012
ER -