A fixed-point nonlinear PCA algorithm for blind source separation

2005 ◽  
Vol 69 (1-3) ◽  
pp. 264-272 ◽  
Author(s):  
Xiaolong Zhu ◽  
Jimin Ye ◽  
Xianda Zhang
Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 165
Author(s):  
Shiyu Guo ◽  
Mengna Shi ◽  
Yanqi Zhou ◽  
Jiayin Yu ◽  
Erfu Wang

As the main method of information transmission, it is particularly important to ensure the security of speech communication. Considering the more complex multipath channel transmission situation in the wireless communication of speech signals and separating or extracting the source signal from the convolutional signal are crucial steps in obtaining source information. In this paper, chaotic masking technology is used to guarantee the transmission safety of speech signals, and a fast fixed-point independent vector analysis algorithm is used to solve the problem of convolutional blind source separation. First, the chaotic masking is performed before the speech signal is sent, and the convolutional mixing process of multiple signals is simulated by impulse response filter. Then, the observed signal is transformed to the frequency domain by short-time Fourier transform, and instantaneous blind source separation is performed using a fast fixed-point independent vector analysis algorithm. The algorithm can preserve the high-order statistical correlation between frequencies to solve the permutation ambiguity problem in independent component analysis. Simulation experiments show that this algorithm can efficiently complete the blind extraction of convolutional signals, and the quality of recovered speech signals is better. It provides a solution for the secure transmission and effective separation of speech signals in multipath transmission channels.


2008 ◽  
Vol 3 (3) ◽  
pp. 343-346 ◽  
Author(s):  
Hongyan Li ◽  
Jianfen Ma ◽  
Deng’ao Li ◽  
Huakui Wang

1997 ◽  
Vol 08 (05n06) ◽  
pp. 601-612 ◽  
Author(s):  
Petteri Pajunen ◽  
Juha Karhunen

In standard blind source separation, one tries to extract unknown source signals from their instantaneous linear mixtures by using a minimum of a priori information. We have recently shown that certain nonlinear extensions of principal component type neural algorithms can be successfully applied to this problem. In this paper, we show that a nonlinear PCA criterion can be minimized using least-squares approaches, leading to computationally efficient and fast converging algorithms. Several versions of this approach are developed and studied, some of which can be regarded as neural learning algorithms. A connection to the nonlinear PCA subspace rule is also shown. Experimental results are given, showing that the least-squares methods usually converge clearly faster than stochastic gradient algorithms in blind separation problems.


Sign in / Sign up

Export Citation Format

Share Document