Hypergraph Modelling for Geometric Model Fitting
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model. In the hypergraph model, vertices represent data points and hyperedges denote model hypotheses. The hypergraph, with large and "data-determined" degrees of hyperedges, can express the complex relationships between model hypotheses and data points. In addition, we develop a robust hypergraph partition algorithm to detect sub-hypergraphs for model fitting. HF can effectively and efficiently estimate the number of, and the parameters of, model instances in multi-structural data heavily corrupted with outliers simultaneously. Experimental results show the advantages of the proposed method over previous methods on both synthetic data and real images.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jul 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2022Generalized Differentiable RANSACcited by 30
- 2023Quantum Multi-Model Fittingcited by 12
- 2025MultiLink: Multi-class Structure Recovery via Agglomerative Clustering and Model Selectioncited by 2
- 2021Event Data Association via Robust Model Fitting for Event-based Object Trackingcited by 0
- 2025MultiLink: Multi-class Structure Recovery via Agglomerative Clustering and Model Selection16 May 2025
- 2023Quantum Multi-Model Fitting27 Mar 2023
- 2022Generalized Differentiable RANSAC26 Dec 2022
- 2021Event Data Association via Robust Model Fitting for Event-based Object Tracking25 Oct 2021