English
Related papers

Related papers: Total Variation Minimization in Compressed Sensing

200 papers

This paper considers the use of total variation regularization in the recovery of approximately gradient sparse signals from their noisy discrete Fourier samples in the context of compressed sensing. It has been observed over the last…

Numerical Analysis · Mathematics 2014-07-22 Clarice Poon

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2020-09-09 Martin Genzel , Maximilian März , Robert Seidel

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

We analyze the asymptotic performance of sparse signal recovery from noisy measurements. In particular, we generalize some of the existing results for the Gaussian case to subgaussian and other ensembles. An achievable result is presented…

Information Theory · Computer Science 2009-04-30 Paul Tune , Sibiraj Bhaskaran Pillai , Stephen Hanly

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

In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable…

Information Theory · Computer Science 2013-04-10 Albert Ai , Alex Lapanowski , Yaniv Plan , Roman Vershynin

In this paper, we consider using total variation minimization to recover signals whose gradients have a sparse support, from a small number of measurements. We establish the proof for the performance guarantee of total variation (TV)…

Information Theory · Computer Science 2013-10-14 Jian-Feng Cai , Weiyu Xu

The problem of multiple sensors simultaneously acquiring measurements of a single object can be found in many applications. In this paper, we present the optimal recovery guarantees for the recovery of compressible signals from multi-sensor…

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

Compressed sensing allows for the recovery of sparse signals from few measurements, whose number is proportional to the sparsity of the unknown signal, up to logarithmic factors. The classical theory typically considers either random linear…

Functional Analysis · Mathematics 2025-04-02 Giovanni S. Alberti , Alessandro Felisi , Matteo Santacesaria , S. Ivan Trapasso

Total variation (TV) minimization is one of the most important techniques in modern signal/image processing, and has wide range of applications. While there are numerous recent works on the restoration guarantee of the TV minimization in…

Analysis of PDEs · Mathematics 2022-07-18 Jian-Feng Cai , Jae Kyu Choi , Ke Wei

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase…

Optimization and Control · Mathematics 2016-12-30 Mateo Díaz , Mauricio Junca , Felipe Rincón , Mauricio Velasco

In compressed sensing, one wishes to acquire an approximately sparse high-dimensional signal $x\in\mathbb{R}^n$ via $m\ll n$ noisy linear measurements, then later approximately recover $x$ given only those measurement outcomes. Various…

Information Theory · Computer Science 2016-06-07 Tom Morgan , Jelani Nelson

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such…

Numerical Analysis · Mathematics 2015-06-11 Deanna Needell , Rachel Ward

From a numerical analysis perspective, assessing the robustness of l1-minimization is a fundamental issue in compressed sensing and sparse regularization. Yet, the recovery guarantees available in the literature usually depend on a priori…

Numerical Analysis · Mathematics 2017-05-10 Simone Brugiapaglia , Ben Adcock , Richard K. Archibald

Wideband spectrum sensing is a critical component of a functioning cognitive radio system. Its major challenge is the too high sampling rate requirement. Compressive sensing (CS) promises to be able to deal with it. Nearly all the current…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is…

Information Theory · Computer Science 2010-04-29 Sivan Gleichman , Yonina C. Eldar

This paper provides novel results for the recovery of signals from undersampled measurements based on analysis $\ell_1$-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery…

Information Theory · Computer Science 2014-11-04 Holger Rauhut , Maryia Kabanava
‹ Prev 1 2 3 10 Next ›