A probabilistic framework for dense image registration using relaxation labelling

Image Registration has investigated in many researches in recent years. It is an important preprocessing step in a variety of applications such as medical images, super resolution and remote sensing. Generally, dense image registration requires several transformations and deformations such as contrast changing, scaling, rotation and displacement. However, in most recent proposed methods, only some of these transforms are considered, which results in incorrect output. In this paper we propose a new method for dense image registration based on relaxation labelling. For each pixel of a test image, we want to find the best match in a reference image, considering the intensity and geometric constraints. We use blocks of reference image as features, then we look for the closest candidate in the test image. In next step, a relaxation labelling procedure is applied to these candidates for selecting the best match between candidate pixels. Experimental results show that the proposed method achieves satisfactory performance in terms of visual quality, PSNR values and Bad pixel evaluation criteria.

[1]  Michal Irani,et al.  Detecting Irregularities in Images and in Video , 2005, ICCV.

[2]  Fredrik Kahl,et al.  Optimal correspondences from pairwise constraints , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[3]  Ce Liu,et al.  Deformable Spatial Pyramid Matching for Fast Dense Correspondences , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[4]  Josef Kittler,et al.  Region-Based Representation for Object Recognition by Relaxation Labelling , 2000, SSPR/SPR.

[5]  Takeo Kanade,et al.  An Iterative Image Registration Technique with an Application to Stereo Vision , 1981, IJCAI.

[6]  Antonio Torralba,et al.  SIFT Flow: Dense Correspondence across Scenes and Its Applications , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Hongyang Chao,et al.  As-Rigid-As-Possible Stereo under Second Order Smoothness Priors , 2014, ECCV.

[8]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Pramode K. Verma,et al.  Dense image registration using sparse coding and belief propagation , 2011, ICSPCS.

[10]  Michal Irani,et al.  Detecting Irregularities in Images and in Video , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[11]  Pushmeet Kohli,et al.  Object stereo — Joint stereo matching and object segmentation , 2011, CVPR 2011.

[12]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Andrew W. Fitzgibbon,et al.  PMBP: PatchMatch Belief Propagation for Correspondence Field Estimation , 2014, International Journal of Computer Vision.

[14]  Pramode K. Verma,et al.  Dense image registration using sparse coding and belief propagation , 2011, 2011 5th International Conference on Signal Processing and Communication Systems (ICSPCS).

[15]  Jitendra Malik,et al.  Large Displacement Optical Flow: Descriptor Matching in Variational Motion Estimation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.