Three novel edge detection methods for incomplete and noisy spectral data
DOI10.1007/S00041-008-9038-9zbMATH Open1181.62153OpenAlexW2095690020MaRDI QIDQ734948FDOQ734948
Authors: Eitan Tadmor, Jing Zou 
Publication date: 14 October 2009
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-008-9038-9
Recommendations
- Detection of edges from spectral data: new results
- Detection of edges in spectral data. II: Nonlinear enhancement
- Recovery of Edges from Spectral Data with Noise—A New Perspective
- Edge detection from truncated Fourier data using spectral mollifiers
- Iterative spectral mollification and conjugation for successive edge detection
Signal detection and filtering (aspects of stochastic processes) (60G35) Inference from stochastic processes and spectral analysis (62M15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- Geometric approach to error-correcting codes and reconstruction of signals
- Title not available (Why is that?)
- Detection of edges in spectral data
- Adaptive edge detectors for piecewise smooth data based on the minmod limiter
- Detection of edges in spectral data. II: Nonlinear enhancement
- Filters, mollifiers and the computation of the Gibbs phenomenon
- Recovery of Edges from Spectral Data with Noise—A New Perspective
- Authenticating edges produced by zero-crossing algorithms
- Spectral Reconstruction of Piecewise Smooth Functions from Their Discrete Data
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
Cited In (15)
- On reconstruction from non-uniform spectral data
- Detection of edges from nonuniform Fourier data
- Sparsity enforcing edge detection method for blurred and noisy Fourier data
- Iterative design of concentration factors for jump detection
- Detection of edges in spectral data. II: Nonlinear enhancement
- Polynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images
- Hypothesis testing for Fourier based edge detection methods
- Detection of edges from spectral data: new results
- Reducing the effects of noise in image reconstruction
- Iterative spectral mollification and conjugation for successive edge detection
- Detection of edges in spectral data III-refinement of the concentration method
- Recovery of Edges from Spectral Data with Noise—A New Perspective
- Admissible concentration factors for edge detection from non-uniform Fourier data
- Model-Based Edge Detector for Spectral Imagery Using Sparse Spatiospectral Masks
- Detecting edges from non-uniform Fourier data via sparse Bayesian learning
This page was built for publication: Three novel edge detection methods for incomplete and noisy spectral data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734948)
