Improved sparsity thresholds through dictionary splitting

Authors

Patrick Kuppinger, Giuseppe Durisi, and Helmut Bölcskei

Reference

Proc. of IEEE Information Theory Workshop, Taormina, Italy, pp. 338-342, Oct. 2009, (invited paper)

DOI: 10.1109/ITW.2009.5351511

[BibTeX, LaTeX, and HTML Reference]

Abstract

Known sparsity thresholds for basis pursuit to deliver the maximally sparse solution of the compressed sensing recovery problem typically depend on the dictionary's coherence. While the coherence is easy to compute, it can lead to rather pessimistic thresholds as it captures only limited information about the dictionary. In this paper, we show that viewing the dictionary as the concatenation of two general sub-dictionaries leads to provably better sparsity thresholds---that are explicit in the coherence parameters of the dictionary and of the individual sub-dictionaries. Equivalently, our results can be interpreted as sparsity thresholds for dictionaries that are unions of two general (i.e., not necessarily orthonormal) sub-dictionaries.


Download this document:

 

Copyright Notice: © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.