Compressed Sensing and Redundant Dictionaries
From MaRDI portal
Publication:3604675
Abstract: This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry constants. Thus, signals that are sparse with respect to the dictionary can be recovered via Basis Pursuit from a small number of random measurements. Further, thresholding is investigated as recovery algorithm for compressed sensing and conditions are provided that guarantee reconstruction with high probability. The different schemes are compared by numerical experiments.
Recommendations
- scientific article; zbMATH DE number 7128825
- Compressive sensing with redundant dictionaries and structured measurements
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing and dictionary learning
- Compressed sensing
- Compressed sensing
- Compressive sensing
- Compressive Sensing
- Compression-Based Compressed Sensing
- Compressed dictionary learning
Cited in
(92)- Sure independence screening and compressed random sensing
- The benefit of group sparsity
- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- Structured random measurements in signal processing
- The \( \ell _1 \)-analysis in phase retrieval with redundant dictionary
- Sparse Legendre expansions via _1-minimization
- Hierarchical compressed sensing
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Adventures in compressive sensing based MIMO radar
- Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
- On sparse representation of analytic signal in Hardy space
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- Compressed Sensing and Source Separation
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Dictionary-sparse recovery from heavy-tailed measurements
- Regularity properties for sparse regression
- Approximation of frame based missing data recovery
- Guarantees of total variation minimization for signal recovery
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- A null space analysis of the _1-synthesis method in dictionary-based compressed sensing
- scientific article; zbMATH DE number 7128825 (Why is no real title available?)
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Compressed data separation via dual frames based split-analysis with Weibull matrices
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- Spectral compressive sensing
- Theory and applications of compressed sensing
- Near oracle performance and block analysis of signal space greedy methods
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Greedy-like algorithms for the cosparse analysis model
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Multipliers for \(p\)-Bessel sequences in Banach spaces
- 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
- Nonlinear least squares in \(\mathbb R^{N}\)
- Analysis of sparse MIMO radar
- Instrumental variable-based OMP identification algorithm for Hammerstein systems
- Performance analysis for unconstrained analysis based approaches
- Compressed sensing with coherent and redundant dictionaries
- Sparse recovery with general frame via general-dual-based analysis Dantzig selector
- Deterministic convolutional compressed sensing matrices
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Restricted isometries for partial random circulant matrices
- Extensions of compressed sensing
- Optimal non-linear models for sparsity and sampling
- Guaranteed sparse signal recovery with highly coherent sensing matrices
- An introduction to compressed sensing
- Combinatorial Algorithms for Compressed Sensing
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed sensing with frames and sparsity in levels class
- Deterministic construction of sparse binary matrices via incremental integer optimization
- Sampling in the analysis transform domain
- From compression to compressed sensing
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression)
- Convex optimization in sums of Banach spaces
- Stable recovery of sparse signals with coherent tight frames via \(l_p\)-analysis approach
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- On the existence of optimal unions of subspaces for data modeling and clustering
- A survey of compressed sensing
- Quasi-linear compressed sensing
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Sampling rates for \(\ell^1\)-synthesis
- Sparsification of matrices and compressed sensing
- Improved RIP conditions for compressed sensing with coherent tight frames
- Compressive sensing and neural networks from a statistical learning perspective
- Approximation theory of wavelet frame based image restoration
- The application of sparse linear prediction dictionary to compressive sensing in speech signals
- Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
- The restricted isometry property for signal recovery with coherent tight frames
- Compressed sensing construction for underdetermined source separation
- The restricted isometry property for time-frequency structured random matrices
- Robust recovery of a kind of weighted l1-minimization without noise level
- Analysis non-sparse recovery for relaxed ALASSO
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- Compressed data separation under \(\ell_p\) bounded noise
- Compressed sensing and dictionary learning
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
- Compressive sensing for subsurface imaging using ground penetrating radar
- On the relation of the frame-related operators of fusion frame systems
- A note on block-sparse signal recovery with coherent tight frames
- Estimation in high dimensions: a geometric perspective
- Signal Reconstruction From Noisy Random Projections
- Compressive sensing with redundant dictionaries and structured measurements
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Sparsity in time-frequency representations
- Greedy signal space methods for incoherence and beyond
- On the strong restricted isometry property of Bernoulli random matrices
- Model recovery for Hammerstein systems using the hierarchical orthogonal matching pursuit method
- Compressive time-of-flight 3D imaging using block-structured sensing matrices
This page was built for publication: Compressed Sensing and Redundant Dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604675)
