Abstract
In linear mixtures, priors, like temporal coloration of the sources, can be used for designing simpler and better algorithms. Especially, modeling sources by Markov models is very efficient, and Markov source separation can be achieved by minimizing the conditional mutual information [1, 2]. This model allows to separate temporally colored Gaussian sources. In this paper, we extend this result for post-nonlinear mixtures (PNL) [3], and show that algorithms based on a Markov model of colored sources leads to better separation results than without prior, i.e. assuming iid sources. The paper contains theoretical developments, and experiments with auto-regressive (AR) source mixtures. PNL algorithms for Markov sources point out a performance improvement of about 7dB with respect to PNL algorithms for iid sources. © Springer-Verlag 2004.
Cite
CITATION STYLE
Larue, A., Jutten, C., & Hosseini, S. (2004). Markovian source separation in post-nonlinear mixtures. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 702–709. https://doi.org/10.1007/978-3-540-30110-3_89
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.