Metric graph reconstruction from noisy data

Abstract : Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs. Building on the notions of correspondence and Gromov-Hausdorff distance in metric geometry, we describe a model for such data sets as an approximation of an underlying metric graph. We present a novel algorithm that takes as an input such a data set, and outputs the underlying metric graph with guarantees. We also implement the algorithm, and evaluate its performance on a variety of real world data sets.
Document type :
Conference papers
27th Annual Symposium on Computational Geometry, 2011, Paris, France. pp.37-46, 2011, <10.1145/1998196.1998203>


https://hal.inria.fr/inria-00630774
Contributor : Marc Glisse <>
Submitted on : Monday, October 10, 2011 - 10:58:43 PM
Last modification on : Friday, January 6, 2012 - 1:35:54 PM

File

ijcga.pdf
fileSource_public_author

Identifiers

Collections

Citation

Mridul Aanjaneya, Frédéric Chazal, Daniel Chen, Marc Glisse, Leonidas J. Guibas, et al.. Metric graph reconstruction from noisy data. 27th Annual Symposium on Computational Geometry, 2011, Paris, France. pp.37-46, 2011, <10.1145/1998196.1998203>. <inria-00630774>

Export

Share

Metrics

Consultation de
la notice

224

Téléchargement du document

85