An efficient key point quantization algorithm for large scale image retrieval

1st ACM Workshop on Large-Scale Multimedia Retrieval and Mining, LS-MMRM 2009, Co-located with the 2009 ACM International Conference on Multimedia, MM'09

Volumn , Issue , 2009, Pages 89-96

  Li, Fengjie ^a   Tong, Wei ^a   Jin, Rong ^a   Jain, Anil K ^a   Lee, Jung Eun ^a  

^a Michigan State University   (United States)

Author keywords

Image retrieval; Key point quantization; Randomized algorithm

Indexed keywords

BAG OF WORDS; BINARY VECTORS; EMPIRICAL STUDIES; HYPER-SPHERES; IMAGE FEATURES; IMAGE SIMILARITY; KEYPOINTS; NEAR-DUPLICATE IMAGE RETRIEVAL; OPTIMAL PARTIAL MATCHING; QUANTIZATION ALGORITHMS; RANDOMIZED ALGORITHM; RANDOMIZED ALGORITHMS; UPPER BOUND; VISUAL WORD;

IMAGE MATCHING; IMAGE RETRIEVAL; METHOD OF MOMENTS; MULTIMEDIA SYSTEMS;

CLUSTERING ALGORITHMS;

EID: 72449210464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1631058.1631075     Document Type: Conference Paper

References (32)

1. ANSI/NIST-ITL 1-2007 standard: Data Format for the Interchange of Fingerprint, Facial, & Other Biometric Information. 2007.
2. S. Boughhorbel, J.-P. Tarel, and F. Fleuret. Non-mercer kernels for svm object recognition. In British Machine Vision Conference, 2004.
3. O. Chum, J. Philbin, and A. Zisserman. Near duplicate image detection: min-hash and tf-idf weighting. In Proceedings of the British Machine Vision Conference, 2008.
4. G. Csurka, C. R. Dance, L. Fan, J. Willamowski, and C. Bray. Visual categorization with bags of keypoints. In Workshop on Statistical Learning in Computer Vision, ECCV, pages 1-22, 2004.
5. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry, 2004.
6. W. Dong, Z. Wang, M. Charikar, and K. Li. Efficiently matching sets of features with random histograms. In Proceeding of ACM Multimedia, pages 179-188, 2008.
7. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley-Interscience Publication, 2000.
8. K. Grauman and T. Darrell. The pyramid match kernel: Efficient learning with sets of features. J. Mach. Learn. Res., 8:725-760, 2007.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
10. Y. Ke, R. Sukthankar, and L. Huston. Efficient near-duplicate detection and sub-image retrieval. In Proceeding of ACM Multimedia, pages 869-876, 2004.
11. R. Kondor and T. Jebara. A kernel between sets of vectors. In Proceedings of the International Conference on Machine Learning, pages 361-368, 2003.
12. J.-E. Lee, A. K. Jain, and R. Jin. Scars, marks and tattoos (SMT): Soft biometric for suspect and victim identification. In Biometric Consortium Conference and Technology Expo, 2008.
13. V. Lepetit, P. Lagger, and P. Fua. Randomized trees for real-time keypoint recognition. In CVPR, pages 775-781, 2005.
14. E. Lipton and J. Glanz. Limits of DNA research pushed to identify the dead of sept. 11. New York Times, April 2002.
15. T. Liu, A. Moore, A. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In Neural Information Processing Systems, pages 825-832, 2004.
16. T. Liu, C. Rosenberg, and H. Rowley. Clustering billions of images with large scale nearest neighbor search. In IEEE Workshop on Applications of Computer Vision (WACV), page 28, 2007.
17. D. Lowe. Distinctive image features form scale-invariant keypoints. In International Journal of Computer Vision, volume 60, pages 91-110, 2004.
18. S. Lyu. Mercer kernels for object recognition with local features. In CVPR, pages 223-229, 2005.
19. H. Moon and P. J. Phillips. Computational and performance aspects of pca-based face recognition algorithms. Perception, 30:303-321, 2001.
20. P. Moreno, P. Ho, and N. Vasconcelos. A kullback-leibler divergence based kernel for svm classification in multimedia applications. In Neural Information Processing Systems, 2003.
21. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISSAPP (1), pages 331-340, 2009.
22. D. Nister and H. Stewenius. Scalable recognition with a vocabulary tree. In CVPR, pages 2161-2168, 2006.
23. T. Pavlidis. Limitations of cbir. In ICPR, 2008.
24. J. Philbin, O. Chum, M. Isard, J. Sivic, and A. Zisserman. Object retrieval with large vocabularies and fast spatial matching. In CVPR, pages 1-8, 2007.
25. S. E. Robertson, S. Walker, and M. Hancock-Beaulieu. Okapi at trec-7. In Proceedings of the Seventh Text REtrieval Conference, 1998.
26. G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, 2006.
27. C. Silpa-Anan and R. Hartley. Localization using an imagemap. In Proceedings of the 2004 Australasian Conference on Robotics & Automation, 2004.
28. C. Silpa-Anan and R. Hartley. Optimised kd-trees for fast image descriptor matching. In CVPR, pages 1-8, 2008.
29. J. Sivic and A. Zisserman. Video Google: A text retrieval approach to object matching in videos. In ICCV, pages 1470-1477, 2003.
30. C. Wallraven, B. Caputo, and A. Graf. Recognition with local features: the kernel recipe. In CVPR, pages 257-264, 2003.
31. B. Wang, Z. Li, M. Li, and W.-Y. Ma. Large-scale duplicate detection for web image search. In ICME, pages 353-356, 2006.
32. L. Wolf and A. Shashua. Learning over sets using kernel principal angles. Journal of Machine Learning Research, 4:913-931, 2003.