English
Related papers

Related papers: Phase transition in binary compressed sensing base…

200 papers

We consider the optimal quantization of compressive sensing measurements following the work on generalization of relaxed belief propagation (BP) for arbitrary measurement channels. Relaxed BP is an iterative reconstruction scheme inspired…

Information Theory · Computer Science 2016-11-15 Ulugbek Kamilov , Vivek K Goyal , Sundeep Rangan

The realisation of sensing modalities based on the principles of compressed sensing is often hindered by discrepancies between the mathematical model of its sensing operator, which is necessary during signal recovery, and its actual…

Information Theory · Computer Science 2018-02-21 Valerio Cambareri , Amirafshar Moshtaghpour , Laurent Jacques

In this paper, we propose majority voting neural networks for sparse signal recovery in binary compressed sensing. The majority voting neural network is composed of several independently trained feedforward neural networks employing the…

Information Theory · Computer Science 2016-11-01 Daisuke Ito , Tadashi Wadayama

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order…

Information Theory · Computer Science 2020-05-22 Ben Adcock , Claire Boyer , Simone Brugiapaglia

We introduce an efficient method for the reconstruction of the correlation between a compressively measured image and a phase-only filter. The proposed method is based on two properties of phase-only filtering: such filtering is a unitary…

Computer Vision and Pattern Recognition · Computer Science 2016-09-30 David Pastor-Calle , Anna Pastuszczak , Michal Mikolajczyk , Rafal Kotynski

Compressed sensing investigates the recovery of sparse signals from linear measurements. But often, in a wide range of applications, one is given only the absolute values (squared) of the linear measurements. Recovering such signals (not…

Functional Analysis · Mathematics 2015-09-29 Irena Bojarovska , Axel Flinth

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Suppose the signal x is realized by driving a k-sparse signal u through an arbitrary unknown stable discrete-linear time invariant system H. These types of processes arise naturally in Reflection Seismology. In this paper we are interested…

Information Theory · Computer Science 2016-09-08 V. Saligrama , M. Zhao

The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive…

Machine Learning · Statistics 2020-06-23 Zhaoqiang Liu , Selwyn Gomes , Avtansh Tiwari , Jonathan Scarlett

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope

We improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. 1) In compressed sensing, we show that if the m \times n sensing matrix has…

Information Theory · Computer Science 2012-01-19 Xiaodong Li

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

Compressed sensing (CS) is a sampling paradigm that allows to simultaneously measure and compress signals that are sparse or compressible in some domain. The choice of a sensing matrix that carries out the measurement has a defining impact…

Information Theory · Computer Science 2017-08-02 Anastasia Lavrenko , Florian Roemer , Giovanni Del Galdo , Reiner Thomae

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

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

This paper addresses the topic of robust Bayesian compressed sensing over finite fields. For stationary and ergodic sources, it provides asymptotic (with the size of the vector to estimate) necessary and sufficient conditions on the number…

Information Theory · Computer Science 2014-01-20 Wenjie Li , Francesca Bassi , Michel Kieffer

Distributed compressed sensing is concerned with representing an ensemble of jointly sparse signals using as few linear measurements as possible. Two novel joint reconstruction algorithms for distributed compressed sensing are presented in…

Information Theory · Computer Science 2014-05-22 Diego Valsesia , Giulio Coluccia , Enrico Magli

In this paper we study the quantization stage that is implicit in any compressed sensing signal acquisition paradigm. We propose using Sigma-Delta quantization and a subsequent reconstruction scheme based on convex optimization. We prove…

Information Theory · Computer Science 2015-04-02 Rayan Saab , Rongrong Wang , Ozgur Yilmaz

In many applications in compressed sensing, the measurement matrix is a Fourier matrix, i.e., it measures the Fourier transform of the underlying signal at some specified `base' frequencies $\{u_i\}_{i=1}^M$, where $M$ is the number of…

Information Theory · Computer Science 2018-02-09 Eeshan Malhotra , Himanshu Pandotra , Ajit Rajwade , Karthik S. Gurumoorthy

One-bit compressed sensing (1bCS) addresses the recovery of sparse signals from highly quantized measurements, retaining only the sign of each linear measurement. In the support recovery setting, the goal is to identify $\text{supp}(x)$,…

Information Theory · Computer Science 2026-04-14 Xiaxin Li , Arya Mazumdar
‹ Prev 1 8 9 10 Next ›