Learning Decorrelated Hashing Codes With Label Relaxation for Multimodal Retrieval
Due to the correlation among hashing bits, the retrieval performance improvement becomes slower when the hashing code length becomes longer. Existing methods try to regularize the projection matrix as an orthogonal matrix to decorrelate hashing codes. However, the binarization of projected data may...
Main Authors: | Dayong Tian, Yiwen Wei, Deyun Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9072435/ |
Similar Items
-
A Review of Hashing Methods for Multimodal Retrieval
by: Wenming Cao, et al.
Published: (2020-01-01) -
Group Embedding for Face Hallucination
by: Tao Lu, et al.
Published: (2018-01-01) -
Online Adaptive Supervised Hashing for Large-Scale Cross-Modal Retrieval
by: Ruoqi Su, et al.
Published: (2020-01-01) -
MESH: A Flexible Manifold-Embedded Semantic Hashing for Cross-Modal Retrieval
by: Fangming Zhong, et al.
Published: (2020-01-01) -
Distributed Supervised Discrete Hashing With Relaxation
by: Rui Hu, et al.
Published: (2021-01-01)