Is Hamming distance the only way for matching binary image feature descriptors?
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
HBST: A Hamming Distance embedding Binary Search Tree for Visual Place Recognition
Reliable and efficient Visual Place Recognition is a major building block of modern SLAM systems. Leveraging on our prior work, in this paper we present a Hamming Distance embedding Binary Search Tree (HBST) approach for…
Image RetrievalRetrievalVisual Place RecognitionBinary Code Ranking with Weighted Hamming Distance
Binary hashing has been widely used for efficient similarity search due to its query and storage efficiency. In most existing binary hashing methods, the high-dimensional data are embedded into Hamming space and the dist…
BOLD - Binary Online Learned Descriptor For Efficient Image Matching
In this paper we propose a novel approach to generate a binary descriptor optimized for each image patch independently. The approach is inspired by the linear discriminant embedding that simultaneously increases inter…
global-optimizationA Fuzzy Brute Force Matching Method for Binary Image Features
Matching of binary image features is an important step in many different computer vision applications. Conventionally, an arbitrary threshold is used to identify a correct match from incorrect matches using Hamming dista…
3D Binary Signatures
In this paper, we propose a novel binary descriptor for 3D point clouds. The proposed descriptor termed as 3D Binary Signature (3DBS) is motivated from the matching efficiency of the binary descriptors for 2D images. 3DB…