Towards optimal indexing for relevance feedback in large image databases+

IEEE Transactions on Image Processing

Volumn 18, Issue 12, 2009, Pages 2780-2789

  Ramaswamy, Sharadh ^a   Rose, Kenneth ^a  

^a University of California   (United States)

Author keywords

CBIR; Image database; Index; Relevance feedback; Similarity search

Indexed keywords

CBIR; IMAGE DATABASE; INDEX; RELEVANCE FEEDBACK; SIMILARITY SEARCH;

DATABASE SYSTEMS; GEOMETRY; IMAGE RETRIEVAL; INDEXING (OF INFORMATION);

FEEDBACK;

EID: 77954742519     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2009.2028929     Document Type: Article

References (42)

1. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, "Query by image and video content: The QBIC system", Computer, vol. 28, no. 9, pp. 23-32, 1995.
2. T. Sikora, "The MPEG-7 visual standard for content description-anoverview", IEEE Trans. Circuits Syst. Video Technol., vol. 11, no. 6, pp. 696-702, Jun. 2001. (Pubitemid 32616531)
3. D. Lowe, "Object recognition from local scale-invariant features", ICCV, vol. 2, pp. 1150-1157, 1999. (Pubitemid 32079997)
4. M. Bober, "MPEG-7 visual shape descriptors", IEEE Trans. Circuits Syst. Video Technol., vol. 11, no. 6, pp. 716-719, Jun. 2001. (Pubitemid 32616533)
5. G. Mori, S. Belongie, and J. Malik, "Efficient shape matching using shape contexts", IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 11, pp. 1832-1837, Nov. 2005. (Pubitemid 41685118)
6. B. Manjunath, J.-R. Ohm, V. Vasudevan, and A. Yamada, "Color and texture descriptors", IEEE Trans. Circuits Syst. Video Technol., vol. 11, no. 6, pp. 703-715, Jun. 2001. (Pubitemid 32616532)
7. M. Swain and D. Ballard, "Indexing via color histograms", ICCV, pp. 390-393, 1990.
8. A. Barla, F. Odone, and A. Verri, "Histogram intersection kernel forimage classification", in Proc. Int. Conf. Image Processing, 2003, vol. 3, pp. III-513-III-516.
9. K. Grauman and T. Darrell, "The Pyramid Match kernel: Discriminativeclassification with sets of image features", ICCV, vol. 2, 2005.
10. Y. Rubner, C. Tomasi, and L. Guibas, "The Earth mover's distance asa metric for image retrieval", Int. J. Comput. Vis., vol. 40, no. 2, pp. 99-121, 2000. (Pubitemid 32136368)
11. S. Belongie, J. Malik, and J. Puzicha, "Shape matching and object recognition using shape contexts", IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 509-522, Apr. 2002. (Pubitemid 34448769)
12. R. Ramakrishnan and J. Gerhke, Database Management Systems, 2nd ed. New York: McGraw-Hill, 2001.
13. A. Guttman, "R-trees: A dynamic index structure for spatial searching", SIGMOD, pp. 47-57, 1984. (Pubitemid 15469534)
14. D. A. White and R. Jain, "Similarity indexing with the SS-tree", ICDE, pp. 516-523, 1996.
15. R. Weber, H. Schek, and S. Blott, "A quantitative analysis and performancestudy for similarity-search methods in high-dimensional spaces", VLDB, pp. 194-205, Aug. 1998.
16. R. Bellman, Adaptive Control Processes: A Guided Tour. Princeton, NJ: Princeton Univ. Press, 1961.
17. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi, "Vectorapproximation based indexing for non-uniform high dimensional datasets", CIKM, pp. 202-209, 2000.
18. J. Chen, C. Bouman, and J. Dalton, "Hierarchical browsing and searchof large image databases", IEEE Trans. Image Process., vol. 9, no. 3, pp. 442-455, Mar. 2000. (Pubitemid 30572356)
19. J. Chen, C. Bouman, and J. Allebach, "Fast image database search usingtree-structured VQ", in Proc. Int. Conf. Image Processing, 1997, vol. 2, pp. 827-8305.
20. S. Ramaswamy and K. Rose, "Adaptive cluster-distance bounding forsimilarity search in image databases", in Proc. Int. Conf. Image Processing, 2007, vol. 6, pp. 381-384.
21. C. Yu, B. C. Ooi, K. L. Tan, and H. V. Jagadish, "Indexing the distance: An efficient method to knn processing", VLDB, pp. 421-430, Sept. 2001.
22. N. Koudas, B. C. Ooi, H. T. Shen, and A. K. H. Tung, "LDC: Enablingsearch by partial distance in a hyper-dimensional space", ICDE, pp. 6-17, 2004.
23. R. Weber and K. Böhm, "Trading quality for time with nearest neighborsearch", EDBT, pp. 21-35, 2000.
24. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in highdimensions via hashing", VLDB, pp. 518-529, Sep. 1999.
25. E. Tuncel, H. Ferhatosmanoglu, and K. Rose, "VQ-Index: An index structure for similarity searching in multimedia databases", ACM Multimedia, pp. 543-552, 2002.
26. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi, "Approximatenearest neighbor searching in multimedia databases", ICDE, pp. 503-511, Apr. 2001. (Pubitemid 32457153)
27. T. Huang and X. S. Zhou, "Image retrieval with relevance feedback: From heuristic weight adjustment to optimal learning methods", in Proc. Int. Conf. Image Processing, 2001, vol. 3, pp. 2-5. (Pubitemid 33057905)
28. J. Davis, B. Kulis, P. Jain, S. Sra, and I. Dhillon, "Information- theoreticmetric learning", ICML, pp. 209-216, 2007.
29. E. Xing, A. Ng, M. Jordan, and S. Russell, "Distance metric learning, with application to clustering with side-information", Adv. Neural Inf. Process. Syst., vol. 15, pp. 505-512, 2003.
30. A. Bar-Hillel, T. Hertz, N. Shental, and D. Weinshall, "Learning amahalanobis metric from equivalence constraints", J. Mach. Learn. Res., vol. 6, pp. 937-965, 2005.
31. Y. Chen, X. S. Zhou, and T. Huang, "One-class SVM for learning in image retrieval", in Proc. Int. Conf. Image Processing, 2001, vol. 1, pp. 34-37. (Pubitemid 33057360)
32. Y. Ishikawa, R. Subramanya, and C. Faloutsos, "Mindreader: Queryingdatabases through multiple examples", VLDB, pp. 218-227, Aug. 1998.
33. Y. Rui and T. Huang, "Optimizing learning in image retrieval", CVPR, vol. 1, pp. 1236-1243, 2000.
34. Y. Rui, T. Huang, and S. Mehrotra, "Content-based image retrieval withrelevance feedback in MARS", in Proc. Int. Conf. Image Processing, 1997, vol. 2, pp. 815-818.
35. P. Jain, B. Kulis, and K. Grauman, "Fast image search for learnedmetrics", CVPR, pp. 1-8, 2008.
36. Y. Sakurai, M. Yoshikawa, R. Kataoka, and S. Uemura, " Similaritysearch for adaptive ellipsoid queries using spatial transformation", VLDB, pp. 231-240, 2001.
37. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Norwell, MA: Kluwer, 1992.
38. S. Ramaswamy and K. Rose, "Fast adaptive Mahalanobis-distance basedsearch and retrieval in image databases", in Proc. Int. Conf. Image Processing, 2003, pp. 181-184.
39. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1996.
40. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient dataclustering method for very large databases", SIGMOD, pp. 103-114, 1996. (Pubitemid 126440760)
41. CalTech 101 Data-Set [Online]. Available: www.vision. caltech.edu/Image Datasets/Caltech101
42. E. Tuncel and K. Rose, "Towards optimal clustering for approximatesimilarity searching", ICME, vol. 2, pp. 497-500, Aug. 2002.