English
Related papers

Related papers: Almost lossless analog signal separation and proba…

200 papers

Existing convex relaxation-based approaches to reconstruction in compressed sensing assume that noise in the measurements is independent of the signal of interest. We consider the case of noise being linearly correlated with the signal and…

Information Theory · Computer Science 2014-01-03 Thomas Arildsen , Torben Larsen

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

This paper considers the problem of recovering a structured signal from a relatively small number of noisy measurements with the aid of a similar signal which is known beforehand. We propose a new approach to integrate prior information…

Information Theory · Computer Science 2018-08-06 Xu Zhang , Wei Cui , Yulong Liu

We address the problem of estimating time and frequency shifts of a known waveform in the presence of multiple measurement vectors (MMVs). This problem naturally arises in radar imaging and wireless communications. Specifically, a signal…

Information Theory · Computer Science 2021-03-01 Maral Safari , Sajad Daei , Farzan Haddadi

Heisenberg's uncertainty principle has recently led to general measurement uncertainty relations for quantum systems: incompatible observables can be measured jointly or in sequence only with some unavoidable approximation, which can be…

Quantum Physics · Physics 2017-06-27 Alberto Barchielli , Matteo Gregoratti , Alessandro Toigo

In compressed sensing the goal is to recover a signal from as few as possible noisy, linear measurements. The general assumption is that the signal has only a few non-zero entries. The recovery can be performed by multiple different…

Information Theory · Computer Science 2020-10-07 Hendrik Bernd Petersen , Bubacarr Bah , Peter Jung

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

This paper investigates the problem of signal estimation from undersampled noisy sub-Gaussian measurements under the assumption of a cosparse model. Based on generalized notions of sparsity, we derive novel recovery guarantees for the…

Information Theory · Computer Science 2021-02-23 Martin Genzel , Gitta Kutyniok , Maximilian März

We consider the inverse problem of recovering an unknown functional parameter $u$ in a separable Banach space, from a noisy observation $y$ of its image through a known possibly non-linear ill-posed map ${\mathcal G}$. The data $y$ is…

Statistics Theory · Mathematics 2018-03-14 Sergios Agapiou , Martin Burger , Masoumeh Dashti , Tapio Helin

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such…

Numerical Analysis · Mathematics 2015-06-11 Deanna Needell , Rachel Ward

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

The problem of recovering signals of high complexity from low quality sensing devices is analyzed via a combination of tools from signal processing and harmonic analysis. By using the rich structure offered by the recent development in…

Information Theory · Computer Science 2020-03-16 Roza Aceska , Jean-Luc Bouchot , Shidong Li

We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An uncertainty relation for block-sparse signals is derived, based on a block-coherence measure, which we…

Information Theory · Computer Science 2015-05-13 Yonina C. Eldar , Patrick Kuppinger , Helmut Bölcskei

We derive fundamental sample complexity bounds for recovering sparse and structured signals for linear and nonlinear observation models including sparse regression, group testing, multivariate regression and problems with missing features.…

Information Theory · Computer Science 2017-02-17 Cem Aksoylar , George Atia , Venkatesh Saligrama

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in…

Numerical Analysis · Mathematics 2024-04-19 Phuoc-Truong Huynh , Konstantin Pieper , Daniel Walter

We consider the problem of reconstructing a sparse signal $x^0\in\R^n$ from a limited number of linear measurements. Given $m$ randomly selected samples of $U x^0$, where $U$ is an orthonormal matrix, we show that $\ell_1$ minimization…

Statistics Theory · Mathematics 2009-11-11 Emmanuel Candes , Justin Romberg

Partial differential equations are central to describing many physical phenomena. In many applications these phenomena are observed through a sensor network, with the aim of inferring their underlying properties. Leveraging from certain…

Information Theory · Computer Science 2017-11-22 John Murray-Bruce , Pier Luigi Dragotti

This letter investigates the joint recovery of a frequency-sparse signal ensemble sharing a common frequency-sparse component from the collection of their compressed measurements. Unlike conventional arts in compressed sensing, the…

Information Theory · Computer Science 2015-06-22 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Peilin Liu , Wenxian Yu

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp
‹ Prev 1 4 5 6 7 8 10 Next ›