EEGsignalprocessing脑电信号处理方法算法.pptVIP

EEG SIGNAL PROCESSING EEG signal modelling 1 Available features 2 Classification algorithms 3 Independent Component Analysis 4 Sparse Representation 5 1 Bioelectricity 1 Signal generation system 2 Excitation model Linear Model Nonlinear Model 2 Basic features 1 Modern methods 2 Temporal Analysis Signal Segmentation: label the EEG signals by segments of similar characteristics. Temporal Criteria Frequency Analysis Suboptimal ? DFT, DCT, DWT; Optimal ? KLT (Karhunen-Loève) Demerits: complete statistical information, no fast calculation. Signal Parameter Estimation AR model: Merits: Outperform DFT in frequency accuracy. Demerits: suffer from poor estimation of parameters. Improvements: accurate order coefficients. AR coefficients estimation methods Yule-Walker ? aryule(x,p) Merits: Toeplitz matrix ? Levinson-Durbin, fastest!!! Demerits: with window ? bad resolution of PSD AR coefficients estimation methods Covariance method ? arcov(x,p), armcov(x,p) Merits: without window? good resolution of PSD Demerits: slow Burg ? arburg(x,p) Merits: accurate approximation of PSD Demerits: line skewing splitting Comparison Principal Component Analysis Use same concept as SVD Decompose data into uncorrelated orthogonal components Autocorrelation matrix is diagonalized Each eigenvector represents a principal component Application ? decomposition, classification, filtering, denoising, whitening. 3 Sparse Approximation 1 Sparse Decomposition 2 Over-complete dictionary ? atoms Hilbert space : Signal: Error: “Sparse”: lN , satisfy limited error . Major algorithms: Basic Pursuit, Matching Pursuits, OMP Matching Pursuits (MP): 1st: kth : 与 正交 K-SVD: training dictionary Potential applications for EEG: Coefficients ? features ERP detection Abnormal EEG detection Classification of different