Structure-from-motion revisited
JL Schonberger, JM Frahm - … of the IEEE conference on computer …, 2016 - cv-foundation.org
Abstract Incremental Structure-from-Motion is a prevalent strategy for 3D reconstruction from
unordered image collections. While incremental reconstruction systems have tremendously …
unordered image collections. While incremental reconstruction systems have tremendously …
Certifiably optimal outlier-robust geometric perception: Semidefinite relaxations and scalable global optimization
We propose the first general and scalable framework to design certifiable algorithms for
robust geometric perception in the presence of outliers. Our first contribution is to show that …
robust geometric perception in the presence of outliers. Our first contribution is to show that …
On the convergence of IRLS and its variants in outlier-robust estimation
Outlier-robust estimation involves estimating some parameters (eg, 3D rotations) from data
samples in the presence of outliers, and is typically formulated as a non-convex and non …
samples in the presence of outliers, and is typically formulated as a non-convex and non …
Certifiably correct range-aided SLAM
A Papalia, A Fishberg, BW O'Neill… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
We present the first algorithm to efficiently compute certifiably optimal solutions to range-
aided simultaneous localization and mapping (RA-SLAM) problems. Robotic navigation …
aided simultaneous localization and mapping (RA-SLAM) problems. Robotic navigation …
An efficient solution to non-minimal case essential matrix estimation
J Zhao - IEEE Transactions on Pattern Analysis and Machine …, 2020 - ieeexplore.ieee.org
Finding relative pose between two calibrated images is a fundamental task in computer
vision. Given five point correspondences, the classical five-point methods can be used to …
vision. Given five point correspondences, the classical five-point methods can be used to …
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
We consider solving high-order and tight semidefinite programming (SDP) relaxations of
nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one …
nonconvex polynomial optimization problems (POPs) that often admit degenerate rank-one …
Semidefinite relaxations of truncated least-squares in robust rotation search: Tight or not
The rotation search problem aims to find a 3D rotation that best aligns a given number of
point pairs. To induce robustness against outliers for rotation search, prior work considers …
point pairs. To induce robustness against outliers for rotation search, prior work considers …
One ring to rule them all: Certifiably robust geometric perception with outliers
We propose the first general and practical framework to design certifiable algorithms for
robust geometric perception in the presence of a large amount of outliers. We investigate the …
robust geometric perception in the presence of a large amount of outliers. We investigate the …
Gmkf: Generalized moment kalman filter for polynomial systems with arbitrary noise
This paper develops a new filtering approach for state estimation in polynomial systems
corrupted by arbitrary noise, which commonly arise in robotics. We first consider a batch …
corrupted by arbitrary noise, which commonly arise in robotics. We first consider a batch …