Algorithms for ridge estimation with convergence guarantees
Not on the map. Why?
Abstract (arXiv)
The extraction of filamentary structure from a point cloud is discussed. The filaments are modeled as ridge lines or higher dimensional ridges of an underlying density. We propose two novel algorithms, and provide theoretical guarantees for their convergences, by which we mean that the algorithms can asymptotically recover the full ridge set. We consider the new algorithms as alternatives to the Subspace Constrained Mean Shift (SCMS) algorithm for which no such theoretical guarantees are known.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 1 of its 61 references that are in the map. First posted on arXiv 26 Apr 2021.
Builds on
1 of 61 references.
References · 1
- 2014Asymptotic theory for density ridgescited by 9
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2021Mode and Ridge Estimation in Euclidean and Directional Product Spaces: A Mean Shift Approachcited by 1
- 2021Statistical embedding: Beyond principal componentscited by 0
- 2025EM Approaches to Nonparametric Estimation for Mixture of Linear Regressionscited by 0
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shiftcited by 0
- 2026Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift5 Aug 2026
- 2025EM Approaches to Nonparametric Estimation for Mixture of Linear Regressions16 Oct 2025
- 2021Mode and Ridge Estimation in Euclidean and Directional Product Spaces: A Mean Shift Approach16 Oct 2021
- 2021Statistical embedding: Beyond principal components3 Jun 2021