A. Hyvärinen and M. Inki
Estimating overcomplete independent component bases for image windows.
Submitted manuscript.
Postscript gzipped
PostScript
Abstract:
Estimating overcomplete ICA bases for image windows is a
difficult problem. Most algorithms are based on
approximations of the likelihood, which leads to computationally heavy
procedures. Here we first review the existing methods, and then
introduce two algorithms that are based on
heuristic approximations and estimate an approximate overcomplete
basis quite fast. The algorithms are based on
quasi-orthogonality in high-dimensional spaces, and the
gaussianization procedure, respectively.
Back to my on-line publications