Compressed sensing with coherent and redundant dictionaries
From MaRDI portal
(Redirected from Publication:544040)
Abstract: This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or incoherent dictionary, but in a truly redundant dictionary. This work thus bridges a gap in the literature and shows not only that compressed sensing is viable in this context, but also that accurate recovery is possible via an L1-analysis optimization problem. We introduce a condition on the measurement/sensing matrix, which is a natural generalization of the now well-known restricted isometry property, and which guarantees accurate recovery of signals that are nearly sparse in (possibly) highly overcomplete and coherent dictionaries. This condition imposes no incoherence restriction on the dictionary and our results may be the first of this kind. We discuss practical examples and the implications of our results on those applications, and complement our study by demonstrating the potential of L1-analysis for such problems.
Recommendations
- Compressed Sensing and Redundant Dictionaries
- scientific article; zbMATH DE number 7128825
- Compressive sensing with redundant dictionaries and structured measurements
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Improved RIP conditions for compressed sensing with coherent tight frames
Cites work
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- scientific article; zbMATH DE number 763653 (Why is no real title available?)
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A simple proof of the restricted isometry property for random matrices
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- An almost optimal unrestricted fast Johnson-Lindenstrauss transform
- Analysis versus synthesis in signal priors
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast Discrete Curvelet Transforms
- Gabor analysis and algorithms. Theory and applications
- Greed is Good: Algorithmic Results for Sparse Approximation
- Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- Johnson-Lindenstrauss lemma for circulant matrices
- Matching pursuits with time-frequency dictionaries
- Microlocal analysis of the geometric separation problem
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Near-ideal model selection by \(\ell _{1}\) minimization
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Split Bregman methods and frame based image restoration
- Stable signal recovery from incomplete and inaccurate measurements
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The restricted isometry property and its implications for compressed sensing
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
Cited in
(only showing first 100 items - show all)- k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
- Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
- Overcomplete representation in a hierarchical Bayesian framework
- Two-stage geometric information guided image reconstruction
- The restricted isometry property for signal recovery with coherent tight frames
- Robust recovery of a kind of weighted l1-minimization without noise level
- Iterative hard thresholding for compressed data separation
- Analysis non-sparse recovery for relaxed ALASSO
- Alternating forward-backward splitting for linearly constrained optimization problems
- Theory and fast learned solver for \(\ell^1\)-TV regularization
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
- Compressed data separation under \(\ell_p\) bounded noise
- Compressed sensing and dictionary learning
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
- Smoothed _1-regularization-based line search for sparse signal recovery
- Templates for convex cone problems with applications to sparse signal recovery
- Stable recovery of analysis based approaches
- A note on block-sparse signal recovery with coherent tight frames
- Compressive imaging and characterization of sparse light deflection maps
- Learning probabilistic neural representations with randomly connected circuits
- Towards probabilistic robust and sparsity-free compressive sampling in civil engineering: a review
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
- Image reconstruction using analysis model prior
- Compressive sensing with redundant dictionaries and structured measurements
- Compressed Sensing and Redundant Dictionaries
- Flavors of compressive sensing
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Greedy signal space methods for incoherence and beyond
- Compressive time-of-flight 3D imaging using block-structured sensing matrices
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Frames and numerical approximation
- $\ell _0$ Minimization for wavelet frame based image restoration
- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- Multi-layer sparse coding: the holistic way
- Sharp recovery bounds for convex demixing, with applications
- Structured random measurements in signal processing
- The \( \ell _1 \)-analysis in phase retrieval with redundant dictionary
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Sparsity based methods for overparameterized variational problems
- Three stochastic measurement schemes for direction-of-arrival estimation using compressed sensing method
- On sparse representation of analytic signal in Hardy space
- Local behavior of sparse analysis regularization: applications to risk estimation
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Coherence pattern-guided compressive sensing with unresolved grids
- Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Guarantees of total variation minimization for signal recovery
- Gradient flows and randomised thresholding: sparse inversion and classification
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- A null space analysis of the _1-synthesis method in dictionary-based compressed sensing
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Stability of \(l_q\)-analysis based dual frame with Weibull matrices for \(0<q\leq 1\)
- scientific article; zbMATH DE number 7128825 (Why is no real title available?)
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Recovery error analysis of noisy measurement in compressed sensing
- Compressed data separation via dual frames based split-analysis with Weibull matrices
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
- The core of a Grassmannian frame
- Low complexity regularization of linear inverse problems
- Bilevel Methods for Image Reconstruction
- Solution of linear ill-posed problems using random dictionaries
- Spectral compressive sensing
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- Theory and applications of compressed sensing
- Decoupling noise and features via weighted \(\ell_1\)-analysis compressed sensing
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- Near oracle performance and block analysis of signal space greedy methods
- Nonuniform recovery of fusion frame structured sparse signals
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization
- Greedy-like algorithms for the cosparse analysis model
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
- Two are better than one: fundamental parameters of frame coherence
- Frames for compressed sensing using coherence
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Optimal D-RIP bounds in compressed sensing
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
- A unified framework for linear dimensionality reduction in L1
- Compressed sensing image restoration based on data-driven multi-scale tight frame
- Compressed data separation via unconstrained l1-split analysis
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization
- Application of ESN prediction model based on compressed sensing in stock market
- On the decay of the smallest singular value of submatrices of rectangular matrices
This page was built for publication: Compressed sensing with coherent and redundant dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544040)
