Combining Appearance and Topology for Wide Baseline Matching
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Video Google: A Text Retrieval Approach to Object Matching in Videos
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
A Bayesian Hierarchical Model for Learning Natural Scene Categories
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
International Journal of Computer Vision
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
3D Object Recognition Using Hyper-Graphs and Ranked Local Invariant Features
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Video mining with frequent itemset configurations
CIVR'06 Proceedings of the 5th international conference on Image and Video Retrieval
Affinity propagation for class exemplar mining
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Hi-index | 0.00 |
Given a query image of an object of interest, our objective is to retrieve all instances of that object with high precision from a database of scalable size. As distinct from the bag-of-feature based methods, we do not regard descriptor quantizations as "visual words". Instead a group of selected SIFT features of an object together with their spatial arrangement are represented by an attributed graph. Each graph is then regarded as a "visual word". We measure the similarity between graphs using the similarity of SIFT features and the compatibility of their arrangement. Using the similarity measure we efficiently identify the set of K nearest neighbor graphs (KNNG) using a SOM based clustering tree. We then extend the concept of "query expansion" widely used in text retrieval to develop a graph clustering method based on pairwise similarity propagation (SPGC), in that the trained KNNG information is utilized for speeding up. Using SOM based clustering tree and SPGC, we develop a framework for scalable object indexing and retrieval. We illustrate these ideas on a database of over 50K images spanning more than 500 objects. We show that the precision is substantially boosted, achieving total recall in many cases.