English
Related papers

Related papers: Quantized Spectral Compressed Sensing: Cramer-Rao …

200 papers

As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compressed sensing algorithms from just n=O(k) measurements, where k…

Information Theory · Computer Science 2016-09-08 Coralia Cartis , Andrew Thompson

Influence of the finite-length registers and quantization effects on the reconstruction of sparse and approximately sparse signals is analyzed in this paper. For the nonquantized measurements, the compressive sensing (CS) framework provides…

Information Theory · Computer Science 2019-07-03 Isidora Stankovic , Milos Brajovic , Milos Dakovic , Cornel Ioana , Ljubisa Stankovic

Recovering complex-valued image recovery from noisy indirect data is important in applications such as ultrasound imaging and synthetic aperture radar. While there are many effective algorithms to recover point estimates of the magnitude,…

Numerical Analysis · Mathematics 2024-03-26 Dylan Green , Jonathan Lindbloom , Anne Gelb

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

In this paper, we consider signals with a low-rank covariance matrix which reside in a low-dimensional subspace and can be written in terms of a finite (small) number of parameters. Although such signals do not necessarily have a sparse…

Statistics Theory · Mathematics 2023-07-19 Mahdi Shaghaghi , Sergiy A. Vorobyov

Spectrum sensing is a fundamental component in cognitive radio. A major challenge in this area is the requirement of a high sampling rate in the sensing of a wideband signal. In this paper a wideband spectrum sensing model is presented that…

Information Theory · Computer Science 2010-10-12 Moslem Rashidi , Kasra Haghighi , Arash Owrang , Mats Viberg

This letter investigates the joint recovery of a frequency-sparse signal ensemble sharing a common frequency-sparse component from the collection of their compressed measurements. Unlike conventional arts in compressed sensing, the…

Information Theory · Computer Science 2015-06-22 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Peilin Liu , Wenxian Yu

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common methods the signal is recovered in the sparse domain. A method for the reconstruction of sparse signal which reconstructs the…

Information Theory · Computer Science 2015-04-28 Ljubisa Stankovic , Milos Dakovic

Compressive sensing is a sensing protocol that facilitates reconstruction of large signals from relatively few measurements by exploiting known structures of signals of interest, typically manifested as signal sparsity. Compressive…

Quantum Physics · Physics 2022-08-10 Kyle Sherbert , Naveed Naimipour , Haleh Safavi , Harry Shaw , Mojtaba Soltanalian

Compressed sensing is a paradigm within signal processing that provides the means for recovering structured signals from linear measurements in a highly efficient manner. Originally devised for the recovery of sparse signals, it has become…

Information Theory · Computer Science 2021-12-09 Jens Eisert , Axel Flinth , Benedikt Groß , Ingo Roth , Gerhard Wunder

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible…

Information Theory · Computer Science 2014-04-30 Matthew L. Malloy , Robert D. Nowak

We consider the compressive sensing of a sparse or compressible signal ${\bf x} \in {\mathbb R}^M$. We explicitly construct a class of measurement matrices, referred to as the low density frames, and develop decoding algorithms that produce…

Information Theory · Computer Science 2009-03-05 Mehmet Akçakaya , Jinsoo Park , Vahid Tarokh

Compressive sampling (CoSa) is a new methodology which demonstrates that sparse signals can be recovered from a small number of linear measurements. Greedy algorithms like CoSaMP have been designed for this recovery, and variants of these…

Numerical Analysis · Mathematics 2014-07-28 Raja Giryes , Deanna Needell

The performance of existing approaches to the recovery of frequency-sparse signals from compressed measurements is limited by the coherence of required sparsity dictionaries and the discretization of frequency parameter space. In this…

Information Theory · Computer Science 2014-07-15 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Zenghui Zhang , Peilin Liu , Wenxian Yu

This work investigates the parameter estimation performance of super-resolution line spectral estimation using atomic norm minimization. The focus is on analyzing the algorithm's accuracy of inferring the frequencies and complex magnitudes…

Information Theory · Computer Science 2018-10-24 Qiuwei Li , Gongguo Tang

Random pulse sequences are a powerful method for qubit noise spectroscopy, enabling efficient reconstruction of sparse noise spectra. Here, we advance this method in two complementary directions. First, we extend the method using a…

Quantum Physics · Physics 2026-01-07 Kaixin Huang , Demitry Farfurnik , Dror Baron , Yi-Kai Liu

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of…

Information Theory · Computer Science 2014-02-05 Rina Foygel , Lester Mackey

In the context of compressed sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information. To address this problem, we theoretically study a…

Information Theory · Computer Science 2017-01-19 Huynh Van Luong , Jurgen Seiler , Andre Kaup , Soren Forchhammer , Nikos Deligiannis

We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…

Information Theory · Computer Science 2019-05-28 Ramin Ayanzadeh , Milton Halem , Tim Finin

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li