Sparse graph based self-supervised hashing for scalable image retrieval
From MaRDI portal
Publication:2056318
DOI10.1016/j.ins.2020.08.092zbMath1475.68298OpenAlexW3082744274MaRDI QIDQ2056318
Li Liu, Haofeng Zhang, Ling Shao, Zheng Zhang, Wei-wei Wang
Publication date: 2 December 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.08.092
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)
Related Items (3)
Nonnegative matrix factorization with local similarity learning ⋮ Deep asymmetric hashing with dual semantic regression and class structure quantization ⋮ Online deep hashing for both uni-modal and cross-modal retrieval
Uses Software
Cites Work
- Unnamed Item
- Faster compression methods for a weighted graph using locality sensitive hashing
- Unsupervised binary representation learning with deep variational networks
- Similarity estimation techniques from rounding algorithms
- A Sparse Embedding and Least Variance Encoding Approach to Hashing
- Scalable Mobile Image Retrieval by Exploring Contextual Saliency
- Deep Discrete Supervised Hashing
- Image Re-Ranking Based on Topic Diversity
- Scalable Deep Hashing for Large-Scale Social Image Retrieval
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
This page was built for publication: Sparse graph based self-supervised hashing for scalable image retrieval