Illumination robust template matching based on nearest neighbor

We propose a novel method for the illumination robust template matching in unconstrained environments, named illumination robust template matching (IRTM). IRTM is based on the patch diversity of the Nearest-Neighbor. A core component is to calculate the similarity between patch pairs. Without illumination change, the Euclidean distance of appearance and geometric features jointly measure the similarity well. However, the illumination change will significantly affect the confidence of measure. In this paper, based on the relative pixel values that do not change with illumination, we define an illumination-robust distance function. With experiments, IRTM is shown to be a well-performing similarity measure against illumination changes, non-rigid geometric deformations, as well as background clutter, and occlusions.

[1]  William T. Freeman,et al.  Best-Buddies Similarity for robust template matching , 2015, CVPR.

[2]  Alexander Sibiryakov,et al.  Fast and high-performance template matching method , 2011, CVPR 2011.

[3]  Michael Werman,et al.  Asymmetric Correlation: A Noise Robust Similarity Measure for Template Matching , 2013, IEEE Transactions on Image Processing.

[4]  Dorin Comaniciu,et al.  Real-time tracking of non-rigid objects using mean shift , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[5]  Lihi Zelnik-Manor,et al.  Template Matching with Deformable Diversity Similarity , 2016, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[6]  Federico Tombari,et al.  Performance Evaluation of Full Search Equivalent Pattern Matching Algorithms , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Denis Simakov,et al.  Summarizing visual data using bidirectional similarity , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Takuya Akashi,et al.  Multi-scale Template Matching with Scalable Diversity Similarity in an Unconstrained Environment , 2019, BMVC.

[9]  Shai Avidan,et al.  Locally Orderless Tracking , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  William T. Freeman,et al.  Best-Buddies Similarity—Robust Template Matching Using Mutual Nearest Neighbors , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[12]  Michael Werman,et al.  Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Ju Jang Lee,et al.  Fast and robust template matching algorithm in noisy image , 2007, 2007 International Conference on Control, Automation and Systems.

[14]  Yacov Hel-Or,et al.  Matching by Tone Mapping: Photometric Invariant Template Matching , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Patrick Pérez,et al.  Color-Based Probabilistic Tracking , 2002, ECCV.

[16]  Yong-Sheng Chen,et al.  Fast algorithm for robust template matching with M-estimators , 2003, IEEE Trans. Signal Process..

[17]  Uwe D. Hanebeck,et al.  Template matching using fast normalized cross correlation , 2001, SPIE Defense + Commercial Sensing.