- Abstract:
-
We propose two methods that reduce the post-nonlinear blind source separation problem (PNLBSS) to a linear BSS problem. The first method is based on the concept of maximal correlation: we apply the alternating conditional expectation (ACE) algorithm---a powerful technique from nonparametric statistics---to approximately invert the componentwise nonlinear functions. The second method is a Gaussianizing transformation, which is motivated by the fact that linearly mixed signals before nonlinear transformation are approximately Gaussian distributed. This heuristic, but simple and efficient procedure works as good as the ACE method. Using the framework provided by ACE, convergence can be proven. The optimal transformations obtained by ACE coincide with the sought-after inverse functions of the nonlinearities. After equalizing the nonlinearities, temporal decorrelation separation (TDSEP) allows us to recover the source signals. Numerical simulations testing "ACE-TD" and "Gauss-TD" on realistic examples are performed with excellent results.
- Links To Paper
- 1st Link
- Bibtex format
- @Article{EDI-INF-RR-0751,
- author = {
Andreas Ziehe
and Motoaki Kawanabe
and Stefan Harmeling
and Klaus-Robert Muller
},
- title = {Blind Separation of Post-nonlinear Mixtures using Linearizing Transformations and Temporal Decorrelation},
- journal = {Journal of Machine Learning Research (JMLR)},
- publisher = {MIT Press},
- year = 2003,
- month = {Dec},
- volume = {4},
- pages = {1319-1338},
- doi = {10.1162/jmlr.2003.4.7-8.1319},
- url = {http://www.jmlr.org/papers/volume4/ziehe03a/ziehe03a.pdf},
- }
|
