# A Fetal Electrocardiogram Signal Extraction Algorithm Based on the Temporal Structure and the Non-Gaussianity

Authors: Yibing Li; Wei Nie; Fang Ye; Ao Li
Journal: Computational and Mathematical Methods in Medicine
 (2016)

---

## Abstract

Fetal electrocardiogram (FECG) extraction is an important issue in biomedical signal processing. In this paper, we develop an objective function for extraction of FECG. The objective function is based on the non-Gaussianity and the temporal structure of source signals. Maximizing the objective function, we can extract the desired FECG. Combining with the solution vector obtained by maximizing the objective function, we further improve the accuracy of the extracted FECG. In addition, the feasibility of the innovative methods is analyzed by mathematical derivation theoretically and the efficiency of the proposed approaches is illustrated with the computer simulations experimentally.


---

## Body

## 1. Introduction

In biomedical signal processing, fetal electrocardiogram (FECG) extraction is full of challenges. FECG provides important information about the health of the fetus. However, FECG is always buried in various interferences and noises. Among these interferences and noises, maternal electrocardiogram (MECG) is the strongest one with high amplitude. Besides, breathing artifact, electrode artifact, and other noises also affect the desired FECG. Therefore, it is a difficult task to extract accurate FECG.Traditional methods cannot get satisfactory results, such as multireference adaptive noise cancellation [1] and singular value decomposition [2]. Recently, the blind source separation (BSS) model [3–6] is introduced to solve the extraction problem of the desired FECG and shows satisfactory results. BSS algorithms can separate all sources from mixtures without any priori knowledge. In BSS algorithms, the ICA model [7–9] utilizes the non-Gaussianity [10] of signals to separate all source signals. This model is suitable for biomedical signal processing [11] and non-Gaussianity becomes an important tool to process these kinds of signals. In [12], traditional BSS algorithms and joint BSS algorithms were used to separate the maternal signal and the fetal signal. Authors [13] proposed two methods based on hybrid BSS to get FECG signals. These methods get better results than traditional BSS algorithms. However, the extraction of the desired FECG with the BSS algorithms is not the best choice. On one hand, separating all sources is a waste of time and not necessary if only the desired FECG is needed. On the other hand, the prior knowledge about the desired FECG can be utilized by us. According to this situation, blind source extraction (BSE) rises in response to the proper time and conditions and becomes a better choice than BSS. BSE only separates one source signal every time, so it has higher efficiency when it extracts the desired FECG. FECG is a special signal with the temporal structure. As prior knowledge, this structure can help us recover source signals. Barros and Cichocki [14] proposed a BSE algorithm called BCBSE. This algorithm can extract the desired FECG by utilizing the temporal structure. However, the algorithm is very sensitive to the estimation error of the optimal time delay. To overcome the drawback of BCBSE, Shi and Zhang [15] developed another BSE algorithm called SemiBSE based on the non-Gaussianity and the mean squared error function that is described in [14]. This method improves the performance of BCBSE. It is more robust for the estimation error of the optimal time delay. However, the performance of this algorithm is up to the choice of the parameters. If we initialize the parameters randomly, the performance of the algorithm becomes weaker. A BSE method called MACBSE [16] was proposed based on several time-delay autocorrelations of primary sources. MACBSE adopts a fixed-point learning algorithm for extraction of the desired source signal without choosing the learning step size. Authors [17] proposed a BSE algorithm called GABSE based on the generalized linear or nonlinear autocorrelations of the sources. This method has fast convergence speed and good stability if any two sources are uncorrelated with each other and have different temporal structures. A fast and robust fixed-point algorithm based on the nonlinear autocorrelation was proposed in [18]. Its convergence speed is shown to be at least quadratic. Li and Liao [19] proposed an algorithm based on the eigenvalue decomposition of the cross-correlation of whitened source signals at a given time tag. This algorithm functions without iterations. Wang et al. [20] proposed a robust separation algorithm to recover original sources through a joint diagonalizer of several average delayed covariance matrices at positions of the optimal time delay and its integers.In order to settle the above problem better, we put forward the method based on the non-Gaussianity and the temporal structure of source signals. This paper consists of two main parts. First, we design an objective function to get the weight vector for extraction of the desired FECG. Then, the weight vector obtained by maximizing the objective function is combined with the FastICA algorithm to further improve the performance of the algorithm.This paper is organized as follows. Section2 introduces the basic theory of our algorithms. As the principle part, we highlight the algorithms and the analysis about the algorithms in Section 3. Simulation results are presented in Section 4, and conclusions are made in Section 5.


## 2. The Basic Model

The linear instantaneous mixed model of BSS problems can be denoted as(1)xt=Ast+nt,where x(t)=[x1(t),x2(t),…,xn(t)]T is the n-dimension mixture vector, A=[a1,…,am] is an unknown mixing matrix, s(t)=[s1(t),s2(t),…,sm(t)]T is the m-dimension source vector, and n(t) is the noise vector. If the noise is ignored, the noiseless model of BSS problems can be expressed as(2)xt=Ast.Preprocessing for the mixtures is usually necessary before the BSS algorithms. First, the mixtures are made to own zero mean through the following formula:(3)x^t=xt-Ext,where x^(t) is the new mixture vector. Then, the prewhitening process makes any two variables of the new mixtures orthogonal and gets the whitened mixtures(4)x~t=Vx^t,where V is the prewhitening matrix. For a BSE algorithm, only a source signal can be separated at a time. If the unmixing matrix is w=(w1,w2,…,wn)T, the estimated source signal can be denoted as(5)yt=wTx~t.Meanwhile, the delayed estimated source signal can be expressed as(6)yt-τ=wTx~t-τ,where τ is the time delay that is some lag constant. The estimation error of the optimal time delay may have bad effect on the performance of the algorithms, so the reasonable estimation is important. The specific estimation method of the optimal time delay refers to [14].


## 3. The Proposed Algorithms

### 3.1. The Proposed Algorithm 1

#### 3.1.1. Objective Function

In order to avoid the blindness of choosing parameters, we combine the non-Gaussianity and the temporal structure to design the following constrained maximization problem:(7)maxw=1ψw=EGytGytyt-τ=EGwTx~tGwTx~tx~t-τTw,where G is a differentiable nonlinear function. This function utilizes the non-Gaussianity, the temporal structure, and the nonlinear correlation.


#### 3.1.2. Learning Algorithm

With respect tow, the gradient of E{G[y(t)]G[y(t)y(t-τ)]} can be obtained as(8)∂EGytGytyt-τ∂w=Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,where g is the derivative of G. According to the gradient ascent learning rule, a gradient method can be derived as follows:(9)w⟵w+μ∂EGytyt-τ∂w=w+μEx~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww,where μ is a learning rate. The desired vector can be obtained through this method, but the corresponding cost is that the convergence speed of the algorithm is slow and the performance of the algorithm is dependent on the proper choice of the learning rate. If the learning rate is chosen improperly, the convergence property will be destroyed. Therefore, how to find a new approach to radically improve the convergence speed and the reliability is an important issue that needs to be solved. The fixed-point algorithm is a choice to solve this issue. For getting a more efficient fixed-point algorithm, we note that the gradient must point in the direction of w at a stable point of the gradient algorithm. It means the gradient must be equal to w multiplied by some scalar constant. In such a case, adding the gradient to w does not change its direction and the convergence can be obtained. Through normalization to the unit norm, the value of w is not changed except by changing its sign. Therefore, the following formula can be obtained:(10)w∝Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt.Through the above formula, the fixed-point algorithm can be updated as(11)w⟵Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww.Utilizing the above fixed-point algorithm, we can extract the desired signal.


#### 3.1.3. Stability Analysis

In this part, we analyze the stability of the proposed algorithm.Theorem 1.
Assume that the input data meet the model as (2). The data are prewhitened through equation x~=VAs and G is a quite smooth even function. Furthermore, we assume that δsi=si(t)si(t-τ)(i=1,2,…,n) are mutually independent. To simplify it, si(t)si(t-τ) is replaced by sisiτ. Under the constraint w=1, the local maxima of E{G[y(t)]G[y(t-τ)]} include one row of the inverse of the matrix VA if the corresponding desired signal si satisfies(12)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j,where g′ is the derivative of g.Proof.
According to the above conditions, we make the orthogonal transform of coordinatesp=ATVTw and obtain(13)Hp=EGpTssτTp.We analyze the stability at the point p=e1=(1,0,0,0,…)T. The independency assumptions are utilized to evaluate the gradient and the Hessian matrix of H(p) at the point p=e1. Then, through making a small perturbation ɛ=(ɛ1,ɛ2,…), where ɛ1 and ɛ2 are the elements of ɛ, we get(14)He1+ɛ=He1+ɛT∂He1∂p+12ɛT∂He1∂pɛ+oɛ2,where ∂H(e1)/∂p and ∂2H(e1)/∂p2 are expressed as(15)∂He1∂p=e1Es1gs1Gs1s1τ+2s1s1τgs1s1τGs1,∂H2e1∂p2=diag⁡Es12g′s1Gs1s1τ+4s12s1τgs1gs1s1τ+4s12s1τ2g′s1s1τGs1,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τs2s2τg′s1s1τGs1+3s1s2s2τgs1gs1s1τ,…,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ.Because of the constraint w=1, we can know ɛ1=1-ɛ22-⋯-1. Meanwhile, 1-γ=1-γ/2+o(γ) is known. The order of ɛ12 is o(ɛ2), so the higher order terms can be neglected. Through the first-order approximation of ɛ1 that is described above, we know ɛ1=-∑i>1ɛi2/2+o(ɛ2) and obtain(16)He1+ɛ=He1+12Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1∑j>1ɛj2+oɛ2.p=e1 is an extremum that is implied in the condition of Theorem 1 if the following condition is satisfied:(17)Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1<0.Based on the above descriptions, this condition can be expanded as(18)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j.


#### 3.1.4. Convergence Analysis

Convergence is also important like stability. In this part, we analyze the convergence of the algorithm.Theorem 2.
If the following two conditions are satisfied, the algorithm described in formula (11) can reach convergence: (1)
{si,siτ} and {sj,sjτ} are mutually independent.(2)
E{sig(si)G(sisiτ)+2sisiτg(sisiτ)G(si)}≠0.Proof.
Based on the orthogonal coordinate transformationp=ATVTw, formula (11) is changed to(19)p^k=EsgpTksGpTkssτTpk+EspTksτgpTkssτTpkGpTks+EsτpTksgpTkssτTpkGpTks,pk+1=p^kp^k,where k is the number of iterations. Using a Taylor approximation for G and g, we have(20)GpTks=Gpisi+gpisip-iTs-i+op-i2,gpTks=gpisi+g′pisip-iTs-i+op-i2,GpTkssτTpk=Gpisipisiτ+gpisipisiτp-iTs-is-iτTp-i+op-i2,gpTkssτTpk=gpisipisiτ+g′pisipisiτp-iTs-is-iτTp-i+op-i2,where p-i is the vector p without its ith component, s-i is the vector s without its ith component, and s-iτ is the vector sτ without its ith component.
Similarly, we analyze the convergence at the pointp=e, where ei is 1 and ej is 0 (∀j≠i). Based on the above conditions, we get(21)p^i=EsigsiGsisiτ+2sisiτgsisiτGsi+op-i2,p^j=Eg′siGsisiτ+siτgsigsisiτ+sisjsjτgsigsisiτpj+op-i2.The above equations clearly show that the algorithm converges to such a vector e in which ei is 1 and ej is 0 if condition (2) is satisfied. It means that w=((VA)T)-1q can converge without computing the sign. This shows that w converges as Theorem 2.


### 3.2. The Proposed Algorithm 2

On the basis of the above algorithm, we propose another improved algorithm by utilizing the FastICA algorithm. The FastICA algorithm is a typical ICA algorithm. The source signal can be estimated through maximizing the non-Gaussianity function of signals. One of the representative non-Gaussianity functions is negentropy. However, this algorithm is based on the theory of projection pursuit, so any signal may be first extracted. According to this problem, we propose an improved algorithm by presetting the weight vector. The method of projection pursuit searches for a projection output to maximize the objective function. Based on the theory of ICA, a local extremum in the solution space of the projection direction is obtained if the negentropy is the objective function. The output of the corresponding data for this local extremum is an independent component. If the mixtures consist ofm source signals, the parameter space formed by ICA will have 2m local extrema that correspond to signed solutions of all source signals. Meanwhile, a local optimal solution owns its attraction region for a greedy optimization algorithm that is based on projection pursuit. In other words, the initial point in this region converges to this local optimal solution with this algorithm. The FastICA algorithm may not extract the desired signal if the initial weight matrix is arbitrary. However, if the initial weight matrix is near the local optimal solution that corresponds to the desired signal, the desired source signal can be extracted. The solution vector of the proposed algorithm 1 can be the initial weight matrix of the FastICA algorithm and help the algorithm extract the desired source signal. The solution vector of the proposed algorithm 1 is denoted as(22)w0=w1,…,wi,…,wj,…,wnT.It is the initial weight matrix of the proposed algorithm 2. Then, we can extract the desired signal with the FastICA algorithm based on the negentropy. The approximate negentropy in literatures can be denoted as(23)Jy∝EGy-EGv2.The gradient of J(y) is written as(24)∇Jy∝γEx~tgyt,where γ=E[G(y)]-E[G(v)]; the learning algorithm is obtained as follows:(25)Δw=EGy-EGvEx~tgyt,w⟵ww.The corresponding fixed-point algorithm is denoted as(26)w⟵Ex~tgyt,w⟵ww.However, the convergence property of the FastICA algorithm based on the negentropy is unsatisfactory because the nonpolynomial moment does not own good algebra property. Therefore, the Newton iteration algorithm is usually utilized to improve the process. If the maximization of E{G[wTx(t)]} under the constraint w=1 is considered, the optimization problem with the Lagrangian multiplier method can be changed to(27)Fw=EGwTx~t+βwTw.The first-order derivative and the second-order derivative can be denoted as(28)∂Fw∂w=Ex~tgwTx~t+2βw,∂2Fw∂w2=Ex~tx~tTg′wTx~t+2βI≈Ex~tx~tTEg′wTx~t+2βI=Eg′wTx~tI+2βI.In order to avoid calculating the inverse of the matrix, the simple approximation is made to get the following Newton iteration algorithm:(29)w⟵w-∂Fw/∂w∂2Fw/∂w2=w-Ex~tgwTx~t+2βwEg′wTx~t+2β.Both sides of the above equation are multiplied by E{g′[wTx~(t)]}+2β and then the learning algorithm after the algebraic simplification is denoted as(30)w⟵Ex~tgwTx~t-Eg′wTx~tw,w⟵ww.Formula (30) is the basic formula of the fixed-point FastICA algorithm.Here, we analyze the condition that the initial weight vector must meet in order to get the desired signal. According to formula (30), we get(31)w^k⟵Ex~tgwkTx~t-Eg′wkTx~twk,wk+1=w^kw^k.Based on formula (31) and q=ATVTw, the following formula is obtained:(32)q^k⟵EstgqkTst-Eg′qkTstqk,qk+1=q^kq^k.Assuming ak=1/q^(k), we obtain(33)qk+1=akEstgqkTst-akEg′qkTstqk.To analyze conveniently, we choose G=y4/4 to illustrate. Therefore, g=y3 and g′=3y2 can be obtained. Formula (33) can be simplified as(34)qk+1=akEs1∑m=1Mqmksm3-3q1kE∑m=1Mqmksm2,…,Esi∑m=1Mqmksm3-3qikE∑m=1Mqmksm2,…,EsM∑m=1Mqmksm3-3qMkE∑m=1Mqmksm2T.Next, the following formula can be obtained:(35)qik+1=akEsi∑m=1Mqmksm3-3akqikE∑m=1Mqmksm2=akEsiqiksi+∑m=1,m≠iMqmksm3-3akqikEqiksi+∑m=1,m≠iMqmksm2=akEqi3ksi4+3qiksi2∑m=1,m≠iMqmksm2-3akqikEqi2ksi2+∑m=1,m≠iMqmksm2=akqi3kEsi4-3akqi3kEsi2=akqi3kEsi4-3Esi2=akqi3kk4si,where k4· denotes the kurtosis of the signal. Similarly, we obtain(36)qjk+1=akqj3kk4sj.The following formula is assumed:(37)bk+1=qjk+1qik+1=qj3kk4sjqi3kk4si=b3kk4sjk4si.Then, b(k) can be denoted as(38)bk=qjkqik=k4sjk4si-1qj1qi1k4sjk4si3k-1.If we want to get the desired signal, qj(k) must be close to 0 and qi(k) must be close to 1. Therefore, the following formula must be met:(39)qj1qi1k4sjk4si<1.The above formula (39) can be simplified as(40)qi21>qj21k4sjk4si.Combining the solution vector w0 described in formula (22), we get(41)q0=ATVTw0=q01,…,q0i,…,q0j,…,q0nT.In conclusion, the desired signal can be obtained if the following condition is satisfied:(42)q0i2>q0j2k4sjk4si.Similarly, if another function G is chosen, there will be another condition that is similar to formula (42) helping us get the desired source signal.


## 3.1. The Proposed Algorithm 1

### 3.1.1. Objective Function

In order to avoid the blindness of choosing parameters, we combine the non-Gaussianity and the temporal structure to design the following constrained maximization problem:(7)maxw=1ψw=EGytGytyt-τ=EGwTx~tGwTx~tx~t-τTw,where G is a differentiable nonlinear function. This function utilizes the non-Gaussianity, the temporal structure, and the nonlinear correlation.


### 3.1.2. Learning Algorithm

With respect tow, the gradient of E{G[y(t)]G[y(t)y(t-τ)]} can be obtained as(8)∂EGytGytyt-τ∂w=Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,where g is the derivative of G. According to the gradient ascent learning rule, a gradient method can be derived as follows:(9)w⟵w+μ∂EGytyt-τ∂w=w+μEx~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww,where μ is a learning rate. The desired vector can be obtained through this method, but the corresponding cost is that the convergence speed of the algorithm is slow and the performance of the algorithm is dependent on the proper choice of the learning rate. If the learning rate is chosen improperly, the convergence property will be destroyed. Therefore, how to find a new approach to radically improve the convergence speed and the reliability is an important issue that needs to be solved. The fixed-point algorithm is a choice to solve this issue. For getting a more efficient fixed-point algorithm, we note that the gradient must point in the direction of w at a stable point of the gradient algorithm. It means the gradient must be equal to w multiplied by some scalar constant. In such a case, adding the gradient to w does not change its direction and the convergence can be obtained. Through normalization to the unit norm, the value of w is not changed except by changing its sign. Therefore, the following formula can be obtained:(10)w∝Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt.Through the above formula, the fixed-point algorithm can be updated as(11)w⟵Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww.Utilizing the above fixed-point algorithm, we can extract the desired signal.


### 3.1.3. Stability Analysis

In this part, we analyze the stability of the proposed algorithm.Theorem 1.
Assume that the input data meet the model as (2). The data are prewhitened through equation x~=VAs and G is a quite smooth even function. Furthermore, we assume that δsi=si(t)si(t-τ)(i=1,2,…,n) are mutually independent. To simplify it, si(t)si(t-τ) is replaced by sisiτ. Under the constraint w=1, the local maxima of E{G[y(t)]G[y(t-τ)]} include one row of the inverse of the matrix VA if the corresponding desired signal si satisfies(12)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j,where g′ is the derivative of g.Proof.
According to the above conditions, we make the orthogonal transform of coordinatesp=ATVTw and obtain(13)Hp=EGpTssτTp.We analyze the stability at the point p=e1=(1,0,0,0,…)T. The independency assumptions are utilized to evaluate the gradient and the Hessian matrix of H(p) at the point p=e1. Then, through making a small perturbation ɛ=(ɛ1,ɛ2,…), where ɛ1 and ɛ2 are the elements of ɛ, we get(14)He1+ɛ=He1+ɛT∂He1∂p+12ɛT∂He1∂pɛ+oɛ2,where ∂H(e1)/∂p and ∂2H(e1)/∂p2 are expressed as(15)∂He1∂p=e1Es1gs1Gs1s1τ+2s1s1τgs1s1τGs1,∂H2e1∂p2=diag⁡Es12g′s1Gs1s1τ+4s12s1τgs1gs1s1τ+4s12s1τ2g′s1s1τGs1,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τs2s2τg′s1s1τGs1+3s1s2s2τgs1gs1s1τ,…,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ.Because of the constraint w=1, we can know ɛ1=1-ɛ22-⋯-1. Meanwhile, 1-γ=1-γ/2+o(γ) is known. The order of ɛ12 is o(ɛ2), so the higher order terms can be neglected. Through the first-order approximation of ɛ1 that is described above, we know ɛ1=-∑i>1ɛi2/2+o(ɛ2) and obtain(16)He1+ɛ=He1+12Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1∑j>1ɛj2+oɛ2.p=e1 is an extremum that is implied in the condition of Theorem 1 if the following condition is satisfied:(17)Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1<0.Based on the above descriptions, this condition can be expanded as(18)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j.


### 3.1.4. Convergence Analysis

Convergence is also important like stability. In this part, we analyze the convergence of the algorithm.Theorem 2.
If the following two conditions are satisfied, the algorithm described in formula (11) can reach convergence: (1)
{si,siτ} and {sj,sjτ} are mutually independent.(2)
E{sig(si)G(sisiτ)+2sisiτg(sisiτ)G(si)}≠0.Proof.
Based on the orthogonal coordinate transformationp=ATVTw, formula (11) is changed to(19)p^k=EsgpTksGpTkssτTpk+EspTksτgpTkssτTpkGpTks+EsτpTksgpTkssτTpkGpTks,pk+1=p^kp^k,where k is the number of iterations. Using a Taylor approximation for G and g, we have(20)GpTks=Gpisi+gpisip-iTs-i+op-i2,gpTks=gpisi+g′pisip-iTs-i+op-i2,GpTkssτTpk=Gpisipisiτ+gpisipisiτp-iTs-is-iτTp-i+op-i2,gpTkssτTpk=gpisipisiτ+g′pisipisiτp-iTs-is-iτTp-i+op-i2,where p-i is the vector p without its ith component, s-i is the vector s without its ith component, and s-iτ is the vector sτ without its ith component.
Similarly, we analyze the convergence at the pointp=e, where ei is 1 and ej is 0 (∀j≠i). Based on the above conditions, we get(21)p^i=EsigsiGsisiτ+2sisiτgsisiτGsi+op-i2,p^j=Eg′siGsisiτ+siτgsigsisiτ+sisjsjτgsigsisiτpj+op-i2.The above equations clearly show that the algorithm converges to such a vector e in which ei is 1 and ej is 0 if condition (2) is satisfied. It means that w=((VA)T)-1q can converge without computing the sign. This shows that w converges as Theorem 2.


## 3.1.1. Objective Function

In order to avoid the blindness of choosing parameters, we combine the non-Gaussianity and the temporal structure to design the following constrained maximization problem:(7)maxw=1ψw=EGytGytyt-τ=EGwTx~tGwTx~tx~t-τTw,where G is a differentiable nonlinear function. This function utilizes the non-Gaussianity, the temporal structure, and the nonlinear correlation.


## 3.1.2. Learning Algorithm

With respect tow, the gradient of E{G[y(t)]G[y(t)y(t-τ)]} can be obtained as(8)∂EGytGytyt-τ∂w=Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,where g is the derivative of G. According to the gradient ascent learning rule, a gradient method can be derived as follows:(9)w⟵w+μ∂EGytyt-τ∂w=w+μEx~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww,where μ is a learning rate. The desired vector can be obtained through this method, but the corresponding cost is that the convergence speed of the algorithm is slow and the performance of the algorithm is dependent on the proper choice of the learning rate. If the learning rate is chosen improperly, the convergence property will be destroyed. Therefore, how to find a new approach to radically improve the convergence speed and the reliability is an important issue that needs to be solved. The fixed-point algorithm is a choice to solve this issue. For getting a more efficient fixed-point algorithm, we note that the gradient must point in the direction of w at a stable point of the gradient algorithm. It means the gradient must be equal to w multiplied by some scalar constant. In such a case, adding the gradient to w does not change its direction and the convergence can be obtained. Through normalization to the unit norm, the value of w is not changed except by changing its sign. Therefore, the following formula can be obtained:(10)w∝Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt.Through the above formula, the fixed-point algorithm can be updated as(11)w⟵Ex~tgytGytyt-τ+Ex~tyt-τgytyt-τGyt+Ex~t-τytgytyt-τGyt,w=ww.Utilizing the above fixed-point algorithm, we can extract the desired signal.


## 3.1.3. Stability Analysis

In this part, we analyze the stability of the proposed algorithm.Theorem 1.
Assume that the input data meet the model as (2). The data are prewhitened through equation x~=VAs and G is a quite smooth even function. Furthermore, we assume that δsi=si(t)si(t-τ)(i=1,2,…,n) are mutually independent. To simplify it, si(t)si(t-τ) is replaced by sisiτ. Under the constraint w=1, the local maxima of E{G[y(t)]G[y(t-τ)]} include one row of the inverse of the matrix VA if the corresponding desired signal si satisfies(12)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j,where g′ is the derivative of g.Proof.
According to the above conditions, we make the orthogonal transform of coordinatesp=ATVTw and obtain(13)Hp=EGpTssτTp.We analyze the stability at the point p=e1=(1,0,0,0,…)T. The independency assumptions are utilized to evaluate the gradient and the Hessian matrix of H(p) at the point p=e1. Then, through making a small perturbation ɛ=(ɛ1,ɛ2,…), where ɛ1 and ɛ2 are the elements of ɛ, we get(14)He1+ɛ=He1+ɛT∂He1∂p+12ɛT∂He1∂pɛ+oɛ2,where ∂H(e1)/∂p and ∂2H(e1)/∂p2 are expressed as(15)∂He1∂p=e1Es1gs1Gs1s1τ+2s1s1τgs1s1τGs1,∂H2e1∂p2=diag⁡Es12g′s1Gs1s1τ+4s12s1τgs1gs1s1τ+4s12s1τ2g′s1s1τGs1,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τs2s2τg′s1s1τGs1+3s1s2s2τgs1gs1s1τ,…,Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ.Because of the constraint w=1, we can know ɛ1=1-ɛ22-⋯-1. Meanwhile, 1-γ=1-γ/2+o(γ) is known. The order of ɛ12 is o(ɛ2), so the higher order terms can be neglected. Through the first-order approximation of ɛ1 that is described above, we know ɛ1=-∑i>1ɛi2/2+o(ɛ2) and obtain(16)He1+ɛ=He1+12Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1∑j>1ɛj2+oɛ2.p=e1 is an extremum that is implied in the condition of Theorem 1 if the following condition is satisfied:(17)Eg′s1Gs1s1τ+s1τgs1gs1s1τ+2s12g′s1s1τGs1+2s1s1τsjsjτg′s1s1τGs1+3s1sjsjτgs1gs1s1τ-s1gs1Gs1s1τ-2s1s1τgs1s1τGs1<0.Based on the above descriptions, this condition can be expanded as(18)Eg′siGsisiτ+siτgsigsisiτ+2si2g′sisiτGsi+2sisiτsjsjτg′sisiτGsi+3sisjsjτgsigsisiτ-sigsiGsisiτ-2sisiτgsisiτGsi<0∀i≠j.


## 3.1.4. Convergence Analysis

Convergence is also important like stability. In this part, we analyze the convergence of the algorithm.Theorem 2.
If the following two conditions are satisfied, the algorithm described in formula (11) can reach convergence: (1)
{si,siτ} and {sj,sjτ} are mutually independent.(2)
E{sig(si)G(sisiτ)+2sisiτg(sisiτ)G(si)}≠0.Proof.
Based on the orthogonal coordinate transformationp=ATVTw, formula (11) is changed to(19)p^k=EsgpTksGpTkssτTpk+EspTksτgpTkssτTpkGpTks+EsτpTksgpTkssτTpkGpTks,pk+1=p^kp^k,where k is the number of iterations. Using a Taylor approximation for G and g, we have(20)GpTks=Gpisi+gpisip-iTs-i+op-i2,gpTks=gpisi+g′pisip-iTs-i+op-i2,GpTkssτTpk=Gpisipisiτ+gpisipisiτp-iTs-is-iτTp-i+op-i2,gpTkssτTpk=gpisipisiτ+g′pisipisiτp-iTs-is-iτTp-i+op-i2,where p-i is the vector p without its ith component, s-i is the vector s without its ith component, and s-iτ is the vector sτ without its ith component.
Similarly, we analyze the convergence at the pointp=e, where ei is 1 and ej is 0 (∀j≠i). Based on the above conditions, we get(21)p^i=EsigsiGsisiτ+2sisiτgsisiτGsi+op-i2,p^j=Eg′siGsisiτ+siτgsigsisiτ+sisjsjτgsigsisiτpj+op-i2.The above equations clearly show that the algorithm converges to such a vector e in which ei is 1 and ej is 0 if condition (2) is satisfied. It means that w=((VA)T)-1q can converge without computing the sign. This shows that w converges as Theorem 2.


## 3.2. The Proposed Algorithm 2

On the basis of the above algorithm, we propose another improved algorithm by utilizing the FastICA algorithm. The FastICA algorithm is a typical ICA algorithm. The source signal can be estimated through maximizing the non-Gaussianity function of signals. One of the representative non-Gaussianity functions is negentropy. However, this algorithm is based on the theory of projection pursuit, so any signal may be first extracted. According to this problem, we propose an improved algorithm by presetting the weight vector. The method of projection pursuit searches for a projection output to maximize the objective function. Based on the theory of ICA, a local extremum in the solution space of the projection direction is obtained if the negentropy is the objective function. The output of the corresponding data for this local extremum is an independent component. If the mixtures consist ofm source signals, the parameter space formed by ICA will have 2m local extrema that correspond to signed solutions of all source signals. Meanwhile, a local optimal solution owns its attraction region for a greedy optimization algorithm that is based on projection pursuit. In other words, the initial point in this region converges to this local optimal solution with this algorithm. The FastICA algorithm may not extract the desired signal if the initial weight matrix is arbitrary. However, if the initial weight matrix is near the local optimal solution that corresponds to the desired signal, the desired source signal can be extracted. The solution vector of the proposed algorithm 1 can be the initial weight matrix of the FastICA algorithm and help the algorithm extract the desired source signal. The solution vector of the proposed algorithm 1 is denoted as(22)w0=w1,…,wi,…,wj,…,wnT.It is the initial weight matrix of the proposed algorithm 2. Then, we can extract the desired signal with the FastICA algorithm based on the negentropy. The approximate negentropy in literatures can be denoted as(23)Jy∝EGy-EGv2.The gradient of J(y) is written as(24)∇Jy∝γEx~tgyt,where γ=E[G(y)]-E[G(v)]; the learning algorithm is obtained as follows:(25)Δw=EGy-EGvEx~tgyt,w⟵ww.The corresponding fixed-point algorithm is denoted as(26)w⟵Ex~tgyt,w⟵ww.However, the convergence property of the FastICA algorithm based on the negentropy is unsatisfactory because the nonpolynomial moment does not own good algebra property. Therefore, the Newton iteration algorithm is usually utilized to improve the process. If the maximization of E{G[wTx(t)]} under the constraint w=1 is considered, the optimization problem with the Lagrangian multiplier method can be changed to(27)Fw=EGwTx~t+βwTw.The first-order derivative and the second-order derivative can be denoted as(28)∂Fw∂w=Ex~tgwTx~t+2βw,∂2Fw∂w2=Ex~tx~tTg′wTx~t+2βI≈Ex~tx~tTEg′wTx~t+2βI=Eg′wTx~tI+2βI.In order to avoid calculating the inverse of the matrix, the simple approximation is made to get the following Newton iteration algorithm:(29)w⟵w-∂Fw/∂w∂2Fw/∂w2=w-Ex~tgwTx~t+2βwEg′wTx~t+2β.Both sides of the above equation are multiplied by E{g′[wTx~(t)]}+2β and then the learning algorithm after the algebraic simplification is denoted as(30)w⟵Ex~tgwTx~t-Eg′wTx~tw,w⟵ww.Formula (30) is the basic formula of the fixed-point FastICA algorithm.Here, we analyze the condition that the initial weight vector must meet in order to get the desired signal. According to formula (30), we get(31)w^k⟵Ex~tgwkTx~t-Eg′wkTx~twk,wk+1=w^kw^k.Based on formula (31) and q=ATVTw, the following formula is obtained:(32)q^k⟵EstgqkTst-Eg′qkTstqk,qk+1=q^kq^k.Assuming ak=1/q^(k), we obtain(33)qk+1=akEstgqkTst-akEg′qkTstqk.To analyze conveniently, we choose G=y4/4 to illustrate. Therefore, g=y3 and g′=3y2 can be obtained. Formula (33) can be simplified as(34)qk+1=akEs1∑m=1Mqmksm3-3q1kE∑m=1Mqmksm2,…,Esi∑m=1Mqmksm3-3qikE∑m=1Mqmksm2,…,EsM∑m=1Mqmksm3-3qMkE∑m=1Mqmksm2T.Next, the following formula can be obtained:(35)qik+1=akEsi∑m=1Mqmksm3-3akqikE∑m=1Mqmksm2=akEsiqiksi+∑m=1,m≠iMqmksm3-3akqikEqiksi+∑m=1,m≠iMqmksm2=akEqi3ksi4+3qiksi2∑m=1,m≠iMqmksm2-3akqikEqi2ksi2+∑m=1,m≠iMqmksm2=akqi3kEsi4-3akqi3kEsi2=akqi3kEsi4-3Esi2=akqi3kk4si,where k4· denotes the kurtosis of the signal. Similarly, we obtain(36)qjk+1=akqj3kk4sj.The following formula is assumed:(37)bk+1=qjk+1qik+1=qj3kk4sjqi3kk4si=b3kk4sjk4si.Then, b(k) can be denoted as(38)bk=qjkqik=k4sjk4si-1qj1qi1k4sjk4si3k-1.If we want to get the desired signal, qj(k) must be close to 0 and qi(k) must be close to 1. Therefore, the following formula must be met:(39)qj1qi1k4sjk4si<1.The above formula (39) can be simplified as(40)qi21>qj21k4sjk4si.Combining the solution vector w0 described in formula (22), we get(41)q0=ATVTw0=q01,…,q0i,…,q0j,…,q0nT.In conclusion, the desired signal can be obtained if the following condition is satisfied:(42)q0i2>q0j2k4sjk4si.Similarly, if another function G is chosen, there will be another condition that is similar to formula (42) helping us get the desired source signal.


## 4. Simulation Results and Analysis

### 4.1. Experiments on Artificial Data

In order to verify the performance of the above algorithms, simulation experiments are performed with the data that are shown in Figure1. Source signals include maternal electrocardiogram (MECG), fetal electrocardiogram (FECG), breathing artifact, electrode artifact, and two kinds of noises. The above source signals are mixed with a matrix to get the mixtures that are shown in Figure 2. The mixing matrix in this paper is written as(43)0.82460.94690.73840.11090.52110.57460.45300.51010.97640.37520.77430.86390.38060.79190.52330.32990.12030.19860.92590.45220.42990.34210.62550.67250.74080.84920.20720.81710.34660.90180.73760.39040.32340.53170.33460.1992.Corresponding simulations are needed to compare the performance of the proposed algorithms and other algorithms. The performance of algorithms can be measured with the performance index (PI) that is denoted as(44)PI=∑j=1npjmaxk⁡pk-1,k=1,…,n,where pj denotes the element of the global vector p=wTVA. If the desired signal is extracted perfectly, the value of PI is 0. In other words, the value of PI is lower if the performance is better. PI is always used to be the measurement index for the artificial data.Figure 1
Source signals data.Figure 2
Mixed signals data.In the comparison algorithms, the MACBSE algorithm, the GABSE algorithm, the SemiBSE algorithm, and the FastNA algorithm are the algorithms that need iterations. Therefore, we compare these algorithms with the proposed algorithm through the relationship of the average performance index and the iterations. In this paper, the functionG(u)=log⁡(cosh⁡(u)) is chosen. The parameters of other algorithms are selected based on the references. In the GABSE algorithm and the FastNA algorithm, G(u)=log⁡(cosh⁡(u)) is also chosen. In the SemiBSE algorithm, the nonlinearity is chosen as g(u)=sign⁡(u) and the constant coefficient is initialized to 0.3. The learning rates are set to 0.1 and 0.0001. All the algorithms described above adopt the same initial weight vector [-0.3331,0.3768,0.2715,0.6498,0.3576,0.3510]T and the optimal time delay 112. The average performance indexes over 100 independent trials against iteration numbers by the six algorithms are shown in Figure 3.Figure 3
The performance indexes against iteration numbers by the six algorithms.It is obviously verified in Figure3 that our algorithms have better performance than other algorithms when the algorithms achieve the convergence.Meanwhile, we compare our algorithms with two noniterative algorithms which include Li’s algorithm and the LAJD algorithm. In the LAJD algorithm,L and K are set to 3 and 2, respectively. The performance indexes of the algorithms after the convergence are shown in Table 1.Table 1
The PI values of the algorithms.
Li’s algorithm
The LAJD algorithm
Our algorithm 1
Our algorithm 2
0.2405
0.195
0.0673
0.033From Table1, it is easy to know that our algorithms have lower performance indexes than Li’s algorithm and the LAJD algorithm.The above comparison is done with the same mixing matrix. However, the mixing matrix is unknown and changing in practice. Therefore, Monte Carlo simulations need to be carried out with different random mixing matrices. We set the initial weight vector as[0,0,0,0,0,1]T and compare different algorithms. The average performance indexes over 100 independent trials against iteration numbers by the six iterative algorithms are shown in Figure 4. In 100 independent trials, the mixing matrices are different and random.Figure 4
The average performance indexes in 100 independent trials against iteration numbers by the six algorithms when the mixing matrix is random.When the mixing matrix is random, the average performance indexes of our algorithms and two noniterative algorithms in 100 independent trials are shown in Table2.Table 2
The average PI values of the algorithms when the mixing matrix is random.
Li’s algorithm
The LAJD algorithm
Our algorithm 1
Our algorithm 2
0.2405
0.195
0.0672
0.033As shown in Figure4 and Table 2, our algorithms still own better performance when the mixing matrix is random.Based on the comparisons of the proposed algorithms and all other algorithms, we can know that our algorithms own good performance for processing the artificial data.


### 4.2. Experiments on Real-World Data

In order to further demonstrate the practicability of our algorithm, the simulations of real-world EEG data which are shown in Figure5 need to be performed. The well-known ECG data are measured from a pregnant woman and shared by De Moor [21]. The ECG data are mixed with maternal electrocardiogram (MECG), fetal electrocardiogram (FECG), breathing artifact, electrode artifact, and some other noises. When extracting FECG from the real-world ECG signals with various kinds of algorithms, we cannot measure the performance of the algorithms with PI because the mixing matrix is unknown. However, the robustness of the algorithms is also an important index. It is always used to be the measurement index for the real-world data. Because there may be estimation error of the optimal time delay in practice, the robustness of the algorithms becomes more important. The FECG signals extracted by all algorithms at the optimal delay 112 are shown in Figure 6. The FECG signals extracted by all algorithms at delays 106 and 120 are shown in Figures 7 and 8. From Figure 6, we can find that all algorithms can extract the FECG signal at the optimal delay 112. However, if the estimation error of the delay is too large, the FECG may not be extracted by the algorithms. According to Figures 7 and 8, we can know that only the proposed algorithms can extract the FECG signal. Our algorithms function when the delay ranges from 106 to 120, which directly illustrates that our algorithms are more robust than other algorithms. In conclusion, our algorithm is applicable to real-world data and owns better robustness than other algorithms.Figure 5
The real-world EEG data.Figure 6
The FECG signals extracted by all algorithms at the optimal delay 112.Figure 7
The FECG signals extracted by all algorithms at the optimal delay 106.Figure 8
The FECG signals extracted by all algorithms at the optimal delay 120.


## 4.1. Experiments on Artificial Data

In order to verify the performance of the above algorithms, simulation experiments are performed with the data that are shown in Figure1. Source signals include maternal electrocardiogram (MECG), fetal electrocardiogram (FECG), breathing artifact, electrode artifact, and two kinds of noises. The above source signals are mixed with a matrix to get the mixtures that are shown in Figure 2. The mixing matrix in this paper is written as(43)0.82460.94690.73840.11090.52110.57460.45300.51010.97640.37520.77430.86390.38060.79190.52330.32990.12030.19860.92590.45220.42990.34210.62550.67250.74080.84920.20720.81710.34660.90180.73760.39040.32340.53170.33460.1992.Corresponding simulations are needed to compare the performance of the proposed algorithms and other algorithms. The performance of algorithms can be measured with the performance index (PI) that is denoted as(44)PI=∑j=1npjmaxk⁡pk-1,k=1,…,n,where pj denotes the element of the global vector p=wTVA. If the desired signal is extracted perfectly, the value of PI is 0. In other words, the value of PI is lower if the performance is better. PI is always used to be the measurement index for the artificial data.Figure 1
Source signals data.Figure 2
Mixed signals data.In the comparison algorithms, the MACBSE algorithm, the GABSE algorithm, the SemiBSE algorithm, and the FastNA algorithm are the algorithms that need iterations. Therefore, we compare these algorithms with the proposed algorithm through the relationship of the average performance index and the iterations. In this paper, the functionG(u)=log⁡(cosh⁡(u)) is chosen. The parameters of other algorithms are selected based on the references. In the GABSE algorithm and the FastNA algorithm, G(u)=log⁡(cosh⁡(u)) is also chosen. In the SemiBSE algorithm, the nonlinearity is chosen as g(u)=sign⁡(u) and the constant coefficient is initialized to 0.3. The learning rates are set to 0.1 and 0.0001. All the algorithms described above adopt the same initial weight vector [-0.3331,0.3768,0.2715,0.6498,0.3576,0.3510]T and the optimal time delay 112. The average performance indexes over 100 independent trials against iteration numbers by the six algorithms are shown in Figure 3.Figure 3
The performance indexes against iteration numbers by the six algorithms.It is obviously verified in Figure3 that our algorithms have better performance than other algorithms when the algorithms achieve the convergence.Meanwhile, we compare our algorithms with two noniterative algorithms which include Li’s algorithm and the LAJD algorithm. In the LAJD algorithm,L and K are set to 3 and 2, respectively. The performance indexes of the algorithms after the convergence are shown in Table 1.Table 1
The PI values of the algorithms.
Li’s algorithm
The LAJD algorithm
Our algorithm 1
Our algorithm 2
0.2405
0.195
0.0673
0.033From Table1, it is easy to know that our algorithms have lower performance indexes than Li’s algorithm and the LAJD algorithm.The above comparison is done with the same mixing matrix. However, the mixing matrix is unknown and changing in practice. Therefore, Monte Carlo simulations need to be carried out with different random mixing matrices. We set the initial weight vector as[0,0,0,0,0,1]T and compare different algorithms. The average performance indexes over 100 independent trials against iteration numbers by the six iterative algorithms are shown in Figure 4. In 100 independent trials, the mixing matrices are different and random.Figure 4
The average performance indexes in 100 independent trials against iteration numbers by the six algorithms when the mixing matrix is random.When the mixing matrix is random, the average performance indexes of our algorithms and two noniterative algorithms in 100 independent trials are shown in Table2.Table 2
The average PI values of the algorithms when the mixing matrix is random.
Li’s algorithm
The LAJD algorithm
Our algorithm 1
Our algorithm 2
0.2405
0.195
0.0672
0.033As shown in Figure4 and Table 2, our algorithms still own better performance when the mixing matrix is random.Based on the comparisons of the proposed algorithms and all other algorithms, we can know that our algorithms own good performance for processing the artificial data.


## 4.2. Experiments on Real-World Data

In order to further demonstrate the practicability of our algorithm, the simulations of real-world EEG data which are shown in Figure5 need to be performed. The well-known ECG data are measured from a pregnant woman and shared by De Moor [21]. The ECG data are mixed with maternal electrocardiogram (MECG), fetal electrocardiogram (FECG), breathing artifact, electrode artifact, and some other noises. When extracting FECG from the real-world ECG signals with various kinds of algorithms, we cannot measure the performance of the algorithms with PI because the mixing matrix is unknown. However, the robustness of the algorithms is also an important index. It is always used to be the measurement index for the real-world data. Because there may be estimation error of the optimal time delay in practice, the robustness of the algorithms becomes more important. The FECG signals extracted by all algorithms at the optimal delay 112 are shown in Figure 6. The FECG signals extracted by all algorithms at delays 106 and 120 are shown in Figures 7 and 8. From Figure 6, we can find that all algorithms can extract the FECG signal at the optimal delay 112. However, if the estimation error of the delay is too large, the FECG may not be extracted by the algorithms. According to Figures 7 and 8, we can know that only the proposed algorithms can extract the FECG signal. Our algorithms function when the delay ranges from 106 to 120, which directly illustrates that our algorithms are more robust than other algorithms. In conclusion, our algorithm is applicable to real-world data and owns better robustness than other algorithms.Figure 5
The real-world EEG data.Figure 6
The FECG signals extracted by all algorithms at the optimal delay 112.Figure 7
The FECG signals extracted by all algorithms at the optimal delay 106.Figure 8
The FECG signals extracted by all algorithms at the optimal delay 120.


## 5. Conclusion

We have proposed novel BSE algorithms for extraction of FECG. First, we design an objective function based on the non-Gaussianity and the temporal structure of the desired FECG. Secondly, a clearer FECG can be obtained by the learning algorithm. Furthermore, the proposed algorithm is further improved through combining the vector obtained by the objective function with the FastICA algorithm. The algorithms of this paper are effective and robust. They can save more time and get more satisfactory results than traditional BSS methods through utilizing the prior information. Experimental results certify the effectiveness of the proposed algorithms. Due to the generality of the presented BSE algorithms, we believe that they can also be extended to other signal processing applications. With our algorithms, it is easy to design suitable functions to solve various kinds of problems.



---

*Source: 9658410-2016-01-26.xml*