Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Karklin, Y.
Right arrow Articles by Lewicki, M. S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Karklin, Y.
Right arrow Articles by Lewicki, M. S.
(Neural Computation. 2005;17:397-423.)
© 2005 The MIT Press


Letter

A Hierarchical Bayesian Model for Learning Nonlinear Statistical Regularities in Nonstationary Natural Signals

Yan Karklin

yan+{at}cs.cmu.edu, Computer Science Department and Center for the Neural Basis of Cognition, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A.

Michael S. Lewicki

lewicki{at}cnbc.cmu.edu, Computer Science Department and Center for the Neural Basis of Cognition, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A.

Capturing statistical regularities in complex, high-dimensional data is an important problem in machine learning and signal processing. Models such as principal component analysis (PCA) and independent component analysis (ICA) make few assumptions about the structure in the data and have good scaling properties, but they are limited to representing linear statistical regularities and assume that the distribution of the data is stationary. For many natural, complex signals, the latent variables often exhibit residual dependencies as well as nonstationary statistics. Here we present a hierarchical Bayesian model that is able to capture higher-order nonlinear structure and represent nonstationary data distributions. The model is a generalization of ICA in which the basis function coefficients are no longer assumed to be independent; instead, the dependencies in their magnitudes are captured by a set of density components. Each density component describes a common pattern of deviation from the marginal density of the pattern ensemble; in different combinations, they can describe nonstationary distributions. Adapting the model to image or audio data yields a nonlinear, distributed code for higher-order statistical regularities that reflect more abstract, invariant properties of the signal.




This article has been cited by other articles:


Home page
Neural Comput.Home page
R. Turner and M. Sahani
A maximum-likelihood interpretation for slow feature analysis.
Neural Comput., April 1, 2007; 19(4): 1022 - 1038.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
F. Creutzig and H. Sprekeler
Predictive Coding and the Slowness Principle: An Information-Theoretic Approach
Neural Comput., April 1, 2007; 20(4): 1026 - 1041.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
O. Schwartz, T. J. Sejnowski, and P. Dayan
Soft mixer assignment in a hierarchical generative model of natural scene statistics.
Neural Comput., November 1, 2006; 18(11): 2680 - 2718.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. Osindero, M. Welling, and G. E. Hinton
Topographic Product Models Applied to Natural Scene Statistics
Neural Comput., February 1, 2005; 18(2): 381 - 414.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2005 by The MIT Press.