English
Related papers

Related papers: Generalized Line Spectral Estimation via Convex Op…

200 papers

We introduce a convex approach for mixed linear regression over $d$ features. This approach is a second-order cone program, based on L1 minimization, which assigns an estimate regression coefficient in $\mathbb{R}^{d}$ for each data point.…

Optimization and Control · Mathematics 2019-01-09 Paul Hand , Babhru Joshi

A recently proposed convex formulation of the phase retrieval problem estimates the unknown signal by solving a simple linear program. This new scheme, known as PhaseMax, is computationally efficient compared to standard convex relaxation…

Information Theory · Computer Science 2017-10-17 Oussama Dhifallah , Christos Thrampoulidis , Yue M. Lu

A fruitful approach for solving signal deconvolution problems consists of resorting to a frame-based convex variational formulation. In this context, parallel proximal algorithms and related alternating direction methods of multipliers have…

Other Computer Science · Computer Science 2015-05-28 Nelly Pustelnik , Jean-Christophe Pesquet , Caroline Chaux

Reconstructing the unknown spectrum of a given X-ray source is a common problem in a wide range of X-ray imaging tasks. For high-energy sources, transmission measurements are mostly used to recover the X-ray spectrum, as a solution to an…

Applied Physics · Physics 2023-07-13 Arthur Walker , Alexandre Friou , Kevin Ginsburger

Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide…

Information Theory · Computer Science 2018-06-12 Ramina Ghods , Andrew S. Lan , Tom Goldstein , Christoph Studer

We consider the problem of recovering fusion frame sparse signals from incomplete measurements. These signals are composed of a small number of nonzero blocks taken from a family of subspaces. First, we show that, by using a-priori…

Information Theory · Computer Science 2014-07-30 Ulaş Ayaz , Sjoerd Dirksen , Holger Rauhut

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

We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y. We show that the partially linear minimum mean squared error (PLMMSE) estimator does not require knowing…

Information Theory · Computer Science 2015-05-27 Tomer Michaeli , Daniel Sigalov , Yonina C. Eldar

We consider the problem of reconstructing two signals from the autocorrelation and cross-correlation measurements. This inverse problem is a fundamental one in signal processing, and arises in many applications, including phase retrieval…

Information Theory · Computer Science 2016-10-11 Kishore Jaganathan , Babak Hassibi

This paper considers the problem of recovering the delays and amplitudes of a weighted superposition of pulses. This problem is motivated by a variety of applications such as ultrasound and radar. We show that for univariate and bivariate…

Information Theory · Computer Science 2016-04-28 Tamir Bendory , Shai Dekel , Arie Feuer

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

In this manuscript, we analyze the sparse signal recovery (compressive sensing) problem from the perspective of convex optimization by stochastic proximal gradient descent. This view allows us to significantly simplify the recovery analysis…

Data Structures and Algorithms · Computer Science 2013-04-19 Rong Jin , Tianbao Yang , Shenghuo Zhu

We consider the line spectral estimation problem which aims to recover a mixture of complex sinusoids from a small number of randomly observed time domain samples. Compressed sensing methods formulates line spectral estimation as a sparse…

Numerical Analysis · Computer Science 2015-12-11 Jun Fang , Linxiao Yang , Hongbin Li

In this paper we build provably near-optimal, in the minimax sense, estimates of linear forms and, more generally, "$N$-convex functionals" (the simplest example being the maximum of several fractional-linear functions) of unknown "signal"…

Statistics Theory · Mathematics 2019-04-01 Anatoli Juditsky , Arkadi Nemirovski

Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for…

Optimization and Control · Mathematics 2014-12-09 Samuel Vaiter , Gabriel Peyré , Jalal M. Fadili

The problem of recovering a signal from the magnitude of its short-time Fourier transform (STFT) is a longstanding one in audio signal processing. Existing approaches rely on heuristics that often perform poorly because of the nonconvexity…

Applications · Statistics 2012-09-11 Dennis L. Sun , Julius O. Smith

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm…

Information Theory · Computer Science 2012-06-05 Yipeng Liu , Ivan Gligorijevic , Vladimir Matic , Maarten De Vos , Sabine Van Huffel

This work investigates the problem of signal recovery from undersampled noisy sub-Gaussian measurements under the assumption of a synthesis-based sparsity model. Solving the $\ell^1$-synthesis basis pursuit allows for a simultaneous…

Information Theory · Computer Science 2020-04-16 Maximilian März , Claire Boyer , Jonas Kahn , Pierre Weiss

In this paper, we consider the problem of sparse recovery from nonlinear measurements, which has applications in state estimation and bad data detection for power networks. An iterative mixed $\ell_1$ and $\ell_2$ convex program is used to…

Information Theory · Computer Science 2013-01-08 Weiyu Xu , Meng Wang , Jianfeng Cai , Ao Tang