English
Related papers

Related papers: Restricted Isometry Property in Quantized Network …

200 papers

The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed…

Optimization and Control · Mathematics 2016-11-15 Sophie M. Fosson , Javier Matamoros , Carles Anton-Haro , Enrico Magli

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

In this paper, we address the question of information preservation in ill-posed, non-linear inverse problems, assuming that the measured data is close to a low-dimensional model set. We provide necessary and sufficient conditions for the…

Information Theory · Computer Science 2018-12-05 Nicolas Keriven , Rémi Gribonval

The restricted isometry property (RIP) is essential for the linear map to guarantee the successful recovery of low-rank matrices. The existing works show that the linear map generated by the measurement matrices with independent and…

Information Theory · Computer Science 2024-05-08 Wei Zhang , Zhenni Wang

In this paper, mathematical bases for non-adaptive joint source network coding of correlated messages in a Bayesian scenario are studied. Specifically, we introduce one-step Quantized Network Coding (QNC), which is a hybrid combination of…

Information Theory · Computer Science 2012-10-30 Mahdy nabaee , Fabrice Labeau

Dimensionality reduction is a popular approach to tackle high-dimensional data with low-dimensional nature. Subspace Restricted Isometry Property, a newly-proposed concept, has proved to be a useful tool in analyzing the effect of…

Information Theory · Computer Science 2019-10-01 Xingyu Xv , Gen Li , Yuantao Gu

Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy the…

Computational Complexity · Computer Science 2011-10-18 Pascal Koiran , Anastasios Zouzias

We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery…

Information Theory · Computer Science 2014-12-05 Hassan Mansour , Rayan Saab

The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been…

Information Theory · Computer Science 2015-06-15 Liqing Xu , Hao Chen

In compressed sensing, the restricted isometry property (RIP) on $M \times N$ sensing matrices (where $M < N$) guarantees efficient reconstruction of sparse vectors. A matrix has the $(s,\delta)$-$\mathsf{RIP}$ property if behaves as a…

Statistics Theory · Mathematics 2021-04-23 Yunzi Ding , Dmitriy Kunisky , Alexander S. Wein , Afonso S. Bandeira

In this paper we propose a new framework for distributed source coding of structured sources, such as sparse signals. Our framework capitalizes on recent advances in the theory of linear inverse problems and signal representations using…

Information Theory · Computer Science 2020-12-02 Maxim Goukhshtein , Petros T. Boufounos , Toshiaki Koike-Akino , Stark C. Draper

Recovery error bounds of tail-minimization and the rate of convergence of an efficient proximal alternating algorithm for sparse signal recovery are considered in this article. Tail-minimization focuses on minimizing the energy in the…

Information Theory · Computer Science 2025-01-28 Meng Huang , Shidong Li

A quantized message passing decoding algorithm for low-density parity-check codes is presented. The algorithm relies on the min approximation at the check nodes, and on modelling the variable node inbound messages as observations of an…

Information Theory · Computer Science 2021-01-01 Emna Ben Yacoub

This paper considers a network where a node wishes to transmit a source message to a legitimate receiver in the presence of an eavesdropper. The transmitter secures its transmissions employing a sparse implementation of Random Linear…

Information Theory · Computer Science 2019-03-25 Andrea Tassi , Robert J. Piechocki , Andrew Nix

The Restricted Isometry Property (RIP) is a fundamental property of a matrix which enables sparse recovery. Informally, an $m \times n$ matrix satisfies RIP of order $k$ for the $\ell_p$ norm, if $\|Ax\|_p \approx \|x\|_p$ for every vector…

Data Structures and Algorithms · Computer Science 2015-02-24 Zeyuan Allen-Zhu , Rati Gelashvili , Ilya Razenshteyn

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 investigate the sign-linear embeddings of 1-bit compressed sensing given by Gaussian measurements. One can give short arguments concerning a Restricted Isometry Property of such maps using Vapnik-Chervonenkis dimension of sparse…

Classical Analysis and ODEs · Mathematics 2016-04-13 Scott Spencer

In the Compressed Sensing community, it is well known that given a matrix $X \in \mathbb R^{n\times p}$ with $\ell_2$ normalized columns, the Restricted Isometry Property (RIP) implies the Null Space Property (NSP). It is also well known…

Statistics Theory · Mathematics 2016-06-30 Stéphane Chrétien , Zhen Wai Olivier Ho

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distribution F; it includes all models - e.g.…

Information Theory · Computer Science 2010-11-23 Emmanuel J. Candes , Yaniv Plan