Sparse Representation of Signals in Hardy Space
From MaRDI portal
Publication:2847068
DOI10.1007/978-3-0348-0603-9_16zbMath1273.30048OpenAlexW2219281263MaRDI QIDQ2847068
Publication date: 4 September 2013
Published in: Quaternion and Clifford Fourier Transforms and Wavelets (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-0348-0603-9_16
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Conjugate functions, conjugate series, singular integrals (42A50) Hardy spaces (30H10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theoretical foundations and numerical methods for sparse recovery. Papers based on the presentations of the summer school ``Theoretical foundations and numerical methods for sparse recovery, Vienna, Austria, August 31 -- September 4, 2009.
- On the stability of the basis pursuit in the presence of noise
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- Adaptive Fourier series---a variation of greedy algorithm
- Compressed sensing and best 𝑘-term approximation
- Adaptive Fourier decomposition of functions in quaternionic Hardy spaces
- 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?
- Atomic Decomposition by Basis Pursuit
- Matching pursuits with time-frequency dictionaries
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Adaptive greedy approximations
This page was built for publication: Sparse Representation of Signals in Hardy Space
