Illumination Robust Template Matching based on Nearest-Neighbor

被引:0
|
作者
Zhang, Yi [1 ]
Zhang, Chao [2 ]
Akashi, Takuya [3 ]
机构
[1] Iwate Univ, Grad Sch Engn, Morioka, Iwate, Japan
[2] Univ Fukui, Fac Engn, Fukui, Japan
[3] Iwate Univ, Fac Sci & Engn, Morioka, Iwate, Japan
关键词
template matching; object detection; illumination change; similarity measure;
D O I
10.1117/12.2590778
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Stereo matching as a nearest-neighbor problem
    Tomasi, C
    Manduchi, R
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (03) : 333 - 340
  • [2] Nearest-neighbor variance estimation (NNVE): Robust covariance estimation via nearest-neighbor cleaning
    Wang, N
    Raftery, AE
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2002, 97 (460) : 994 - 1006
  • [3] Nearest-neighbor variance estimation (NNVE): Robust covariance estimation via nearest-neighbor cleaning - Comment
    Soofi, ES
    Dadpay, A
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2002, 97 (460) : 1012 - 1014
  • [4] Fingerprint matching based on octantal nearest-neighbor structure and core points
    Yang, Li-min
    Yang, Jie
    Wu, Hong-tao
    COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING, PROCEEDINGS, 2006, 4338 : 931 - +
  • [5] ON UNSUPERVISED NEAREST-NEIGHBOR REGRESSION AND ROBUST LOSS FUNCTIONS
    Kramer, Oliver
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 164 - 170
  • [6] ON NEAREST-NEIGHBOR GRAPHS
    PATERSON, MS
    YAO, FF
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 416 - 426
  • [7] On Nearest-Neighbor Graphs
    D. Eppstein
    M. S. Paterson
    F. F. Yao
    Discrete & Computational Geometry, 1997, 17 : 263 - 282
  • [8] Nearest-neighbor methods
    Sutton, Clifton
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2012, 4 (03): : 307 - 309
  • [9] On nearest-neighbor graphs
    Eppstein, D
    Paterson, MS
    Yao, FF
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 17 (03) : 263 - 282
  • [10] In defense of Nearest-Neighbor based image classification
    Boiman, Oren
    Shechtman, Eli
    Irani, Michal
    2008 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-12, 2008, : 1992 - +