Networks of polynomial pieces with application to the analysis of point clouds and images
From MaRDI portal
Publication:2654450
Abstract: We consider Holder smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges between polynomial pieces that are in `good continuation' of each other. Little known to the community, a similar construction was used by Kolmogorov and Tikhomirov in their proof of their celebrated entropy results for Holder classes. We show how to use such networks in the context of detecting geometric objects buried in noise to approximate the scan statistic, yielding an optimization problem akin to the Traveling Salesman. In the same context, we describe an alternative approach based on computing the longest path in the network after appropriate thresholding. For the special case of curves, we also formalize the notion of `good continuation' between beamlets in any dimension, obtaining more economical piecewise linear approximation networks for curves. We include some numerical experiments illustrating the use of the beamlet network in characterizing the filamentarity content of 3D datasets, and show that even a rudimentary notion of good continuity may bring substantial improvement.
Recommendations
Cites work
- scientific article; zbMATH DE number 1714595 (Why is no real title available?)
- scientific article; zbMATH DE number 2177599 (Why is no real title available?)
- scientific article; zbMATH DE number 5604036 (Why is no real title available?)
- scientific article; zbMATH DE number 4047567 (Why is no real title available?)
- scientific article; zbMATH DE number 44878 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- Adaptive multiscale detection of filamentary structures in a background of uniform random points
- Color-coding
- Connect the dots: how many random points can a regular curve pass through?
- Detecting highly oscillatory signals by chirplet path pursuit
- Maximal meaningful events and applications to image analysis
- Minimax estimation via wavelet shrinkage
- Minimax theory of image reconstruction
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On approximating the longest path in a graph
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Ridgelets and the representation of mutilated Sobolev functions
- Scan statistics
- Scan statistics and applications
- The Structure and Function of Complex Networks
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Wedgelets: Nearly minimax estimation of edges
Cited in
(5)- scientific article; zbMATH DE number 1737977 (Why is no real title available?)
- Detection of an anomalous cluster in a network
- Remember the curse of dimensionality: the case of goodness-of-fit testing in arbitrary dimension
- Detecting curved edges in noisy images in sublinear time
- Spectral clustering based on local linear approximations
This page was built for publication: Networks of polynomial pieces with application to the analysis of point clouds and images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654450)
