paper-with-me

Papers

Mode-Seeking on Hypergraphs for Robust Geometric Model Fitting

2016-03-25 · ICCV 2015 12 · Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

In this paper, we propose a novel geometric model fitting method, called Mode-Seeking on Hypergraphs (MSH),to deal with multi-structure data even in the presence of severe outliers. The proposed method formulates geometric model fitting as a mode seeking problem on a hypergraph in which vertices represent model hypotheses and hyperedges denote data points. MSH intuitively detects model instances by a simple and effective mode seeking algorithm. In addition to the mode seeking algorithm, MSH includes a similarity measure between vertices on the hypergraph and a weight-aware sampling technique. The proposed method not only alleviates sensitivity to the data distribution, but also is scalable to large scale problems. Experimental results further demonstrate that the proposed method has significant superiority over the state-of-the-art fitting methods on both synthetic data and real images.

📄 PDF Abstract BibTeX arXiv:1603.07807

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Searching for Representative Modes on Hypergraphs for Robust Geometric Model Fitting

2018-02-04 · Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

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 represen…

Hypergraph Modelling for Geometric Model Fitting

2016-07-11 · Guobao Xiao, Hanzi Wang, Taotao Lai, David Suter

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 …

model

Finding Modes by Probabilistic Hypergraphs Shifting

2017-04-12 · Yang Wang, Lin Wu

In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph mo…

ClusteringGraph Matching

Explaining Human Choice Probabilities with Simple Vector Representations

2025-11-05 · Peter DiBerardino, Britt Anderson arxiv

We formalize human choice behavior in a probabilistic hide-and-seek task. In our geometric construction, vectors represent participant choice frequencies as well as probability matching and maximizing strategies. We meas…

Analysis of Semi-Supervised Learning on Hypergraphs

2025-10-29 · Adrien Weihs, Andrea L. Bertozzi, Matthew Thorpe arxiv

Hypergraphs provide a natural framework for modeling multiway interactions. We analyze a class of variational semi-supervised learning problems posed on random geometric hypergraphs and establish asymptotic consistency i…