Recent image retrieval algorithms based on local features indexed by a vocabulary tree and holistic features indexed by compact hashing codes both demonstrate excellent scalability. However, their retrieval precision may vary dramatically among queries. This motivates us to investigate how to fuse the ordered retrieval sets given by multiple retrieval methods, to further enhance the retrieval precision. Thus, we propose a graph-based query specific fusion approach where multiple retrieval sets are merged and reranked by conducting a link analysis on a fused graph. The retrieval quality of an individual method is measured by the consistency of the top candidates' nearest neighborhoods. Hence, the proposed method is capable of adaptively integrating the strengths of the retrieval methods using local or holistic features for different queries without any supervision. Extensive experiments demonstrate competitive performances on 4 public datasets, i.e., the UKbench, Corel-5K, Holidays and San Francisco Landmarks datasets.
@inproceedings{zhang_CVPR10_annotation, title={Automatic image annotation using group sparsity}, author={Zhang, Shaoting and Huang, Junzhou and Huang, Yuchi and Yu, Yang and Li, Hongsheng and Metaxas, Dimitris N}, booktitle={IEEE Conference on Computer Vision and Pattern Recognition}, pages={3312--3319}, year={2010}, organization={IEEE} } @ARTICLE{Zhang_Graph_Fusion, author={Zhang, S. and Yang, M. and Cour, T. and Yu, K. and Metaxas, D.N.}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, title={Query Specific Rank Fusion for Image Retrieval}, year={2015}, month={April}, volume={37}, number={4}, pages={803-815}, }