Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Fast Asymmetric and Discrete Cross-Modal Hashing With Semantic Consistency

Bibliographic Data

ID22106780
AuthorsShaohua Teng (0000-0002-7204-1288, Guangdong University of Technology), Chengzhen Ning (0000-0001-8630-6497, Guangdong University of Technology), Wei Zhang (0000-0002-5458-9581, Guangdong University of Technology), Naiqi Wu (0000-0001-6782-458X, Macau University of Science and Technology), Ying Zeng (0000-0001-9839-1182, Guangdong University of Technology)
Year2023
Volume10
Issue2
Pages577-589
Publication date2023-04-01
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueIEEE Transactions on Computational Social Systems (JOURNAL)
Journal identifiersISSN: 2329-924X • E-ISSN: 2373-7476
PublisherInstitute of Electrical and Electronics Engineers (IEEE) (PUBLISHER)
DOI10.1109/tcss.2022.3195704
OpenAlexW4300219050
LanguageEN
Citations received2
References cited47

Hashing has attracted widespread attention in the field of supervised cross-modal retrieval due to its advantages in search and storage. However, there are still some issues to be addressed, e.g.: 1) how to effectively combine sample and label semantics to learn hash codes; 2) how to reduce high computational requirements brought by computing a pairwise similarity matrix; and 3) how to effectively solve discrete optimization problems. To cope with them, a fast asymmetric and discrete cross-modal hashing (FADCH) method is proposed in this article. First, matrix factorization is leveraged to collaboratively construct a common semantic subspace between different modalities. Second, semantic consistency is preserved by aligning the common semantic subspace with the semantic representation constructed from labels, which effectively exploits the semantic complementarity of labels and samples. Third, we embed labels into hash codes and keep the correlation between different modal samples by using a pairwise similarity matrix. Fourth, we use an asymmetric strategy with relaxation to associate hash codes with semantic representation, which not only avoids the difficulty of symmetric frame optimization but also embeds more semantic information into the Hamming space. In addition, a strongly orthogonal constraint is introduced to optimize the hash codes. Finally, an effective optimization algorithm is developed to directly generate discrete hash codes while reducing the complexity from $O(n^{2})$ to $O(n)$ . The experimental results on three benchmark datasets illustrate the superiority of the FADCH method

Algorithm · Discrete optimization · Double hashing · Dynamic perfect hashing · Hash function · Hash table · Optimization problem · Programming language · Semantic similarity · Universal hashing · Advanced Image and Video Retrieval Techniques · Computer Science · Video Analysis and Summarization · Video Surveillance and Tracking Methods · Artificial Intelligence · Theoretical Computer Science

  • Robust Asymmetric Cross-Modal Hashing Retrieval With Dual Semantic Enhancement

    Open Access•Shaohua Teng, Tuhong Xu et al.•IEEE Transactions on Computational…•2024

  • Kernel-Based Sparse Representation Learning With Global and Local Low-Rank Label Constraint

    Open Access•Luyao Teng, Feiyi Tang et al.•IEEE Transactions on Computational…•2024

Unique citing works2
Citations per year1
Citation span2024 - 2024 (1)
Citation velocityrecent
Highly citedNo
Citation typesNeutral: 2

Tools

Open DOI
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae