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