Selecting the Best Optimal Feature Correspondence with Deep Learning

2019

Closed access Metadata (CSL-JSON)
DOI 10.1109/aiccsa47632.2019.9035258
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Finding a correspondence between a pair of feature sets is an important problem with several applications ranging from camera calibration to panoramic image generation. When this problem is formulated as a transportation (or, minimum-cost network flow) problem, the optimal solution induces the sets of feature correspondences. Considering the case where multiple optimal solutions exist for a given transportation problem, each optimal solution yields different feature correspondences. The objective of this paper is to utilize deep learning to select the optimal solution, which best preserves local neighborhood information in such cases. Instead of a hand-crafted optimal solution selection as done by the previous work [6], we propose a novel deep learning-based optimal solution selection. The experimental evaluation of the proposed work including a comparison with the previous framework demonstrates both the effectiveness and efficiency of the overall approach.