Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005.
DOI: 10.1109/ijcnn.2005.1556298
|View full text |Cite
|
Sign up to set email alerts
|

On the use of clustering and local singular spectrum analysis to remove ocular artifacts from electroencephalograms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
13
0

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 12 publications
0
13
0
Order By: Relevance
“…For example, in (Daly, Nicolaou, et al, 2013) three approaches to artifact removal are compared, including an approach, originally proposed in (Teixeira et al, 2005), for using singular value decomposition as a dimensionality reduction step in an artefact removal method.…”
Section: P R E -P R I N T V E R S I O Nmentioning
confidence: 99%
“…For example, in (Daly, Nicolaou, et al, 2013) three approaches to artifact removal are compared, including an approach, originally proposed in (Teixeira et al, 2005), for using singular value decomposition as a dimensionality reduction step in an artefact removal method.…”
Section: P R E -P R I N T V E R S I O Nmentioning
confidence: 99%
“…. , x K ) into a multi-dimensional one, by embedding (a standard procedure for time series analysis [7]) in a high dimensional space [8]. This is done by considering windows of length M < K and N = K − M + 1 lagged vectors…”
Section: B Singular Spectrum Analysis (Ssa)mentioning
confidence: 99%
“…It has also been employed for analysis, forecasting and detection of structural changes in time series models. The main domains of its application are the climatic, meteorological and geophysical time series [7] and also biological signals as EEG [8].…”
Section: Introductionmentioning
confidence: 99%
“…In order to reduce the complexity we these multidimensional signal vectors together with second present a variant of kernel-PCA whose parameters are computed using the eigendecomposition of a low-rank approximation of with the mean of the values along each descendent diagonal of the kernel matrix. This approach accomplished by splitting the X [8]. Note that if ±c[n] corresponds to the extracted EOG, then data set into subsets.…”
mentioning
confidence: 99%
“…Local SSA basically introduces a clustering step into the SSA of the works (as an example see [7])present solutions while in technique [8] and operates in input space. It encompasses the the work we are proposing a single-channel approach.…”
mentioning
confidence: 99%