Mode-Seeking on Hypergraphs for Robust Geometric Model Fitting

Files

RA_hdl_107657.pdf (1.24 MB)
  (Restricted Access)

Date

2015

Authors

Wang, H.
Xiao, G.
Yan, Y.
Suter, D.

Editors

Advisors

Journal Title

Journal ISSN

Volume Title

Type:

Conference paper

Citation

Proceedings / IEEE International Conference on Computer Vision. IEEE International Conference on Computer Vision, 2015, vol.Proceedings 2015 IEEE International Conference on Computer Vision, pp.2902-2910

Statement of Responsibility

Hanzi Wang, Guobao Xiao, Yan Yan, David Suter

Conference Name

IEEE International Conference on Computer Vision (ICCV) (11 Dec 2015 - 18 Dec 2015 : Santiago, Chile)

Abstract

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.

School/Discipline

Dissertation Note

Provenance

Description

Access Status

Rights

© 2015 IEEE

License

Call number

Persistent link to this record