Blind source separation by nonnegative matrix factorization with minimum-volume constraint

Proceedings of 2010 International Conference on Intelligent Control and Information Processing, ICICIP 2010(2010)

引用 2|浏览10
暂无评分
摘要
Recently, nonnegative matrix factorization (NMF) attracts more and more attentions for the promising of wide applications. A problem that still remains is that, however, the factors resulted from it may not necessarily be realistically interpretable. Some constraints are usually added to the standard NMF to generate such interpretive results. In this paper, a minimum-volume constrained NMF is proposed and an efficient multiplicative update algorithm is developed based on the natural gradient optimization. The proposed method can be applied to the blind source separation (BSS) problem, a hot topic with many potential applications, especially if the sources are mutually dependent. Simulation results of BSS for images show the superiority of the proposed method. © 2010 IEEE.
更多
查看译文
关键词
algorithm design and analysis,optimization,blind source separation,signal to noise ratio,matrix decomposition,nonnegative matrix factorization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要