Blind source separation and deconvolution of fast sampled signals

被引:0
作者
Back, AD [1 ]
Cichocki, A [1 ]
机构
[1] RIKEN, Inst Phys & Chem Res, Brain Informat Proc Grp, Wako, Saitama 35101, Japan
来源
PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2 | 1998年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In real world implementations of blind source separation and deconvolution, the mixing takes place in continuous time. In the models normally considered, discrete time sampling is implicitly assumed to provide a mixing filter matrix from a suitable demixing filter matrix which can be learned given an appropriate algorithm, In this paper, we consider the implications of trying to separate and deconvolve signals which may include some signals which are low frequency compared to the sample rate. It is shown that if a fast sampling rate is used to obtain the discrete time observed data, learning to solve blind source separation and deconvolution tasks can be very difficult. This is due to the data covariance matrix becoming almost singular. We propose a discrete time model based on alternative discrete time operators which is capable Of overcoming the problems and giving significantly improved performance under the conditions described.
引用
收藏
页码:637 / 640
页数:4
相关论文
共 20 条
[1]  
AGARWAL RC, 1975, IEEE T CIRCUITS SYST, V22, P921, DOI 10.1109/TCS.1975.1083998
[2]  
Amari S, 1996, ADV NEUR IN, V8, P757
[3]  
AMARI S, 1995, P INT S NONL THEOR I, P37
[4]  
[Anonymous], 1992, ADV NEUR IN
[5]   ZEROS OF SAMPLED SYSTEMS [J].
ASTROM, KJ ;
HAGANDER, P ;
STERNBY, J .
AUTOMATICA, 1984, 20 (01) :31-38
[6]  
BACK AD, 1995, ADV NEURAL INFORMATI, V7, P883
[7]   AN INFORMATION MAXIMIZATION APPROACH TO BLIND SEPARATION AND BLIND DECONVOLUTION [J].
BELL, AJ ;
SEJNOWSKI, TJ .
NEURAL COMPUTATION, 1995, 7 (06) :1129-1159
[8]  
CICHOCKI A, 1994, P INT S ART NEUR NET, P406
[9]  
CICHOCKI A, 1994, NEURAL NETWORKS OPTI
[10]  
Dahlquist G., 1974, NUMERICAL METHODS