Abstract
Most of existing convolutive nonnegative matrix factorization algorithms are sensitive to noise and outliers. In this paper, a robust convolutive nonnegative matrix factorization algorithm for convolutive BSS is proposed. The algorithm uses the projected gradient descent method to minimize the robust statistic energy function and yields two equations updated alternatively. Unlike other nonnegative matrix factorization algorithms, the robust convolutive nonnegative matrix factorization algorithm is resistant to noise and outliers. Experimental results on convolutive blind source separation are presented to illustrate the much improved performance of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
