语义分割网络下的混合信号频谱分离

单通道接收机下,多个时频混合信号的分离属于非稀疏欠定信号分离问题,难以求解。针对这类非稀疏欠定信号分离问题,提出了一种基于语义分割网络、从频域实现多个指定类别信号分离的新方法。利用语义分割网络提取信号的频域分布特征,克服了单通道接收机下信号先验信息过少的问题。仿真表明,该方法具有较高的分离精度,且响应时间短,可用于单通道接收机中时频混叠信号的分离。     

基于压缩感知的欠定图像盲源分离研究

系统阐述了利用稀疏成分分析(Sparse Component Analysis,SCA)算法进行欠定图像盲源分离。首先在估计出源图像个数的基础上,利用线性聚类估计混合矩阵;其次将压缩感知(Compressed Sensing,CS)应用到恢复源图像中。为了得到自适应的过完备稀疏字典来提高分离效果,提出了利用K均值奇异值分解(K-means Singular Value Decomposition,K-SVD)算法对过完备DCT字典循环迭代训练的思想,并对图像分块处理来减少计算复杂度;最后进行了仿真测试并对分离出的图像进行了分析和进一步处理。     

旋转变换和欠定盲分离的DUET算法

DUET是采用时频掩码求解欠定问题的著名算法.本文讨论旋转变换对DUET算法的影响,提出了一个改进的DUET算法.该算法利用混叠矩阵的任意两列作为旋转矩阵,先旋转接收信号和混叠矩阵,后执行DUET算法.因为DUET算法在不同的旋转变换下有不同的结果,所以需要将这些结果相加,以弥补DUET算法的失真.最后,几个语音信号的实验结果显示算法的性能和实用.     

基于超平面法矢量的欠定盲混合矩阵估计

源信号稀疏性差时,基于源信号稀疏特性的欠定盲混合矩阵估计算法,通常先聚类求得混合矢量张成的超平面,然后估计混合矩阵。但此方法涉及运算量较大的超平面聚类,算法效率低。针对这一缺陷,提出了一种新的混合矩阵估计算法。先由所提出的基于梯度法的法矢量更新方法求得超平面法矢量的估计,然后求出混合矩阵。该方法不需要进行超平面聚类,大大降低了运算量,提高了混合矩阵估计效率。仿真结果证明了该方法的正确性和有效性。     

基于时频分布的欠定混叠盲分离

针对欠定混合信号的盲分离问题,提出了基于时频分布的欠定盲分离算法,首先计算信号的时频分布矩阵并找出信号的自源时频点,然后把自源点对应的时频分布矩阵表示成三阶张量并通过张量分解估计出混合矩阵,最后通过计算矩阵的伪逆和时频合成来完成源信号的恢复.该算法不需要假设源信号是稀疏的或相互独立的.仿真结果表明与已有算法相比本文方法...     

A signal power adaptive regularized sphere decoding algorithm based multiuser detection technique for underdetermined OFDM/SDMA uplink system

This work considers a regularized Fincke‐Pohst Sphere Decoder (R‐FSD) to detect the multiuser data of orthogonal frequency division multiplexing/space division multiple access (OFDM/SDMA) uplink system with underdetermined and rank‐deficient channel. Rank‐deficiency of the detected channel coefficients makes error‐free multiuser detection (MUD) a difficult task. In literature, most of the papers deal with either a determined or over‐determined full‐rank system. The method proposed in this work transforms an original ill‐posed least squares (LS) problem to a well‐posed one at the receiver, by using the standard Tikhonov regularization method. This is an efficient, direct, and less complex approach where the channel is modified using a regularization parameter that adapts to the signal power at the receiver. The result obtained is compared with maximum likelihood (ML), zero forcing (ZF), minimum mean squared error (MMSE) and ordered successive interference cancellation (OSIC) based detection techniques.     

Audio-Visual Underdetermined Blind Source Separation Algorithm Based on Gaussian Potential Function

Most existing algorithms for the underdetermined blind source separation （UBSS） problem are two-stage algorithm, i.e., mixing parameters estimation and sources estimation. In the mixing parameters estimation, the previously proposed traditional clustering algorithms are sensitive to the initializations of the mixing parameters. To reduce the sensitiveness to the initialization, we propose a new algorithm for the UBSS problem based on anechoic speech mixtures by employing the visual information, i.e., the interaural time difference （ITD） and the interaural level difference （ILD）, as the initializations of the mixing parameters. In our algorithm, the video signals are utilized to estimate the distances between microphones and sources, and then the estimations of the ITD and ILD can be obtained. With the sparsity assumption in the time-frequency domain, the Gaussian potential function algorithm is utilized to estimate the mixing parameters by using the ITDs and ILDs as the initializations of the mixing parameters. And the time-frequency masking is used to recover the sources by evaluating the various ITDs and ILDs. Experimental results demonstrate the competitive performance of the proposed algorithm compared with the baseline algorithms.     

Empirical kernel map approach to nonlinear underdetermined blind separation of sparse nonnegative dependent sources: pure component extraction from nonlinear mixture mass spectra

Nonlinear underdetermined blind separation of nonnegative dependent sources consists in decomposing a set of observed nonlinearly mixed signals into a greater number of original nonnegative and dependent component (source) signals. This hard problem is practically relevant for contemporary metabolic profiling of biological samples, where sources (a.k.a. pure components or analytes) are aimed to be extracted from mass spectra of nonlinear multicomponent mixtures. This paper presents a method for nonlinear underdetermined blind separation of nonnegative dependent sources that comply with a sparse probabilistic model, that is, sources are constrained to be sparse in support and amplitude. This model is validated on experimental pure component mass spectra. Under a sparse prior, a nonlinear problem is converted into an equivalent linear one comprised of original sources and their higher‐order, mostly second‐order, monomials. The influence of these monomials, which stand for error terms, is reduced by preprocessing a matrix of mixtures by means of robust principal component analysis and hard, soft and trimmed thresholding. Preprocessed data matrices are mapped in high‐dimensional reproducible kernel Hilbert space (RKHS) of functions by means of an empirical kernel map. Sparseness‐constrained nonnegative matrix factorizations in RKHS yield sets of separated components. They are assigned to pure components from the library using a maximal correlation criterion. The methodology is exemplified on demanding numerical and experimental examples related respectively to extraction of eight dependent components from three nonlinear mixtures and to extraction of 25 dependent analytes from nine nonlinear mixture mass spectra recorded in nonlinear chemical reaction of peptide synthesis. Copyright © 2014 John Wiley & Sons, Ltd.     

Nonlinear mixture‐wise expansion approach to underdetermined blind separation of nonnegative dependent sources

Underdetermined blind separation of nonnegative dependent sources consists in decomposing a set of observed mixed signals into greater number of original nonnegative and dependent component (source) signals. That is an important problem for which very few algorithms exist. It is also practically relevant for contemporary metabolic profiling of biological samples, such as biomarker identification studies, where sources (a.k.a. pure components or analytes) are aimed to be extracted from mass spectra of complex multicomponent mixtures. This paper presents a method for underdetermined blind separation of nonnegative dependent sources. The method performs nonlinear mixture‐wise mapping of observed data in high‐dimensional reproducible kernel Hilbert space (RKHS) of functions and sparseness‐constrained nonnegative matrix factorization (NMF) therein. Thus, the original problem is converted into new one with increased number of mixtures, increased number of dependent sources, and higher‐order (error) terms generated by nonlinear mapping. Provided that amplitudes of original components are sparsely distributed, which is the case for mass spectra of analytes, sparseness‐constrained NMF in RKHS yields, with significant probability, improved accuracy relative to the case when the same NMF algorithm is performed on the original problem. The method is exemplified on numerical and experimental examples related respectively to extraction of 10 dependent components from five mixtures and to extraction of 10 dependent analytes from mass spectra of two to five mixtures. Thereby, analytes mimic complexity of components expected to be found in biological samples. Copyright © 2013 John Wiley & Sons, Ltd.     

基于时频分布的欠定混合矩阵盲辨识

针对欠定混合矩阵的盲辨识问题,提出了基于空间时频分布的盲辨识算法,首先计算信号的空间时频分布并找出源信号的自源时频点,然后把所有自源点对应的时频分布矩阵表示成高维矩阵的形式,再通过联合对角化和特征值分解估计出混合矩阵.该方法不需要假设源信号是稀疏的或独立的,此外通过检测能量足够大的自源时频点,提高了算法的鲁棒性.仿真结...