Minimal residual ordinal loss hashing with an adaptive optimization mechanism

Minimal residual ordinal loss hashing with an adaptive optimization mechanism

Abstract The binary coding technique has been widely used in approximate nearest neighbors (ANN) search tasks. Traditional hashing algorithms treat binary bits equally, which usually causes an ambiguous ranking. To solve this issue, we propose an innovative bitwise weight method dubbed minimal resid...

Full description

Bibliographic Details
Main Authors: Zhen Wang, Fuzhen Sun, Longbo Zhang, Pingping Liu
Format: Article
Language:English
Published: SpringerOpen 2020-03-01
Series:EURASIP Journal on Image and Video Processing
Subjects:
Binary codes
Bitwise weights
Ordinal relation preserving
Joint optimization
Minimal residual loss
Online Access:http://link.springer.com/article/10.1186/s13640-020-00497-4

Internet

http://link.springer.com/article/10.1186/s13640-020-00497-4

Similar Items