Rigid Image Registration by General Adaptive Neighborhood Matching

Abstract : This paper aims to propose a new feature and intensity-based image registration method. The proposed approach is based on the block matching algorithm : a displacement field is locally computed by matching spatially-invariant intensity sub-blocks of the images before performing an optimization algorithm from this vector field to estimate the transformation. Our approach proposes a new way to calculate the displacement field by matching spatially-variant sub-blocks of the images, called General Adaptive Neighborhoods (GANs). These neighborhoods are adaptive with respect to both the intensities and the spatial structures of the image. They represent the patterns within the grayscale images. This paper also presents a consistent shape metric used to match the GANs. The performed qualitative and quantitative experiments show that the proposed GAN matching method provides accurate displacement fields enabling to perform image rigid registration, even for data from different modalities, that outperforms the classical block matching algorithm with respect to robustness and accuracy criteria.
Liste complète des métadonnées

Contributeur : Fatima Lillouch <>
Soumis le : lundi 15 février 2016 - 11:14:06
Dernière modification le : mardi 16 janvier 2018 - 15:59:29



Johan Debayle, Benoît Presles. Rigid Image Registration by General Adaptive Neighborhood Matching . Pattern Recognition, Elsevier, 2016, 55, pp.45-57. 〈http://www.sciencedirect.com/science/article/pii/S0031320316000455〉. 〈10.1016/j.patcog.2016.01.024〉. 〈emse-01274011〉



Consultations de la notice