Document Type
Article - postprint
Department
Mathematics (CMC)
Publication Date
7-16-2013
Abstract
Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an orthonormal basis. In practice, however, there are many signals that cannot be sparsely represented or approximated using an orthonormal basis, but that do have sparse representations in a redundant dictionary. Standard results in CS can sometimes be extended to handle this case provided that the dictionary is sufficiently incoherent or well conditioned, but these approaches fail to address the case of a truly redundant or overcomplete dictionary. In this paper, we describe a variant of the iterative recovery algorithm CoSaMP for this more challenging setting. We utilize the mbi D-RIP, a condition on the sensing matrix analogous to the well-known restricted isometry property. In contrast to prior work, the method and analysis are “signal-focused”; that is, they are oriented around recovering the signal rather than its dictionary coefficients. Under the assumption that we have a near-optimal scheme for projecting vectors in signal space onto the model family of candidate sparse signals, we provide provable recovery guarantees. Developing a practical algorithm that can provably compute the required near-optimal projections remains a significant open problem, but we include simulation results using various heuristics that empirically exhibit superior performance to traditional recovery algorithms.
Rights Information
© 2013 IEEE
Terms of Use & License Information
DOI
10.1109/TIT.2013.2273491
Recommended Citation
Davenport, M. A., Needell, D., Wakin, M. B., "Signal Space CoSaMP for Sparse Recovery with Redundant Dictionaries", IEEE Transactions on Information Theory, vol. 59, iss. 10, 6820 - 6829, 2013. doi: 10.1109/TIT.2013.2273491
