Integral Transforms from Finite Data: An Application of Gaussian Process Regression to Fourier Analysis

04/10/2017
by   Luca Ambrogioni, et al.
0

Computing accurate estimates of the Fourier transform of analog signals from discrete data points is important in many fields of science and engineering. The conventional approach of performing the discrete Fourier transform of the data implicitly assumes periodicity and bandlimitedness of the signal. In this paper, we use Gaussian process regression to estimate the Fourier transform (or any other integral transform) without making these assumptions. This is possible because the posterior expectation of Gaussian process regression maps a finite set of samples to a function defined on the whole real line, expressed as a linear combination of covariance functions. We estimate the covariance function from the data using an appropriately designed gradient ascent method that constrains the solution to a linear combination of tractable kernel functions. This procedure results in a posterior expectation of the analog signal whose Fourier transform can be obtained analytically by exploiting linearity. Our simulations show that the new method leads to sharper and more precise estimation of the spectral density both in noise-free and noise-corrupted signals. We further validate the method in two real-world applications: the analysis of the yearly fluctuation in atmospheric CO2 level and the analysis of the spectral content of brain signals.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2020

Infinite Sequences, Series Convergence and the Discrete Time Fourier Transform over Finite Fields

Digital Transforms have important applications on subjects such as chann...
research
10/18/2022

Equispaced Fourier representations for efficient Gaussian process regression from a billion data points

We introduce a Fourier-based fast algorithm for Gaussian process regress...
research
06/07/2013

Quaternionic Fourier-Mellin Transform

In this contribution we generalize the classical Fourier Mellin transfor...
research
08/03/2023

The Data Movement Bottleneck: Theoretical Shortcomings of Analog Optical Fourier Transform and Convolution Computing Accelerators

Modern computing tasks are constrained to having digital electronic inpu...
research
07/03/2020

Noise-Robust Adaptation Control for Supervised System Identification Exploiting A Noise Dictionary

We present a noise-robust adaptation control strategy for block-online s...
research
12/12/2018

Thwarting Adversarial Examples: An L_0-RobustSparse Fourier Transform

We give a new algorithm for approximating the Discrete Fourier transform...
research
10/30/2018

Pseudo-Bayesian Learning with Kernel Fourier Transform as Prior

We revisit Rahimi and Recht (2007)'s kernel random Fourier features (RFF...

Please sign up or login with your details

Forgot password? Click here to reset