An efficient framework for location-based scene matching in image databases

被引:0
作者
Xu Chen
Madirakshi Das
Alexander Loui
机构
[1] University of Michigan,Department of EECS
[2] Eastman Kodak Company,Kodak Research Lab
关键词
Scene matching; SIFT; Clustering; Image search and retrieval; Face detection; Occlusion; Blur; Classification;
D O I
10.1007/s13735-012-0011-7
中图分类号
学科分类号
摘要
SIFT-based methods have been widely used for scene matching of photos taken at particular locations or places of interest. These methods are typically very time consuming due to the large number and high dimensionality of features used, making them unfeasible for use in consumer image collections containing a large number of images where computational power is limited and a fast response is desired. Considerable computational savings can be realized if images containing signature elements of particular locations can be automatically identified from the large number of images and only these representative images used for scene matching. We propose an efficient framework incorporating a set of discriminative image features that effectively enables us to select representative images for fast location-based scene matching. These image features are used for classifying images into good or bad candidates for scene matching, using different classification approaches. Furthermore, the image features created from our framework can facilitate the process of using sub-images for location-based scene matching with SIFT features. The experimental results demonstrate the effectiveness of our approach compared with the traditional SIFT-, PCA-SIFT-, and SURF-based approaches by reducing the computational time by an order of magnitude.
引用
收藏
页码:103 / 114
页数:11
相关论文
共 25 条
  • [1] Bay H(2008)Surf: speeded up robust features Comput Vis Image Understand (CVIU) 110 346-359
  • [2] Ess A(1996)Bagging predictors Mach Learn 24 123-140
  • [3] Tuytelaars T(1991)Optimal partitioning for classfication and regression tree IEEE Trans Pattern Anal Mach Intell 13 340-354
  • [4] Gool LV(2008)Geometry-based edge clustering for graph visualization IEEE Trans Vis Comput Graph 14 1277-1284
  • [5] Breiman L(1980)The selection of critical subsets for signal, image and scene matching IEEE Trans Pattern Anal Mach Intell 2 313-322
  • [6] Chou P(1999)Chameleon: hierarchical clustering using dynamic modeling IEEE Comp 32 68-75
  • [7] Cui W(2004)Distinctive image features from scale invariant features Int J Comput Vis 60 91-110
  • [8] Zhou H(2007)Bridging the gap: query by semantic example IEEE Trans Multimed 9 923-938
  • [9] Qu H(2003)Automated location matching in movies Comput Vis Image Understand Spec Isssue Video Retr Summ 92 236-264
  • [10] Wong P(1999)Improving boosting algorithms using confidence-rated predictions Mach Learn 37 297-336