Sürdürülebilir Kalkınma Amaçları

Yazarlar

  • MakaleAçık Erişim2020Scopus SJRQ1
    Accurate deep neural network model to detect cardiac arrhythmia on more than 10,000 individual subject ECG records

    Yildirim, Ozal; Talo, Muhammed; Ciaccio, Edward J.; Tan, Ru San; Acharya, U Rajendra

    Background and objective: Cardiac arrhythmia, which is an abnormal heart rhythm, is a common clinical problem in cardiology. Detection of arrhythmia on an extended duration electrocardiogram (ECG) is done based on initial algorithmic software screening, with final visual validation by cardiologists. It is a time consuming and subjective process. Therefore, fully automated computer-assisted detection systems with a high degree of accuracy have an essential role in this task. In this study, we proposed an effective deep neural network (DNN) model to detect different rhythm classes from a new ECG database. Methods: Our DNN model was designed for high performance on all ECG leads. The proposed model, which included both representation learning and sequence learning tasks, showed promising results on all 12-lead inputs. Convolutional layers and sub-sampling layers were used in the representation learning phase. The sequence learning part involved a long short-term memory (LSTM) unit after representation of learning layers. Results: We performed two different class scenarios, including reduced rhythms (seven rhythm types) and merged rhythms (four rhythm types) according to the records from the database. Our trained DNN model achieved 92.24% and 96.13% accuracies for the reduced and merged rhythm classes, respectively. Conclusion: Recently, deep learning algorithms have been found to be useful because of their high performance. The main challenge is the scarcity of appropriate training and testing resources because model performance is dependent on the quality and quantity of case samples. In this study, we used a new public arrhythmia database comprising more than 10,000 records. We constructed an efficient DNN model for automated detection of arrhythmia using these records.

    • SDG 3 · Sağlık ve Kaliteli Yaşam
    AtıfScopus143OpenAlex146
    ScopusWeb of SciencePubMedİncele
  • MakaleYalnız künye2019Scopus SJRQ1
    A new approach for arrhythmia classification using deep coded features and LSTM networks

    Yildirim, Ozal; Baloglu, Ulas Baran; Tan, Ru-San; Ciaccio, Edward J.; Acharya, U. Rajendra

    Background and objective: For diagnosis of arrhythmic heart problems, electrocardiogram (ECG)signals should be recorded and monitored. The long-term signal records obtained are analyzed by expert cardiologists. Devices such as the Holter monitor have limited hardware capabilities. For improved diagnostic capacity, it would be helpful to detect arrhythmic signals automatically. In this study, a novel approach is presented as a candidate solution for these issues. Methods: A convolutional auto-encoder (CAE)based nonlinear compression structure is implemented to reduce the signal size of arrhythmic beats. Long-short term memory (LSTM)classifiers are employed to automatically recognize arrhythmias using ECG features, which are deeply coded with the CAE network. Results: Based upon the coded ECG signals, both storage requirement and classification time were considerably reduced. In experimental studies conducted with the MIT-BIH arrhythmia database, ECG signals were compressed by an average 0.70% percentage root mean square difference (PRD)rate, and an accuracy of over 99.0% was observed. Conclusions: One of the significant contributions of this study is that the proposed approach can significantly reduce time duration when using LSTM networks for data analysis. Thus, a novel and effective approach was proposed for both ECG signal compression, and their high-performance automatic recognition, with very low computational cost.

    • SDG 3 · Sağlık ve Kaliteli Yaşam
    AtıfScopus377OpenAlex388
    ScopusWeb of SciencePubMedİncele
  • MakaleYalnız künye2017Scopus SJRQ1
    A novel overlapped nuclei splitting algorithm for histopathological images

    Serin, Faruk; Erturkler, Metin; Gul, Mehmet

    Background and objective Nuclei segmentation is a common process for quantitative analysis of histopathological images. However, this process generally results in overlapping of nuclei due to the nature of images, the sample preparation and staining, and image acquisition processes as well as insufficiency of 2D histopathological images to represent 3D characteristics of tissues. We present a novel algorithm to split overlapped nuclei. Methods The histopathological images are initially segmented by K-Means segmentation algorithm. Then, nuclei cluster are converted to binary image. The overlapping is detected by applying threshold area value to nuclei in the binary image. The splitting algorithm is applied to the overlapped nuclei. In first stage of splitting, circles are drawn on overlapped nuclei. The radius of the circles is calculated by using circle area formula, and each pixel's coordinates of overlapped nuclei are selected as center coordinates for each circle. The pixels in the circle that contains maximum number of intersected pixels in both the circle and the overlapped nuclei are removed from the overlapped nuclei, and the filled circle labeled as a nucleus. Results The algorithm has been tested on histopathological images of healthy and damaged kidney tissues and compared with the results provided by an expert and three related studies. The results demonstrated that the proposed splitting algorithm can segment the overlapping nuclei with accuracy of 84%. Conclusions The study presents a novel algorithm splitting the overlapped nuclei in histopathological images and provides more accurate cell counting in histopathological analysis. Furthermore, the proposed splitting algorithm has the potential to be used in different fields to split any overlapped circular patterns.

    AtıfScopus6WoS7OpenAlex7
    ScopusWeb of SciencePubMedİncele
  • Dergi
    Computer Methods and Programs in Biomedicine