This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Query Point Movement Techniques for Large CBIR Systems
May 2009 (vol. 21 no. 5)
pp. 729-743
Danzhou Liu, University of Central Florida, Orlando
Kien A. Hua, University of Central Florida, Orlando
Khanh Vu, University of Central Florida, Orlando
Ning Yu, University of Central Florida, Orlando
Target search in content-based image retrieval (CBIR) systems refers to finding a specific (target) image such as a particular registered logo or a specific historical photograph. Existing techniques, designed around query refinement based on relevance feedback, suffer from slow convergence, and do not guarantee to find intended targets. To address these limitations, we propose several efficient query point movement methods. We prove that our approach is able to reach any given target image with fewer iterations in the worst and average cases. We propose a new index structure and query processing technique to improve retrieval effectiveness and efficiency. We also consider strategies to minimize the effects of users' inaccurate relevance feedback. Extensive experiments in simulated and realistic environments show that our approach significantly reduces the number of required iterations and improves overall retrieval performance. The experimental results also confirm that our approach can always retrieve intended targets even with poor selection of initial query points.

[1] C.B. Barber, D.P. Dobkin, and H.T. Huhdanpaa, “The Quickhull Algorithm for Convex Hulls,” ACM Trans. Math. Software, vol. 22, no. 4, pp. 469-483, 1996.
[2] I. Bartolini, P. Ciacci, and F. Waas, “Feedbackbypass: A New Approach to Interactive Similarity Query Processing,” Proc. 27th Int'l Conf. Very Large Data Base (VLDB '01), pp. 201-210, 2001.
[3] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD '90, pp. 322-331, 1990.
[4] C. Böhm, S. Berchtold, and D.A. Keim, “Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases,” ACM Computing Surveys, vol. 33, no. 3, pp. 322-373, 2001.
[5] P. Browne and A.F. Smeaton, “Video Information Retrieval Using Objects and Ostensive Relevance Feedback,” Proc. ACM Symp. Applied Computing (SAC '04), pp. 1084-1090, 2004.
[6] R. Brunelli and O. Mich, “Image Retrieval by Examples,” IEEE Trans. Multimedia, vol. 2, no. 3, pp. 164-171, 2000.
[7] C. Carson, S. Belongie, H. Greenspan, and J. Malik, “Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 8, pp. 1026-1038, Aug. 2002.
[8] K. Chakrabarti, M. Ortega-Binderberger, S. Mehrotra, and K. Porkaew, “Evaluating Refined Queries in Top-K Retrieval Systems,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 2, pp.256-270, Feb. 2004.
[9] L. Chen, M.T. Özsu, and V. Oria, “MINDEX: An Efficient Index Structure for Salient-Object-Based Queries in Video Databases,” Multimedia Systems, vol. 10, no. 1, pp. 56-71, 2004.
[10] I.J. Cox, M.L. Miller, T.P. Minka, T.V. Papathomas, and P.N. Yianilos, “The Bayesian Image Retrieval System, PicHunter: Theory, Implementation, and Psychophysical Experiments,” IEEE Trans. Image Processing, vol. 9, no. 1, pp. 20-37, 2000.
[11] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A.E. Abbadi, “Constrained Nearest Neighbor Queries,” Proc. Seventh Int'l Symp. Spatial and Temporal Databases (SSTD '01), pp. 257-278, 2001.
[12] M. Flickner, H.S. Sawhney, 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, Sept. 1995.
[13] T. Gevers and A. Smeulders, “Content-Based Image Retrieval: An Overview,” Emerging Topics in Computer Vision, G. Medioni and S.B. Kang, eds., Prentice Hall, 2004.
[14] A. Gupta and R. Jain, “Visual Information Retrieval,” Comm. ACM, vol. 40, no. 5, pp. 70-79, 1997.
[15] A. Guttman, “The R-Tree: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 47-57, June 1984.
[16] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp.265-318, 1999.
[17] K.A. Hua, N. Yu, and D. Liu, “Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-Based Image Retrieval,” Proc. 22nd IEEE Int'l Conf. Data Eng. (ICDE), 2006.
[18] Y. Ishikawa, R. Subramanya, and C. Faloutsos, “MindReader: Querying Databases through Multiple Examples,” Proc. 24th Int'l Conf. Very Large Data Base (VLDB '98), pp. 218-227, 1998.
[19] H.V. Jagadish, B.C. Ooi, K.-L. Tan, C. Yu, and R. Zhang, “iDistance: An Adaptive ${\rm B}^{+}$ -Tree Based Indexing Method for Nearest Neighbor Search,” ACM Trans. Database Systems, vol. 30, no. 2, pp. 364-397, 2005.
[20] D.-H. Kim and C.-W. Chung, “Qcluster: Relevance Feedback Using Adaptive Clustering for Content-Based Image Retrieval,” Proc. ACM SIGMOD '03, pp. 599-610, 2003.
[21] D. Liu, K.A. Hua, K. Vu, and N. Yu, “Fast Query Point Movement Techniques with Relevance Feedback for Content-Based Image Retrieval,” Proc. 10th Int'l Conf. Extending Database Technology (EDBT '06), pp. 700-717, 2006.
[22] W.Y. Ma and B. Manjunath, “Netra: A Toolbox for Navigating Large Image Databases,” Proc. IEEE Int'l Conf. Image Processing (ICIP '97), pp. 568-571, 1997.
[23] M. Nakazato, L. Manola, and T.S. Huang, “ImageGrouper: A Group-Oriented User Interface for Content-Based Image Retrieval and Digital Image Arrangement,” J. Visual Languages and Computing, vol. 14, no. 4, pp. 363-386, 2003.
[24] V. Ogle and M. Stonebraker, “Chabot: Retrieval from a Relational Database of Images,” Computer, vol. 28, no. 9, pp. 40-48, Sept. 1995.
[25] F. Olken and D. Rotem, “Sampling from Spatial Databases,” Proc. Ninth IEEE Int'l Conf. Data Eng. (ICDE '93), pp. 199-208, 1993.
[26] M. Ortega-Binderberger and S. Mehrotra, “Relevance Feedback Techniques in the MARS Image Retrieval Systems,” Multimedia Systems, vol. 9, no. 6, pp. 535-547, 2004.
[27] A. Pentland, R.W. Picard, and S. Sclaroff, “Photobook: Content-Based Manipulation for Image Databases,” Int'l J. Computer Vision, vol. 18, no. 3, pp. 233-254, 1996.
[28] F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
[29] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD '95, pp. 71-79, 1995.
[30] Y. Rui, T. Huang, M. Ortega, and S. Mehrotra, “Relevance Feedback: A Power Tool for Interactive Content-Based Image Retrieval,” IEEE Trans. Circuits and Systems for Video Technology, vol. 8, no. 5, pp. 644-655, 1998.
[31] Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, “The A-Tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation,” Proc. 26th Int'l Conf. Very Large Data Base (VLDB '00), pp. 516-526, 2000.
[32] H.T. Shen, B.C. Ooi, and X. Zhou, “Towards Effective Indexing for Very Large Video Sequence Database,” Proc. ACM SIGMOD '05, pp. 730-741, 2005.
[33] J.R. Smith and S.-F. Chang, “Transform Features for Texture Classification and Discrimination in Large Image Databases,” Proc. IEEE Int'l Conf. Image Processing (ICIP '94), pp. 407-411, 1994.
[34] J.R. Smith and S.-F. Chang, “VisualSEEk: A Fully Automated Content-Based Image Query System,” Proc. Fourth ACM Int'l Conf. Multimedia (MULTIMEDIA '96), pp. 87-98, 1996.
[35] M.A. Stricker and M. Orengo, “Similarity of Color Images,” Proc. Storage and Retrieval for Image and Video Databases (SPIE '95), pp.381-392, 1995.
[36] S. Tong and E.Y. Chang, “Support Vector Machine Active Learning for Image Retrieval,” Proc. Ninth ACM Int'l Conf. Multimedia (MULTIMEDIA '01), pp. 107-118, 2001.
[37] K. Vu, K.A. Hua, H. Cheng, and S.-D. Lang, “A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases,” Proc. ACM SIGMOD '06, pp. 527-538, 2006.
[38] K. Vu, K.A. Hua, and W. Tavanapong, “Image Retrieval Based on Regions of Interest,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 4, pp. 1045-1049, July/Aug. 2003.
[39] J.Z. Wang, J. Li, and G. Wiederhold, “SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture Libraries,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 9, pp. 947-963, Sept. 2001.
[40] L. Wu, C. Faloutsos, K. Sycara, and T.R. Payne, “FALCON: Feedback Adaptive Loop for Content-Based Retrieval,” Proc. 26th Int'l Conf. Very Large Data Base (VLDB '00), pp. 297-306, 2000.
[41] Y.L. Wu, D. Agrawal, and A.E. Abbadi, “Applying the Golden Rule of Sampling for Query Estimation,” Proc. ACM SIGMOD '01, pp. 449-460, 2001.
[42] Y.L. Wu, D. Agrawal, and A.E. Abbadi, “Query Estimation by Adaptive Sampling,” Proc. 18th IEEE Int'l Conf. Data Eng. (ICDE '02), pp. 639-648, 2002.
[43] W. Yuan and K. Nahrstedt, “Energy-Efficient Soft Real-Time CPU Scheduling for Mobile Multimedia Systems,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 149-163, 2003.
[44] X.S. Zhou and T.S. Huang, “Edge-Based Structural Features for Content-Based Image Retrieval,” Pattern Recognition Letters, vol. 22, no. 5, pp. 457-468, 2001.

Index Terms:
Query formulation, Relevance feedback, Search process
Citation:
Danzhou Liu, Kien A. Hua, Khanh Vu, Ning Yu, "Fast Query Point Movement Techniques for Large CBIR Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 5, pp. 729-743, May 2009, doi:10.1109/TKDE.2008.188
Usage of this product signifies your acceptance of the Terms of Use.