Publications related to MATHICSE Technical Report : Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi ...

MATHICSE2017

Learning-based subsampling

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Yen-Huan Li, Luca Baldassarre, Baran Gözcü

The present invention concerns a method of sampling a test signal. The method comprises: acquiring (21) training signals sampled at a plurality of sampling locations; running (23) an optimization procedure for determining an index set of n indices, represe ...

2017

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Martin Vetterli, Arash Amini, Mitra Fatemi

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

2016

Shapes from Pixels

Mitra Fatemi

In today's digital world, sampling is at the heart of any signal acquisition device. Imaging devices are ubiquitous examples that capture two-dimensional visual signals and store them as the pixels of discrete images. The main concern is whether and how th ...

EPFL2016

Attributing Aliasing Artifacts in Dirty Intensity Fields to their Parent Source

Matthieu Martin Jean-André Simeoni

Estimating intensity fields of stochastic phenomenons is of crucial interest in many scientific applications. Typical experimental setups involve an acquisition system, that subsequently filters and samples the probed intensity field. This equivalently def ...

2016

BDD Minimization for Approximate Computing

Mathias Soeken, Arun Chandrasekharan

We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representa ...

IEEE2016

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

Fabio Nobile, Giovanni Migliorati

Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...

2015

Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Fabio Nobile, Giovanni Migliorati

We study the accuracy of the discrete least-squares approximation on a finite-dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...

2015

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Fabio Nobile, Giovanni Migliorati

We study the accuracy of the discrete least-squares approximation on a finite dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...

MATHICSE2015

Generalized Poisson Summation Formula for Tempered Distributions

Michaël Unser, Quy Ha Nguyen

The Poisson summation formula (PSF), which relates the sampling of an analog signal with the periodization of its Fourier transform, plays a key role in the classical sampling theory. In its current forms, the formula is only applicable to a limited class ...

IEEE2015

MATHICSE Technical Report : Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Graph Chatbot

Chat with Graph Search

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

Learning-based subsampling

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Shapes from Pixels

Attributing Aliasing Artifacts in Dirty Intensity Fields to their Parent Source

BDD Minimization for Approximate Computing

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Generalized Poisson Summation Formula for Tempered Distributions

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Shapes from Pixels

BDD Minimization for Approximate Computing

Learning-based subsampling

Attributing Aliasing Artifacts in Dirty Intensity Fields to their Parent Source

Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

MATHICSE Technical Report : Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points

Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

Generalized Poisson Summation Formula for Tempered Distributions