Related papers: Reconstructing Functions from Random Samples

A theory of sections of simplicial height functions is developed. At the core of this theory lies the section complex, which is assembled from higher section spaces. The latter encode flow lines along the height, as well as their…

In this paper we investigate the approximation of continuous functions on the Wasserstein space by smooth functions, with smoothness meant in the sense of Lions differentiability. In particular, in the case of a Lipschitz function we are…

We study the persistent homology of both functional data on compact topological spaces and structural data presented as compact metric measure spaces. One of our goals is to define persistent homology so as to capture primarily properties…

Several imaging algorithms including patch-based image denoising, image time series recovery, and convolutional neural networks can be thought of as methods that exploit the manifold structure of signals. While the empirical performance of…

In this paper we prove two results regarding reconstruction from magnitudes of frame coefficients (the so called "phase retrieval problem"). First we show that phase retrievability as an algebraic property implies that nonlinear maps are…

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…

A randomized scheme that succeeds with probability $1-\delta$ (for any $\delta>0$) has been devised to construct (1) an equidistributed $\epsilon$-cover of a compact Riemannian symmetric space $\mathbb M$ of dimension $d_{\mathbb M}$ and…

We give a definition of convergence of differential of Lipschitz functions with respect to measured Gromov-Hausdorff topology. As their applications, we give a characterization of harmonic functions with polynomial growth on asymptotic…

We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…

We consider harmonic maps into pseudo-Riemannian manifolds. We show the removability of isolated singularities for continuous maps, i.e. that any continuous map from an open subset of R^m into a pseudo-Riemannian manifold which is two times…

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…

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,…

Given a sample $Y$ from an unknown manifold $X$ embedded in Euclidean space, it is possible to recover the homology groups of $X$ by building a Vietoris--Rips or \v{C}ech simplicial complex on top of the vertex set $Y$. However, these…

For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…

This paper explores the existence and properties of \emph{basic} eigenvalues and eigenfunctions associated with the Riemannian Laplacian on closed, connected Riemannian manifolds featuring an effective isometric action by a compact Lie…

In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold of Euclidean space without maintaining or even constructing complicated data structures such as Voronoi diagrams or Delaunay complexes. Our…

Modern generative modeling methods have demonstrated strong performance in learning complex data distributions from clean samples. In many scientific and imaging applications, however, clean samples are unavailable, and only noisy or…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…