10 April 2018 FBC: a flat binary code scheme for fast Manhattan hash retrieval
Author Affiliations +
Proceedings Volume 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017); 106154T (2018) https://doi.org/10.1117/12.2303359
Event: Ninth International Conference on Graphic and Image Processing, 2017, Qingdao, China
Abstract
Hash coding is a widely used technique in approximate nearest neighbor (ANN) search, especially in document search and multimedia (such as image and video) retrieval. Based on the difference of distance measurement, hash methods are generally classified into two categories: Hamming hashing and Manhattan hashing. Benefitting from better neighborhood structure preservation, Manhattan hashing methods outperform earlier methods in search effectiveness. However, due to using decimal arithmetic operations instead of bit operations, Manhattan hashing becomes a more time-consuming process, which significantly decreases the whole search efficiency. To solve this problem, we present an intuitive hash scheme which uses Flat Binary Code (FBC) to encode the data points. As a result, the decimal arithmetic used in previous Manhattan hashing can be replaced by more efficient XOR operator. The final experiments show that with a reasonable memory space growth, our FBC speeds up more than 80% averagely without any search accuracy loss when comparing to the state-of-art Manhattan hashing methods.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yan Kong, Yan Kong, Fuzhang Wu, Fuzhang Wu, Lifa Gao, Lifa Gao, Yanjun Wu, Yanjun Wu, } "FBC: a flat binary code scheme for fast Manhattan hash retrieval", Proc. SPIE 10615, Ninth International Conference on Graphic and Image Processing (ICGIP 2017), 106154T (10 April 2018); doi: 10.1117/12.2303359; https://doi.org/10.1117/12.2303359
PROCEEDINGS
9 PAGES


SHARE
Back to Top