Fast Image Search with Locality-Sensitive Hashing and Homogeneous Kernels Map

Algorithm 1

KLSH algorithm.

(1) Process Data

(a) Obtain matrix from database throughout the points.

(b) Obtain by randomly sampling a subset from the

(c) Project on th subset to obtain .

(d) Obtain

(e) Project onto the points in kernel space

(f) Obtain hash bucket

(2) Query Processing

(a) Obtain the same hash bucket in (29) from the database

(b) Use Ann search for query matching.