Affordable Access

Topology-based denoising of chaos

Authors
Publisher
Taylor and Francis Group
Publication Date
Keywords
  • Electrical Communication Engineering
Disciplines
  • Computer Science

Abstract

In this article, we propose a denoising algorithm to denoise a time series y(i) = x(i) + e(i), where {x(i)} is a time series obtained from a time- T map of a uniformly hyperbolic or Anosov flow, and {e(i)} a uniformly bounded sequence of independent and identically distributed (i.i.d.) random variables. Making use of observations up to time n, we create an estimate of x(i) for i<n. We show under typical limiting behaviours of the orbit and the recurrence properties of x(i), the estimation error converges to zero as n tends to infinity with probability 1.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Dynamical topology and statistical properties of s...

on Chaos An Interdisciplinary Jou... December 2012

Denoising based on time-shift PCA.

on Journal of Neuroscience Method... Sep 30, 2007
More articles like this..