TL;DR
CLIPPER introduces a graph-theoretic framework for robust data association that guarantees optimal solutions, operates efficiently at scale, and performs exceptionally well in high-noise, high-outlier scenarios.
Contribution
It proposes a relaxation-based approach for data association that guarantees optimality and significantly improves runtime and accuracy over existing methods.
Findings
Achieves 100% precision and 98% recall in high-outlier regimes.
Maintains low runtime of 15 ms on large problems.
Successfully associates noisy points with high accuracy in complex scenarios.
Abstract
We present CLIPPER (Consistent LInking, Pruning, and Pairwise Error Rectification), a framework for robust data association in the presence of noise and outliers. We formulate the problem in a graph-theoretic framework using the notion of geometric consistency. State-of-the-art techniques that use this framework utilize either combinatorial optimization techniques that do not scale well to large-sized problems, or use heuristic approximations that yield low accuracy in high-noise, high-outlier regimes. In contrast, CLIPPER uses a relaxation of the combinatorial problem and returns solutions that are guaranteed to correspond to the optima of the original problem. Low time complexity is achieved with an efficient projected gradient ascent approach. Experiments indicate that CLIPPER maintains a consistently low runtime of 15 ms where exact methods can require up to 24 s at their peak, even…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsPruning
