Mixing matrix estimation method for dual‐channel time‐frequency overlapped signals based on interval probability

For dual‐channel time‐frequency (TF) overlapped signals with low sparsity in underdetermined blind source separation (UBSS), this paper proposes an effective method based on interval probability to estimate and expand the types of mixing matrices. First, the detection of TF single‐source points (TF‐SSP) is used to improve the TF sparsity of each source. For more distinguishability, as the ratios of the coefficients from different columns of the mixing matrix are close, a local peak‐detection mechanism based on interval probability (LPIP) is proposed. LPIP utilizes uniform subintervals to optimize and classify the TF coefficient ratios of the detected TF‐SSP effectively in the case of a high level of TF overlap among sources and reduces the TF interference points and redundant signal features greatly to enhance the estimation accuracy. The simulation results show that under both noiseless and noisy cases, the proposed method performs better than the selected mainstream traditional methods, has good robustness, and has low algorithm complexity.     

Methods for solving underdetermined systems

We compare some alternative methods for computing solutions of underdetermined linear systems, Ax=b. Each method involves solving an associated system with a different nonsingular coefficient matrix, . We obtain bounds on the condition numbers of these nonsingular matrices and test the methods on numerical examples. We discuss implications for computing eigenvector derivatives and make some recommendations.     

A Faster and Simpler Recursive Algorithm for the LAPACK Routine DGELS

We present new algorithms for computing the linear least squares solution to overdetermined linear systems and the minimum norm solution to underdetermined linear systems. For both problems, we consider the standard formulation min AX – B _F and the transposed formulation min A ^T X – B _F , i.e, four different problems in all. The functionality of our implementation corresponds to that of the LAPACK routine DGELS. The new implementation is significantly faster and simpler. It outperforms the LAPACK DGELS for all matrix sizes tested. The improvement is usually 50–100% and it is as high as 400%. The four different problems of DGELS are essentially reduced to two, by use of explicit transposition of A. By explicit transposition we avoid computing Householder transformations on vectors with large stride. The QR factorization of block columns of A is performed using a recursive level-3 algorithm. By interleaving updates of B with the factorization of A, we reduce the number of floating point operations performed for the linear least squares problem. By avoiding redundant computations in the update of B we reduce the work needed to compute the minimum norm solution. Finally, we outline fully recursive algorithms for the four problems of DGELS as well as for QR factorization.This revised version was published online in October 2005 with corrections to the Cover Date.     

Lagrange分析方法及其新进展

Lagrange分析是Fowles等人于70年代初首先提出的,在动态实验数据处理中有重要应用,但是实践表明有时所得的结果不可信。近年来,Lagrange分析方法得到迅速的发展,提出了不少新的思想、方法和改进,如冲量时间积分函数、曲面拟合,反解法和自治性检验等。尤其在与Lagrange分析密切相关的非简单波特性的研究方面取得了相当大的进展。本文主要评述Lagrange分析的最新进展,对它的历史和今后发展趋势也作了扼要说明。      

动态变化混叠模型下盲源分离中的源数估计

在进行欠定盲分离时,特别是对于源信号数目及混合矩阵动态变化的情况,常规的欠定盲分离及源数估计方法不能对源信号数目的变化时刻做出判断,因此很难实现动态变化的源信号数目实时和准确的估计。针对这个问题,提出了一种动态变化混叠模型下欠定盲源分离中的源数估计方法。首先,建立动态变化混叠情形下盲源分离的数学模型及动态标识矩阵。其次,基于构建的动态标识矩阵统计和判断动态源信号数目的变化情况。最后,通过分段时间内多维观测矢量采样点聚类区间局部峰值统计,实现动态变化混叠模型下盲源分离中的源信号数目的有效估计。仿真结果表明,该方法能有效实现动态变化混叠模型下欠定盲源分离中的源数估计,并且信号估计效果良好。     

一种基于lp模约束的FOCUSS迭代 EEG源定位新方法

如何有效地从头表记录电位中准确定位脑电源的真实活动位置是神经认知脑功能研究中的一个关键问题.本文在FOCUSS算法迭代基础上,从脑神经活动的局部稀疏性出发,提出了一种新的脑功能成像方法.在该算法中,通过把稀疏性的l_p模约束加入到修改的FOCUSS算法的迭代过程中,使算法可以有效地收敛于真实的稀疏源活动位置.利用该方法对随机系统、三层球模型及真实头模型确定的稀疏欠定系统进行了求解模拟实验,结果显示了该方法在求解欠定系统及EEG源定位时具有良好的稳健性.     

基于两步法稀疏分量分析的欠定盲源分离

分析了解决欠定盲源分离问题的稀疏分量分析方法。首先讨论了数据矩阵稀疏表示（分解）的方法,其次重点讨论了基于稀疏因式分解方法的盲源分离。该盲源分离技术分两步．一步是估计混合矩阵,第二步是估计源矩阵。如源信号是高度稀疏的,盲分离可直接在时域内实现。否则．对观测的混合矩阵运用小波包变换预处理后才能进行。仿真结果证明了理论分析的正确性。     

具有延迟的欠定语音盲分离

探讨具有延迟的欠定语音盲分离问题,针对语音信号的部分W-分离正交性,提出一种新的基于混叠矩阵估计的语音盲分离方法.首先对观测信号进行短时傅里叶变换,选定一个信号作为参考信号,构造幅度衰减向量和时间延迟向量,提取单源主导区间的观测信号作为观测样本;然后对观测样本进行聚类,通过估计参考信号的混叠系数来估计混叠矩阵;最后结合...     

Iterative methods for the canonical decomposition of multi-way arrays: Application to blind underdetermined mixture identification

Two main drawbacks can be stated in the alternating least square (ALS) algorithm used to fit the canonical decomposition (CAND) of multi-way arrays. First its slow convergence caused by the presence of collinearity between factors in the multi-way array it decomposes. Second its blindness to Hermitian symmetries of the considered arrays. Enhanced line search (ELS) scheme was found to be a good way to cope with the slow convergence of the ALS algorithm together with a partial use of the Hermitian symmetry. However, to our knowledge, required equations to perform the latter scheme are only given in the case of third and fifth order arrays. Therefore, our first contribution consists in generalizing the ELS procedure to the case of complex arrays of any order greater than three. Our second contribution is another improvement of the ALS scheme, able to profit from Hermitianity and positive semi-definiteness of the considered arrays. It consists in resorting to the CAND first of a third order array having one unitary loading matrix and second of several rank-1 arrays. An iterative algorithm is then proposed alternating between Procrustes problem solving and the computation of rank-one matrix approximations in order to achieve the CAND of the third order array.