Compressed Sensing and Redundant Dictionaries

DOI10.1109/TIT.2008.920190zbMATH Open1332.94022arXivmath/0701131OpenAlexW2105877514MaRDI QIDQ3604675FDOQ3604675

Authors: Holger Rauhut, Karin Schnass, P. Vandergheynst 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0701131

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Signal detection and filtering (aspects of stochastic processes) (60G35) Identification in stochastic control theory (93E12)

Cited In (87)

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

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)