An internal self-similarities matching algorithm for IR/visual images based on shape

We present an efficient approach for measuring similarity between visual and IR images based on matching internal self-similarities. What is correlated across images is the internal layout of local self-similarities, even though geometric distortions and at multiple scales. These internal self-similarities are efficiently captured by a compact local "self-similarity descriptor". We compare our measure to commonly used SURF. Experimental results show that the proposed algorithm can realize the rotation invariance, scale invariance and robustness for occlusion. The proposed algorithm can match the shape in the IR and visible images efficiently and correctly.

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

[2]  Vincent Lepetit,et al.  Fast Non-Rigid Surface Detection, Registration and Realistic Augmentation , 2008, International Journal of Computer Vision.

[3]  Andrew Blake,et al.  Contour-based learning for object detection , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[4]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[5]  Cordelia Schmid,et al.  Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search , 2008, ECCV.

[6]  Matthijs C. Dorst Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[7]  B. Schiele,et al.  Combined Object Categorization and Segmentation With an Implicit Shape Model , 2004 .

[8]  Eli Shechtman,et al.  Matching Local Self-Similarities across Images and Videos , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.