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 methods. This article introduces two unifying formulations for outlier-robust estimation,
generalized maximum consensus
(
$\text{G}$
-
$\text{MC}$
) and
generalized truncated least squares
(
$\text{G-TLS}$
), and investigates fundamental limits, practical algorithms, and applications. Our first contribution is a proof that outlier-robust estimation is
inapproximable:
In the worst case, it is impossible to (even approximately) find the set of outliers, even with slower-than-polynomial-time algorithms (particularly, algorithms running in
quasi-polynomial
time). As a second contribution, we review and extend two general-purpose algorithms. The first,
adaptive trimming
(
$\text{ADAPT}$
), is combinatorial and is suitable for
$\text{G}$
-
$\text{MC}$
; the second,
graduated nonconvexity
(
$\text{GNC}$
), is based on homotopy methods and is suitable for
$\text{G-TLS}$
. We extend
$\text{ADAPT}$
and
$\text{GNC}$
to the case where the user does not have prior knowledge of the inlier-noise statistics (or the statistics may vary over time) and is unable to guess a reasonable threshold to separate inliers from outliers (as the one commonly used in RANdom SAmple Consensus
$(\text{RANSAC})$
. We propose the first
minimally tuned
algorithms for outlier rejection, which dynamically decide how to separate inliers from outliers. Our third contribution is an evaluation of the proposed algorithms on robot perception problems: mesh registration, image-based object detection (
shape alignment
), and pose graph optimization.
$\text{ADAPT}$
and
$\text{GNC}$
execute in real time, are deterministic, outperform
$\text{RANSAC}$
, and are robust up to 80–90% outliers. Their minimally tuned versions also compare favorably with the state of the art, even though they do not rely on a noise bound for the inliers.