检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071
出 处:《西安电子科技大学学报》2014年第6期1-5,88,共6页Journal of Xidian University
基 金:国家自然科学基金资助项目(61201134;61201135);中央高校基本科研业务费专项资金资助项目(72124669);高等学校学科创新引智计划资助项目(B08038);重大专项基金资助项目(2012ZX03001027-001)
摘 要:针对原有的拉普拉斯混合模型势函数法复杂度高、随机选取部分观测数据点作为初始聚类中心的算法聚类结果不稳定、准确率低的问题,提出了一种改进的势函数欠定盲源分离算法.该算法在基于密度概念的基础上,以簇内距离小、簇间距离大为原则,选取部分高密度点作为势函数的初始聚类中心.理论分析与仿真实验表明,改进算法的复杂度大大降低,而估计准确度降低很少.在信噪比为10dB时,该算法仿真时间降为原始势函数法的5%;相对随机选取算法,在计算复杂度基本一致的前提下,该算法的估计准确度大大提高,源信号个数估计准确率由61%提高到85%,混合矩阵估计误差由0.47下降为0.27.Aiming at the problem that the original Laplace Mixed Model Potential Function(LMMPF) algorithm has high complexity and the random initial cluster center algorithm has a low accuracy and stability,we propose an improved LMMPF algorithm.Based on the concept of density,we can choose some high-density data as the initial cluster centers.These data obey the principle that the distance between the data in the same group is small and the distance between groups is great.Theoretical analysis and experimental results show that compared to the original LMMPF algorithm the complexity of the new algorithm becomes much lower while the estimated accuracy is reduced only a little bit.When the Signal to Noise Ration(SNR)is 10 dB,the running time of the improved algorithm is reduced to 5%.Compared to the randomly-chosen algorithm,the new algorithm has a much higher accuracy:the accuracy rate of estimating the number of sources is raised from 61% to 85% and the mixing matrix estimated error is reduced from 0.47 to 0.27.
关 键 词:欠定盲源分离 混合矩阵估计 势函数法 密度法 初始聚类中心
分 类 号:TN911.4[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28