English
Related papers

Related papers: On Asymptotic Incoherence and its Implications for…

200 papers

Recently it has been established that asymptotic incoherence can be used to facilitate subsampling, in order to optimize reconstruction quality, in a variety of continuous compressed sensing problems, and the coherence structure of certain…

Information Theory · Computer Science 2016-10-25 Alex Jones , Ben Adcock , Anders Hansen

This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…

Functional Analysis · Mathematics 2014-07-08 Bogdan Roman , Anders Hansen , Ben Adcock

This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces a mathematical framework that generalizes the three standard…

Information Theory · Computer Science 2014-06-24 Ben Adcock , Anders C. Hansen , Clarice Poon , Bogdan Roman

In many signal processing applications, one wishes to acquire images that are sparse in transform domains such as spatial finite differences or wavelets using frequency domain samples. For such applications, overwhelming empirical evidence…

Computer Vision and Pattern Recognition · Computer Science 2013-10-22 Felix Krahmer , Rachel Ward

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

We consider a compressed sensing problem in which both the measurement and the sparsifying systems are assumed to be frames (not necessarily tight) of the underlying Hilbert space of signals, which may be finite or infinite dimensional. The…

Information Theory · Computer Science 2020-10-15 Giovanni S. Alberti , Matteo Santacesaria

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

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

This paper extends the sample complexity theory for ill-posed inverse problems developed in a recent work by the authors [`Compressed sensing for inverse problems and the sample complexity of the sparse Radon transform', J. Eur. Math. Soc.,…

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

A signature result in compressed sensing is that Gaussian random sampling achieves stable and robust recovery of sparse vectors under optimal conditions on the number of measurements. However, in the context of image reconstruction, it has…

Information Theory · Computer Science 2021-01-26 Ben Adcock , Simone Brugiapaglia , Matthew King-Roskamp

Sensor selection refers to the problem of intelligently selecting a small subset of a collection of available sensors to reduce the sensing cost while preserving signal acquisition performance. The majority of sensor selection algorithms…

Other Computer Science · Computer Science 2017-02-27 Amirali Aghazadeh , Mohammad Golbabaee , Andrew S. Lan , Richard G. Baraniuk

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

This note complements the paper "The quest for optimal sampling: Computationally efficient, structure-exploiting measurements for compressed sensing" [2]. Its purpose is to present a proof of a result stated therein concerning the recovery…

Functional Analysis · Mathematics 2014-06-17 Ben Adcock , Anders C. Hansen , Bogdan Roman

We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution…

Information Theory · Computer Science 2011-09-29 Gilles Puy , Pierre Vandergheynst , Yves Wiaux

The problem of minimization of the number of measurements needed for digital image acquisition and reconstruction with a given accuracy is addressed. Basics of the sampling theory are outlined to show that the lower bound of signal sampling…

Computer Vision and Pattern Recognition · Computer Science 2018-03-01 Leonid P. Yaroslavsky

Asymptotic optimality is a key theoretical property in model averaging. Due to technical difficulties, existing studies rely on restricted weight sets or the assumption that there is no true model with fixed dimensions in the candidate set.…

Statistics Theory · Mathematics 2024-11-15 Wenchao Xu , Xinyu Zhang

We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random…

Information Theory · Computer Science 2012-03-13 Gilles Puy , Pierre Vandergheynst , Rémi Gribonval , Yves Wiaux

The aim of this article is to establish asymptotic distributions and consistency of subsampling for spectral density and for magnitude of coherence for non-stationary, almost periodically correlated time series. We show the asymptotic…

Statistics Theory · Mathematics 2011-02-11 Łukasz Lenart

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is…

Optics · Physics 2009-09-15 Albert C. Fannjiang
‹ Prev 1 2 3 10 Next ›