An Algorithm for Sensor Data Uncertainty Quantification

Abstract

This article presents an algorithm for reducing measurement uncertainty of one physical quantity when given oversampled measurements of two physical quantities with correlated noise. The algorithm assumes that the aleatoric measurement uncertainty in both physical quantities follows a Gaussian distribution and relies on sampling faster than it is possible for the measurand to change to calculate the parameters of the noise distribution. In constrast to the Kalman and particle filters, which respectively require state update equations and a map of one physical quality, our algorithm requires only the oversampled sensor measurements. When applied to temperature-compensated humidity sensors, it provides reduced uncertainty in humidity estimates from correlated temperature and humidity measurements. In an experimental evaluation, the algorithm achieves average uncertainty reduction of 10.3%. The algorithm incurs an execution time overhead of 5.3 % when compared to the minimum algorithm required to measure and calculate the uncertainty. Detailed instruction-level emulation of a C-language implementation compiled to the RISC-V architecture shows that the uncertainty reduction program required 0.05 % more instructions per iteration than the minimum operations required to calculate the uncertainty.

Cite as:

J. T. Meech and P. Stanley-Marbell, "An Algorithm for Sensor Data Uncertainty Quantification," in IEEE Sensors Letters, 6(1), pp. 1–4, January 2022, doi: 10.1109/LSENS.2021.3133761.

Bibtex:

@ARTICLE{9647933,  
author={Meech, James T and Stanley-Marbell, Phillip},
journal={IEEE Sensors Letters},
title={An Algorithm for Sensor Data Uncertainty Quantification},
month={january},
year={2022}, 
volume={6},  
number={1},  
pages={1-4},  
doi={10.1109/LSENS.2021.3133761}
}