Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Applied Mechanics / 應用力學研究所
  4. Automatic Detection of the K-Complex Using Matching Pursuit Algorithmfor NREM-2 Stage Scoring
 
  • Details

Automatic Detection of the K-Complex Using Matching Pursuit Algorithmfor NREM-2 Stage Scoring

Date Issued
2014
Date
2014
Author(s)
Chen, Szu-Yu
URI
http://ntur.lib.ntu.edu.tw//handle/246246/264114
Abstract
The purpose of this research is to develop an identification method of the K-Complex wave (KC) in NREM-2 stages (N2) based on AASM rules. In order to mimic the procedure of the sleep stage scoring by sleep technicians, this study uses the matching pursuit algorithm (MP) to locate the KCs in a sleep signal. Similar to the Fourier expansion, the MP expands a signal by a set of bases. The expansion is composed of iterative matching pursuit processes. In each MP process, the correlations between the bases and the signal are computed and the basis that best matches the signal is extracted from the signal. Then the MP process is conducted repeatedly to find the signal segments that possess KC-like waveforms. That simulates the KC pattern recognition by sleep experts. After the KC candidates are obtained, several criteria are applied to screen the candidates, including the duration, peak-to-peak voltage, ratio of negative to positive amplitude, the interval between continuous KC, and the ratio of peak-to-peak voltage to the average of background voltage. Candidates that pass all criteria are considered KC in the signal. This study uses two different data sources. The first one is the DREAMS Databases provided by Devuyst on the website. The sleep signals for 5 subjected were taken from the database. The proposed method was applied to detect KC in these signals and the results were compared those by manual scoring. Among all N2 epochs, the sensitivity (TPR) of the proposed method in KC detection was 65%, 74%, and 80%, respectively, compared with the KC marked by expert 1, expert 2, and the intersection of experts 1 and 2. In the detection of epochs with KC, the sensitivity of the proposed method was 77%, 92%, and 95%, respectively, compared with results by expert 1,expert 2, and the intersection of experts 1 and 2. In general, the performance of the proposed method surpasses the DREAMS automatic detection algorithm. The second data set was collected from the Kang-Ning General Hospital, constituting of sleep signals of 9 healthy subjects. Among all N2 epochs, the TPR of the proposed method in the detection of KC and epochs with KC was 94% and 96%, respectively. Nevertheless, the overall performance of the proposed method is satisfactory, especially in the detection of epochs with KC.
Subjects
睡眠腦波
K複合波
自動判讀
睡眠第二期
匹配追蹤演算法
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-103-R01543049-1.pdf

Size

23.54 KB

Format

Adobe PDF

Checksum

(MD5):f7f0890abb499829d2537a42cfe9fc03

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science