Anti-sparse coding for approximate nearest neighbor search

Details Anti-sparse coding for approximate nearest neighbor search Anti-sparse coding for approximate nearest neighbor search

2011-10-17

arxiv.org/abs/1110.3767v2

Computer Science

Computer Vision and Pattern Recognition

submitted to ICASSP'2012; RR-7771 (2011)

Scientific paper

This paper proposes a binarization scheme for vectors of high dimension based on the recent concept of anti-sparse coding, and shows its excellent performance for approximate nearest neighbor search. Unlike other binarization schemes, this framework allows, up to a scaling factor, the explicit reconstruction from the binary representation of the original vector. The paper also shows that random projections which are used in Locality Sensitive Hashing algorithms, are significantly outperformed by regular frames for both synthetic and real data if the number of bits exceeds the vector dimensionality, i.e., when high precision is required.

Affiliated with

Also associated with

No associations

Rating

Anti-sparse coding for approximate nearest neighbor search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Anti-sparse coding for approximate nearest neighbor search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anti-sparse coding for approximate nearest neighbor search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319276