skip to main content
10.1145/2671188.2749297acmconferencesArticle/Chapter ViewAbstractPublication PagesicmrConference Proceedingsconference-collections
short-paper

A Two-step Approach to Cross-modal Hashing

Published:22 June 2015Publication History

ABSTRACT

With the rapid growth of multimedia data, it is very desirable to effectively and efficiently search objects of interest across different modalities from large scale databases. Cross-modal hashing provides a very promising way to address such problem. In this paper, we propose a two-step cross-modal hashing approach to obtain compact hash codes and learn hash functions from multimodal data. Our approach decomposes the cross-modal hashing problem into two steps: generating hash code and learning hash function. In the first step, we obtain the hash codes for all modalities of data via a joint multi-modal graph, which takes into consideration both the intra-modality and inter-modality similarity. In the second step, learning hashing function is formulated as a binary classification problem. We train binary classifiers to predict the hash code for any data object unseen before. Experimental results on two cross-modal datasets show the effectiveness of our proposed approach.

References

  1. M. M. Bronstein, A. M. Bronstein, F. Michel, and N. Paragios. Data fusion through cross-modality metric learning using similarity-sensitive hashing. In CVPR, pages 3594--3601, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  2. T.-S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, , and Y.-T. Zheng. NUS-WIDE: A real-world web image database from national university of singapore. In ACM International Conference on Image and Video Retrieval, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. LIBLINEAR: A library for large linear classification. JMLR, 9:1871--1874, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, pages 817--824, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Kumar and R. Udupa. Learning hash functions for cross-view similarity search. In IJCAI, pages 1360--1365, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. Quadrianto and C. H. Lampert. Learning multi-view neighborhood preserving projections. In ICML, pages 425--432, 2011.Google ScholarGoogle Scholar
  7. N. Rasiwasia, P. J. Moreno, and N. Vasconcelos. Bridging the gap: query by semantic example. IEEE TMM, 9(5):923--938, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. Rasiwasia, J. C. Pereira, E. Coviello, G. Doyle, G. Lanckriet, R. Levy, and N. Vasconcelos. A new approach to cross-modal multimedia retrieval. In ACM MM, pages 251--260, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Rastegari, J. Choi, S. Fakhraei, H. D. III, and L. S. Davis. Predictable dual-view hashing. In ICML, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Song, Y. Yang, Z. Huang, H. Shen, and R. Hong. Multiple feature hashing for real-time large scale near-duplicate video retrieval. In ACM MM, pages 423--432, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753--1760, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Zhang, F. Wang, and L. Si. Composite hashing with multiple information sources. In ACM SIGIR, pages 225--234, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Zhang, J. Wang, D. Cai, and J. S. Liu. Self-taught hashing for fast similarity search. In SIGIR, pages 18--25, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Y. Zhen and D.-Y. Yeung. A probabilistic model for multimodal hash function learning. In SIGKDD, pages 940--948, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Two-step Approach to Cross-modal Hashing

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICMR '15: Proceedings of the 5th ACM on International Conference on Multimedia Retrieval
      June 2015
      700 pages
      ISBN:9781450332743
      DOI:10.1145/2671188

      Copyright © 2015 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 22 June 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Acceptance Rates

      ICMR '15 Paper Acceptance Rate48of127submissions,38%Overall Acceptance Rate254of830submissions,31%

      Upcoming Conference

      ICMR '24
      International Conference on Multimedia Retrieval
      June 10 - 14, 2024
      Phuket , Thailand

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader