MindReader: Querying Databases Through Multiple Examples
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
QCluster: relevance feedback using adaptive clustering for content-based image retrieval
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating Refined Queries in Top-k Retrieval Systems
IEEE Transactions on Knowledge and Data Engineering
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
IEEE Transactions on Image Processing
Fast query point movement techniques with relevance feedback for content-based image retrieval
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
Recent content-based image retrieval (CBIR) techniques were designed around query refinement based on relevance feedback. They suffer from slow convergence, high disk I/O, and do not even guarantee to find intended targets. In this paper, we identify the cause of these problems and propose several efficient target search methods to address these drawbacks. Our complexity analysis shows that our approach is able to reach any given target image with fewer iterations in the worst and average cases. We evaluated our techniques on large datasets in simulated and realistic environments. The results show that our approach significantly reduces the number of iterations and improves overall retrieval performance. The experiments also confirm that our approach can always retrieve intended targets even with poor selection of initial query points and can be used to improve the effectiveness of existing CBIR systems with relevance feedback.