Pub Date : 2024-07-25DOI: 10.24425/ijet.2024.149587
P. Staroniewicz
Research work on the effectiveness of voice disguise techniques is important for the development of biometric systems (surveillance) as well as phonoscopic research (forensics). A speaker recognition system or a listener can be deliberately or non-deliberately misled by technical or natural methods. It is important to determine the impact of these techniques on both automatic systems and live listeners. This paper presents the results of listening tests conducted on a group of 40 people. The effectiveness of speaker recognition was investigated using selected natural (chosen from four groups of deliberate natural techniques: phonation, phonemic, prosodic and deformation) and technical (pitch shifting, GSM coding) voice disguise techniques. The results were related to the previously obtained outcomes for the automatic method of verification carried out using a classical speaker recognition system based on MFCC (Mel Frequency Cepstral Coefficients) parameterisation and GMM (Gaussian Mixture Models) classification.
{"title":"Subjective tests of speaker recognition for selected voice disguise techniques","authors":"P. Staroniewicz","doi":"10.24425/ijet.2024.149587","DOIUrl":"https://doi.org/10.24425/ijet.2024.149587","url":null,"abstract":"Research work on the effectiveness of voice disguise techniques is important for the development of biometric systems (surveillance) as well as phonoscopic research (forensics). A speaker recognition system or a listener can be deliberately or non-deliberately misled by technical or natural methods. It is important to determine the impact of these techniques on both automatic systems and live listeners. This paper presents the results of listening tests conducted on a group of 40 people. The effectiveness of speaker recognition was investigated using selected natural (chosen from four groups of deliberate natural techniques: phonation, phonemic, prosodic and deformation) and technical (pitch shifting, GSM coding) voice disguise techniques. The results were related to the previously obtained outcomes for the automatic method of verification carried out using a classical speaker recognition system based on MFCC (Mel Frequency Cepstral Coefficients) parameterisation and GMM (Gaussian Mixture Models) classification.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141802762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149515
Marek Bazan, Czesław Smutnicki, Maciej E. Marchwiany
We consider the real-life problem of planning tasks for teams in a corporation, in conditions of some restrictions. The problem takes into account various constraints, such as for instance flexible working hours, common meeting periods, time set aside for self-learning, lunchtimes and periodic performance of tasks. Additionally, only a part of the team may participate in meetings, and each team member may have their own periodic tasks such as self-development. We propose an algorithm that is an extension of the algorithm dedicated for scheduling on parallel unrelated processors with the makespan criterion. Our approach assumes that each task can be defined by a subset of employees or an entire team. However, each worker is of a different efficiency, so task completion times may differ. Moreover, the tasks are prioritized. The problem is NP-hard. Numerical experiments cover benchmarks with 10 instances of 100 tasks assigned to a 5-person team. For all instances, various algorithms such as branch-and-bound, genetic and tabu search have been tested.
{"title":"Optimization of a task schedule for teams with members having various skills","authors":"Marek Bazan, Czesław Smutnicki, Maciej E. Marchwiany","doi":"10.24425/ijet.2024.149515","DOIUrl":"https://doi.org/10.24425/ijet.2024.149515","url":null,"abstract":"We consider the real-life problem of planning tasks for teams in a corporation, in conditions of some restrictions. The problem takes into account various constraints, such as for instance flexible working hours, common meeting periods, time set aside for self-learning, lunchtimes and periodic performance of tasks. Additionally, only a part of the team may participate in meetings, and each team member may have their own periodic tasks such as self-development. We propose an algorithm that is an extension of the algorithm dedicated for scheduling on parallel unrelated processors with the makespan criterion. Our approach assumes that each task can be defined by a subset of employees or an entire team. However, each worker is of a different efficiency, so task completion times may differ. Moreover, the tasks are prioritized. The problem is NP-hard. Numerical experiments cover benchmarks with 10 instances of 100 tasks assigned to a 5-person team. For all instances, various algorithms such as branch-and-bound, genetic and tabu search have been tested.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149530
N.ZH. Sabitova, Y. Tikhonov, V. Lakhno, Makulov Kariyrbek, Olena Kryvoruchko, Vitalyi Chubaievskyi, A. Desiatko, Mereke Zhumadilova
A methodology is proposed for modifying computer ontologies (CO) for electronic courses (EC) in the field of information and communication technologies (ICT) for universities, schools, extracurricular institutions, as well as for the professional retraining of specialists. The methodology includes the modification of CO by representing the formal ontograph of CO in the form of a graph and using techniques for working with the graph to find optimal paths on the graph using applied software (SW). A genetic algorithm (GA) is involved in the search for the optimal CO. This will lead to the division of the ontograph into branches and the ability to calculate the best trajectory in a certain sense through the EC educational material, taking into account the syllabus. An example is considered for the ICT course syllabus in terms of a specific topic covering the design and use of databases. It is concluded that for the full implementation of this methodology, a tool is needed that automates this procedure for developing EC and/or electronic textbooks. An algorithm and a prototype of software tools are also proposed, integrating machine methods of working with CO and graphs.
本文提出了一种修改计算机本体（CO）的方法，用于大学、学校、课外机构的信息和通信技术（ICT）领域的电子课程（EC），以及专家的专业再培训。该方法包括对 CO 进行修改，将 CO 的正式本体图以图的形式表示出来，并使用应用软件（SW）在图上寻找最优路径。遗传算法（GA）参与了最佳 CO 的搜索。这将导致将本体图划分为多个分支，并能根据教学大纲，计算出欧共体教材在一定意义上的最佳轨迹。以信息和通信技术课程教学大纲中涉及数据库设计和使用的一个具体专题为例进行说明。结论是，要全面实施这种方法，需要有一种工具，能自动执行编写教科书和/或电子教科书的程序。此外，还提出了一种算法和软件工具原型，整合了处理 CO 和图形的机器方法。
{"title":"Optimization of computer ontologies for e-courses in information and communication technologies","authors":"N.ZH. Sabitova, Y. Tikhonov, V. Lakhno, Makulov Kariyrbek, Olena Kryvoruchko, Vitalyi Chubaievskyi, A. Desiatko, Mereke Zhumadilova","doi":"10.24425/ijet.2024.149530","DOIUrl":"https://doi.org/10.24425/ijet.2024.149530","url":null,"abstract":"A methodology is proposed for modifying computer ontologies (CO) for electronic courses (EC) in the field of information and communication technologies (ICT) for universities, schools, extracurricular institutions, as well as for the professional retraining of specialists. The methodology includes the modification of CO by representing the formal ontograph of CO in the form of a graph and using techniques for working with the graph to find optimal paths on the graph using applied software (SW). A genetic algorithm (GA) is involved in the search for the optimal CO. This will lead to the division of the ontograph into branches and the ability to calculate the best trajectory in a certain sense through the EC educational material, taking into account the syllabus. An example is considered for the ICT course syllabus in terms of a specific topic covering the design and use of databases. It is concluded that for the full implementation of this methodology, a tool is needed that automates this procedure for developing EC and/or electronic textbooks. An algorithm and a prototype of software tools are also proposed, integrating machine methods of working with CO and graphs.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149527
S. Barczentewicz, Tomasz Rodziewicz, Andrzej Bień, Andrzej Firlit
The paper presents the propagation assessment and power quality parameters improvement system in power distribution grid. In this work main functionalities of the system are described focusing on the individual assessment module. The module is using CIRED/CIGRE C4.109 method which is based on the 10-minutes aggregated data. Three cases of individual emission assessment using real measurement data in the distribution system operator environment ware analyzed. The obtained results confirmed the legitimacy of using 10-minute data to assess the emissions of harmonics.
{"title":"Individual emission assessment of harmonics in DSO environment","authors":"S. Barczentewicz, Tomasz Rodziewicz, Andrzej Bień, Andrzej Firlit","doi":"10.24425/ijet.2024.149527","DOIUrl":"https://doi.org/10.24425/ijet.2024.149527","url":null,"abstract":"The paper presents the propagation assessment and power quality parameters improvement system in power distribution grid. In this work main functionalities of the system are described focusing on the individual assessment module. The module is using CIRED/CIGRE C4.109 method which is based on the 10-minutes aggregated data. Three cases of individual emission assessment using real measurement data in the distribution system operator environment ware analyzed. The obtained results confirmed the legitimacy of using 10-minute data to assess the emissions of harmonics.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140387108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149532
Vladyslav Vasylenko, Serhii Zaitsev, Yuliia Tkach, Oleksandr Korchenko, R. Ziubina, O. Veselska
The article proposes a method of assessing information transmission reliability by using the output normalized logarithmic ratio of the likelihood function (LRLF) of the decoder. Based on the evaluation, the method allows adapting system parameters with turbo codes (TC) or LDPC code. This method can be used in combination with other methods of parametric and structural adaptation using turbo codes or LDPC codes.
{"title":"Method of assessing the information reliability of in 5G wireless transmission systems","authors":"Vladyslav Vasylenko, Serhii Zaitsev, Yuliia Tkach, Oleksandr Korchenko, R. Ziubina, O. Veselska","doi":"10.24425/ijet.2024.149532","DOIUrl":"https://doi.org/10.24425/ijet.2024.149532","url":null,"abstract":"The article proposes a method of assessing information transmission reliability by using the output normalized logarithmic ratio of the likelihood function (LRLF) of the decoder. Based on the evaluation, the method allows adapting system parameters with turbo codes (TC) or LDPC code. This method can be used in combination with other methods of parametric and structural adaptation using turbo codes or LDPC codes.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149538
Michał Grabowski, Robert Janowski
In this paper we derive mathematical description of TCP (Transmission Control Protocol) retransmission probability based on Jacobson’s smoothing algorithm that belongs to EWMA (Exponentially Weighted Moving Average) category. This description is parametrized on the probability density function (pdf) of RTT (Round Trip Time) samples and α, β – two primary parameters of Jacobson’s algorithm. Although it is not a close form expression, it is formulated as an effective algorithm that let us to explicitly calculate the values of RTO (Retransmission Time Out) probability as a function of α, β and the pdf of RTT samples. We achieve the effectiveness of this approach by applying smart discretization of the state space and replacement of continuous functions with discrete approximate equivalents. In this way, we mitigate the cardinality of discrete distributions we deal with that results in linear (n+m) instead of multiplicative (n⋅m) growth of computational complexity. We provide the evaluation of RTO probability for a wide set of α, β parameter values and differently shaped Normal and Laplace pdfs the RTT samples are taken from. The obtained numerical results let us to draw some conclusions regarding the choice of optimal values of α, β parameters as well as the impact of pdf the RTT samples are taken from.
{"title":"The analytical framework for optimizing TCP retransmission algorithm based on adjustment of its EWMA parameters","authors":"Michał Grabowski, Robert Janowski","doi":"10.24425/ijet.2024.149538","DOIUrl":"https://doi.org/10.24425/ijet.2024.149538","url":null,"abstract":"In this paper we derive mathematical description of TCP (Transmission Control Protocol) retransmission probability based on Jacobson’s smoothing algorithm that belongs to EWMA (Exponentially Weighted Moving Average) category. This description is parametrized on the probability density function (pdf) of RTT (Round Trip Time) samples and α, β – two primary parameters of Jacobson’s algorithm. Although it is not a close form expression, it is formulated as an effective algorithm that let us to explicitly calculate the values of RTO (Retransmission Time Out) probability as a function of α, β and the pdf of RTT samples. We achieve the effectiveness of this approach by applying smart discretization of the state space and replacement of continuous functions with discrete approximate equivalents. In this way, we mitigate the cardinality of discrete distributions we deal with that results in linear (n+m) instead of multiplicative (n⋅m) growth of computational complexity. We provide the evaluation of RTO probability for a wide set of α, β parameter values and differently shaped Normal and Laplace pdfs the RTT samples are taken from. The obtained numerical results let us to draw some conclusions regarding the choice of optimal values of α, β parameters as well as the impact of pdf the RTT samples are taken from.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149526
J. Kryszyn, W. Smolik, D. Wanta, P. Wróblewski, M. Midura
Medical information systems could benefit from electronic health records management using openEHR. On the other hand, such a standard adds an additional software layer to the system, which might impact performance. In this article, we present an in-depth comparison of open-source openEHR servers and propose tools for testing them. Load tests for selected opensource servers were prepared using Apache JMeter. Statistics of elapsed time of requests and throughput of each solution were calculated. Results show that open-source openEHR servers significantly differ in performance and stability and prove that load testing should be a crucial part of a development process.
{"title":"Comparison of openEHR open-source servers","authors":"J. Kryszyn, W. Smolik, D. Wanta, P. Wróblewski, M. Midura","doi":"10.24425/ijet.2024.149526","DOIUrl":"https://doi.org/10.24425/ijet.2024.149526","url":null,"abstract":"Medical information systems could benefit from electronic health records management using openEHR. On the other hand, such a standard adds an additional software layer to the system, which might impact performance. In this article, we present an in-depth comparison of open-source openEHR servers and propose tools for testing them. Load tests for selected opensource servers were prepared using Apache JMeter. Statistics of elapsed time of requests and throughput of each solution were calculated. Results show that open-source openEHR servers significantly differ in performance and stability and prove that load testing should be a crucial part of a development process.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140387060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149516
Jarosław Mazurkiewicz
This work aims to create an ANN-based system for a musical improviser. An artificial improviser of "hearing" music will create a melody. The data supplied to the improviser is MIDItype musical data. This is the harmonic-rhythmic course, the background for improvisation, and the previously made melody notes. The harmonic run is fed into the system as the currently ongoing chord and the time to the next chord, while the supplied few dozen notes performed earlier will indirectly carry information about the entire run and the musical context and style. Improvisation training is carried out to check ANN as a correctlooking musical improvisation device. The improviser generates several hundred notes to be substituted for a looped rhythmicharmonic waveform and examined for quality.
这项工作旨在为音乐即兴演奏者创建一个基于人工智能网络的系统。人工即兴 "听觉 "音乐将创造出一段旋律。提供给即兴演奏者的数据是 MIDI 类型的音乐数据。这些数据包括和声节奏进程、即兴创作的背景以及先前创作的旋律音符。和声的运行过程会作为当前正在进行的和弦和到下一个和弦的时间输入系统，而之前演奏的几十个音符则间接地包含了整个运行过程以及音乐背景和风格的信息。为了检验 ANN 作为音乐即兴装置的正确性，我们进行了即兴演奏训练。即兴演奏者将生成数百个音符，替换成循环节奏和声波形，并对其质量进行检查。
{"title":"Sofcomputing approach to melody generation based on harmonic analysis","authors":"Jarosław Mazurkiewicz","doi":"10.24425/ijet.2024.149516","DOIUrl":"https://doi.org/10.24425/ijet.2024.149516","url":null,"abstract":"This work aims to create an ANN-based system for a musical improviser. An artificial improviser of \"hearing\" music will create a melody. The data supplied to the improviser is MIDItype musical data. This is the harmonic-rhythmic course, the background for improvisation, and the previously made melody notes. The harmonic run is fed into the system as the currently ongoing chord and the time to the next chord, while the supplied few dozen notes performed earlier will indirectly carry information about the entire run and the musical context and style. Improvisation training is carried out to check ANN as a correctlooking musical improvisation device. The improviser generates several hundred notes to be substituted for a looped rhythmicharmonic waveform and examined for quality.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149534
Magdalena Pastuła, Paweł Russek, K. Wiatr
We present the implementation of the hardware ANS compressor in FPGAs. The main goal of the design was to propose a solution suitable to low-cost, low-energy embedded systems. We propose the streaming-rANS algorithm of the ANS family as a target for the implementation. Also, we propose a set of algorithm parameters that substantially reduce the use of FPGA resources, and we examine what is the influence of the chosen parameters on compression performance. Further, we compare our design to the lossless codecs found in literature, and to the streaming-rANS codecs with arbitrary parameters.
我们介绍了用 FPGA 实现硬件 ANS 压缩机的情况。设计的主要目标是提出一种适合低成本、低能耗嵌入式系统的解决方案。我们提出了 ANS 系列中的 streaming-rANS 算法作为实现目标。此外，我们还提出了一套可大幅减少 FPGA 资源使用的算法参数，并研究了所选参数对压缩性能的影响。此外，我们还将我们的设计与文献中的无损编解码器以及具有任意参数的流式 RANS 编解码器进行了比较。
{"title":"Low-cost ANS encoder for lossless data compression in FPGAs","authors":"Magdalena Pastuła, Paweł Russek, K. Wiatr","doi":"10.24425/ijet.2024.149534","DOIUrl":"https://doi.org/10.24425/ijet.2024.149534","url":null,"abstract":"We present the implementation of the hardware ANS compressor in FPGAs. The main goal of the design was to propose a solution suitable to low-cost, low-energy embedded systems. We propose the streaming-rANS algorithm of the ANS family as a target for the implementation. Also, we propose a set of algorithm parameters that substantially reduce the use of FPGA resources, and we examine what is the influence of the chosen parameters on compression performance. Further, we compare our design to the lossless codecs found in literature, and to the streaming-rANS codecs with arbitrary parameters.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140386699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-23DOI: 10.24425/ijet.2024.149517
Łukasz Jeleń, Piotr Ciskowski, Konrad Kluwak
Electrocardiography is an examination performed frequently in patients experiencing symptoms of heart disease. Upon a detailed analysis, it has shown potential to detect and identify various activities. In this article, we present a deep learning approach that can be used to analyze ECG signals. Our research shows promising results in recognizing activity and disease patterns with nearly 90% accuracy. In this paper, we present the early results of our analysis, indicating the potential of using deep learning algorithms in the analysis of both onedimensional and two–dimensional data. The methodology we present can be utilized for ECG data classification and can be extended to wearable devices. Conclusions of our study pave the way for exploring live data analysis through wearable devices in order to not only predict specific cardiac conditions, but also a possibility of using them in alternative and augmented communication frameworks.
{"title":"Deep learning in the classification and recognition of cardiac activity patterns","authors":"Łukasz Jeleń, Piotr Ciskowski, Konrad Kluwak","doi":"10.24425/ijet.2024.149517","DOIUrl":"https://doi.org/10.24425/ijet.2024.149517","url":null,"abstract":"Electrocardiography is an examination performed frequently in patients experiencing symptoms of heart disease. Upon a detailed analysis, it has shown potential to detect and identify various activities. In this article, we present a deep learning approach that can be used to analyze ECG signals. Our research shows promising results in recognizing activity and disease patterns with nearly 90% accuracy. In this paper, we present the early results of our analysis, indicating the potential of using deep learning algorithms in the analysis of both onedimensional and two–dimensional data. The methodology we present can be utilized for ECG data classification and can be extended to wearable devices. Conclusions of our study pave the way for exploring live data analysis through wearable devices in order to not only predict specific cardiac conditions, but also a possibility of using them in alternative and augmented communication frameworks.","PeriodicalId":13922,"journal":{"name":"International Journal of Electronics and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140387084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：