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 were designed around query refinement based on relevance feedback, suffer from slow convergence, and do not even guarantee to find intended targets. To address those limitations, we propose several efficient query point movement methods. We theoretically prove that our approach is able to reach any given target image with fewer iterations in the worst and average cases. Extensive experiments in simulated and realistic environments 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 employed to improve the effectiveness and efficiency of existing CBIR systems.
Danzhou Liu, Kien A. Hua, Khanh Vu, Ning Yu