DeepAI AI Chat
Log In Sign Up

ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariants

by   Jingnan Shi, et al.

Many estimation problems in robotics, computer vision, and learning require estimating unknown quantities in the face of outliers. Outliers are typically the result of incorrect data association or feature matching, and it is common to have problems where more than 90 are outliers. While current approaches for robust estimation are able to deal with moderate amounts of outliers, they fail to produce accurate estimates in the presence of many outliers. This paper develops an approach to prune outliers. First, we develop a theory of invariance that allows us to quickly check if a subset of measurements are mutually compatible without explicitly solving the estimation problem. Second, we develop a graph-theoretic framework, where measurements are modeled as vertices and mutual compatibility is captured by edges. We generalize existing results showing that the inliers form a clique in this graph and typically belong to the maximum clique. We also show that in practice the maximum k-core of the compatibility graph provides an approximation of the maximum clique, while being faster to compute in large problems. These two contributions leads to ROBIN, our approach to Reject Outliers Based on INvariants, which allows us to quickly prune outliers in generic estimation problems. We demonstrate ROBIN in four geometric perception problems and show it boosts robustness of existing solvers while running in milliseconds in large problems.


page 1

page 14


Convex Relaxations for Pose Graph Optimization with Outliers

Pose Graph Optimization involves the estimation of a set of poses from p...

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

This contribution extends the Bron Kerbosch algorithm for solving the ma...

Optimal and Robust Category-level Perception: Object Pose and Shape Estimation from 2D and 3D Semantic Keypoints

We consider a category-level perception problem, where one is given 2D o...

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

This paper formulates a necessary and sufficient condition for a generic...

RANSIC: Fast and Highly Robust Estimation for Rotation Search and Point Cloud Registration using Invariant Compatibility

Correspondence-based rotation search and point cloud registration are tw...

IMOT: General-Purpose, Fast and Robust Estimation for Spatial Perception Problems with Outliers

Spatial perception problems are the fundamental building blocks of robot...

Estimation Contracts for Outlier-Robust Geometric Perception

Outlier-robust estimation is a fundamental problem and has been extensiv...