Teaser: Fast and certifiable point cloud registration
We propose the first fast and certifiable algorithm for the registration of two sets of three-
dimensional (3-D) points in the presence of large amounts of outlier correspondences. A …
dimensional (3-D) points in the presence of large amounts of outlier correspondences. A …
A polynomial-time solution for robust registration with extreme outlier rates
We propose a robust approach for the registration of two sets of 3D points in the presence of
a large amount of outliers. Our first contribution is to reformulate the registration problem …
a large amount of outliers. Our first contribution is to reformulate the registration problem …
Outlier-robust estimation: Hardness, minimally tuned algorithms, and applications
Nonlinear estimation in robotics and vision is typically plagued with outliers due to wrong
data association or incorrect detections from signal processing and machine learning …
data association or incorrect detections from signal processing and machine learning …
A quaternion-based certifiably optimal solution to the Wahba problem with outliers
The Wahba problem, also known as rotation search, seeks to find the best rotation to align
two sets of vector observations given putative correspondences, and is a fundamental …
two sets of vector observations given putative correspondences, and is a fundamental …
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 …
Multi-model 3d registration: Finding multiple moving objects in cluttered point clouds
We investigate a variation of the 3D registration problem, named multi-model 3D
registration. In the multi-model registration problem, we are given two point clouds picturing …
registration. In the multi-model registration problem, we are given two point clouds picturing …
Efficient globally optimal consensus maximisation with tree search
Maximum consensus is one of the most popular criteria for robust estimation in computer
vision. Despite its widespread use, optimising the criterion is still customarily done by …
vision. Despite its widespread use, optimising the criterion is still customarily done by …
Outlier-robust spatial perception: Hardness, general-purpose algorithms, and guarantees
V Tzoumas, P Antonante… - 2019 IEEE/RSJ …, 2019 - ieeexplore.ieee.org
Spatial perception is the backbone of many robotics applications, and spans a broad range
of research problems, including localization and mapping, point cloud alignment, and …
of research problems, including localization and mapping, point cloud alignment, and …
Uncertainty-driven dense two-view structure from motion
This work introducesan effective and practical solution to the dense two-view structure from
motion (S f M) problem. One vital question addressed is how to mindfully use per-pixel …
motion (S f M) problem. One vital question addressed is how to mindfully use per-pixel …
Consensus maximization with linear matrix inequality constraints
P Speciale, D Pani Paudel… - Proceedings of the …, 2017 - openaccess.thecvf.com
Consensus maximization has proven to be a useful tool for robust estimation. While
randomized methods like RANSAC are fast, they do not guarantee global optimality and fail …
randomized methods like RANSAC are fast, they do not guarantee global optimality and fail …