English
Related papers

Related papers: Reconstruction Guarantee Analysis of Binary Measur…

200 papers

Due to the many applications in Magnetic Resonance Imaging (MRI), Nuclear Magnetic Resonance (NMR), radio interferometry, helium atom scattering etc., the theory of compressed sensing with Fourier transform measurements has reached a mature…

Numerical Analysis · Mathematics 2021-03-31 Laura Thesing , Anders Christian Hansen

In this paper, the joint support recovery of several sparse signals whose supports present similarities is examined. Each sparse signal is acquired using the same noisy linear measurement process, which returns fewer observations than the…

Information Theory · Computer Science 2017-02-20 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

The Binary Iterative Hard Thresholding (BIHT) algorithm is a popular reconstruction method for one-bit compressed sensing due to its simplicity and fast empirical convergence. There have been several works about BIHT but a theoretical…

Information Theory · Computer Science 2020-12-24 Michael P. Friedlander , Halyun Jeong , Yaniv Plan , Ozgur Yilmaz

The performance of estimating the common support for jointly sparse signals based on their projections onto lower-dimensional space is analyzed. Support recovery is formulated as a multiple-hypothesis testing problem. Both upper and lower…

Information Theory · Computer Science 2009-11-05 Gongguo Tang , Arye Nehorai

In the recent past, binary similarity measures have been applied in solving biometric identification problems, including fingerprint, handwritten character detection, and in iris image recognition. The application of the relevant…

Computer Vision and Pattern Recognition · Computer Science 2023-07-04 Manoj Muniswamaiah , Tilak Agerwala , Charles C. Tappert

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

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

The many variants of the restricted isometry property (RIP) have proven to be crucial theoretical tools in the fields of compressed sensing and matrix completion. The study of extending compressed sensing to accommodate phaseless…

Information Theory · Computer Science 2014-04-16 Vladislav Voroninski , Zhiqiang Xu

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

We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal…

Information Theory · Computer Science 2014-12-23 Junan Zhu , Dror Baron , Marco F. Duarte

In this paper, we introduce a sparse approximation property of order $s$ for a measurement matrix ${\bf A}$: $$\|{\bf x}_s\|_2\le D \|{\bf A}{\bf x}\|_2+ \beta \frac{\sigma_s({\bf x})}{\sqrt{s}} \quad {\rm for\ all} \ {\bf x},$$ where ${\bf…

Information Theory · Computer Science 2015-05-28 Qiyu Sun

Binary matrix and ternary matrix are two types of popular sensing matrices in compressed sensing for their competitive performance and low computation. However, to the best of our knowledge, there seems no literature aiming at evaluating…

Information Theory · Computer Science 2014-02-10 Weizhi Lu , Kidiyo Kpalma , Joseph Ronsin

We demonstrate a simple greedy algorithm that can reliably recover a d-dimensional vector v from incomplete and inaccurate measurements x. Here our measurement matrix is an N by d matrix with N much smaller than d. Our algorithm,…

Numerical Analysis · Mathematics 2007-12-11 Deanna Needell , Roman Vershynin

While it is well known that the restricted isometry property (RIP) guarantees uniform sparse recovery from noisy linear measurements, uniform recovery of structured signals from nonlinear observations remains much less understood. This…

Information Theory · Computer Science 2026-04-23 Pedro Abdalla , Radu Balan , Junren Chen

The restricted isometry property (RIP) is a well-known condition that guarantees the absence of spurious local minima in low-rank matrix recovery problems with linear measurements. In this paper, we introduce a novel property named bound…

Optimization and Control · Mathematics 2020-12-14 Yingjie Bi , Javad Lavaei

This paper is concerned with the problem of reconstructing an infinite-dimensional signal from a limited number of linear measurements. In particular, we show that for binary measurements (modelled with Walsh functions and Hadamard…

Numerical Analysis · Mathematics 2019-08-02 Anders Christian Hansen , Laura Thesing

For massive multiple-input multiple-output (MIMO) systems operating in frequency-division duplex mode, downlink channel state information (CSI) acquisition will incur large overhead. This overhead is substantially reduced when sparse…

Signal Processing · Electrical Eng. & Systems 2022-03-29 Pengxia Wu , Julian Cheng

Inspired by significant real-life applications, in particular, sparse phase retrieval and sparse pulsation frequency detection in Asteroseismology, we investigate a general framework for compressed sensing, where the measurements are…

Numerical Analysis · Mathematics 2017-09-04 Martin Ehler , Massimo Fornasier , Juliane Sigl

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

When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…

Numerical Analysis · Mathematics 2011-10-20 Jiawei Chiu , Laurent Demanet