English
Related papers

Related papers: Sharp results on sampling with derivatives in band…

200 papers

We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure,…

Social and Information Networks · Computer Science 2016-05-23 Gilles Puy , Nicolas Tremblay , Rémi Gribonval , Pierre Vandergheynst

We tensorize the Faber spline system from [14] to prove sequence space isomorphisms for multivariate function spaces with higher mixed regularity. The respective basis coefficients are local linear combinations of discrete function values…

Functional Analysis · Mathematics 2020-04-08 Nadiia Derevianko , Tino Ullrich

We prove that if $f:I\subset \Bbb R\to \Bbb R$ is of bounded variation, then the noncentered maximal function $Mf$ is absolutely continuous, and its derivative satisfies the sharp inequality $\|DMf\|_1\le |Df|(I)$. This allows us obtain,…

Classical Analysis and ODEs · Mathematics 2010-09-24 J. M. Aldaz , J. Pérez Lázaro

Weighted average sampling is more practical and numerically more stable than sampling at single points as in the classical Shannon sampling framework. Using the frame theory, one can completely reconstruct a bandlimited function from its…

Information Theory · Computer Science 2014-07-04 Haizhang Zhang

It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard.…

Signal Processing · Electrical Eng. & Systems 2017-11-21 Xuan Xie , Hui Feng , Junlian Jia , Bo Hu

We consider the problem of sampling from data defined on the nodes of a weighted graph, where the edge weights capture the data correlation structure. As shown recently, using spectral graph theory one can define a cut-off frequency for the…

Information Theory · Computer Science 2014-11-13 Ilan Shomorony , A. Salman Avestimehr

Consider the task of sampling and reconstructing a bandlimited spatial field in $\Re^2$ using moving sensors that take measurements along their path. It is inexpensive to increase the sampling rate along the paths of the sensors but more…

Information Theory · Computer Science 2012-11-02 Jayakrishnan Unnikrishnan , Martin Vetterli

This paper deals with the problem of reconstructing a band-limited signal when a finite subset of its samples and of its derivative are missing. The technique used, due to P.J.S.G. Ferreira, is based on the use of a particular frame for…

Functional Analysis · Mathematics 2010-09-13 Paola Brianzi , Vincenza Del Prete

This paper investigates signal prediction through the perfect reconstruction of signals from shift-invariant spaces using nonuniform samples of both the signal and its derivatives. The key advantage of derivative sampling is its ability to…

Information Theory · Computer Science 2025-12-29 Sreya T , Riya Ghosh , A. Antony Selvan

The paper investigates possibility of recovery of sequences from their decimated subsequences. It is shown that this recoverability is associated with certain spectrum degeneracy of a new kind, and that a sequences of a general kind can be…

Information Theory · Computer Science 2017-10-31 Nikolai Dokuchaev

Sampling theory in spaces other than the space of band-limited functions has recently received considerable attention. This is in part because the band-limitedness assumption is not very realistic in many applications. In addition,…

Classical Analysis and ODEs · Mathematics 2007-05-23 Cristina Blanco , Carlos Cabrelli , Sigrid Heineken

Many engineering, social, and biological complex systems consist of dynamical elements connected via a large-scale network. Monitoring the network's dynamics is essential for a variety of maintenance and scientific purposes. Whilst we…

Signal Processing · Electrical Eng. & Systems 2019-04-30 Zhuangkun Wei , Bin Li , Weisi Guo

We consider multi-variate signals spanned by the integer shifts of a set of generating functions with distinct frequency profiles and the problem of reconstructing them from samples taken on a random periodic set. We show that such a…

Functional Analysis · Mathematics 2023-10-13 Jorge Antezana , Diana Carbajal , José Luis Romero

In this work, we study the properties of sampling sets on families of large graphs by leveraging the theory of graphons and graph limits. To this end, we extend to graphon signals the notion of removable and uniqueness sets, which was…

Machine Learning · Computer Science 2026-03-16 Alejandro Parada-Mayorga , Alejandro Ribeiro

This paper is concerned with the problem of sampling and interpolation involving derivatives in shift-invariant spaces and the error analysis of the derivative sampling expansions for fundamentally large classes of functions. A new type of…

Functional Analysis · Mathematics 2024-02-15 Kumari Priyanka , A. Antony Selvan

It is known that the simple slice sampler has robust convergence properties, however the class of problems where it can be implemented is limited. In contrast, we consider hybrid slice samplers which are easily implementable and where…

Methodology · Statistics 2026-01-14 Krzysztof Łatuszyński , Daniel Rudolf

This paper concerns with iterative schemes for the perfect reconstruction of functions belonging to multiresolution spaces on bounded manifolds from nonuniform sampling. The schemes have optimal complexity in the sense that the…

Numerical Analysis · Mathematics 2007-05-23 Massimo Fornasier , Laura Gori

In this paper, we consider the problem of reconstructing piecewise smooth functions to high accuracy from nonuniform samples of their Fourier transform. We use the framework of nonuniform generalized sampling (NUGS) to do this, and to…

Numerical Analysis · Mathematics 2014-10-02 Ben Adcock , Milana Gataric , Anders C. Hansen

A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…

Information Theory · Computer Science 2018-06-19 Erik Agrell , Balázs Csébfalvi

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson