English
Related papers

Related papers: An Estimation Theoretic Approach for Sparsity Patt…

200 papers

Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is…

Information Theory · Computer Science 2015-05-30 Zai Yang , Cishen Zhang , Jun Deng , Wenmiao Lu

Compressed sensing (CS) model of complex-valued data can represent the signal recovery process of a large amount types of radar systems, especially when the measurement matrix is row-orthogonal. Based on debiased least absolute shrinkage…

Signal Processing · Electrical Eng. & Systems 2023-07-28 Siqi Na , Tianyao Huang , Yimin Liu , Takashi Takahashi , Yoshiyuki Kabashima , Xiqin Wang

Compressed Sensing decoding algorithms can efficiently recover an N dimensional real-valued vector x to within a factor of its best k-term approximation by taking m = 2klog(N/k) measurements y = Phi x. If the sparsity or approximate…

Numerical Analysis · Mathematics 2008-12-09 Rachel Ward

In this paper, we consider the problem of recovering compressively sensed ultrasound images. We build on prior work, and consider a number of existing approaches that we consider to be the state-of-the-art. The methods we consider take…

Signal Processing · Electrical Eng. & Systems 2018-11-06 Richard Porter , Vladislav Tadic , Alin Achim

The linear inverse source and scattering problems are studied from the perspective of compressed sensing, in particular the idea that sufficient incoherence and sparsity guarantee uniqueness of the solution. By introducing the sensor as…

Data Analysis, Statistics and Probability · Physics 2009-05-19 Albert Fannjiang , Pengchong Yan , Thomas Strohmer

This paper provides performance bounds for compressed sensing in the presence of Poisson noise using expander graphs. The Poisson noise model is appropriate for a variety of applications, including low-light imaging and digital streaming,…

Information Theory · Computer Science 2009-11-25 Sina Jafarpour , Rebecca Willett , Maxim Raginsky , Robert Calderbank

We study the problem of signal estimation from non-linear observations when the signal belongs to a low-dimensional set buried in a high-dimensional space. A rough heuristic often used in practice postulates that non-linear observations may…

Information Theory · Computer Science 2015-11-17 Yaniv Plan , Roman Vershynin

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

In this work, we provide non-asymptotic, probabilistic guarantees for successful recovery of the common nonzero support of jointly sparse Gaussian sources in the multiple measurement vector (MMV) problem. The support recovery problem is…

Information Theory · Computer Science 2021-07-27 Saurabh Khanna , Chandra R. Murthy

Many practical sensing applications involve multiple sensors simultaneously acquiring measurements of a single object. Conversely, most existing sparse recovery guarantees in compressed sensing concern only single-sensor acquisition…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

We study the problem of exact support recovery based on noisy observations and present Refined Least Squares (RLS). Given a set of noisy measurement $$ \myvec{y} = \myvec{X}\myvec{\theta}^* + \myvec{\omega},$$ and $\myvec{X} \in…

Statistics Theory · Mathematics 2021-03-22 Ofir Lindenbaum , Stefan Steinerberger

The idea of compressed sensing is to exploit representations in suitable (overcomplete) dictionaries that allow to recover signals far beyond the Nyquist rate provided that they admit a sparse representation in the respective dictionary.…

Computer Vision and Pattern Recognition · Computer Science 2018-06-22 Michael Moeller , Otmar Loffeld , Juergen Gall , Felix Krahmer

Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix.…

Information Theory · Computer Science 2013-10-03 Weizhi Lu , Weiyu Li , Kidiyo Kpalma , Joseph Ronsin

We study the problem of reconstructing a sparse signal from a limited number of its linear projections when a part of its support is known, although the known part may contain some errors. The ``known" part of the support, denoted T, may be…

Information Theory · Computer Science 2015-03-13 Namrata Vaswani , Wei Lu

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

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

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…

Information Theory · Computer Science 2013-06-11 Atul Divekar , Deanna Needell

Parallel acquisition systems arise in various applications in order to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

In this letter, we present a unified result for the stable recovery bound of Lq(0 < q < 1) optimization model in compressed sensing, which is a constrained Lq minimization problem aware of the noise in a linear system. Specifically, without…

Optimization and Control · Mathematics 2016-09-07 Zhi-Long Dong , Xiaoqi Yang , Yu-Hong Dai

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan