English
Related papers

Related papers: Inferring Sparsity: Compressed Sensing using Gener…

200 papers

Federated learning is a privacy-preserving approach to train a global model at a central server by collaborating with wireless devices, each with its own local training data set. In this paper, we present a compressive sensing approach for…

Signal Processing · Electrical Eng. & Systems 2020-08-06 Yo-Seb Jeon , Mohammad Mohammadi Amiri , Jun Li , H. Vincent Poor

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

Methodology · Statistics 2007-11-13 Emmanuel J. Candes , Michael B. Wakin , Stephen P. Boyd

Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…

Information Theory · Computer Science 2014-05-02 Armin Eftekhari , Michael B. Wakin

In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models,…

Information Theory · Computer Science 2013-03-29 Marco F. Duarte , Michael B. Wakin , Dror Baron , Shriram Sarvotham , Richard G. Baraniuk

This thesis consists of original contributions in the area of digital signal processing. The reconstruction of signals sparse (highly concentrated) in various transform domains is the primary problem analyzed in the thesis. The considered…

Signal Processing · Electrical Eng. & Systems 2019-09-19 Milos Brajovic

In this paper, we study the compressed sensing reconstruction problem with generalized elastic net prior (GENP), where a sparse signal is sampled via a noisy underdetermined linear observation system, and an additional initial estimation of…

Information Theory · Computer Science 2015-02-19 Xing Wang , Jie Liang

We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incoherent" measurements, in real-time. The signals are sparse in some…

Information Theory · Computer Science 2016-11-17 Namrata Vaswani

We study the problem of signal estimation from non-linear observations when the signal belongs to a low-dimensional set buried in a high-dimensional space. A rough heuristic often used in practice postulates that non-linear observations may…

Information Theory · Computer Science 2015-11-17 Yaniv Plan , Roman Vershynin

Compressed sensing (CS) is an innovative technique allowing to represent signals through a small number of their linear projections. Hence, CS can be thought of as a natural candidate for acquisition of multidimensional signals, as the…

Information Theory · Computer Science 2014-03-06 Giulio Coluccia , Simeon Kamden-Kuiteng , Andrea Abrardo , Mauro Barni , Enrico Magli

Optimal sensor placement is a central challenge in the design, prediction, estimation, and control of high-dimensional systems. High-dimensional states can often leverage a latent low-dimensional representation, and this inherent…

Optimization and Control · Mathematics 2020-05-18 Krithika Manohar , Bingni W. Brunton , J. Nathan Kutz , Steven L. Brunton

Growing set of optimization and regression techniques, based upon sparse representations of signals, to build models from data sets has received widespread attention recently with the advent of compressed sensing. This paper deals with the…

Dynamical Systems · Mathematics 2021-10-26 Amartya Mukherjee , Yusuf Aydogdu , Thambirajah Ravichandran , Navaratnam Sri Namachchivaya

We define a message-passing algorithm for computing magnetizations in Restricted Boltzmann machines, which are Ising models on bipartite graphs introduced as neural network models for probability distributions over spin configurations. To…

Machine Learning · Computer Science 2020-12-02 Burak Çakmak , Manfred Opper

Compressed sensing allows for the recovery of sparse signals from few measurements, whose number is proportional to the sparsity of the unknown signal, up to logarithmic factors. The classical theory typically considers either random linear…

Functional Analysis · Mathematics 2025-04-02 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan

We examine the problem of selecting a small set of linear measurements for reconstructing high-dimensional signals. Well-established methods for optimizing such measurements include principal component analysis (PCA), independent component…

Computer Vision and Pattern Recognition · Computer Science 2025-08-06 Ling-Qi Zhang , Zahra Kadkhodaie , Eero P. Simoncelli , David H. Brainard

The theory of compressive sensing (CS) asserts that an unknown signal $\mathbf{x} \in \mathbb{C}^N$ can be accurately recovered from $m$ measurements with $m\ll N$ provided that $\mathbf{x}$ is sparse. Most of the recovery algorithms need…

Methodology · Statistics 2017-10-12 Jianfeng Wang , Zhiyong Zhou , Anders Garpebring , Jun Yu

Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can…

Information Theory · Computer Science 2017-04-19 Sajad Daei , Farzan Haddadi

This paper studies the problem of reconstructing sparse or compressible signals from compressed sensing measurements that have undergone nonuniform quantization. Previous approaches to this Quantized Compressed Sensing (QCS) problem based…

Information Theory · Computer Science 2013-05-17 L. Jacques , D. K. Hammond , M. J. Fadili

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K << N elements from an N-dimensional basis. Instead of taking periodic…

Information Theory · Computer Science 2016-11-17 Richard G. Baraniuk , Volkan Cevher , Marco F. Duarte , Chinmay Hegde

Compressed sensing is an imaging paradigm that allows one to invert an underdetermined linear system by imposing the a priori knowledge that the sought after solution is sparse (i.e., mostly zeros). Previous works have shown that if one…

Image and Video Processing · Electrical Eng. & Systems 2023-12-05 Nicholas Dwork , Erin K. Englund