Bridge detection and robust geodesics estimation via random walks

Eugene Brevdo, Peter Jeffrey Ramadge

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors graph is known to fail in the presence of bridges. Our method detects bridges using global statistics via a Markov random walk and denoises the nearest neighbors graph using "surrogate" weights. We show experimentally that our method outperforms methods based on local neighborhood statistics.

Original languageEnglish (US)
Title of host publication2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings
Pages2102-2105
Number of pages4
DOIs
StatePublished - Nov 8 2010
Event2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States
Duration: Mar 14 2010Mar 19 2010

Other

Other2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
CountryUnited States
CityDallas, TX
Period3/14/103/19/10

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Bridge detection and robust geodesics estimation via random walks'. Together they form a unique fingerprint.

Cite this