Soft decision optimization method for robust fundamental matrix estimation

被引:0
作者
Chun-Bao Xiao
Da-Zheng Feng
Ming-Dong Yuan
机构
[1] Henan University of Science and Technology,Information Engineering College
[2] Xidian University,School of Computer Science and Technology
[3] Xidian University,National Laboratory of Radar Signal Processing
来源
Machine Vision and Applications | 2019年 / 30卷
关键词
Feature matching; Fundamental matrix; Soft decision; Optimization; Inlier selection;
D O I
暂无
中图分类号
学科分类号
摘要
It is easy to show that in computer vision, there is the closely coupled relation between feature matching and fundamental matrix estimation. The widely used robust methods such as RANSAC and its improved versions separately deal with feature matching and fundamental matrix estimation. Although these methods are simple to implement, their performance may be relatively low in the presence of gross outliers. By exploiting such coupled relation, the soft decision optimization method is proposed in this paper to estimate the fundamental matrix and find the inlier correspondence set together. Combing feature matching and fundamental matrix estimation, a soft decision objective function is developed to automatically remove the interference of the outliers in the candidate correspondence set. Moreover, an efficient expectation–maximization algorithm is established to find the solution to the fundamental matrix and the inlier correspondence set. Experiments on both synthesized data and real images show that the proposed method can cope with large noise and high ratio of outliers and is superior to some state-of-the-art robust methods in precision, recall, and residual error.
引用
收藏
页码:657 / 669
页数:12
相关论文
共 47 条
  • [1] Tuytelaars T(2008)Local invariant feature detectors: a survey Found. Trends Comput. Graph. Vis. 3 177-280
  • [2] Mikolajczyk K(2014)Learning local feature descriptors using convex optimisation IEEE Trans. Pattern Anal. Mach. Intell. 36 1573-1585
  • [3] Simonyan K(2004)Distinctive image features from scale-invariant keypoints Int. J. Comput. Vis. 60 91-110
  • [4] Vedaldi A(2005)iDistance: An adaptive B + tree based indexing method for nearest neighbor search ACM Trans. Data Base Syst. 30 364-397
  • [5] Zisserman A(1999)Indexing without invariants in 3D object recognition IEEE Trans. Pattern Anal. Mach. Intell. 21 1000-1015
  • [6] Lowe DG(2009)Semantic hashing Int. J. Approx. Reason. 50 969-978
  • [7] Jagadish HV(1998)Determining the epipolar geometry and its uncertainty: a review Int. J. Comput. Vis. 27 161-195
  • [8] Beng CO(1996)The fundamental matrix: theory, algorithms, and stability analysis Int. J. Comput. Vis. 17 43-75
  • [9] Kian LT(2003)Overall view regarding fundamental matrix estimation Image Vis. Comput. 21 205-220
  • [10] Beis JS(1981)Random sample consensus: a paradigm for model fitting with application to image analysis and automated cartography Commun. ACM 24 381-395