Extracting Latent Dynamics from Multi-dimensional Data by Probabilistic Slow Feature Analysis
Slow feature analysis (SFA) is a time-series analysis method for extracting slowly-varying latent features from multi-dimensional data. In this paper, the probabilistic version of SFA algorithms is discussed from a theoretical point of view. First, the fundamental notions of SFA algorithms are reviewed in order to show the mechanism of extracting the slowly-varying latent features by means of the SFA. Second, recent advances in the SFA algorithms are described on the emphasis of the probabilistic version of the SFA. Third, the probabilistic SFA with rigorously derived likelihood function is derived by means of belief propagation. Using the rigorously derived likelihood function, we simultaneously extracts slow features and underlying parameters for the latent dynamics. Finally, we show using synthetic data that the probabilistic SFA with rigorously derived likelihood function can estimate the slow feature accurately even under noisy environments.
KeywordsSlow feature analysis State-space model Probabilistic information processing Bayesian statistics Latent dynamics
Unable to display preview. Download preview PDF.
- 5.Berkes, P.: Pattern Recognition with Slow Feature Analysis. Cognitive Sciences EPrint Archive (CogPrint) 4104 (2005)Google Scholar
- 12.Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman (1988)Google Scholar
- 13.Sekiguchi, T., Omori, T., Okada, M.: Effect of Observation Noise in Probabilistic Slow Feature Analysis. IPSJ Trans. Math. Model. Appl. (in press)Google Scholar
- 14.Sekiguchi, T., Omori, T., Okada, M.: Belief Propagation for Probabilisitic Slow Feature Analysis. IEICE Tech. Rep. (2011)Google Scholar
- 15.Omori T., Sekiguchi, T., Okada, M.: (in prep.)Google Scholar