• DocumentCode
    2028553
  • Title

    EEG signal classification based on a Riemannian distance measure

  • Author

    Li, Yili ; Wong, Kon Max ; DeBruin, Hubert

  • Author_Institution
    Electr. & Comput. Eng., McMaster Univ., Hamilton, ON, Canada
  • fYear
    2009
  • fDate
    26-27 Sept. 2009
  • Firstpage
    268
  • Lastpage
    273
  • Abstract
    We proposed a k-nearest neighbor EEG signal classification algorithm using a dissimilarity measure defined with a Riemannian distance. The EEG signals are characterized by curves on the manifold of power spectral density matrices. By endowing the manifold with a Riemannian metric we obtain the Riemanian distance between two points on the manifold. Based on this, the measure of dissimilarity is then defined. To best facilitate the classification of similar and dissimilar EEG signal sets, we obtain the optimally weighted Riemannian distance aiming to render signals in different classes more separable while those in the same class more compact. The motivation of the algorithm design and verification method are also provided. Experimental results are presented showing the superior performance of the new metric in comparison to the k-nearest neighbor EEG signal classification algorithm using the commonly used Kullback-Leibler (KL) dissimilarity measure.
  • Keywords
    electroencephalography; matrix algebra; medical signal processing; signal classification; Kullback-Leibler dissimilarity measure; Riemannian distance measure; k-nearest neighbor EEG signal classification algorithm; power spectral density matrices; verification method; Classification algorithms; Data mining; Electric variables measurement; Electroencephalography; Feature extraction; Filtering; Manifolds; Pattern classification; Power engineering and energy; Power engineering computing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Science and Technology for Humanity (TIC-STH), 2009 IEEE Toronto International Conference
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-3877-8
  • Electronic_ISBN
    978-1-4244-3878-5
  • Type

    conf

  • DOI
    10.1109/TIC-STH.2009.5444491
  • Filename
    5444491