Underdetermined blind source separation of temporomandibular joint sounds

The underdetermined blind source separation problem using a filtering approach is addressed. An extension of the FastICA algorithm is devised which exploits the disparity in the kurtoses of the underlying sources to estimate the mixing matrix and thereafter achieves source recovery by employing the ll-norm algorithm. Besides, we demonstrate how promising FastICA can be to extract the sources. Furthermore, we illustrate how this scenario is particularly appropriate for the separation of temporomandibular joint (TMJ) sounds.     

多维盲信源分离的联合块对角化方法

根据多维盲信源分离中源信号组内相关、组间独立的特点,提出一种利用联合块对角化解决该问题的方法,并用经过改造的雅克比算法实现。源信号自相关矩阵具有块对角结构,使得白化后观测数据的时延相关矩阵具有可联合块对角化的结构,因此可以通过联合块对角化来辨识分离矩阵中的正交部分以恢复源信号。针对联合块对角化的特点,对传统的雅克比方法加以改造,将GIVENS旋转矩阵中参数的选择问题转化为一元四次三角函数多项式的优化问题,同时调整旋转的循环顺序。这样,通过连续的GIVENS旋转即可实现联合块对角化。实验仿真和分析表明了算法的有效性。      

DS-CDMA系统中基于盲分离的DOA估计

针对异步DS-CDMA系统的多用户环境,提出了一种适用于过载状态(路径总数大于天线阵元数)下的DOA估计算法.该算法首先基于最小输出能量(MOE)准则分离出感兴趣信息,此时,感兴趣信息中包含的路径数小于天线阵元数;然后采用计算简便的矩阵点除算法高效地解析出各DOA信息.算法具有计算量小,估计精度高等优点.仿真实验验证了算法的有效性.     

Computerized classification of temporomandibular joint sounds

Sounds, such as clicking and/or crepitation, evoked in the temporomandibular (jaw) joint during function may indicate pathology. Analysis of the reduced interference time-frequency distribution of these sounds is of diagnostic value. However, visual evaluation is expensive and error prone, and there is, thus, a need for automated analysis. The aim of this study was to find the optimal signal representation and pattern recognition method for computerized classification of temporomandibular joint sounds. Concepts of time-shift invariance with and without scale invariance were employed and mutually compared. The automated analysis methods provided classification results that were similar to previous visual classification of the sounds. It was found that the classifier performance was significantly improved when scale invariance was omitted. This behavior occurred because scale invariance interfered with the frequency content of the signal. Therefore, scale invariance should not be pursued in the classification scheme employed in this study.     

基于信源数目估计的超定盲信号分离

针对盲信号分离中信道噪声大、信号分离效果差等问题,在传统主分量分析和特征值分解方法的基础上,提出了一种基于信源数目估计的超定盲信号分离方法。首先,采用主分量分析和最大似然估计方法分别对混合矩阵和噪声协方差进行估计,用于对信道噪声的估计与去除;然后,采用交叉验证法对源信号维数进行估计,实现盲信号分离。为了验证提出算法的分离效果,对轻拖尾与轻拖尾混合信号以及重拖尾与轻拖尾信号混合情况进行仿真实验验证,结果表明该算法具有良好的分离效果。     

利用盲源分离算法实现DOA估计

提出一种基于快速盲源分离算法实现波达方向（DOA）估计的方法。构造了具有对角化结构的相关矩阵组,引入解盲源分离问题的联合对角化代价函数,采用一种快速的复数域乘性迭代算法求解代价函数,得到混迭矩阵逆的估计,进而实现DOA估计。与同类算法相比,该算法具有更广的适用性和更精确的DOA估计性能。仿真实验结果验证了算法的快速收敛性和优越的估计性能。     

Concurrent speakers localization using blind source separation and microphone array geometry

Multidimensional Systems and Signal Processing - Speaker localization has been an active topic of research due to its wide range of applications in multimedia and communication technologies. While...     

Joint blind source separation by generalized joint diagonalization of cumulant matrices

In this paper, we show that the joint blind source separation (JBSS) problem can be solved by jointly diagonalizing cumulant matrices of any order higher than one, including the correlation matrices and the fourth-order cumulant matrices. We introduce an efficient iterative generalized joint diagonalization algorithm such that a series of orthogonal procrustes problems are solved. We present simulation results to show that the new algorithms can reliably solve the permutation ambiguity in JBSS and that they offer superior performance compared with existing multiset canonical correlation analysis (MCCA) and independent vector analysis (IVA) approaches. Experiment on real-world data for separation of fetal heartbeat in electrocardiogram (ECG) data demonstrates a new application of JBSS, and the success of the new algorithms for a real-world problem.     

Probability estimation for recoverability analysis of blind source separation based on sparse representation

An important application of sparse representation is underdetermined blind source separation (BSS), where the number of sources is greater than the number of observations. Within the stochastic framework, this paper discusses recoverability of underdetermined BSS based on a two-stage sparse representation approach. The two-stage approach is effective when the source matrix is sufficiently sparse. The first stage of the two-stage approach is to estimate the mixing matrix, and the second is to estimate the source matrix by minimizing the 1-norms of the source vectors subject to some constraints. After estimating the mixing matrix and fixing the number of nonzero entries of a source vector, we estimate the recoverability probability (i.e., the probability that the source vector can be recovered). A general case is then considered where the number of nonzero entries of the source vector is fixed and the mixing matrix is drawn from a specific probability distribution. The corresponding probability estimate on recoverability is also obtained. Based on this result, we further estimate the recoverability probability when the sources are also drawn from a distribution (e.g., Laplacian distribution). These probability estimates not only reflect the relationship between the recoverability and sparseness of sources, but also indicate the overall performance and confidence of the two-stage sparse representation approach for solving BSS problems. Several simulation results have demonstrated the validity of the probability estimation approach.     

Convolutive blind source separation based on joint block Toeplitzation and block-inner diagonalization

This paper takes a close look at the block Toeplitz structure and block-inner diagonal structure of auto correlation matrices of source signals in convolutive blind source separation (BSS) problems. The aim is to propose a one-stage time-domain algorithm for convolutive BSS by explicitly exploiting the structure in autocorrelation matrices of source signals at different time delays and inherent relations among these matrices. The main idea behind the proposed algorithm is to implement the joint block Toeplitzation and block-inner diagonalization (JBTBID) of a set of correlation matrices of the observed vector sequence such that the mixture matrix can be extracted. For this purpose, a novel tri-quadratic cost function is introduced. The important feature of this tri-quadratic contrast function enables the development of an efficient algebraic method based on triple iterations for searching the minimum point of the cost function, which is called the triply iterative algorithm (TIA). Through the cyclic minimization process in the proposed TIA, it is expected that the JBTBID is achieved. The source signals can be retrieved. Moreover, the asymptotic convergence of the proposed TIA is analyzed. Convergence performance of the TIA and the separation results are also demonstrated by simulations in comparison with some other prominent two-stage time-domain methods.     

一种欠定盲源分离中混合矩阵的估计方法

欠定盲源分离问题中基于源信号稀疏性的两阶段法中,混合矩阵估计的准确与否,直接影响源信号的恢复效果。文中提出了一种在稀疏域估计混合矩阵的新方法。该方法通过搜索稀疏域中同一直线附近的点,利用这些点重构出混合矩阵,避免了远离直线周边的点对估计混合矩阵的干扰,从而大大降低了计算量。仿真表明该算法性能良好。     

Uncorrelated component analysis for blind source separation

The uncorrelated component analysis (UCA) of a stationary random vector process consists of searching for a linear transformation that minimizes the temporal correlation between its components. Through a general analysis we show that under practically reasonable and mild conditions UCA is a solution for blind source separation. The theorems proposed in this paper for UCA provide useful insights for developing practical algorithms. UCA explores the temporal information of the signals, whereas independent component analysis (ICA) explores the spatial information; thus UCA can be applied for source separation in some cases where ICA cannot. For blind source separation, combining ICA and UCA may give improved performance because more information can be utilized. The concept of single UCA (SUCA) is also proposed, which leads to sequential source separation.This work was supported in part by grants from the Research Grants Council of Hong Kong, grants HKU553/96M, HKU7036/97E, and HKUST776/96E.     

Non-orthogonal joint diagonalization in the least-squares sensewith application in blind source separation

Approximate joint diagonalization of a set of matrices is an essential tool in many blind source separation (BSS) algorithms. A common measure of the attained diagonalization of the set is the weighted least-squares (WLS) criterion. However, most well-known algorithms are restricted to finding an orthogonal diagonalizing matrix, relying on a whitening phase for the nonorthogonal factor. Often, such an approach implies unbalanced weighting, which can result in degraded performance. We propose an iterative alternating-directions algorithm for minimizing the WLS criterion with respect to a general (not necessarily orthogonal) diagonalizing matrix. Under some mild assumptions, we prove weak convergence in the sense that the norm of parameters update is guaranteed to fall below any arbitrarily small threshold within a finite number of iterations. We distinguish between Hermitian and symmetrical problems. Using BSS simulations results, we demonstrate the improvement in estimating the mixing matrix, resulting from the relaxation of the orthogonality restriction     

Low-complexity single-channel blind source separation

For the time-frequency overlapped signals, a low-complexity single-channel blind source separation (SBSS) algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separate the mixed signals, but also adopts the orthogonal triangle decomposition-M (QRD-M) to reduce the computational complexity. According to analysis and simulation results, we demonstrate that the separation performance of the proposed algorithm is similar to that of the per-survivor processing (PSP) algorithm, while its computational complexity is sharply reduced.     

Superefficiency in blind source separation

Blind source separation is the problem of extracting independent signals from their mixtures without knowing the mixing coefficients nor the probability distributions of source signals and may be applied to EEG and MEG imaging of the brain. It is already known that certain algorithms work well for the extraction of independent components. The present paper is concerned with superefficiency of these based on the statistical and dynamical analysis. In a statistical estimation using t examples, the covariance of any two extracted independent signals converges to 0 of the order of 1/t. On-line dynamics shows that the covariance is of the order of η when the learning rate η is fixed to a small constant. In contrast with the above general properties, a surprising superefficiency holds in blind source separation under certain conditions where superefficiency implies that covariance decreases in the order of 1/t² or of η² . The paper uses the natural gradient learning algorithm and method of estimating functions to obtain superefficient procedures for both batch estimation and on-line learning. A standardized estimating function is introduced to this end. Superefficiency does not imply that the error variances of the extracted signals decrease in the order of 1/t² or η² but implies that their covariances (and independencies) do     

A complex mixing matrix estimation algorithm in under-determined blind source separation problems

This paper considers the complex mixing matrix estimation in under-determined blind source separation problems. The proposed estimation algorithm is based on single source points contributed by only one source. First, the problem of complex matrix estimation is transformed to that of real matrix estimation to lay the foundation for detecting single source points. Secondly, a detection algorithm is adopted to detect single source points. Then, a potential function clustering method is proposed to process single source points in order to get better performance. Finally, we can get the complex mixing matrix after derivation and calculation. The algorithm can estimate the complex mixing matrix when the number of sources is more than that of sensors, which proves it can solve the problem of under-determined blind source separation. The experimental results validate the efficiency of the proposed algorithm.     

Spatiotemporal blind source separation approach to atrial activity estimation in atrial tachyarrhythmias

The analysis and characterization of atrial tachyarrhythmias requires, in a previous step, the extraction of the atrial activity (AA) free from ventricular activity and other artefacts. This contribution adopts the blind source separation (BSS) approach to AA estimation from multilead electrocardiograms (ECGs). Previously proposed BSS methods for AA extraction-e.g., independent component analysis (ICA)-exploit only the spatial diversity introduced by the multiple spatially-separated electrodes. However, AA typically shows certain degree of temporal correlation, with a narrowband spectrum featuring a main frequency peak around 3.5-9 Hz. Taking advantage of this observation, we put forward a novel two-step BSS-based technique which exploits both spatial and temporal information contained in the recorded ECG signals. The spatiotemporal BSS algorithm is validated on simulated and real ECGs from a significant number of atrial fibrillation (AF) and atrial flutter (AFL) episodes, and proves consistently superior to a spatial-only ICA method. In simulated ECGs, a new methodology for the synthetic generation of realistic AF episodes is proposed, which includes a judicious comparison between the known AA content and the estimated AA sources. Using this methodology, the ICA technique obtains correlation indexes of 0.751, whereas the proposed approach obtains a correlation of 0.830 and an error in the estimated signal reduced by a factor of 40%. In real ECG recordings, we propose to measure performance by the spectral concentration (SC) around the main frequency peak. The spatiotemporal algorithm outperforms the ICA method, obtaining a SC of 58.8% and 44.7%, respectively.     

基于麦克风阵列的相容时延矢量声源定位方法

时延估计是常用的声源定位方法,传统的算法将定位分为两个步骤,即先估计麦克风阵列中每一对基元的接收信号时延,然后根据这些时延用几何的方法确定声源的位置。在低信噪比下,一对麦克风的时延估计误差较大,导致定位误差较大。相容时延矢量估计算法将两步合为一步,没有逐对估计时延,而是构造一个目标函数,通过搜索得到声源的位置。仿真结果表明,在低信噪比下,只需要较短的数据,该算法仍可得到较高的定位精度。     

超定盲信号分离的半参数统计方法

研究观测信号的数目m不小于源信号的数目n情况下盲信号分离问题.首先证明若混合矩阵满列秩,则在本质相等意义下,存在唯一的m×m非奇异矩阵使得分离系统的输出除零信号外,其它非零信号即是希望提取的源信号.基于此,采用半参数统计方法构造超定盲信号分离的估计函数,给出相应的学习算法;理论证明了该算法具有等变化性和分离矩阵的非奇异特性,并借助于源信号数目未知且动态变化的计算机仿真验证了其有效性.     

General approach to blind source separation

This paper identifies and studies two major issues in the blind source separation problem: separability and separation principles. We show that separability is an intrinsic property of the measured signals and can be described by the concept of m-row decomposability introduced in this paper; we also show that separation principles can be developed by using the structure characterization theory of random variables. In particular, we show that these principles can be derived concisely and intuitively by applying the Darmois-Skitovich theorem, which is well known in statistical inference theory and psychology. Some new insights are gained for designing blind source separation filters