A Non-alternating Graph Hashing Algorithm For Large Scale Image Search

Abstract

In the era of big data, methods for improving memory and computational efficiency have become crucial for successful deployment of technologies. Hashing is one of the most effective approaches to deal with computational limitations that come with big data. One natural way for formulating this problem is spectral hashing that directly incorporates affinity to learn binary codes. However, due to binary constraints, the optimization becomes intractable. To mitigate this challenge, different relaxation approaches have been proposed to reduce the computational load of obtaining binary codes and still attain a good solution. The problem with all existing relaxation methods is resorting to one or more additional auxiliary variables to attain high quality binary codes while relaxing the problem. The existence of auxiliary variables leads to coordinate descent approach which increases the computational complexity. We argue that introducing these variables is unnecessary. To this end, we propose

Stats

• citations3
• S2 citations—
• github stars0
• HF likes0
• heat score4.52
• arxiv keyhemati2020a

Related papers

• Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
• Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
• Simultaneous Feature Aggregating And Hashing For Large-scale Image Search (2017)10.61
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
• Exploring Auxiliary Context: Discrete Semantic Transfer Hashing For Scalable Image Retrieval (2019)15.88
• SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84