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

被引:3
作者
Chen, Xu [1 ]
Das, Madirakshi [2 ]
Loui, Alexander [2 ]
机构
[1] Univ Michigan, Dept EECS, Ann Arbor, MI 48109 USA
[2] Eastman Kodak Co, Kodak Res Lab, Rochester, NY 14650 USA
关键词
Scene matching; SIFT; Clustering; Image search and retrieval; Face detection; Occlusion; Blur; Classification;
D O I
10.1007/s13735-012-0011-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 matchingwith 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
页数:12
相关论文
共 24 条
[1]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[2]   Bagging predictors [J].
Breiman, L .
MACHINE LEARNING, 1996, 24 (02) :123-140
[3]   OPTIMAL PARTITIONING FOR CLASSIFICATION AND REGRESSION TREES [J].
CHOU, PA .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (04) :340-354
[4]   Geometry-Based Edge Clustering for Graph Visualization [J].
Cui, Weiwei ;
Zhou, Hong ;
Qu, Huamin ;
Wong, Pak Chung ;
Li, Xiaoming .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2008, 14 (06) :1277-1284
[5]  
Das M, 2008, P INT C IM VID RETR
[6]  
Duda R., 2001, PATTERN CLASSIFICATI
[7]  
Gao J, 2001, P IEEE C COMP VIS PA
[8]   THE SELECTION OF CRITICAL SUBSETS FOR SIGNAL, IMAGE, AND SCENE MATCHING [J].
HALL, EL ;
DAVIES, DL ;
CASEY, ME .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1980, 2 (04) :313-322
[9]  
Jones M, 2003, P IEEE C COMP VIS
[10]   Chameleon: Hierarchical clustering using dynamic modeling [J].
Karypis, G ;
Han, EH ;
Kumar, V .
COMPUTER, 1999, 32 (08) :68-+