A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
DOI10.1016/J.ACHA.2006.04.003zbMATH Open1278.94024OpenAlexW2062616135MaRDI QIDQ861809FDOQ861809
Authors: Jing Zou 
Publication date: 2 February 2007
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2006.04.003
Recommendations
- Nearly optimal sparse Fourier transform
- Combinatorial sublinear-time Fourier algorithms
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- (Nearly) sample-optimal sparse Fourier transform
- Improved approximation guarantees for sublinear-time Fourier algorithms
optimal B-term Fourier representation of signalsparse Fourier transform for nonequispaced datasublinear randomized algorithm
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Randomized algorithms (68W20) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Decoding by Linear Programming
- 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
- Near-optimal sparse fourier representations via sampling
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Accelerating the Nonuniform Fast Fourier Transform
- A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- Geometric approach to error-correcting codes and reconstruction of signals
- Random sampling of sparse trigonometric polynomials
- Efficient numerical methods in non-uniform sampling theory
- On numerical methods for discrete least-squares approximation by trigonometric polynomials
- Random Sampling of Multivariate Trigonometric Polynomials
- Stability Results for Scattered Data Interpolation by Trigonometric Polynomials
Cited In (4)
- Three novel edge detection methods for incomplete and noisy spectral data
- What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
This page was built for publication: A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861809)
