On the path density of a gradient field

Abstract

We consider the problem of reliably finding filaments in point clouds. Realistic data sets often have numerous filaments of various sizes and shapes. Statistical techniques exist for finding one (or a few) filaments but these methods do not handle noisy data sets with many filaments. Other methods can be found in the astronomy literature but they do not have rigorous statistical guarantees. We propose the following method. Starting at each data point we construct the steepest ascent path along a kernel density estimator. We locate filaments by finding regions where these paths are highly concentrated. Formally, we define the density of these paths and we construct a consistent estimator of this path density.

Published in at http://dx.doi.org/10.1214/08-AOS671 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (6)

• Testing for Non-Gaussianity in the Wilkinson Microwave Anisotropy Probe Data: Minkowski Functionals and the Length of the Skeleton
• Skeleton as a probe of the cosmic web: the 2D case
• Empirical graph Laplacian approximation of Laplace--Beltrami operators: Large sample results
• Detection of cosmic filaments using the Candy model
• Adaptive multiscale detection of filamentary structures in a background of uniform random points
• Integral curves of noisy vector fields and statistical problems in diffusion tensor imaging: nonparametric kernel estimation and hypotheses testing

Cited by in corpus (5)

• Nonparametric ridge estimation
• Cosmic Web Reconstruction through Density Ridges: Method and Algorithm
• The large-scale environment from cosmological simulations I: The baryonic cosmic web
• Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
• Fibre-generated point processes and fields of orientations