Dynamical sampling with additive random noise
classification
🧮 math.NA
keywords
dynamicalnoisesamplingadditivealgorithmsrealactionalgorithm
read the original abstract
Dynamical sampling deals with signals that evolve in time under the action of a linear operator. The purpose of the present paper is to analyze the performance of the basic dynamical sampling algorithms in the finite dimensional case and study the impact of additive noise. The algorithms are implemented and tested on synthetic and real data sets, and denoising techniques are integrated to mitigate the effect of the noise. We also develop theoretical and numerical results that validate the algorithm for recovering the driving operators, which are defined via a real symmetric convolution.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.