Evaluation of Hashing Methods Performance on Binary Feature Descriptors

07/21/2017
by   Jacek Komorowski, et al.
0

In this paper we evaluate performance of data-dependent hashing methods on binary data. The goal is to find a hashing method that can effectively produce lower dimensional binary representation of 512-bit FREAK descriptors. A representative sample of recent unsupervised, semi-supervised and supervised hashing methods was experimentally evaluated on large datasets of labelled binary FREAK feature descriptors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2015

Supervised Discrete Hashing

This paper has been withdrawn by the authour....
research
12/26/2017

Scalable Prototype Selection by Genetic Algorithms and Hashing

Classification in the dissimilarity space has become a very active resea...
research
09/21/2016

How should we evaluate supervised hashing?

Hashing produces compact representations for documents, to perform tasks...
research
06/08/2020

Procrustean Orthogonal Sparse Hashing

Hashing is one of the most popular methods for similarity search because...
research
09/28/2018

Aggregation of binary feature descriptors for compact scene model representation in large scale structure-from-motion applications

In this paper we present an efficient method for aggregating binary feat...
research
12/09/2017

Semi-supervised Multimodal Hashing

Retrieving nearest neighbors across correlated data in multiple modaliti...
research
12/08/2015

Is Hamming distance the only way for matching binary image feature descriptors?

Brute force matching of binary image feature descriptors is conventional...

Please sign up or login with your details

Forgot password? Click here to reset