Simple low-dimensional features approximating NCC-based image matching

被引:23
作者
Satoh, Shin'ichi [1 ]
机构
[1] Res Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
关键词
Image matching; Image mining; Normalized cross correlation; NEAREST-NEIGHBOR; ALGORITHM;
D O I
10.1016/j.patrec.2011.07.027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes new low-dimensional image features that enable images to be very efficiently matched. Image matching is one of the key technologies for many vision-based applications, including template matching, block motion estimation, video compression, stereo vision, image/video near-duplicate detection, similarity join for image/video database, and so on. Normalized cross correlation (NCC) is one of widely used method for image matching with preferable characteristics such as robustness to intensity offsets and contrast changes, but it is computationally expensive. The proposed features, derived by the method of Lagrange multipliers, can provide upper-bounds of NCC as a simple dot product between two low-dimensional feature vectors. By using the proposed features, NCC-based image matching can be effectively accelerated. The matching performance with the proposed features is demonstrated using an image database obtained from actual broadcast videos. The new features are shown to outperform other methods: multilevel successive elimination algorithm (MSEA), discrete cosine transform (DCT) coefficients, and histograms, achieving very high precision while only slightly sacrificing recall. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:1902 / 1911
页数:10
相关论文
共 32 条
[1]  
Agrawal R., 1993, Proceedings of the International Conference on Foundations of Data Organization and Algorithms, Chicago, IL, P69
[2]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[3]  
[Anonymous], 2006, 2006 IEEE COMP SOC C
[4]  
[Anonymous], 2008, P 17 INT C WORLD WID, DOI DOI 10.1145/1367497.1367540
[5]  
[Anonymous], 1982, Computer Vision
[6]  
[Anonymous], 2002, COMPUTER VISION MODE, DOI 10.5555/580035
[7]   An optimal algorithm for approximate nearest neighbor searching in fixed dimensions [J].
Arya, S ;
Mount, DM ;
Netanyahu, NS ;
Silverman, R ;
Wu, AY .
JOURNAL OF THE ACM, 1998, 45 (06) :891-923
[8]   A non-supervised approach for repeated sequence detection in TV broadcast streams [J].
Berrani, Sid-Ahmed ;
Manson, Gael ;
Lechat, Patrick .
SIGNAL PROCESSING-IMAGE COMMUNICATION, 2008, 23 (07) :525-537
[9]   Searching in high-dimensional spaces -: Index structures for improving the performance of multimedia Databases [J].
Böhm, C ;
Berchtold, S ;
Keim, D .
ACM COMPUTING SURVEYS, 2001, 33 (03) :322-373
[10]   RELATION BETWEEN THE KARHUNEN LOEVE AND COSINE TRANSFORMS [J].
CLARKE, RJ .
IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1981, 128 (06) :359-360