@lin2014bilateral; @Ma2017Locality]. In addition, the performance under preselected correspondences (with higher inlier ratios) and different detector-descriptor combinations are also accessed to test their flexibility with respect to the inlier ratio and correspondence distribution changes. Finally, the efficiency with respect to different scales of initial feature matches are examined. According to the experimental outcomes, we make an aggregated summary of the current advantages and limitations of our evaluated methods as well as their suitable applications.

In a nutshell, the contributions of this paper are threefold:

-   A review and the core computation steps of eight state-of-the-art 2D correspondence selection algorithms are presented.

-   We comprehensively evaluate and compare the performance, the robustness to a variety of perturbations and the efficiency of each algorithm on four standard datasets consisting of hundreds of images with zoom, rotation, blur, viewpoint change, JPEG compression, light change, different rendering styles and multi-structures.

-   Instructive summarizations including merits, demerits and suitable applications of the tested methods are given that can be served as a “user guide” for the developers.

The remainder of this paper is organized as follows. Sect. \[sec:rela\] gives a review of 2D correspondence selection algorithms and relevant evaluations. Sect. \[sec:method\] presents the core computation 