3,297 research outputs found
Particle filtering in high-dimensional chaotic systems
We present an efficient particle filtering algorithm for multiscale systems,
that is adapted for simple atmospheric dynamics models which are inherently
chaotic. Particle filters represent the posterior conditional distribution of
the state variables by a collection of particles, which evolves and adapts
recursively as new information becomes available. The difference between the
estimated state and the true state of the system constitutes the error in
specifying or forecasting the state, which is amplified in chaotic systems that
have a number of positive Lyapunov exponents. The purpose of the present paper
is to show that the homogenization method developed in Imkeller et al. (2011),
which is applicable to high dimensional multi-scale filtering problems, along
with important sampling and control methods can be used as a basic and flexible
tool for the construction of the proposal density inherent in particle
filtering. Finally, we apply the general homogenized particle filtering
algorithm developed here to the Lorenz'96 atmospheric model that mimics
mid-latitude atmospheric dynamics with microscopic convective processes.Comment: 28 pages, 12 figure
Dynamic gesture recognition using PCA with multi-scale theory and HMM
In this paper, a dynamic gesture recognition system is presented which requires no special hardware other than a Webcam. The system is based on a novel method combining Principal Component Analysis (PCA) with hierarchical multi-scale theory and Discrete Hidden Markov Models (DHMM). We use a hierarchical decision tree based on multiscale theory. Firstly we convolve all members of the training data with a Gaussian kernel, which blurs differences between images and reduces their separation in feature space. This reduces the number of eigenvectors needed to describe the data. A principal component space is computed from the convolved data. We divide the data in this space into two clusters using the k-means algorithm. Then the level of blurring is reduced and PCA is applied to each of the clusters separately. A new principal component space is formed from each cluster. Each of these spaces is then divided into two and the process is repeated. We thus produce a binary tree of principal component spaces where each level of the tree represents a different degree of blurring. The search time is then proportional to the depth of the tree, which makes it possible to search hundreds of gestures in real time. The output of the decision tree is then input into DHMM to recognize temporal information
- …