English
Related papers

Related papers: Signal reconstruction in linear mixing systems wit…

200 papers

We propose a method to reconstruct sparse signals degraded by a nonlinear distortion and acquired at a limited sampling rate. Our method formulates the reconstruction problem as a nonconvex minimization of the sum of a data fitting term and…

Optimization and Control · Mathematics 2023-01-19 Arthur Marmin , Marc Castella , Jean-Christophe Pesquet , Laurent Duval

The article concerns compressed sensing methods in the quaternion algebra. We prove that it is possible to uniquely reconstruct - by $\ell_1$-norm minimization - a sparse quaternion signal from a limited number of its linear measurements,…

Functional Analysis · Mathematics 2017-05-23 Agnieszka Badeńska , Łukasz Błaszczyk

We revisit the source image estimation problem from blind source separation (BSS). We generalize the traditional minimum distortion principle to maximum likelihood estimation with a model for the residual spectrograms. Because residual…

Audio and Speech Processing · Electrical Eng. & Systems 2020-09-14 Robin Scheibler

We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation. The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum…

Machine Learning · Statistics 2013-08-27 Zhao Song , Aleksandar Dogandzic

The typical approach for recovery of spatially correlated signals is regularized least squares with a coupled regularization term. In the Bayesian framework, this algorithm is seen as a maximum-a-posterior estimator whose postulated prior…

Information Theory · Computer Science 2018-05-31 Ali Bereyhi , Saeid Haghighatshoar , Ralf R. Müller

Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In…

Information Theory · Computer Science 2016-12-09 Deanna Needell , Rayan Saab , Tina Woolf

In compressed sensing one measures sparse signals directly in a compressed form via a linear transform and then reconstructs the original signal. However, it is often the case that the linear transform itself is known only approximately, a…

Information Theory · Computer Science 2013-11-13 Florent Krzakala , Marc Mézard , Lenka Zdeborová

We study the problem of demixing a pair of sparse signals from noisy, nonlinear observations of their superposition. Mathematically, we consider a nonlinear signal observation model, $y_i = g(a_i^Tx) + e_i, \ i=1,\ldots,m$, where $x = \Phi…

Machine Learning · Statistics 2017-08-02 Mohammadreza Soltani , Chinmay Hegde

We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising…

Machine Learning · Statistics 2013-04-02 Franz J. Király , Louis Theran

The problem of estimating the accuracy of signal reconstruction from threshold-based sampling, by only taking the sampling output into account, is addressed. The approach is based on re-sampling the reconstructed signal and the application…

Signal Processing · Electrical Eng. & Systems 2018-11-06 Bernhard Moser

Programmable linear optical interferometers are promising for classical and quantum applications. Their integrated design makes it possible to create more scalable and stable devices. To use them in practice, one has to reconstruct the…

Quantum Physics · Physics 2024-01-12 B. I. Bantysh , A. Yu. Chernyavskiy , S. A. Fldzhyan , Yu. I. Bogdanov

The article concerns compressed sensing methods in the quaternion algebra. We prove that it is possible to uniquely reconstruct - by $\ell_1$ norm minimization - a sparse quaternion signal from a limited number of its real linear…

Functional Analysis · Mathematics 2016-05-26 Agnieszka Badenska , Łukasz Błaszczyk

We present a general architecture for the acquisition of ensembles of correlated signals. The signals are multiplexed onto a single line by mixing each one against a different code and then adding them together, and the resulting signal is…

Information Theory · Computer Science 2018-06-13 Ali Ahmed , Justin Romberg

Consider the compressed sensing setup where the support $s^*$ of an $m$-sparse $d$-dimensional signal $x$ is to be recovered from $n$ linear measurements with a given algorithm. Suppose that the measurements are such that the algorithm does…

Information Theory · Computer Science 2021-03-10 Mohammad Mehrabi , Aslan Tchamkerten

This paper considers the linear inverse problem where we wish to estimate a structured signal $x$ from its corrupted observations. When the problem is ill-posed, it is natural to make use of a convex function $f(\cdot)$ that exploits the…

Information Theory · Computer Science 2013-12-06 Samet Oymak , Christos Thrampoulidis , Babak Hassibi

Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical…

Statistics Theory · Mathematics 2015-06-05 Ahmed A. Quadeer , Tareq Y. Al-Naffouri

In this paper, we study the support recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when multiple support estimate sets with different accuracy are available. We identify…

Information Theory · Computer Science 2012-06-01 Hassan Mansour , Ozgur Yilmaz

In this paper, compressed sensing with noisy measurements is addressed. The theoretically optimal reconstruction error is studied by evaluating Tanaka's equation. The main contribution is to show that in several regions, which have…

Information Theory · Computer Science 2013-02-19 Junan Zhu , Dror Baron

$\ell_1$ minimization is often used for finding the sparse solutions of an under-determined linear system. In this paper we focus on finding sharp performance bounds on recovering approximately sparse signals using $\ell_1$ minimization,…

Information Theory · Computer Science 2010-05-21 Weiyu Xu , Babak Hassibi

We consider the problem of signal reconstruction from quadratic measurements that are encoded as +1 or -1 depending on whether they exceed a predetermined positive threshold or not. Binary measurements are fast to acquire and inexpensive in…

Information Theory · Computer Science 2018-03-14 Subhadip Mukherjee , Chandra Sekhar Seelamantula