Blind Compressed Sensing

DOI10.1109/TIT.2011.2165821MaRDI QIDQ5272317zbMATH OpenOpenAlexFDO

Authors Sivan Gleichman, Y. C. Eldar

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/1002.2586

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Sampling theory in information and communication theory (94A20)

Abstract: The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is essential for the recovery process. This work introduces the concept of blind compressed sensing, which avoids the need to know the sparsity basis in both the sampling and the recovery process. We suggest three possible constraints on the sparsity basis that can be added to the problem in order to make its solution unique. For each constraint we prove conditions for uniqueness, and suggest a simple method to retrieve the solution. Under the uniqueness conditions, and as long as the signals are sparse enough, we demonstrate through simulations that without knowing the sparsity basis our methods can achieve results similar to those of standard compressed sensing, which relay on prior knowledge of the sparsity basis. This offers a general sampling and reconstruction system that fits all sparse signals, regardless of the sparsity basis, under the conditions and constraints presented in this work.

Cited in

(13)

• Data-driven methods for quantitative imaging
• Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
• Compressed dictionary learning
• Sparse approximation based on a random overcomplete basis
• FRIST-flipping and rotation invariant sparsifying transform learning and applications
• Compressive Blind Image Deconvolution
• Sub-Nyquist sampling and reconstruction model of LFM signals based on blind compressed sensing in FRFT domain
• Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
• Fast algorithm for constrained linear inverse problems
• A survey on compressive sensing: classical results and recent advancements
• Robust sparse signal reconstructions against basis mismatch and their applications
• A class of cross-layer optimization design for congestion and energy efficiency with compressed sensing in wireless sensing networks
• Dynamical sampling in multiply generated shift-invariant spaces

This page was built for publication: Blind Compressed Sensing

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