1 March 1994 Disembedology and chaotic noise reduction
Author Affiliations +
Abstract
There have been many new methods for analyzing chaotic data proposed in the past few years. Not only can one do passive measurement of the dimensions and characteristic exponents of a chaotic data set, one can now also improve the data set by reducing the noise level. In addition, one can also predict its future for short times. These techniques for chaotic data analysis often start with a procedure of `embedding', or reconstruction of the attractors in some Euclidean space Rd. However, the inverse problem of the embedding, namely, to recover a best scalar time series from a given array of points in Rd, is often ignored. In this paper, we describe optimization criteria for disembedding.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert G. Cawley, Robert G. Cawley, Guan-Hsong Hsu, Guan-Hsong Hsu, } "Disembedology and chaotic noise reduction", Proc. SPIE 2037, Chaos/Nonlinear Dynamics: Methods and Commercialization, (1 March 1994); doi: 10.1117/12.167538; https://doi.org/10.1117/12.167538
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Estimators for overdetermined linear Stokes parameters
Proceedings of SPIE (May 03 2016)
"Smoothness" in embedded time series
Proceedings of SPIE (November 17 1993)
Noise reduction for chaotic data by geometric projection
Proceedings of SPIE (January 11 1993)
Distributed and fractal pixel sensors
Proceedings of SPIE (February 22 2005)

Back to Top