English
Related papers

Related papers: Beyond consistent reconstructions: optimality and …

200 papers

We introduce a generalized framework for sampling and reconstruction in separable Hilbert spaces. Specifically, we establish that it is always possible to stably reconstruct a vector in an arbitrary Riesz basis from sufficiently many of its…

Numerical Analysis · Mathematics 2010-12-01 Ben Adcock , Anders C. Hansen

The purpose of this paper is to report on recent approaches to reconstruction problems based on analog, or in other words, infinite-dimensional, image and signal models. We describe three main contributions to this problem. First, linear…

Numerical Analysis · Mathematics 2013-10-07 Ben Adcock , Anders Hansen , Bogdan Roman , Gerd Teschke

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 an infinite-dimensional signal from a finite set of measurements is a fundamental problem in approximation theory and signal processing. While the generalized sampling (GS) framework provides a robust methodology for…

Functional Analysis · Mathematics 2026-05-25 Luca Finotti , Matteo Santacesaria

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

An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a…

Information Theory · Computer Science 2017-02-14 Andrew Knyazev , Akshay Gadde , Hassan Mansour , Dong Tian

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

The best practical techniques for exact solution of instances of the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a branch-and-bound framework, working with a…

Optimization and Control · Mathematics 2024-02-19 Zhongzhu Chen , Marcia Fampa , Jon Lee

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

In high-dimensional generalized linear models, it is crucial to identify a sparse model that adequately accounts for response variation. Although the best subset section has been widely regarded as the Holy Grail of problems of this type,…

Machine Learning · Statistics 2023-08-02 Junxian Zhu , Jin Zhu , Borui Tang , Xuanyu Chen , Hongmei Lin , Xueqin Wang

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

We give an overview of recent developments in the problem of reconstructing a band-limited signal from non-uniform sampling from a numerical analysis view point. It is shown that the appropriate design of the finite-dimensional model plays…

Numerical Analysis · Mathematics 2025-10-20 Thomas Strohmer

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

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

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

This paper considers the problem of optimum reconstruction in generalized sampling-reconstruction processes (GSRPs). We propose constrained GSRP, a novel framework that minimizes the reconstruction error for inputs in a subspace, subject to…

Signal Processing · Electrical Eng. & Systems 2019-10-23 Bashir Sadeghi , Runyi Yu , Vishnu Naresh Boddeti

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

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

We address the problem of image reconstruction from incomplete measurements, encompassing both upsampling and inpainting, within a learning-based framework. Conventional supervised approaches require fully sampled ground truth data, while…

Computer Vision and Pattern Recognition · Computer Science 2026-03-23 Benjamin Walder , Daniel Toader , Robert Nuster , Günther Paltauf , Peter Burgholzer , Gregor Langer , Lukas Krainer , Markus Haltmeier

The best techniques for the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a variety of concave continuous relaxations of the objective function. A standard…

Optimization and Control · Mathematics 2023-02-13 Zhongzhu Chen , Marcia Fampa , Jon Lee
‹ Prev 1 2 3 10 Next ›