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

• URL: http://arxiv.org/abs/2011.03659v2
• Date: Tue, 23 Mar 2021 20:02:00 GMT
• Title: ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariants
• Authors: Jingnan Shi, Heng Yang, Luca Carlone
• Abstract summary: Outliers are typically the result of incorrect data association or feature matching. Current approaches for robust estimation fail to produce accurate estimates in the presence of many outliers. This paper develops an approach to prune outliers.
• Score: 30.19476775410544
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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% of the measurements used for estimation 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.

Related papers

• Regularized Contrastive Partial Multi-view Outlier Detection [76.77036536484114]
  We propose a novel method named Regularized Contrastive Partial Multi-view Outlier Detection (RCPMOD) In this framework, we utilize contrastive learning to learn view-consistent information and distinguish outliers by the degree of consistency. Experimental results on four benchmark datasets demonstrate that our proposed approach could outperform state-of-the-art competitors.
  arXiv  Detail & Related papers  (2024-08-02T14:34:27Z)
• Robust Capped lp-Norm Support Vector Ordinal Regression [85.84718111830752]
  Ordinal regression is a specialized supervised problem where the labels show an inherent order. Support Vector Ordinal Regression, as an outstanding ordinal regression model, is widely used in many ordinal regression tasks. We introduce a new model, Capped $ell_p$-Norm Support Vector Ordinal Regression(CSVOR), that is robust to outliers.
  arXiv  Detail & Related papers  (2024-04-25T13:56:05Z)
• Best Arm Identification with Fixed Budget: A Large Deviation Perspective [54.305323903582845]
  We present sred, a truly adaptive algorithm that can reject arms in it any round based on the observed empirical gaps between the rewards of various arms. In particular, we present sred, a truly adaptive algorithm that can reject arms in it any round based on the observed empirical gaps between the rewards of various arms.
  arXiv  Detail & Related papers  (2023-12-19T13:17:43Z)
• Revisiting Rotation Averaging: Uncertainties and Robust Losses [51.64986160468128]
  We argue that the main problem of current methods is the minimized cost function that is only weakly connected with the input data via the estimated epipolar. We propose to better model the underlying noise distributions by directly propagating the uncertainty from the point correspondences into the rotation averaging.
  arXiv  Detail & Related papers  (2023-03-09T11:51:20Z)
• Estimation Contracts for Outlier-Robust Geometric Perception [25.105820975269506]
  Outlier-robust estimation is a fundamental problem and has been extensively investigated by statisticians practitioners. We provide conditions on the input under which modern estimation algorithms are guaranteed to recover an estimate close to the ground in the presence of outliers.
  arXiv  Detail & Related papers  (2022-08-22T18:01:49Z)
• Practical, Fast and Robust Point Cloud Registration for 3D Scene Stitching and Object Localization [6.8858952804978335]
  3D point cloud registration is a fundamental problem in remote sensing, photogrammetry, robotics and geometric computer vision. We propose a novel, fast and highly robust solution, named VOCRA, for the point cloud registration problem with extreme outlier rates. We show that our solver VOCRA is robust against over 99% outliers and more time-efficient than the state-of-the-art competitors.
  arXiv  Detail & Related papers  (2021-11-08T01:49:04Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)
• RANSIC: Fast and Highly Robust Estimation for Rotation Search and Point Cloud Registration using Invariant Compatibility [6.8858952804978335]
  Correspondence-based rotation search and point cloud registration are fundamental problems in robotics and computer vision. We present RANSIC, a fast and highly robust method applicable to both problems based on a new paradigm combining random sampling with invariance and compatibility. In multiple synthetic and real experiments, we demonstrate that RANSIC is fast for use, robust against over 95% outliers, and also able to recall approximately 100% inliers, outperforming other state-of-the-art solvers for both the rotation search and the point cloud registration problems.
  arXiv  Detail & Related papers  (2021-04-19T08:29:34Z)
• Outlier-Robust Estimation: Hardness, Minimally Tuned Algorithms, and Applications [25.222024234900445]
  This paper introduces two unifying formulations for outlier-robust estimation, Generalized Maximum Consensus (G-MC) and Generalized Truncated Least Squares (G-TLS) 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. We propose the first minimally tuned algorithms for outlier rejection, that dynamically decide how to separate inliers from outliers.
  arXiv  Detail & Related papers  (2020-07-29T21:06:13Z)
• $\gamma$-ABC: Outlier-Robust Approximate Bayesian Computation Based on a Robust Divergence Estimator [95.71091446753414]
  We propose to use a nearest-neighbor-based $gamma$-divergence estimator as a data discrepancy measure. Our method achieves significantly higher robustness than existing discrepancy measures.
  arXiv  Detail & Related papers  (2020-06-13T06:09:27Z)
• Zero-Assignment Constraint for Graph Matching with Outliers [40.02444837257561]
  We present the zero-assignment constraint (ZAC) for approaching the graph matching problem in the presence of outliers. The underlying idea is to suppress the matchings of outliers by assigning zero-valued vectors to the potential outliers in the obtained optimal correspondence matrix. We design an efficient outlier-robust algorithm to significantly reduce the incorrect or redundant matchings caused by numerous outliers.
  arXiv  Detail & Related papers  (2020-03-26T14:11:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.