Fast Asymmetric and Discrete Cross-Modal Hashing With Semantic Consistency
Bibliographic Data
| ID | 22106780 |
|---|---|
| Authors | Shaohua 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) |
| Year | 2023 |
| Volume | 10 |
| Issue | 2 |
| Pages | 577-589 |
| Publication date | 2023-04-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2022.3195704 |
| OpenAlex | W4300219050 |
| Language | EN |
| Citations received | 2 |
| References cited | 47 |
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
| Unique citing works | 2 |
|---|---|
| Citations per year | 1 |
| Citation span | 2024 - 2024 (1) |
| Citation velocity | recent |
| Highly cited | No |
| Citation types | Neutral: 2 |