AVBH: Asymmetric Learning to Hash with Variable Bit Encoding
Nearest neighbour search (NNS) is the core of large data retrieval. Learning to hash is an effective way to solve the problems by representing high-dimensional data into a compact binary code. However, existing learning to hash methods needs long bit encoding to ensure the accuracy of query, and lon...
Main Authors: | Yanduo Ren, Jiangbo Qian, Yihong Dong, Yu Xin, Huahui Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Scientific Programming |
Online Access: | http://dx.doi.org/10.1155/2020/2424381 |
Similar Items
-
A Ranking-Based Hashing Algorithm Based on the Distributed Spark Platform
by: Anbang Yang, et al.
Published: (2020-03-01) -
Dual Asymmetric Deep Hashing Learning
by: Jinxing Li, et al.
Published: (2019-01-01) -
Semi-Paired Asymmetric Deep Cross-Modal Hashing Learning
by: Yi Wang, et al.
Published: (2020-01-01) -
Efficient Variable Bit Rate Control Schemes for Video Encoders
by: Hsien-Chen Chiu, et al. -
Smooth Hash Proof System Based on the Learning With Errors Problem With Multi-Bit Key Output
by: Momeng Liu, et al.
Published: (2019-01-01)