Fast nearest neighbor retrieval using randomized binary codes and approximate Euclidean distance
We propose to approximate the Euclidean distance using the Hamming distance. The approximation relies on binary codes constructed from random projections. The approximation accuracy depends mainly on the number of projections. We also propose a fast retrieval method using the approximate distance. This method retrieves ranked result similar to the true Euclidean distance.
approximate euclidean distance hamming distance fast nearest neighbor search binary code indexing