Deep Learning to Ternary Hash Codes by Continuation
Not on the map. Why?
Abstract (arXiv)
Recently, it has been observed that {0,1,-1}-ternary codes which are simply generated from deep features by hard thresholding, tend to outperform {-1,1}-binary codes in image retrieval. To obtain better ternary codes, we for the first time propose to jointly learn the features with the codes by appending a smoothed function to the networks. During training, the function could evolve into a non-smoothed ternary function by a continuation method. The method circumvents the difficulty of directly training discrete functions and reduces the quantization errors of ternary codes. Experiments show that the generated codes indeed could achieve higher retrieval accuracy.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 16 Jul 2021.
Builds on
4 of 19 references.
References · 4
- 2017HashNet: Deep Learning to Hash by Continuationcited by 121
- 2016A Survey on Learning to Hashcited by 119
- 2015Simultaneous Feature Learning and Hash Coding with Deep Neural Networkscited by 44
- 2021Ternary Hashingcited by 2
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Ternary and Binary Quantization for Improved Classification31 Mar 2022