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 language | English (US) |
|---|---|
| Title of host publication | 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings |
| Pages | 2102-2105 |
| Number of pages | 4 |
| DOIs | |
| State | Published - Nov 8 2010 |
| Event | 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States Duration: Mar 14 2010 → Mar 19 2010 |
Other
| Other | 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 |
|---|---|
| Country | United States |
| City | Dallas, TX |
| Period | 3/14/10 → 3/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
Brevdo, E., & Ramadge, P. J. (2010). Bridge detection and robust geodesics estimation via random walks. In 2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings (pp. 2102-2105). [5495135] https://doi.org/10.1109/ICASSP.2010.5495135