Recovery of Sparsely Corrupted Signals

DOI10.1109/TIT.2011.2179701zbMATH Open1365.94185OpenAlexW2078776517MaRDI QIDQ5271972FDOQ5271972

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

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.1621

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Abstract: 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.

Cited In (24)

• Sharp recovery bounds for convex demixing, with applications
• Signal recovery via TV-type energies
• Support Recovery for Sparse Signals With Unknown Non-Stationary Modulation
• Phase Transitions in Recovery of Structured Signals From Corrupted Measurements
• Reconstruction of sparse signals in impulsive disturbance environments
• A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
• Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• Reconstruction of functions from prescribed proximal points
• Stable restoration and separation of approximately sparse signals
• Compressed data separation via unconstrained l1-split analysis
• Robust multi-image processing with optimal sparse regularization
• Title not available (Why is no real title available?)
• Performance analysis for unconstrained analysis based approaches
• A general theory for subspace-sparse recovery
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• Compressed sensing and matrix completion with constant proportion of corruptions
• Correcting for unknown errors in sparse high-dimensional function approximation
• Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
• A Lorentzian IHT for complex-valued sparse signal recovery
• Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
• Signal recovery by stochastic optimization
• Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
• Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm

This page was built for publication: Recovery of Sparsely Corrupted Signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271972)