Abstract
An efficient measure of signal temporal predictability is proposed, which is referred to as difference measure. We can prove that the difference measure of any signal mixture is between the maximal and minimal difference measure of the source signals. Previous blind source separation (BSS) problem is changed to a generalized eigenproblem by using Stone’s measure. However, by using difference measure, the BSS problem is furthermore simplified to a standard symmetric eigenproblem. And the separation matrix is the eigenvector matrix, which can be solved by using principal component analysis (PCA) method. Based on difference measure, a few efficient algorithms have been proposed, which are either in batch mode or in on-line mode. Simulations show that difference measure is competitive with Stone’s measure. Especially, the on-line algorithms derived from difference measure have better performance than those derived from Stone’s measure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cickocki A, Karhunen J, Kasprzak W and Vigario R (1999). Neural networks for blind separation with unknown number of sources. Neurocomputing 24(1): 55–93
Cichocki A, Amar S-i (2002) Adaptive blind signal and image processing. John Wiley and Sons
Cichocki A, Kasprzak W and Skarbek W (1996). Adaptive learning algorithm for principal component analysis with partial data. Proc Cybernet Syst 2: 1014–1019
Comon P (1994). Independent component analysis-a new concept? . Signal Process 36(4): 287–314
Golub GH and Van Loan CF (1996). Matrix computations, 3rd edn. The Johns Hopkins Univ Press, M.D Baltimore
Hyvärinen A, Karhunen J, Oja E (2001) Independent component analsysis. John Wiley and Sons
Li H, Jiang T, Zhang K (2004) Efficient and robust feature extraction by maximum margin criterion. In: Thrun S, Sand L, Schoelkopf B (eds) Advances in neural information processing systems, vol. 16. MIT Press, Vancouver, Canada
Oja E (1989). Neural networks, principal components and subspaces. Int J Neural Syst 1: 61–68
Stone JV (2001). Blind source separation using temporal predictability. Neural Comput 13: 1559–1574
Tanaka T (2005). Generalized weighted rules for principal components tracking. IEEE Trans Signal Process 53(4): 1243–1253
Xie S, He Z and Fu Y (2005). A note on stone’s conjecture of blind source separation. Neural Comput 17: 321–330
Xu L (1993). Least mean square error reconstruction principle for self-organizing neural-nets. Neural Networks 6: 627–648
Ye M, Yi Z and Lv JC (2005). A globally convergent PCA learning algorithm. Neural Comput Appl 14(1): 18–24
Yi Z, Ye M, Lv JC and Tan KK (2005). Convergence analysis of a deterministic discrete time system of Oja’s PCA learning algorithm. IEEE Trans Neural Networks 16(6): 1318–1328
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ye, M., Li, X. An Efficient Measure of Signal Temporal Predictability for Blind Source Separation. Neural Process Lett 26, 57–68 (2007). https://doi.org/10.1007/s11063-007-9042-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11063-007-9042-0