Blind Separation of Post-Nonlinear Mixtures Using Linearizing Transformations and Temporal Decorrelation
Abstract
We propose two methods that reduce the post-nonlinear blind source separation problem (PNL-BSS) 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 non-parametric statistics---to approximately invert the componentwise non-linear 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.
Cite
Text
Ziehe et al. "Blind Separation of Post-Nonlinear Mixtures Using Linearizing Transformations and Temporal Decorrelation." Journal of Machine Learning Research, 2003.Markdown
[Ziehe et al. "Blind Separation of Post-Nonlinear Mixtures Using Linearizing Transformations and Temporal Decorrelation." Journal of Machine Learning Research, 2003.](https://mlanthology.org/jmlr/2003/ziehe2003jmlr-blind/)BibTeX
@article{ziehe2003jmlr-blind,
title = {{Blind Separation of Post-Nonlinear Mixtures Using Linearizing Transformations and Temporal Decorrelation}},
author = {Ziehe, Andreas and Kawanabe, Motoaki and Harmeling, Stefan and Müller, Klaus-Robert},
journal = {Journal of Machine Learning Research},
year = {2003},
pages = {1319-1338},
volume = {4},
url = {https://mlanthology.org/jmlr/2003/ziehe2003jmlr-blind/}
}