Sparse approximate reconstruction decomposed by two optimization problems
From MaRDI portal
Publication:2003320
DOI10.1007/s00034-017-0667-6zbMath1426.94063OpenAlexW2761509580MaRDI QIDQ2003320
Publication date: 16 July 2019
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0667-6
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (3)
\(\mathrm{L_1RIP}\)-based robust compressed sensing ⋮ Sparse reconstruction via the mixture optimization model with iterative support estimate ⋮ Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- From compression to compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Extensions of compressed sensing
- Spectral compressive sensing
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
- Recovery error analysis of noisy measurement in compressed sensing
- Compressed sensing based on trust region method
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Certifying the Restricted Isometry Property is Hard
- An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring
- 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?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Atomic Decomposition by Basis Pursuit
- Singular Values of Companion Matrices and Bounds on Zeros of Polynomials
- Uncertainty principles and ideal atomic decomposition
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Generalized Sampling Expansions with Multiple Sampling Rates for Lowpass and Bandpass Signals in the Fractional Fourier Transform Domain
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Sparse approximate reconstruction decomposed by two optimization problems
