paper-with-me

Papers

Deep Unsupervised Hashing by Distilled Smooth Guidance

2021-05-13 · Xiao Luo, Zeyu Ma, Daqing Wu, Huasong Zhong, Chong Chen, Jinwen Ma, Minghua Deng

Hashing has been widely used in approximate nearest neighbor search for its storage and computational efficiency. Deep supervised hashing methods are not widely used because of the lack of labeled data, especially when the domain is transferred. Meanwhile, unsupervised deep hashing models can hardly achieve satisfactory performance due to the lack of reliable similarity signals. To tackle this problem, we propose a novel deep unsupervised hashing method, namely Distilled Smooth Guidance (DSG), which can learn a distilled dataset consisting of similarity signals as well as smooth confidence signals. To be specific, we obtain the similarity confidence weights based on the initial noisy similarity signals learned from local structures and construct a priority loss function for smooth similarity-preserving learning. Besides, global information based on clustering is utilized to distill the image pairs by removing contradictory similarity signals. Extensive experiments on three widely used benchmark datasets show that the proposed DSG consistently outperforms the state-of-the-art search methods.

📄 PDF Abstract BibTeX arXiv:2105.06125

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringComputational EfficiencyDeep Hashing

Similar Papers 제목 키워드 기반

DistillHash: Unsupervised Deep Hashing by Distilling Data Pairs

2019-05-09 · CVPR 2019 6 · Erkun Yang, Tongliang Liu, Cheng Deng, Wei Liu 외

Due to the high storage and search efficiency, hashing has become prevalent for large-scale similarity search. Particularly, deep hashing methods have greatly improved the search performance under supervised scenarios. I…

Deep HashingSemantic SimilaritySemantic Textual Similarity

Weighted Contrastive Hashing

2022-09-28 · Jiaguo Yu, Huming Qiu, Dubing Chen, Haofeng Zhang

The development of unsupervised hashing is advanced by the recent popular contrastive learning paradigm. However, previous contrastive learning-based works have been hampered by (1) insufficient data similarity mining ba…

Contrastive LearningData AugmentationRetrieval

Attribute-Prompted Kernel Hashing for Unsupervised Data-Efficient Cross-Modal Retrieval

2026-07-01 · Runhao Li, Xiaoxu Ma, Zhenyu Weng, Yue Zhang 외 arxiv

Unsupervised cross-modal hashing enables efficient retrieval of semantically related instances across different modalities without requiring manual semantic annotation. However, existing unsupervised methods rely heavily…

Cross-Modal RetrievalContrastive Learning

Cluster-wise Unsupervised Hashing for Cross-Modal Similarity Search

2019-11-11 · Lu Wang, Jie Yang

Large-scale cross-modal hashing similarity retrieval has attracted more and more attention in modern search applications such as search engines and autopilot, showing great superiority in computation and storage. However…

ClusteringRetrieval

Adaptive Structural Similarity Preserving for Unsupervised Cross Modal Hashing

2022-07-09 · Liang Li, Baihua Zheng, Weiwei Sun

Cross-modal hashing is an important approach for multimodal data management and application. Existing unsupervised cross-modal hashing algorithms mainly rely on data features in pre-trained models to mine their similarit…

ManagementRepresentation Learning