Computational Intelligence and Complexity Measures for Chaotic Information Processing

This dissertation investigates the application of computational intelligence methods in the analysis of nonlinear chaotic systems in the framework of many known and newly designed complex systems. Parallel comparisons are made between these methods. This provides insight into the difficult challenges facing nonlinear systems characterization and aids in developing a generalized algorithm in computing algorithmic complexity measures, Lyapunov exponents, information dimension and topological entropy. These metrics are implemented to characterize the dynamic patterns of discrete and continuous systems. These metrics make it possible to distinguish order from disorder in these systems. Steps required for computing Lyapunov exponents with a reorthonormalization method and a group theory approach are formalized. Procedures for implementing computational algorithms are designed and numerical results for each system are presented. The advance-time sampling technique is designed to overcome the scarcity of phase space samples and the buffer overflow problem in algorithmic complexity measure estimation in slow dynamics feedback-controlled systems. It is proved analytically and tested numerically that for a quasiperiodic system like a Fibonacci map, complexity grows logarithmically with the evolutionary length of the data block. It is concluded that a normalized algorithmic complexity measure can be used as a system classifier. This quantity turns out to be one for random sequences and a non-zero value less than one for chaotic sequences. For periodic and quasi-periodic responses, as data strings grow their normalized complexity approaches zero, while a faster deceasing rate is observed for periodic responses. Algorithmic complexity analysis is performed on a class of certain rate convolutional encoders. The degree of diffusion in random-like patterns is measured. Simulation evidence indicates that algorithmic complexity associated with a particular class of 1/n-rate code increases with the increase of the encoder constraint length. This occurs in parallel with the increase of error correcting capacity of the decoder. Comparing groups of rate-1/n convolutional encoders, it is observed that as the encoder rate decreases from 1/2 to 1/7, the encoded data sequence manifests smaller algorithmic complexity with a larger free distance value

Time series causality analysis and EEG data analysis on music improvisation

This thesis describes a PhD project on time series causality analysis and applications. The project is motivated by two EEG measurements of music improvisation experiments, where we aim to use causality measures to construct neural networks to identify the neural differences between improvisation and non-improvisation. The research is based on mathematical backgrounds of time series analysis, information theory and network theory. We first studied a series of popular causality measures, namely, the Granger causality, partial directed coherence (PDC) and directed transfer function (DTF), transfer entropy (TE), conditional mutual information from mixed embedding (MIME) and partial MIME (PMIME), from which we proposed our new measures: the direct transfer entropy (DTE) and the wavelet-based extensions of MIME and PMIME. The new measures improved the properties and applications of their father measures, which were verified by simulations and examples. By comparing the measures we studied, MIME was found to be the most useful causality measure for our EEG analysis. Thus, we used MIME to construct both the intra-brain and cross-brain neural networks for musicians and listeners during the music performances. Neural differences were identified in terms of direction and distribution of neural information flows and activity of the large brain regions. Furthermore, we applied MIME on other EEG and financial data applications, where reasonable causality results were obtained.Open Acces

Research on digital image watermark encryption based on hyperchaos

The digital watermarking technique embeds meaningful information into one or more watermark images hidden in one image, in which it is known as a secret carrier. It is difficult for a hacker to extract or remove any hidden watermark from an image, and especially to crack so called digital watermark. The combination of digital watermarking technique and traditional image encryption technique is able to greatly improve anti-hacking capability, which suggests it is a good method for keeping the integrity of the original image. The research works contained in this thesis include: (1)A literature review the hyperchaotic watermarking technique is relatively more advantageous, and becomes the main subject in this programme. (2)The theoretical foundation of watermarking technologies, including the human visual system (HVS), the colour space transform, discrete wavelet transform (DWT), the main watermark embedding algorithms, and the mainstream methods for improving watermark robustness and for evaluating watermark embedding performance. (3) The devised hyperchaotic scrambling technique it has been applied to colour image watermark that helps to improve the image encryption and anti-cracking capabilities. The experiments in this research prove the robustness and some other advantages of the invented technique. This thesis focuses on combining the chaotic scrambling and wavelet watermark embedding to achieve a hyperchaotic digital watermark to encrypt digital products, with the human visual system (HVS) and other factors taken into account. This research is of significant importance and has industrial application value

A simple method for detecting chaos in nature

Chaos, or exponential sensitivity to small perturbations, appears everywhere in nature. Moreover, chaos is predicted to play diverse functional roles in living systems. A method for detecting chaos from empirical measurements should therefore be a key component of the biologist's toolkit. But, classic chaos-detection tools are highly sensitive to measurement noise and break down for common edge cases, making it difficult to detect chaos in domains, like biology, where measurements are noisy. However, newer tools promise to overcome these limitations. Here, we combine several such tools into an automated processing pipeline, and show that our pipeline can detect the presence (or absence) of chaos in noisy recordings, even for difficult edge cases. As a first-pass application of our pipeline, we show that heart rate variability is not chaotic as some have proposed, and instead reflects a stochastic process in both health and disease. Our tool is easy-to-use and freely available

Festschrift on the occasion of Ulrike Feudel’s 60th birthday

Peer reviewedPostprin

Amplitude Death: The emergence of stationarity in coupled nonlinear systems

When nonlinear dynamical systems are coupled, depending on the intrinsic dynamics and the manner in which the coupling is organized, a host of novel phenomena can arise. In this context, an important emergent phenomenon is the complete suppression of oscillations, formally termed amplitude death (AD). Oscillations of the entire system cease as a consequence of the interaction, leading to stationary behavior. The fixed points that the coupling stabilizes can be the otherwise unstable fixed points of the uncoupled system or can correspond to novel stationary points. Such behaviour is of relevance in areas ranging from laser physics to the dynamics of biological systems. In this review we discuss the characteristics of the different coupling strategies and scenarios that lead to AD in a variety of different situations, and draw attention to several open issues and challenging problems for further study.Comment: Physics Reports (2012

Design and Implementation of Secure Chaotic Communication Systems

Chaotic systems have properties such as ergodicity, sensitivity to initial conditions/parameter mismatches, mixing property, deterministic dynamics, structure complexity, to mention a few, that map nicely with cryptographic requirements such as confusion, diffusion, deterministic pseudorandomness, algorithm complexity. Furthermore, the possibility of chaotic synchronization, where the master system (transmitter) is driving the slave system (receiver) by its output signal, made it probable for the possible utilization of chaotic systems to implement security in the communication systems. Many methods like chaotic masking, chaotic modulation, inclusion, chaotic shift keying (CSK) had been proposed however, many attack methods later showed them to be insecure. Different modifications of these methods also exist in the literature to improve the security, but almost all suffer from the same drawback. Therefore, the implementation of chaotic systems in security still remains a challenge. In this work, different possibilities on how it might be possible to improve the security of the existing methods are explored. The main problem with the existing methods is that the message imprint could be found in the dynamics of the transmitted signal, therefore by some signal processing or pattern classification techniques, etc, allow the exposition of the hidden message. Therefore, the challenge is to remove any pattern or change in dynamics that the message might bring in the transmitted signal

The effects of ball interactions on the dynamic behavior of a ball balancer rotating at speeds above the translational resonant frequency of the system.

Many applications are inherently rotational in nature. These applications range from industrial products to consumer products. As seen in a traditional frequency response plot, the motion of a rotating imbalance does not approach zero as the forcing frequency is increased. Unlike a traditional forced mass spring oscillator, the motion of the rotating imbalance approaches some non-zero value. To account for this residual motion, some systems utilize a balancing device to reduce this motion. These balancing devices can be passive or active, depending on the design considerations. This paper will focus on the traditional, passive ball-type balancer due to its simplicity and extensive use in application. This paper derives the equations of motion for a vertically oriented ball-type balancing system. Due to the high non-linearity of these equations, a fourth order Runge-Kutta numerical integration method is used. The ball balancer equations of motion contain the proper physics needed for full operation such that the ball balancer can translate horizontally, vertically and rotate angularly in the presence of gravity. Acceleration terms are included such that a wide range of operating conditions can be tested. Additionally, n number of balls are present, which are affected by rolling friction and viscous fluid drag. Unlike many numerical models published in the past, the ball-to-ball interactions are not neglected within this model. These interactions include collisions, and train formations and separations. An application of the method presented by (Henon 1982) is utilized where the equations of motion are altered such that an exact integration step can be solved. This is based on the need for a displacement step (collision) or a force step (separation). Although the model presented can accommodate n number of balls, only a maximum ball count of two is considered. It is shown how the behavior of the balls affect the motion response of the ball balancer at rotational velocities above the translational resonance of the system. It is seen that a critical transition is reached; the operating point at which the ball balancer becomes effective at offsetting an eccentric mass. It is also seen that ball balancer displacement decreases until a point of saturation, after which ball balancer displacement increases. Also for the two ball case, it is shown that the spatial characteristics of the balls do affect steady state motion. The angle that separates two contacting balls alters the center of gravity of the train of balls such that the balancing capacity of the system is reduced. Although this effect is shown to be small for a two ball case, the balancing capacity is further reduced as the angle between two contacting balls becomes larger