Compressed Sensing with Coherent and Redundant Dictionaries

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.

Cited by in corpus (25)

• Templates for Convex Cone Problems with Applications to Sparse Signal Recovery
• Distributed Compressive Sensing: A Deep Learning Approach
• Greedy-Like Algorithms for the Cosparse Analysis Model
• Sparsity Averaging for Compressive Imaging
• Uncertainty quantification for radio interferometric imaging: I. proximal MCMC methods
• Compressed Sensing with General Frames via Optimal-dual-based ${\ell }_1$-analysis
• Hybrid Beamforming Based on Implicit Channel State Information for Millimeter Wave Links
• Sparse image reconstruction on the sphere: implications of a new sampling theorem
• Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
• Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
• Matrix Completion-Based Channel Estimation for MmWave Communication Systems With Array-Inherent Impairments
• Sparse Representation of Astronomical Images
• Mismatch and resolution in compressive imaging
• Fast Algorithms for Demixing Sparse Signals from Nonlinear Observations
• Sample Complexity of Total Variation Minimization
• Analysis-based sparse reconstruction with synthesis-based solvers
• Efficient Least Residual Greedy Algorithms for Sparse Recovery
• Greedy Approximate Projection for Magnetic Resonance Fingerprinting with Partial Volumes
• Convolutional Sparse Coding Fast Approximation with Application to Seismic Reflectivity Estimation
• Utilizing the Structure of the Curvelet Transform with Compressed Sensing
• Improved Recovery of Analysis Sparse Vectors in Presence of Prior Information
• Learning to Scan: A Deep Reinforcement Learning Approach for Personalized Scanning in CT Imaging
• A Compressed Sampling and Dictionary Learning Framework for WDM-Based Distributed Fiber Sensing
• Localization of Sound Sources in a Room with One Microphone
• Compressive Imaging and Characterization of Sparse Light Deflection Maps