DeepAI AI Chat
Log In Sign Up

Comparative evaluation of 2D feature correspondence selection algorithms

by   Chen Zhao, et al.
Huazhong University of Science u0026 Technology

Correspondence selection aiming at seeking correct feature correspondences from raw feature matches is pivotal for a number of feature-matching-based tasks. Various 2D (image) correspondence selection algorithms have been presented with decades of progress. Unfortunately, the lack of an in-depth evaluation makes it difficult for developers to choose a proper algorithm given a specific application. This paper fills this gap by evaluating eight 2D correspondence selection algorithms ranging from classical methods to the most recent ones on four standard datasets. The diversity of experimental datasets brings various nuisances including zoom, rotation, blur, viewpoint change, JPEG compression, light change, different rendering styles and multi-structures for comprehensive test. To further create different distributions of initial matches, a set of combinations of detector and descriptor is also taken into consideration. We measure the quality of a correspondence selection algorithm from four perspectives, i.e., precision, recall, F-measure and efficiency. According to evaluation results, the current advantages and limitations of all considered algorithms are aggregately summarized which could be treated as a "user guide" for the following developers.


page 1

page 7

page 10

page 11

page 13


Performance Evaluation of 3D Correspondence Grouping Algorithms

This paper presents a thorough evaluation of several widely-used 3D corr...

A Performance Evaluation of Correspondence Grouping Methods for 3D Rigid Data Matching

Seeking consistent point-to-point correspondences between 3D rigid data ...

Consensus-Guided Correspondence Denoising

Correspondence selection between two groups of feature points aims to co...

Efficient Feature Matching by Progressive Candidate Search

We present a novel feature matching algorithm that systematically utiliz...

HSolo: Homography from a single affine aware correspondence

The performance of existing robust homography estimation algorithms is h...

The Stroke Correspondence Problem, Revisited

We revisit the stroke correspondence problem [13,14]. We optimize this a...