Assessing the severity of missing data problems with the interval discrete Fourier transform algorithm

Behrendt, Marco and de Angelis, Marco and Comerford, Liam and Beer, Michael; (2022) Assessing the severity of missing data problems with the interval discrete Fourier transform algorithm. In: Proceedings of the 32nd European Safety and Reliability Conference (ESREL 2022). Research Publishing, IRL, pp. 2553-2560. ISBN 9789811851834 (https://doi.org/10.3850/978-981-18-5183-4_S14-05-2...)

[thumbnail of Behrendt-etal-ESREL-2022-Assessing-the-severity-of-missing-data-problems-with-the-interval-discrete-Fourier-transform-algorithm]
Preview
 Text. Filename: Behrendt_etal_ESREL_2022_Assessing_the_severity_of_missing_data_problems_with_the_interval_discrete_Fourier_transform_algorithm.pdf
Final Published Version
License: Strathprints license 1.0
Download (352kB)| Preview

Abstract

The interval discrete Fourier transform (DFT) algorithm can propagate in polynomial time signals carrying interval uncertainty. By computing the exact theoretical bounds on signal with missing data, the algorithm can be used to assess the worst-case scenario in terms of maximum or minimum power, and to provide insights into the amplitude spectrum bands of the transformed signal. The uncertainty width of the spectrum bands can also be interpreted as an indicator of the quality of the reconstructed signal. This strategy must however, assume upper and lower values for the missing data present in the signal. While this may seem arbitrary, there are a number of existing techniques that can be used to obtain reliable bounds in the time domain, for example Kriging regressor or interval predictor models. Alternative heuristic strategies based on variable (as opposed to fixed) bounds can also be explored, thanks to the flexibility and efficiency of the interval DFT algorithm. This is illustrated by means of numerical examples and sensitivity analyses.

ORCID iDs

Behrendt, Marco, de Angelis, Marco ORCID logoORCID: https://orcid.org/0000-0001-8851-023X, Comerford, Liam and Beer, Michael;
CORE (COnnecting REpositories)