Disembedology and chaotic noise reduction

Robert G. Cawley; Guan-Hsong Hsu

doi:10.1117/12.167538

1 March 1994 Disembedology and chaotic noise reduction

Robert G. Cawley, Guan-Hsong Hsu

Proceedings Volume 2037, Chaos/Nonlinear Dynamics: Methods and Commercialization; (1994) https://doi.org/10.1117/12.167538
Event: SPIE's 1993 International Symposium on Optics, Imaging, and Instrumentation, 1993, San Diego, CA, United States

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 R^d. However, the inverse problem of the embedding, namely, to recover a best scalar time series from a given array of points in R^d, is often ignored. In this paper, we describe optimization criteria for disembedding.

Citation Download Citation

Robert G. Cawley and Guan-Hsong Hsu "Disembedology and chaotic noise reduction", Proc. SPIE 2037, Chaos/Nonlinear Dynamics: Methods and Commercialization, (1 March 1994); https://doi.org/10.1117/12.167538

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available