Networks of polynomial pieces with application to the analysis of point clouds and images
From MaRDI portal
Publication:2654450
DOI10.1016/J.JAT.2009.03.007zbMATH Open1190.42015arXiv0709.0258OpenAlexW2092137880MaRDI QIDQ2654450FDOQ2654450
Authors: Ery Arias-Castro, Boris Efros, Ofer Levi
Publication date: 19 January 2010
Published in: Journal of Approximation Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0709.0258
Recommendations
multiscale analysispiecewise polynomialsbeamletsdetection of filamentsextracting information from graphsHölder smoothness classes
Cites Work
- Title not available (Why is that?)
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimax estimation via wavelet shrinkage
- Title not available (Why is that?)
- Title not available (Why is that?)
- Color-coding
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On approximating the longest path in a graph
- Scan statistics and applications
- Title not available (Why is that?)
- Scan statistics
- Minimax theory of image reconstruction
- Adaptive multiscale detection of filamentary structures in a background of uniform random points
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Maximal meaningful events and applications to image analysis
- Ridgelets and the representation of mutilated Sobolev functions
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Wedgelets: Nearly minimax estimation of edges
- Detecting highly oscillatory signals by chirplet path pursuit
- Connect the dots: how many random points can a regular curve pass through?
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
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)