Compressed Sensing with General Frames via Optimal-dual-based ${\ell }_1$-analysis

Abstract

Compressed sensing with sparse frame representations is seen to have much greater range of practical applications than that with orthonormal bases. In such settings, one approach to recover the signal is known as ${\ell }_1$-analysis. We expand in this article the performance analysis of this approach by providing a weaker recovery condition than existing results in the literature. Our analysis is also broadly based on general frames and alternative dual frames (as analysis operators). As one application to such a general-dual-based approach and performance analysis, an optimal-dual-based technique is proposed to demonstrate the effectiveness of using alternative dual frames as analysis operators. An iterative algorithm is outlined for solving the optimal-dual-based ${\ell }_1$-analysis problem. The effectiveness of the proposed method and algorithm is demonstrated through several experiments.

34 pages, 8 figures. To appear in IEEE Transactions on Information Theory

References in corpus (1)

• Compressed Sensing with Coherent and Redundant Dictionaries

Cited by in corpus (13)

• Near-optimal compressed sensing guarantees for total variation minimization
• ${\ell }^1$-Analysis Minimization and Generalized (Co-)Sparsity: When Does Recovery Succeed?
• One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations
• Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
• Compressed Sensing with 1D Total Variation: Breaking Sample Complexity Barriers via Non-Uniform Recovery
• Sparse Signal Separation in Redundant Dictionaries
• Efficient Least Residual Greedy Algorithms for Sparse Recovery
• Compressive Sensing with Redundant Dictionaries and Structured Measurements
• Restricted $q$-Isometry Properties Adapted to Frames for Nonconvex $l_q$-Analysis
• Local sparsity and recovery of fusion frames structured signals
• New sufficient conditions of signal recovery with tight frames via $l_1$-analysis
• Spark Level Sparsity and the ${\ell }_1$ Tail Minimization
• A Nonconvex Approach for Structured Sparse Learning