Scalable Discrete Supervised Hash Learning With Asymmetric Matrix Factorization

Abstract

Hashing method maps similar data to binary hashcodes with smaller hamming distance, and it has received a broad attention due to its low storage cost and fast retrieval speed. However, the existing limitations make the present algorithms difficult to deal with large-scale datasets: (1) discrete constraints are involved in the learning of the hash function; (2) pairwise or triplet similarity is adopted to generate efficient hashcodes, resulting both time and space complexity are greater than O(n^2). To address these issues, we propose a novel discrete supervised hash learning framework which can be scalable to large-scale datasets. First, the discrete learning procedure is decomposed into a binary classifier learning scheme and binary codes learning scheme, which makes the learning procedure more efficient. Second, we adopt the Asymmetric Low-rank Matrix Factorization and propose the Fast Clustering-based Batch Coordinate Descent method, such that the time and space complexity is reduce

Stats

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

Related papers

• Dual Asymmetric Deep Hashing Learning (2018)9.03
• Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
• Efficient Discrete Supervised Hashing For Large-scale Cross-modal Retrieval (2019)11.08
• Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
• Collaborative Learning For Extremely Low Bit Asymmetric Hashing (2018)7.50
• Deep Discrete Supervised Hashing (2017)15.06
• Deep Discrete Hashing With Self-supervised Pairwise Labels (2017)9.49
• Self-supervised Asymmetric Deep Hashing With Margin-scalable Constraint (2020)0.00