English
Related papers

Related papers: Quantized Compressive Sensing with RIP Matrices: T…

200 papers

Scanning tunneling microscopy (STM) is a notoriously slow technique; Data-recording is serial which renders complex measurement tasks, such as quasiparticle interference (QPI) mapping, impractical. However, QPI would provide insight into…

Other Condensed Matter · Physics 2020-05-06 Jens Oppliger , Fabian Donat Natterer

This work is concerned with the problem of recovering high-dimensional signals $\mathbf{x} \in \mathbb{R}^n$ which belong to a convex set of low-complexity from a small number of quantized measurements. We propose to estimate the signals…

Information Theory · Computer Science 2021-03-29 Hans Christian Jung , Johannes Maly , Lars Palzer , Alexander Stollenwerk

Compressive sensing (CS) is a signal processing technique that enables sub-Nyquist sampling and near lossless reconstruction of a sparse signal. The technique is particularly appealing for neural signal processing since it avoids the issues…

Signal Processing · Electrical Eng. & Systems 2021-02-02 Hyunseok Park , Xilin Liu

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…

Numerical Analysis · Mathematics 2014-04-02 Guangliang Chen , Atul Divekar , Deanna Needell

One-bit compressed sensing (1bCS) is an extreme-quantized signal acquisition method that has been intermittently studied in the past decade. In 1bCS, linear samples of a high dimensional signal are quantized to only one bit per sample (sign…

Information Theory · Computer Science 2021-09-15 Arya Mazumdar , Soumyabrata Pal

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

Compressed sensing magnetic resonance imaging (CS-MRI) heavily relies on the low mutual coherence between the measurement matrix and the sparsity basis. However, under highly accelerated Cartesian undersampling, the severe structural…

Signal Processing · Electrical Eng. & Systems 2026-05-05 Siyuan Feng

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is…

Machine Learning · Computer Science 2019-05-21 Yan Wu , Mihaela Rosca , Timothy Lillicrap

In compressed sensing (CS), sparse signals can be reconstructed from significantly fewer samples than required by the Nyquist-Shannon sampling theorem. While non-sparse signals can be sparsely represented in appropriate transformation…

Information Theory · Computer Science 2026-03-13 Qi Qi , Abdelhamid Tayebi , Daizhan Cheng , Jun-e Feng

The application of compressive sensing (CS) to structural health monitoring is an emerging research topic. The basic idea in CS is to use a specially-designed wireless sensor to sample signals that are sparse in some basis (e.g. wavelet…

Applications · Statistics 2015-03-31 Yong Huang , James L. Beck , Stephen Wu , Hui Li

Compressive sensing (CS) reconstructs images from sub-Nyquist measurements by solving a sparsity-regularized inverse problem. Traditional CS solvers use iterative optimizers with hand crafted sparsifiers, while early data-driven methods…

Computer Vision and Pattern Recognition · Computer Science 2023-06-02 Pamuditha Somarathne , Tharindu Wickremasinghe , Amashi Niwarthana , A. Thieshanthan , Chamira U. S. Edussooriya , Dushan N. Wadduwage

Compressive sensing (CS) technologies present many advantages over other existing approaches for implementing wideband spectrum sensing in cognitive radios (CRs), such as reduced sampling rate and computational complexity. However, there…

Information Theory · Computer Science 2016-07-15 Jing Jiang , Hongjian Sun , David Baglee , H. Vincent Poor

We consider a resource-constrained scenario where a compressed sensing- (CS) based sensor has a low number of measurements which are quantized at a low rate followed by transmission or storage. Applying this scenario, we develop a new…

Information Theory · Computer Science 2014-05-01 Amirpasha Shirazinia , Saikat Chatterjee , Mikael Skoglund

Combining quantum sensing with quantum computing can lead to quantum computational sensors that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. Early examples of quantum…

Quantum Physics · Physics 2025-07-22 Saeed A. Khan , Sridhar Prabhu , Logan G. Wright , Peter L. McMahon

In this paper, we compare and catalog the performance of various greedy quantized compressed sensing algorithms that reconstruct sparse signals from quantized compressed measurements. We also introduce two new greedy approaches for…

Information Theory · Computer Science 2016-01-01 Hao-Jun Michael Shi , Mindy Case , Xiaoyi Gu , Shenyinying Tu , Deanna Needell

Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition.…

Quantum Physics · Physics 2012-10-18 Steven T. Flammia , David Gross , Yi-Kai Liu , Jens Eisert

Compressed sensing was proposed by E. J. Cand\'es, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement…

Information Theory · Computer Science 2015-05-29 Hao Chen

Compressed sensing (CS) is an emerging paradigm for acquisition of compressed representations of a sparse signal. Its low complexity is appealing for resource-constrained scenarios like sensor networks. However, such scenarios are often…

Information Theory · Computer Science 2015-03-31 Diego Valsesia , Giulio Coluccia , Enrico Magli

This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative intensities whose measurements are corrupted by Poisson noise. In this…

Information Theory · Computer Science 2015-05-14 Maxim Raginsky , Rebecca M. Willett , Zachary T. Harmany , Roummel F. Marcia

In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's…

Information Theory · Computer Science 2012-08-01 Ray Maleh , Gerald L. Fudge
‹ Prev 1 4 5 6 7 8 10 Next ›