On sparse representation of analytic signal in Hardy space
From MaRDI portal
Publication:2867872
DOI10.1002/mma.2752zbMath1281.30036OpenAlexW2014675061MaRDI QIDQ2867872
Publication date: 20 December 2013
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.2752
Hardy spaces (30H10) Blaschke products (30J10) Numerical methods in complex analysis (potential theory, etc.) (65E99)
Cites Work
- Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system
- Compressed sensing with coherent and redundant dictionaries
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- On the stability of the basis pursuit in the presence of noise
- Adaptive Fourier series---a variation of greedy algorithm
- SVD compression, unitary transforms, and computational complexity
- Compressed sensing and best 𝑘-term approximation
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Analytic Phase Derivatives, All-Pass Filters and Signals of Minimum Phase
- Algorithm of Adaptive Fourier Decomposition
- Matching pursuits with time-frequency dictionaries
- Compressed sensing
This page was built for publication: On sparse representation of analytic signal in Hardy space