Approximate Maximum Likelihood Source Separation Using the Natural Gradient
Lists
Only you see this
Abstract
This paper addresses a maximum likelihood method for source separation in the case of overdetermined mixtures corrupted by additive white Gaussian noise. We consider an approximate likelihood which is based on the Laplace approximation and develop a natural gradient adaptation algorithm to find a local maximum of the corresponding approximate likelihood. We present a detailed mathematical derivation of the algorithm using the Lie group invariance. Useful behavior of the algorithm is verified by numerical experiments.
BibTeX
@article{choi2003approximate,
author = {Seungjin Choi and Andrzej Cichocki and Liqing Zhang and Shun-ichi Amari},
title = {{Approximate Maximum Likelihood Source Separation Using the Natural Gradient}},
journal = {IEICE Trans. Fundam. Electron. Commun. Comput. Sci.},
year = {2003},
url = {https://openreview.net/forum?id=R1E662cuql},
}Loading related content...