Abstract

K-complex is a special type of electroencephalogram (EEG, brain activity) waveform that is used in sleep stage scoring. An automated detection of K-complexes is a desirable component of sleep stage monitoring. This automation is difficult due to the ambiguity of the scoring rules, complexity and extreme size of data. We develop three convex optimisation models that extract key features of EEG signals. These features are essential for detecting K-complexes. Our models are based on approximation of the original signals by sine functions with piecewise polynomial amplitudes. Then, the parameters of the corresponding approximations (rather than raw data) are used to detect the presence of K-complexes. The proposed approach significantly reduces the dimension of the classification problem (by extracting essential features) and the computational time while the classification accuracy is improved in most cases. Numerical results show that these models are efficient for detecting K-complexes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.