.png){kind=icon}
Return
Contrast-Based Unsupervised Hashing Learning With Multi-Hashcode
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2021.3130500.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to high storage and calculation efficiency, hash-based methods have been widely used in image retrieval systems. Unsupervised deep hashing methods can learn the binary representations of images effectively without any annotations. The strategy of constraining hash code in the previous unsupervised methods may not fully utilize the structural information in semantic similarity. To address this problem, we propose a new strategy based on contrastive learning to capture high-level semantic similarity among features and preserve it in generated hash codes. In addition, we employ a novel framework to handle hash codes with different lengths simultaneously which is more time-saving in generating hash codes than existing methods. Extensive experiments on MIRFlickr, NUS-WIDE, and COCO benchmark datasets show that our method makes great improvement on the performance of unsupervised image retrieval.
Keywords:
Codes
Semantics
Training
Image retrieval
Mathematical models
Annotations
Multimedia Web sites
Contrastive learning
image retrieval
unsupervised hashing
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
ShareSave
ShareSaveEarthquakes and related catastrophic events, Island of Hawaii, November 29, 1975: A preliminary report.png)
Circular
OAAI
CircularIF0
OAAIShareSave
View more