Iterative hard thresholding for compressed data separation
DOI10.1016/j.jco.2020.101469zbMath1460.94025OpenAlexW3008971790MaRDI QIDQ2190470
Dekai Liu, Song Li, Wen-chang Sun, Jun Hong Lin
Publication date: 18 June 2020
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2020.101469
framescompressed sensingiterative hard thresholdingrestricted isometry propertymutual coherencedata separation
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- Hard thresholding pursuit algorithms: number of iterations
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- The cosparse analysis model and algorithms
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Stable recovery of analysis based approaches
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- Restricted $q$-Isometry Properties Adapted to Frames for Nonconvex $l_q$-Analysis
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- Microlocal Analysis of the Geometric Separation Problem
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Compressed Data Separation With Redundant Dictionaries
- Compressed sensing
- Adaptive greedy approximations
- Dictionary-sparse recovery via thresholding-based algorithms
This page was built for publication: Iterative hard thresholding for compressed data separation
