By Topic

High-entropy Hamming embedding of local image descriptors using random projections

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sibiryakov, A. ; Mitsubishi Electr. Res. Centre Eur., Guildford, UK

We present a method of transforming local image descriptors into a compact form of bit-sequences whose similarity is determined by Hamming distance. Following the locality-sensitive hashing approach, the descriptors are projected on a set of random directions that are learned from a set of non-matching data. The learned random projections result in high-entropy binary codes (HE2) that outperform codes based on standard random projections in match/non-match classification and nearest neighbor search. Despite of data compression and granularity of Hamming space, HE2-descriptor outperforms the original descriptor in the classification task. In nearest neighbor search task, the performance of the HE2-descriptor is asymptotic to the performance of the original descriptor. As a supporting result, we obtain another descriptor, HE2 + 1, and demonstrate that the performance of the original descriptor can be improved by adding a few bits derived from the descriptor itself.

Published in:

Multimedia Signal Processing, 2009. MMSP '09. IEEE International Workshop on

Date of Conference:

5-7 Oct. 2009