English
Related papers

Related papers: Reconstruction of Randomly Sampled Sparse Signals …

200 papers

We propose a robust and efficient approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on…

Information Theory · Computer Science 2015-10-28 Sohail Bahmani , Justin Romberg

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement…

Statistical Mechanics · Physics 2012-08-20 Florent Krzakala , Marc Mézard , François Sausset , Yifan Sun , Lenka Zdeborová

The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics. In the compressed sensing framework, tailored methods have been…

Optimization and Control · Mathematics 2019-07-24 Sophie M. Fosson , Mohammad Abuabiah

We consider the problem of recovering signals from their power spectral density. This is a classical problem referred to in literature as the phase retrieval problem, and is of paramount importance in many fields of applied sciences. In…

Information Theory · Computer Science 2013-11-12 Kishore Jaganathan , Samet Oymak , Babak Hassibi

We address the problem of sparse recovery in an online setting, where random linear measurements of a sparse signal are revealed sequentially and the objective is to recover the underlying signal. We propose a reweighted least squares (RLS)…

Machine Learning · Computer Science 2017-06-30 Subhadip Mukherjee , Deepak R. , Huaijin Chen , Ashok Veeraraghavan , Chandra Sekhar Seelamantula

There have been a number of studies on sparse signal recovery from one-bit quantized measurements. Nevertheless, little attention has been paid to the choice of the quantization thresholds and its impact on the signal recovery performance.…

Information Theory · Computer Science 2013-05-21 Jun Fang , Yanning Shen , Hongbin Li

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

We study the problem of recovering the underlining sparse signals from clean or noisy phaseless measurements. Due to the sparse prior of signals, we adopt an L0regularized variational model to ensure only a small number of nonzero elements…

Optimization and Control · Mathematics 2016-12-09 Yuping Duan , Chunlin Wu , Zhi-Feng Pang , Huibin Chang

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

This paper investigates the problem of recovering the support of structured signals via adaptive compressive sensing. We examine several classes of structured support sets, and characterize the fundamental limits of accurately recovering…

Statistics Theory · Mathematics 2016-09-05 Rui M. Castro , Ervin Tánczos

In sparse recovery, the unique sparsest solution to an under-determined system of linear equations is of main interest. This scheme is commonly proposed to be applied to signal acquisition. In most cases, the signals are not sparse…

Information Theory · Computer Science 2013-07-16 Henning Zörlein , Faisal Akram , Martin Bossert

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Information Theory · Computer Science 2013-06-11 Atul Divekar , Deanna Needell

Measurement samples are often taken in various monitoring applications. To reduce the sensing cost, it is desirable to achieve better sensing quality while using fewer samples. Compressive Sensing (CS) technique finds its role when the…

Information Theory · Computer Science 2016-11-18 Ying Li , Kun Xie , Xin Wang

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals…

Information Theory · Computer Science 2013-02-07 Lixin Shen , Bruce W. Suter

Signal reconstruction in compressive sensing involves finding a sparse solution that satisfies a set of linear constraints. Several approaches to this problem have been considered in existing reconstruction algorithms. They each provide a…

Information Theory · Computer Science 2013-03-15 Christian Schou Oxvig , Patrick Steffen Pedersen , Thomas Arildsen , Torben Larsen

We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how the data was generated. For example, a sparse Green's…

Optimization and Control · Mathematics 2012-12-06 Aleksandr Y. Aravkin , Tristan van Leeuwen , Ning Tu

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal…

Computer Vision and Pattern Recognition · Computer Science 2015-06-11 Virginia Estellers , Jean-Philippe Thiran , Xavier Bresson

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…

Information Theory · Computer Science 2015-07-24 Yuanxin Li , Yuejie Chi

We consider the problem of recovering a signal $\mathbf{x}^* \in \mathbf{R}^n$, from magnitude-only measurements $y_i = |\left\langle\mathbf{a}_i,\mathbf{x}^*\right\rangle|$ for $i=[m]$. Also called the phase retrieval, this is a…

Machine Learning · Statistics 2017-11-28 Gauri Jagatap , Chinmay Hegde