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