An Underdetermined Blind Separation Algorithm Based on Fuzzy Clustering

Dalian, Liaoning(2008)

引用 2|浏览0
暂无评分
摘要
In underdetermined blind separation, the 'two-step approach' is often adopted, which depends on source signals' sparse representation. The first step is to estimate the mixture matrix by K-mean clustering algorithm using the sensor signals; and in the second step, the shortest-path algorithm is used to recover source signals. Generally, people suppose that the number of source signals is known when they estimate the mixture matrix by the K-mean clustering algorithm. In fact, the number of source signals is unknown or blind, so it is very important to estimate the number of source signals. In this paper, it gives a novel underdetermined blind separation algorithm based on fuzzy clustering, which can accurately estimate the number of sources and the mixture matrix respectively, by which source signals can be reconstructed. The last simulations show the good performance of the paper's algorithm.
更多
查看译文
关键词
fuzzy clustering,fuzzy set theory,pattern clustering,mixture matrix,k-mean clustering algorithm,source signal,shortest-path algorithm,blind separation algorithm,underdetermined blind separation,blind source separation,good performance,two-step approach,source signal sparse representation,last simulation,underdetermined blind separation algorithm,shortest path algorithm,algorithm design and analysis,reliability theory,mathematics,independent component analysis,data mining,mathematical model,clustering algorithms,sparse representation,sparse matrices,noise,k means clustering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要