Fast Query Point Movement Techniques for Large CBIR Systems

Authors:
Danzhou Liu;Kien A. Hua;Khanh Vu;Ning Yu
Affiliations:
University of Central Florida, Orlando;University of Central Florida, Orlando;University of Central Florida, Orlando;University of Central Florida, Orlando
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2009

Citing 0
Cited 6

Distance-based relevance feedback using a hybrid interactive genetic algorithm for image retrieval

Applied Soft Computing
Relevance feedback strategies for artistic image collections tagging

Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Active learning paradigms for CBIR systems based on optimum-path forest classification

Pattern Recognition
Feature space warping relevance feedback with transductive learning

ACIVS'11 Proceedings of the 13th international conference on Advanced concepts for intelligent vision systems
Incorporating multiple distance spaces in optimum-path forest classification to improve feedback-based learning

Computer Vision and Image Understanding
Probability based document clustering and image clustering using content-based image retrieval

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.