IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v268y2015icp947-956.html
   My bibliography  Save this article

Convex optimisation-based methods for K-complex detection

Author

Listed:
  • Zamir, Z. Roshan
  • Sukhorukova, N.
  • Amiel, H.
  • Ugon, A.
  • Philippe, C.

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.

Suggested Citation

  • Zamir, Z. Roshan & Sukhorukova, N. & Amiel, H. & Ugon, A. & Philippe, C., 2015. "Convex optimisation-based methods for K-complex detection," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 947-956.
    • Handle: RePEc:eee:apmaco:v:268:y:2015:i:c:p:947-956
    DOI: 10.1016/j.amc.2015.07.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315009169
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.07.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nadezda Sukhorukova & Julien Ugon, 2016. "Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 536-549, November.
    2. Peiris, V. & Sharon, N. & Sukhorukova, N. & Ugon, J., 2021. "Generalised rational approximation and its application to improve deep learning classifiers," Applied Mathematics and Computation, Elsevier, vol. 389(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:268:y:2015:i:c:p:947-956. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.