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

12/08/2015
by   Erkan Bostanci, et al.
0

Brute force matching of binary image feature descriptors is conventionally performed using the Hamming distance. This paper assesses the use of alternative metrics in order to see whether they can produce feature correspondences that yield more accurate homography matrices. Two statistical tests, namely ANOVA (Analysis of Variance) and McNemar's test were employed for evaluation. Results show that Jackard-Needham and Dice metrics can display better performance for some descriptors. Yet, these performance differences were not found to be statistically significant.

READ FULL TEXT
research
11/29/2013

The Power of Asymmetry in Binary Hashing

When approximating binary similarity using the hamming distance between ...
research
02/14/2016

Do We Need Binary Features for 3D Reconstruction?

Binary features have been incrementally popular in the past few years du...
research
09/18/2018

Adding Cues to Binary Feature Descriptors for Visual Place Recognition

In this paper we propose an approach to embed continuous and selector cu...
research
07/21/2017

Evaluation of Hashing Methods Performance on Binary Feature Descriptors

In this paper we evaluate performance of data-dependent hashing methods ...
research
02/26/2018

HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition

Reliable and efficient Visual Place Recognition is a major building bloc...
research
12/04/2014

Image Data Compression for Covariance and Histogram Descriptors

Covariance and histogram image descriptors provide an effective way to c...
research
10/15/2017

Stable Matchings in Metric Spaces: Modeling Real-World Preferences using Proximity

Suppose each of n men and n women is located at a point in a metric spac...

Please sign up or login with your details

Forgot password? Click here to reset