Searching for Representative Modes on Hypergraphs for Robust Geometric Model Fitting
Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

TL;DR
This paper introduces a hypergraph-based mode-seeking method for robust geometric model fitting that effectively segments multi-structure data with outliers by leveraging higher-order similarities and hypergraph reduction techniques.
Contribution
It presents a novel hypergraph construction and reduction approach combined with a mode-seeking algorithm for accurate and efficient geometric model fitting in complex data.
Findings
Outperforms state-of-the-art methods on synthetic and real data
Effectively estimates number and parameters of multiple models
Handles severe outliers with high robustness
Abstract
In this paper, we propose a simple and effective {geometric} model fitting method to fit and segment multi-structure data even in the presence of severe outliers. We cast the task of geometric model fitting as a representative mode-seeking problem on hypergraphs. Specifically, a hypergraph is firstly constructed, where the vertices represent model hypotheses and the hyperedges denote data points. The hypergraph involves higher-order similarities (instead of pairwise similarities used on a simple graph), and it can characterize complex relationships between model hypotheses and data points. {In addition, we develop a hypergraph reduction technique to remove "insignificant" vertices while retaining as many "significant" vertices as possible in the hypergraph}. Based on the {simplified hypergraph, we then propose a novel mode-seeking algorithm to search for representative modes within…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
