By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. ...By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.展开更多
This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time...This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.展开更多
In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for unde...In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for underdetermined blind separation of sparse sources with unknown number of sources in the presence of noise. It uses the robust competitive agglomeration （RCA） algorithm to estimate the source number and the mixing matrix, and the source signals then are recovered by using the interior point linear programming. Simulation results show good performance of the proposed algorithm for underdetermined blind sources separation （UBSS）.展开更多
针对欠定盲源分离(Underdetermined blind source separation,UBSS)问题,采用基于密度的空间聚类(Density based spatial clustering of applications with noise,DBSCAN)算法估计聚类中心时易陷入局部最优,因此由聚类中心坐标构成的混...针对欠定盲源分离(Underdetermined blind source separation,UBSS)问题,采用基于密度的空间聚类(Density based spatial clustering of applications with noise,DBSCAN)算法估计聚类中心时易陷入局部最优,因此由聚类中心坐标构成的混合矩阵的精度降低,导致信号分离结果不理想。本文在DBSCAN基础上提出布谷鸟自适应搜索群优化算法(Cuckoo adaptive search swarm optimization of density based spatial clustering of applications with noise,CASSO-DBSCAN),该算法依据Levy飞行策略增强全局自适应搜索能力,并利用群体学习思想精细寻优得到最优解,从而更加精准地估计聚类中心。通过语音信号的盲源分离仿真实验对该算法进行验证,结果表明,该算法能够有效改善欠定混合矩阵的估计精度,具有良好的鲁棒性,证明了其可行性。展开更多
In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms accordin...In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.展开更多
基金supported by the National Natural Science Foundation of China(6120113461201135)+2 种基金the 111 Project(B08038)the Fundamental Research Funds for the Central Universities(72124669)the Open Research Fund of the Academy of Application(2014CXJJ-TX06)
文摘By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.
基金supported by the National Natural Science Foundation of China(61072120)
文摘This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.
基金the Research Foundation for Doctoral Programs of Higher Education of China (Grant No.20060280003)the Shanghai Leading Academic Discipline Project (Grant No.T0102)
文摘In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for underdetermined blind separation of sparse sources with unknown number of sources in the presence of noise. It uses the robust competitive agglomeration （RCA） algorithm to estimate the source number and the mixing matrix, and the source signals then are recovered by using the interior point linear programming. Simulation results show good performance of the proposed algorithm for underdetermined blind sources separation （UBSS）.
文摘针对欠定盲源分离(Underdetermined blind source separation,UBSS)问题,采用基于密度的空间聚类(Density based spatial clustering of applications with noise,DBSCAN)算法估计聚类中心时易陷入局部最优,因此由聚类中心坐标构成的混合矩阵的精度降低,导致信号分离结果不理想。本文在DBSCAN基础上提出布谷鸟自适应搜索群优化算法(Cuckoo adaptive search swarm optimization of density based spatial clustering of applications with noise,CASSO-DBSCAN),该算法依据Levy飞行策略增强全局自适应搜索能力,并利用群体学习思想精细寻优得到最优解,从而更加精准地估计聚类中心。通过语音信号的盲源分离仿真实验对该算法进行验证,结果表明,该算法能够有效改善欠定混合矩阵的估计精度,具有良好的鲁棒性,证明了其可行性。
基金supported by the National Natural Science Foundation of China(61201134)the 111 Project(B08038)
文摘In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.
