arrow
Return

Efficient large-scale geometric verification for structure from motion

delete2019-07-01
delete3
PRE
AI
Q
Qingshan Xu
J
Jie Li
陶文兵 (Wenbing Tao) *
D
Delie Ming
DOI:10.1016/j.patrec.2018.09.028delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Geometric verification is a fundamental problem in epipolar geometry, which estimates fundamental matrix and homography matrix to confirm that image pairs share a common 3D structure. However, it still suffers from low efficiency when it encounters large-scale Structure from Motion (SfM). In this paper, we adopt the linear congruence algorithm to sample point-pairs in parallel. Then, we propose to simultaneously estimate a certain number of candidate fundamental/homography matrices in GPU to avoid the iterative random point sets sampling and perform matrix estimation based on these point sets, followed by best matrix selection and further parallel refinement. Experiments on extensive datasets show that our GPU-based geometric verification is up to seventy times faster than original iteration method while maintaining comparable satisfactory 3D reconstruction results. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Geometric verification
Fundamental matrix
Homography matrix
Large-scale SfM
Gpu-based model
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition Letters cover
Pattern Recognition Letters
IF:
3.3
Papers:
7.8K
Citations:
1.6W

Organization

No organization information available