Top Position Sensitive Ordinal Relation Preserving Bitwise Weight for Image Retrieval
In recent years, binary coding methods have become increasingly popular for tasks of searching approximate nearest neighbors (ANNs). High-dimensional data can be quantized into binary codes to give an efficient similarity approximation via a Hamming distance. However, most of existing schemes consid...
Main Authors: | Zhen Wang, Fuzhen Sun, Longbo Zhang, Lei Wang, Pingping Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/1/18 |
Similar Items
-
Minimal residual ordinal loss hashing with an adaptive optimization mechanism
by: Zhen Wang, et al.
Published: (2020-03-01) -
Episode 7.05 – Flipping Bits using the Bitwise Inverse and Bitwise-XOR
by: Tarnoff, David
Published: (2020) -
Episode 7.04 – Setting Bits using the Bitwise-OR
by: Tarnoff, David
Published: (2020) -
Episode 7.01 – The Need for Bitwise Operations
by: Tarnoff, David
Published: (2020) -
Episode 7.03 – Coding Bitwise Operations
by: Tarnoff, David
Published: (2020)