Recovery of sparsely corrupted signals


Christoph Studer, Patrick Kuppinger, Graeme Pope, and Helmut Bölcskei


IEEE Transactions on Information Theory, Vol. 58, No. 5, pp. 3115-3130, May 2012.

DOI: 10.1109/TIT.2011.2179701

[BibTeX, LaTeX, and HTML Reference]


We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary. This setup covers a wide range of applications, such as image inpainting, super-resolution, signal separation, and recovery of signals that are impaired by, e.g., clipping, impulse noise, or narrowband interference. We present deterministic recovery guarantees based on a novel uncertainty relation for pairs of general dictionaries and we provide corresponding practicable recovery algorithms. The recovery guarantees we find depend on the signal and noise sparsity levels, on the coherence parameters of the involved dictionaries, and on the amount of prior knowledge about the signal and noise support sets.


Uncertainty relations, signal restoration, signal separation, coherence-based recovery guarantees, l1-norm minimization, greedy algorithms

Download this document:


Copyright Notice: © 2012 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.