Skip to main content
SpringerLink
Log in

Binary code reranking method with weighted hamming distance

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Due to its compact binary codes and efficient search scheme, image hashing method is suitable for large-scale image retrieval. In image hashing methods, Hamming distance is used to measure similarity between two points. For K-bit binary codes, the Hamming distance is an int and bounded by K. Therefore, there are many returned images sharing the same Hamming distances with the query. In this paper, we propose two efficient image ranking methods, which are distance weights based reranking method (DWR) and bit importance based reranking method (BIR). DWR method aim to rerank PCA hash codes. DWR averages Euclidean distance of equal hash bits to these bits with different values, so as to obtain the weights of hash codes. BIR method is suitable for all type of binary codes. Firstly, feedback technology is adopted to detect the importance of each binary bit, and then big weights are assigned to important bits and small weights are assigned to minor bits. The advantage of this proposed method is calculation efficiency. Evaluations on two large-scale image data sets demonstrate the efficacy of our methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Andoni A, Indyk P (2006) Near-optimal hashing algorithms for near neighbor problem in high dimensions. In: IEEE Symposium on Foundations of Computer Science (FOCS)

  2. Charikar M (2002) Similarity estimation techniques from rounding algorithms. In: ACM Symp. on theory of computing

  3. Fu H, Kong X, Lu J (2013) Large-scale image retrieval based on boosting iterative quantization hashing with query-adaptive reranking. Neurocomputing 122(25):480C489

    Google Scholar 

  4. Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of the 25th VLDB Conference, Edinburgh, Scotland

  5. Gao Y, Wang M, Zha Z, Tian Q (2011) Less is more: efficient 3-d object retrieval with query view selection. IEEE Trans Multimed 13(5):1007–1018

    Article  Google Scholar 

  6. Gao Y, Wang M, Tao D, Ji R (2012) 3-D object retrieval and recognition with hypergraph analysis. IEEE Trans Image Process 21(9):4290–4303

    Article  MathSciNet  Google Scholar 

  7. Gao Y, Wang M, Zha Z, Shen J (2013) Visual-textual joint relevance learning for tag-based social image search. IEEE Trans Image Process 22(1):363–376

    Article  MathSciNet  Google Scholar 

  8. Indyk P, Motwani R, 1998 Approximate nearest neighbors: towards removing the curse of dimensionality. In: 30th symposium on theory of computing

  9. Gong Y, Lazebnik S (2011) Iterative quantization: A procrustean approach to learning binary codes. In: Proceedings of IEEE conference on computer vision and pattern recognition, Colorado Springs, USA, pp 817–824

  10. Jiang Y, Wang J, Chang S (2011) Lost in binarization: query-adaptive ranking for similar image search with compact codes. In: Proceedings of ACM international conference on multimedia retrieval, Trento, Italy

  11. Wang M, Yang K, Hua X, Zhang H (2010) Towards a relevant and diverse search of social images. IEEE Trans Multimed 12(8):829–842

    Article  Google Scholar 

  12. Wang J, Kumar S, Chang S (2010) Sequential projection learning for hashing with compact codes. In: Proceedings of international conference on machine learning, Haifa, Israel, pp 1127– 1134

  13. Wang J, Kumar S, Chang S (2010) Semi-supervised hashing for scalable image retrieval. In Proceedings of IEEE conference on computer vision and pattern recognition, San Francisco, USA, pp 3424–3431

  14. Wang M, Liu B, Hua X (2010) Accessible image search for color blindness. ACM Trans Intell Syst Technol 1(1):8:1–26

    Article  Google Scholar 

  15. Xie X, Lu L, Jia M, Li H, Seide F, Ma W (2008) Mobile search with multimodal queries. In Proceedings of the IEEE 96(4):589–601

    Article  Google Scholar 

  16. Xu H, Wang J, Li Z, Zeng G, Li S, Yu N (2011) Complementary Hashing for Approximate Nearest Neighbor Search. In Proceedings of IEEE International Conference on Computer Vision, Barcelona, Spain, PP 1631-1638

  17. Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: Proceedings of annual conference on neural information processing systems, Vancouver, Canada, pp 1753–1760

  18. Zhang X, Zhang L, Shum H Y (2012) Query-sensitive hash code ranking for efficient ε-neighbor search. In: Proceedings of IEEE conference on computer vision and pattern recognition, providence, RI, USA, pp 2058–2065

  19. Zhou J, Fu H, Kong X (2011) A balanced semi-supervised hashing method for CBIR. In: Proceedings of IEEE International Conference on Image Processing, Brussels, Belguim, pp 2481– 2484

Download references

Acknowledgments

The work is partially supported by the Fundamental Research Funds for the Central Universities DUT14QY03.

Author information

Authors and Affiliations

  1. School of Information and Communication Engineering, Dalian University of Technology, Dalian, China

    Haiyan Fu, Xiangwei Kong & Zhenfan Wang

Authors
  1. Haiyan Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangwei Kong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhenfan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiangwei Kong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fu, H., Kong, X. & Wang, Z. Binary code reranking method with weighted hamming distance. Multimed Tools Appl 75, 1391–1408 (2016). https://doi.org/10.1007/s11042-014-2087-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-014-2087-y

Keywords

Search

Navigation