English
Related papers

Related papers: On the stable sampling rate for binary measurement…

200 papers

In this paper we analyze two-dimensional wavelet reconstructions from Fourier samples within the framework of generalized sampling. For this, we consider both separable compactly-supported wavelets and boundary wavelets. We prove that the…

Functional Analysis · Mathematics 2014-03-25 Ben Adcock , Anders C. Hansen , Gitta Kutyniok , Jackie Ma

The theory of sampling and the reconstruction of data has a wide range of applications and a rich collection of techniques. For many methods a core problem is the estimation of the number of samples needed in order to secure a stable and…

Information Theory · Computer Science 2019-07-30 Laura Thesing , Anders Christian Hansen

Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in the form of integral transforms such as the Fourier transform. This framework is well-suited to many real-world…

Information Theory · Computer Science 2021-05-25 Ben Adcock , Vegard Antun , Anders C. Hansen

Due to the many applications in Magnetic Resonance Imaging (MRI), Nuclear Magnetic Resonance (NMR), radio interferometry, helium atom scattering etc., the theory of compressed sensing with Fourier transform measurements has reached a mature…

Numerical Analysis · Mathematics 2021-03-31 Laura Thesing , Anders Christian Hansen

In this paper we study the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling. Our first result demonstrates that…

Numerical Analysis · Mathematics 2013-05-14 Ben Adcock , Anders C. Hansen , Clarice Poon

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

In this paper we study the general reconstruction of a compactly supported function from its Fourier coefficients using compactly supported shearlet systems. We assume that only finitely many Fourier samples of the function are accessible…

Functional Analysis · Mathematics 2015-07-31 Jackie Ma

We investigate the problems of 1-D and 2-D signal recovery from subsampled Hadamard measurements using Haar wavelet sparsity prior. These problems are of interest in, e.g., computational imaging applications relying on optical multiplexing…

Information Theory · Computer Science 2019-07-24 Amirafshar Moshtaghpour , José M. Bioucas Dias , Laurent Jacques

Recovering a signal (function) from finitely many binary or Fourier samples is one of the core problems in modern medical imaging, and by now there exist a plethora of methods for recovering a signal from such samples. Examples of methods,…

Numerical Analysis · Mathematics 2021-06-02 Vegard Antun

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Numerical Analysis · Mathematics 2022-05-04 Ben Adcock , Milana Gataric , José Luis Romero

We analyze signal recovery when samples are taken concomitantly from a signal and its Fourier transform. This two-sided sampling framework extends classical one-sided reconstruction and is particularly useful when measurements in either…

Signal Processing · Electrical Eng. & Systems 2026-03-18 Mert Kayaalp , Oleg Szehr

Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with…

Numerical Analysis · Mathematics 2013-01-15 Ben Adcock , Anders C. Hansen , Clarice Poon

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

We consider the problem of recovering a compactly-supported function from a finite collection of pointwise samples of its Fourier transform taking nonuniformly. First, we show that under suitable conditions on the sampling frequencies -…

Numerical Analysis · Mathematics 2014-04-08 Ben Adcock , Milana Gataric , Anders C. Hansen

This paper studies several aspects of signal reconstruction of sampled data in spaces of bandlimited functions. In the first part, signal spaces are characterized in which the classical sampling series uniformly converge, and we investigate…

Information Theory · Computer Science 2014-10-23 Holger Boche , Volker Pohl

In this paper, we show that high-dimensional sparse wavelet signals of finite levels can be constructed from their partial Fourier measurements on a deterministic sampling set with cardinality about a multiple of signal sparsity.

Information Theory · Computer Science 2015-10-28 Yang Chen , Cheng Cheng , Qiyu Sun

Recent advances in unsupervised learning have highlighted the possibility of learning to reconstruct signals from noisy and incomplete linear measurements alone. These methods play a key role in medical and scientific imaging and sensing,…

Signal Processing · Electrical Eng. & Systems 2024-10-22 Julián Tachella , Laurent Jacques

In this note we study the problem of sampling and reconstructing signals which are assumed to lie on or close to one of several subspaces of a Hilbert space. Importantly, we here consider a very general setting in which we allow infinitely…

Information Theory · Computer Science 2009-12-02 Thomas Blumensath

The characterization of a binary function by partial frequency information is considered. We show that it is possible to reconstruct binary signals from incomplete frequency measurements via the solution of a simple linear optimization…

Information Theory · Computer Science 2012-04-19 Yu Mao

We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…

Numerical Analysis · Mathematics 2010-12-01 Ben Adcock , Anders C. Hansen
‹ Prev 1 2 3 10 Next ›