检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学信息科学与工程学院,南京210096
出 处:《Journal of Southeast University(English Edition)》2016年第2期135-140,共6页东南大学学报(英文版)
基 金:The National Natural Science Foundation of China(No.60872074)
摘 要:In order to decrease the probability of missing some data points or noises being added in the inverse truncated mixing matrix (ITMM) algorithm, a two-stage frequency- domain method is proposed for blind source separation of underdetermined instantaneous mixtures. The separation process is decomposed into two steps of ITMM and matrix completion in the view that there are many soft-sparse (not very sparse) sources. First, the mixing matrix is estimated and the sources are recovered by the traditional ITMM algorithm in the frequency domain. Then, in order to retrieve the missing data and remove noises, the matrix completion technique is applied to each preliminary estimated source by the traditional ITMM algorithm in the frequency domain. Simulations show that, compared with the traditional ITMM algorithms, the proposed two-stage algorithm has better separation performances. In addition, the time consumption problem is considered. The proposed algorithm outperforms the traditional ITMM algorithm at a cost of no more than one- fourth extra time consumption.为了减少传统的截断混合矩阵求逆(ITMM)算法在个别时频点会丢失数据或者产生噪声信号的概率,提出了一种基于频域的2步欠定瞬时盲分离算法.由于现实中存在大量软稀疏(稀疏度不是很大)混合信号,将分离过程分解为ITMM和矩阵补偿2个步骤.首先估计出混合矩阵和利用经典的ITMM算法对混合信号进行初步恢复,然后对初步估计的信号时频矩阵进行矩阵补偿处理,从而达到修补丢失数据和去除多余数据(去噪)的效果.实验仿真验证了所提出的2步分离法相对于传统的ITMM算法能够得到更好的分离效果.此外,对算法的时耗问题进行了研究,相对于传统的ITMM算法,所提算法的时耗增加不到四分之一,却能够得到更好的分离效果.
关 键 词:inverse truncated mixing matrix under-determined blind source separation (UBSS) frequencydomain matrix completion
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222