<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">23817</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.023817</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Novel Radial Basis Function Neural Network Approach for ECG Signal Classification</article-title><alt-title alt-title-type="left-running-head">A Novel Radial Basis Function Neural Network Approach for ECG Signal Classification</alt-title><alt-title alt-title-type="right-running-head">A Novel Radial Basis Function Neural Network Approach for ECG Signal Classification</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Sathishkumar</surname><given-names>S.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>sathismecse@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Devi Priya</surname><given-names>R.</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Information Technology, Adhiyamaan College of Engineering</institution>, <addr-line>Hosur, 621004</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Information Technology, Kongu Engineering College</institution>, <addr-line>Erode, 638060</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: S. Sathishkumar. Email: <email>sathismecse@gmail.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-05-30"><day>30</day>
<month>05</month>
<year>2022</year></pub-date>
<volume>35</volume>
<issue>1</issue>
<fpage>129</fpage>
<lpage>148</lpage>
<history>
<date date-type="received"><day>22</day><month>9</month><year>2021</year></date>
<date date-type="accepted"><day>29</day><month>1</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Sathishkumar and Devi Priya</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Sathishkumar and Devi Priya</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_23817.pdf"></self-uri>
<abstract>
<p>Electrocardiogram (ECG) is a diagnostic method that helps to assess and record the electrical impulses of heart. The traditional methods in the extraction of ECG features is inneffective for avoiding the computational abstractions in the ECG signal. The cardiologist and medical specialist find numerous difficulties in the process of traditional approaches. The specified restrictions are eliminated in the proposed classifier. The fundamental aim of this work is to find the R-R interval. To analyze the blockage, different approaches are implemented, which make the computation as facile with high accuracy. The information are recovered from the MIT-BIH dataset. The retrieved data contain normal and pathological ECG signals. To obtain a noiseless signal, Gabor filter is employed and to compute the amplitude of the signal, DCT-DOST (Discrete cosine based Discrete orthogonal stock well transform) is implemented. The amplitude is computed to detect the cardiac abnormality. The R peak of the underlying ECG signal is noted and the segment length of the ECG cycle is identified. The Genetic algorithm (GA) retrieves the primary highlights and the classifier integrates the data with the chosen attributes to optimize the identification. In addition, the GA helps in performing hereditary calculations to reduce the problem of multi-target enhancement. Finally, the RBFNN (Radial basis function neural network) is applied, which diminishes the local minima present in the signal. It shows enhancement in characterizing the ordinary and anomalous ECG signals.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Electrocardiogram signal</kwd>
<kwd>gabor filter</kwd>
<kwd>discrete cosine based discrete orthogonal stock well transform</kwd>
<kwd>genetic algorithm</kwd>
<kwd>radial basis function neural network</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Automatic electrocardiogram analysis is the best practice for recording the functions of the heart by positioning the electrodes at the external area of the skin. The research on ECG device is focused by various researchers in recent years [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. The advance techniques in ECG provide enhancement in visualizing the heart abnormalities at regular interval. It is most helpful in diagnosing the cardiac disorders like myocardial infarction. In India, 5.5&#x0025; of sudden cardiac death is recorded for every year [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. A myocardial dead tissue is produced by incorporating the historical backdrop of ailment and physical investigation with electrocardiogram discoveries. Among various heart diseases, the wall rupture is a complicated one. In [<xref ref-type="bibr" rid="ref-5">5</xref>], it occurs in 1&#x0025; of patients of acute myocardial infarction and it accounts for up to 7&#x0025; of all infarct related death. Automatic ECG analysis has worked well in the identification of cardiac related problems to provide better treatment. The measure of heart tissue harmis decided by the multi goal examination of electrocardiogram signals [<xref ref-type="bibr" rid="ref-6">6</xref>]. The most crucial component of the ECG signal is QRS complex and its pinnacle is indicated as R-peaks [<xref ref-type="bibr" rid="ref-7">7</xref>]. The R-R intermission is the time space among two successive R tops. It is utilized to find the abnormalities in the heart operation called arrhythmia. In this diagnosis, the size of infarct is estimated to identify the acute complications [<xref ref-type="bibr" rid="ref-8">8</xref>]. In ECG, Q and T waves play a major role. If any problem occurs in the P wave, it causes no complications. Thus, the QRS detection is necessary to achieve the target. T wave change is occurred in larger area, which denotes ischemia whereas the ST segment change is occurred in lesser area, which indicates the myocardial injury and Q wave overlie [<xref ref-type="bibr" rid="ref-9">9</xref>,<xref ref-type="bibr" rid="ref-10">10</xref>]. Many researchers have worked in the area of medical field under cancer detection, electrocardiogram analysis etc. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> highlights the structure of ECG signal.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Structure of ECG signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-1.png"/>
</fig>
<p>In [<xref ref-type="bibr" rid="ref-11">11</xref>], the blockage and R-R interval are determined to achieve good accuracy. The systematic finding of QRS complex is essential to extract the R-R interval from the electrocardiogram recordings. To accurately analyze the cardiac rate variation, the RR series plays a significant role, which provides a quantitative evaluation of heart autonomic capacity in both normal and sickness states [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>]. In the past decades, wide collections of algorithm and techniques are used in understanding the automatic regulation of heart beat. However, the ECG recording contains fictitious occurrences of multiple disruptions like commotion interference in the signal, unexpected change in amplitude of QRS etc [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>]. The noise interference in the electrocardiogram is removed with the assistance of preprocessing. By using the DCT algorithm based DOST, the signals are extracted [<xref ref-type="bibr" rid="ref-17">17</xref>] and the amplitude is computed in each interval. If there is any complication in computing the amplitude, it detects a block in that area. Initially, it is set as 100 hertz. It is split up into 5 intervals like PQRST and the amplitude is set as 1 millivolt. The frequency is computed by f&#x2009;&#x003D;&#x2009;1/T and then the features are extracted [<xref ref-type="bibr" rid="ref-18">18</xref>&#x2013;<xref ref-type="bibr" rid="ref-20">20</xref>]. It helps to compute the mean and average of each interval. Finally, the RBFNN is used to analogize the trained and test data. The data is collected from the MIT-BIH dataset. The collected information have normal dataset and abnormal dataset [<xref ref-type="bibr" rid="ref-21">21</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>]. The trained and test dataset is analogized with the ratio of 1:6 and the expected accuracy is met. This approach is used to decide the perfect calculation for analogizing various classes of ECG oddities by quantitatively looking at the different QRS identification method. It aids in detecting the blockage and R-R interval [<xref ref-type="bibr" rid="ref-24">24</xref>&#x2013;<xref ref-type="bibr" rid="ref-27">27</xref>]. Though, many algorithms and approaches are used for QRS detection, the proposed work is used in real time analysis and it works well in performing large datasets as it requires no extensive computations for processing. It maximizes the detection accuracy to 98.5&#x0025; accuracy.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Proposed Works</title>
<p>The proposed system focuses on the blockage area to detect the R-R interval in ECG signal as represented in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. This DCT-DOST segmentation with adaptive threshold is used in this paper to determine the QRS complex and R peak from the recorded signals of the MIH-BIH database. The distortion in the ECG is filtered by a Gabor filter and therefore the QRS complex information is preserved. After denoising, the signal gets segmented into 256 constituent parts and the magnitude is analogized with the trained data. It is performed for diagnosing the cardiac abnormality. The difference in the amplitude and time period of the ECG sample helps to analysis the abnormality. Nearly 50,000 samples of ECG signals are considered for this analysis. The sampling frequency is split into 5 intervals to detect the RR interval. The mean, variance, entropy are evaluated to extract the features. The GA is used to select significant features. The R peak, segment length and mean are identified for the underlying ECG signal. Finally, the test data is analogized with the trained ECG signal. By using the RBFNN classifier.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Block diagram of proposed work</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-2.png"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Preprocessing</title>
<p>Gabor filter is a type of linear filters and its response for impulse signal is characterized as a Gaussian function [<xref ref-type="bibr" rid="ref-28">28</xref>&#x2013;<xref ref-type="bibr" rid="ref-30">30</xref>]. The requirement of minimal space bandwidth product makes this filter highly suitable for the proposed work.</p>
<p>To define the result of signal propagation in frequency domain, the unpredictable theory has to equal the constant value.<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mi>c</mml:mi></mml:math>
</disp-formula>where, c is a constant, &#x0394;<italic>t</italic>, &#x0394;<italic>f</italic> is the time and frequency space measurement.</p>
<p>In 2D type, the time variable t is supplanted by spatial coordinates (x, y), and the frequency f is superseded by space variables (u, v). In most cases, the 2D Gabor function is evaluated as follows:<disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">[</mml:mo></mml:mrow></mml:mstyle><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi>y</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>g</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">]</mml:mo></mml:mrow></mml:mstyle><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>&#x03B8;</mml:mi><mml:mo>+</mml:mo><mml:mi>y</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>&#x03B8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>In the frequency domain,<disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>u</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mstyle></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math>
</disp-formula>where <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mi>&#x03C3;</mml:mi><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>&#x03C3;</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>&#x03C3;</mml:mi><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>&#x03C3;</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula></p>
<p>The standard deviation of the elliptical Gaussian is represented as <italic>&#x03C3;x</italic> <italic>and</italic> <italic>&#x03C3;y</italic> in the x and y axis. For exact amplitude esteems, the DC values of a 2D Gabor filter are used to minimize the higher order harmonics, which is significantly depicted in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The formula for calculating the filter parameter is denoted as,<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mstyle displaystyle="false" scriptlevel="0"><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:msup></mml:math>
</disp-formula><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>O</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>s</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula></p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Gabor filter functionality</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-3.png"/>
</fig>
<p><italic>&#x03C3;</italic><sub><italic>u</italic></sub> is computed by using the equation,<disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>u</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy='false'>)</mml:mo><mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula></p>
<p><italic>&#x03C3;</italic><sub><italic>v</italic></sub> is evaluated by using,<disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>v</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>tan</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>&#x03C0;</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>k</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mn>2</mml:mn><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:msup><mml:mi>u</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mi>l</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>u</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>U</mml:mi><mml:mi>h</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:math>
</disp-formula></p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>DCT-DOST Based Segmentation</title>
<p>This method uses the DCT-DOST scheme to examine the time domain representation of the ECG signal and to naturally distinguish the R-peak. In the case of DOST, the signal loses its structure during the coefficient truncation. However, it withstands against the coefficient truncations with DCT. The DCT includes all the frequencies to reduce the unpredictability. The DCT-DOST shows essential coefficients at lower frequencies.</p>
<p>The linear S transform fill the gap among fourier and wavelet transforms. The S transfer of a signal h(t) is,<disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mi>s</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x03C4;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>f</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>f</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo>&#x222B;</mml:mo></mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>e</mml:mi><mml:msup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:msup><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mrow></mml:msup><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>i</mml:mi><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msup><mml:mi>d</mml:mi><mml:mi>t</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
<p>Window&#x2019;s width is expressed as,<disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>f</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><italic>&#x03B4;</italic>(<italic>&#x03C4;</italic>, <italic>f</italic><sub>0</sub>) is a 1D time function that demonstrates the magnitude change with time for a fixed frequency. The DOST of h (KT) is,<disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mi>H</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mi>T</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>n</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi>H</mml:mi><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">[</mml:mo></mml:mrow></mml:mstyle><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">]</mml:mo></mml:mrow></mml:mstyle><mml:mspace width="thickmathspace" /><mml:mi>G</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>i</mml:mi><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>m</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mstyle></mml:math>
</disp-formula>where, <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mi>G</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:msup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03C0;</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:msup><mml:mi>m</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:msup><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:math>
</inline-formula></p>
<p>where n extends from 1, 2,&#x2026;N-1.</p>
<p>The proposed work&#x2019;s main goal is to automatically find the peak value of R. To detect the R peak, every heartbeat segment consists 105 patterns as per the R top identification and 151 patterns are generated after the retrieval of R-peak. A sum of 256 patterns is taken to find the extension of cardiac pulse. The advantage of determining the length of every cardiac pulse is to accurately detect the R top. The entire process is depicted in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>R peak detection using DCT-DOST</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-4.png"/>
</fig>
<p>After the retrieval of noiseless image, the DCT-DOST approach is applied for performing peak identification. Initially, the sample frequency is 100 hertz. It is split into five intervals to accurately locate the R-R interval. It is real value transformation and it is positioned in space to minimize the time. It includes no negative frequency. Only positive frequencies are used and there is no symmetry coefficient. Hence, the higher frequencies have to be converted as frequency space during segmentation. Since the DCT-DOST contains no negative frequencies, the frequency width for any signal of length 2&#x2005;N is,</p>
<p>N<sub>1&#x2009;&#x003D;&#x2009;1</sub> and</p>
<p>N<sub>i&#x2009;</sub>&#x003D;<sub>&#x2009;</sub>2<sup>i&#x2212;2</sup> for 2 &#x2264; <italic>i</italic>&#x2009;&#x2264;&#x2009;<italic>N</italic>&#x2009;&#x2212;&#x2009;1</p>
<p>The DCT-DOST method is,</p>
<p><italic>Y</italic>&#x2009;&#x003D;&#x2009;<italic>dct</italic> (<italic>y</italic>);</p>
<p><italic>z</italic>&#x2009;&#x003D;&#x2009;0</p>
<p><italic>For</italic> <italic>cy</italic> <italic>in</italic> [1, 2, 3, &#x2026;];</p>
<p><italic>Y</italic>[<italic>z</italic>;<italic>z</italic>&#x2009;&#x002B;&#x2009;(<italic>z</italic>&#x2009;&#x2212;&#x2009;1)]; <italic>idct</italic> (<italic>y</italic>[<italic>z</italic>;<italic>z</italic>&#x2009;&#x002B;&#x2009;<italic>cz</italic>&#x2009;&#x2212;&#x2009;1]);</p>
<p><italic>end</italic></p>
<p><italic>return</italic> <italic>y</italic></p>
<p>The info ECG signal is propagated via N point DCT. This level produces the coefficients A<sub>1</sub>, A<sub>2</sub>, &#x2026;, A<sub>n</sub>. The acquired coefficients are split into sub bands [2<sup>0</sup>, 2<sup>1</sup>, 2<sup>2</sup>, &#x2026;&#x2026;2<sup>n&#x2212;1</sup>. For each sub band, <italic>&#x03B2;</italic> point inverse DCT operation is performed to ensure the <italic>&#x03B2;</italic> bandwidth.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Feature Extraction</title>
<p>In ECG signal, the feature extraction helps to figure out the amplitude and interval values of P-QRS-T segment in ECG. This work aims to determine the R-R interval and to extract the morphological highlights. By utilizing highlight extraction, 19 transient highlights including PQ, RR and PT interim and 3 morphological highlights are extricated from the ECG signal as portrayed in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Working of feature extraction</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-5.png"/>
</fig>
<p>The maximal and minimal points for each beat of the ECG signal are captured by using morphological highlights. The equation is,<disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</disp-formula></p>
<p>The least value and most value point are figured out in the first and next R peaks. Then it is normalized by taking the esteems between 0 and 1.</p>
<p>Features, which describe the position of P, Q, R, S, T peak and QRS duration are computed by using the initial position of the Q-wave in the end of the S-wave. The QRS complex is computed, which is highly significant in the detection of abnormality.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Algorithm Used to Compute Duration of QRS Complex</title>
<p><bold>Step 1:</bold> Read the signal</p>
<p>Step 2: Identify the duration of QRS complex waveform.</p>
<p>Step 3: Execute the wavelet analysis</p>
<p>Step 4: Calculate the coefficients by using wavelet decomposition.</p>
<p>Step 5: Identify R peak location in the signal by taking 60&#x0025; of its value as threshold.</p>
<p>Step 6: Identify Q point by finding the smallest value ranging from Rloc-50 to Rloc-10.</p>
<p>Step 7: Identify S point by finding the smallest value ranging from Rloc&#x002B;5 to Rloc&#x002B;50.</p>
<p>Step 8: Identify T point by finding the highest value ranging from Rloc&#x002B;25 to Rloc&#x002B;100.</p>
<p>Step 9: Compute the duration of QRS complex by using the equation,<disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="normal">Q</mml:mi><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">S</mml:mi><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>=</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">l</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">F</mml:mi><mml:mi mathvariant="normal">F</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="normal">Q</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>Step 10: Find X&#x003D;QRS.</p>
<p>False negative Detection of QRS complex by using,<list list-type="simple"><list-item><label>a)</label>
<p>Premature ventricular complexes</p></list-item><list-item><label>b)</label>
<p>Low amplitude.</p></list-item></list></p>
<p>False positive Detection by using,<list list-type="simple"><list-item><label>a)</label>
<p>Negative QRS complexes</p></list-item><list-item><label>b)</label>
<p>Low SNR</p></list-item></list></p>
<p>This QRS algorithm is helpful to extract the R-R interval. It is performed by using the heart rate variability (HRV). It is an interval among two sequential R peaks and it is measured by,<disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext><mml:mo>&#x2212;</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>;</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math>
</disp-formula>where r(i) is the peak time of i<sup>th</sup> wave.</p>
<p>The next step is to reduce the number of features. It&#x2019;s done with the aid of a genetic algorithm. It is utilized to improve the features for identifying ECG signals. The structure of this algorithm is signified in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The next generation chooses the best conditions and ignores the remaining. It starts creating a new population at each stage using Selection, Crossover and Mutation.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Structure of genetic algorithm</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-6.png"/>
</fig>
<p>And finally it applies a fitness function, which is computed by,<disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mi>f</mml:mi><mml:mo>.</mml:mo><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</disp-formula></p>
<p>N stands for the number of outputs, t stands for the goal output, and out stands for the actual output. Positive and negative values may be present in the fitness function. As a result, we can&#x2019;t use fitness benefit directly. The selection operator is used to identify the best features associated with the highest fitness value and passes them over to the next generation. The crossover operator swaps the selected individuals chromosomes to produce offspring chromosomes.<disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:mi>C</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mn>0</mml:mn></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>The final operator is then used to notify the bits in the chromosome. The probability that the chromosome in the n<sup>th</sup> position will be estimated is calculated using,<disp-formula id="eqn-16"><label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:mi mathvariant="normal">P</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>The GA algorithm aids in the optimization of neural network results, and it works well to achieve high precision, sensitivity, and specificity, as well as providing output with better classification. The classification is performed by RBFNN.</p>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Radial Basis Function Neural Network</title>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> represents the RBFNN function, which is used in time series prediction, classification and approximation of function. It can be used for any type of model, including linear and nonlinear, as well as any network. It includes three layers like input, hidden and output layers. The input to the hidden layer is converted nonlinearly by the hidden layer. The hidden layer&#x2019;s activation is combined in a linear way by the output layer. The input layer is represented as an x &#x2208; R<sup>n</sup> vector of real numbers. The network&#x2019;s result is R<sup>n</sup> &#x2192;&#x2009;<italic>R</italic>, which is given by<disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>x</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>where the neurons present in the hidden layer is represented as N, C<sub>i</sub> is the centre vector and a<sub>i</sub> is the neuron&#x2019;s weight. The parameters a<sub>i</sub>, c<sub>i</sub> and &#x03B2;<sub>i</sub> aid to optimize the fitness between &#x03C6; and the signal.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>RBFNN network</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-7.png"/>
</fig>
<p>A typical RBF of the scalar input vector which is a first layer is,<disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">(</mml:mo></mml:mrow></mml:mstyle><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>c</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:mstyle scriptlevel="0"><mml:mrow><mml:mo maxsize="2.047em" minsize="2.047em">)</mml:mo></mml:mrow></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>Normalized and de-normalized forms of the generated input are also possible. It is discovered to be in non-normalized state. The equation is,<disp-formula id="eqn-19"><label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>where, <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mi>u</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula></p>
<p>This input layer expression is expressed as,</p>
<p><disp-formula id="eqn-20"><label>(20)</label>
<mml:math id="mml-eqn-20" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p>where, <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</inline-formula><disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>In the de-normalized form<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mi>u</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>&#x03B5;</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>&#x03B5;</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>In the normalized form<disp-formula id="ueqn-3">
<mml:math id="mml-ueqn-3" display="block"><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The probability density function among the input and the output layer is estimated,<disp-formula id="eqn-21"><label>(21)</label>
<mml:math id="mml-eqn-21" display="block"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x222B;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:math>
</disp-formula></p>
<p>The output y given an input x as<disp-formula id="eqn-22"><label>(22)</label>
<mml:math id="mml-eqn-22" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>&#x222B;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mi>y</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>y</mml:mi></mml:math>
</disp-formula></p>
<p>where, the conditional prospect of y specified x is signified as P (y&#x007C;x).</p>
<p>For performing classification, the trained and test datasets are obtained from MIT-BIH database. Nearly 80&#x0025; of data are chosen for training and 20&#x0025; is considered for testing. The training dataset is represented as<disp-formula id="eqn-23"><label>(23)</label>
<mml:math id="mml-eqn-23" display="block"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:msubsup></mml:math>
</disp-formula></p>
<p>The output of the training dataset is Y<sub>i</sub> and time prediction is done by predicting the successive value and features of a sequence,<disp-formula id="ueqn-4">
<mml:math id="mml-ueqn-4" display="block"><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Results and Discussion</title>
<p>The entire work is implemented in MATLAB to analyze the ECG signals. The MIT-BIH dataset is used to validate. The RBFNN classifier is trained by using the aforementioned dataset and the performance is examined for the sample ECG signal. The expected outcome for the ECG signals at each stages of the proposed method is exhibited for detailed analysis. The ECG specimen image taken is elaborated for 50,000 samples. A sample ECG signal is shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Input ECG signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-8.png"/>
</fig>
<p>The electromyogram noise, Gaussian noise and low frequency noises are excluded by the Gabor filter. In addition, the texture features of ECG signal are analysed. In comparison with the input signal, the output of Gabor is more precise and accurate as depicted in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Gabor filter output</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-9.png"/>
</fig>
<p>The distance between the R-peak values is estimated by finding the absolute values. When the heart&#x2019;s electrical function is assumed as a vector, it is easy to analyze the trajectory of the vectors peak. The signal ECG is considered as projection of the heart&#x2019;s electrical vector as depicted in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Estimation of absolute value in ECG signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-10.png"/>
</fig>
<p>The energies in the ECG signal is gathered by using DCT-DOST to represent the most important coefficient at low frequency. The features that are extracted using the DCT-DOST approach indicate the time-recurrence attributes of ECG signal. From <xref ref-type="fig" rid="fig-11">Fig. 11</xref>, it is noted that the peak values in QRS polarity and the unexpected variations in QRS amplitude are detected.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Output of DCT-DOST approach</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-11.png"/>
</fig>
<p>The traditional filtering minimizes the signal noise by delaying the QRS components. The zero phase filtering minimizes phase distortion and provides a compromise among filtering and data retention. The output of the zero phase filter is depicted in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Output of zero phase filter</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-12.png"/>
</fig>
<p>The ECG portion is composed of 112 patterns before the occurrence of R top and 144 patterns after the occurrence of R top. An aggregate of 256 patterns is chosen to find the length of every occasion relating to window size. To consolidate the majority of data with respect to each heart occasion, the length of each event is chosen. These unbalanced time&#x2013;recurrence coefficients have to be processed for the ECG signal to represent the morphological qualities. The segmentation result of DCT-DOST is shown in <xref ref-type="fig" rid="fig-13">Fig. 13</xref>.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Segmented output of sample ECG signal</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-13.png"/>
</fig>
<p>The moving average filter is utilized to remove high frequency noises from the ECG signal by computing the running mean on the predetermined window length. The R-top in the ECG signal is smoothed around 33&#x0025; of its unique height. The output of this filter is represented in <xref ref-type="fig" rid="fig-14">Fig. 14</xref>.</p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Output of moving average filter</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-14.png"/>
</fig>
<p>The QRS wave of the ECG is detected by using zero crossing point detection approach. The dominant and low frequency contents in the ECG are roughly estimated as represented in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Zero crossing detector output</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-15.png"/>
</fig>
<p>The R top discovery in ECG is used to analyze heart anomalies and pulse fluctuation. The primary request separation of the sign is utilized to store the incline data of the genuine pinnacles. <xref ref-type="fig" rid="fig-16">Fig. 16</xref> portrays that the proposed strategy proficiently recognizes the R tops under different conditions like pattern float, uproarious sign, tall T waves or a delayed waves.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>R-peak detection</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-16.png"/>
</fig>
<p>The enhanced performances is achieved with the slope index than the high recurrence index, which is depicted in <xref ref-type="fig" rid="fig-17">Fig. 17</xref>.</p>
<fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Slope identification of ECG</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-17.png"/>
</fig>
<p>The QRS detection ensures the efficient extraction of beat interval and the abnormalities in the heart function. The improvement in the QRS sections are executed by the proposed technique to eliminate the pattern meandering. In this paper, the QRS fiducial focuses are detected to perceive the R point using by QRS complex. <xref ref-type="fig" rid="fig-18">Fig. 18</xref> clarifies that the heart function classification is accomplished.</p>
<fig id="fig-18">
<label>Figure 18</label>
<caption>
<title>Detection of QRS using the proposed method</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-18.png"/>
</fig>
<p>The RR-interim is resolved to obtain the dynamic qualities of the ECG signal. The mean RR interim features are determined by averaging the RR interims of the previous 3-minimum RR interval in a specific occasion, which is highlighted in <xref ref-type="fig" rid="fig-19">Fig. 19</xref>.</p>
<fig id="fig-19">
<label>Figure 19</label>
<caption>
<title>Identification of RR interval</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-19.png"/>
</fig>
<p>Similarly, the neighborhood RR features are inferred by averaging all the RR-interims of the previous episodes of a specific occasion. The neighborhood and mean highlights indicate the mean qualities. These 4 highlights are connected to the morphological list of ECG signal.</p>
<p>The performance of this methodology is analogized with the traditional methods like CNN(Convolutional Neural Network) and SVM (Support Vector Machine). With a maximum accuracy of 98.5&#x0025;, the accuracy of this system outperforms other approaches, which is portrayed in <xref ref-type="fig" rid="fig-20">Fig. 20</xref>.</p>
<fig id="fig-20">
<label>Figure 20</label>
<caption>
<title>Accuracy comparison of different methods</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-20.png"/>
</fig>
<p>The sensitivity shows the true positive value of the classification. It&#x2019;s calculated as the percentage of positives, which are correctly categorised. With a maximum sensitivity of 98.3&#x0025;, it outperforms the CNN and SVM, which own the maximum sensitivity of 92&#x0025; and 86&#x0025; respectively. <xref ref-type="fig" rid="fig-21">Fig. 21</xref> illustrates the sensitivity relation.</p>
<fig id="fig-21">
<label>Figure 21</label>
<caption>
<title>Sensitivity comparison</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-21.png"/>
</fig>
<p>The proposed method&#x2019;s specificity values change in a zig-zag pattern as the number of samples is increased. With a maximum specificity of 99&#x0025;, the proposed method delivers better performance than CNN and SVM, which have the maximum of 93&#x0025; and 95.6&#x0025; respectively. The compariron outcome is represented in <xref ref-type="fig" rid="fig-22">Fig. 22</xref>.</p>
<fig id="fig-22">
<label>Figure 22</label>
<caption>
<title>Comparison of specificity</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_23817-fig-22.png"/>
</fig>
<p>The measure of various contents in the ECG signal like class, sinus rhythm, artifact, ventricular tachycardia, atrial brillation, bigeminy and PVC (Premature Ventricular Contractions) are computed in terms of R, P, S and F1. From <xref ref-type="table" rid="table-1">Tabs. 1</xref> and <xref ref-type="table" rid="table-2">2</xref>, it is clear that the estimation of the proposed RBFNN is higher than the conventional methods.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Comparison of aggregate accuracy</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" colspan="4">Aggregate accuracy comparison</th>
</tr>
<tr>
<th align="left">Model</th>
<th align="left">Training</th>
<th align="left">Validation</th>
<th align="left">Test</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Baseline&#x2013;LSTM<break/>Baseline-CNN</td>
<td align="left">66.8&#x0025;<break/>68.6&#x0025;</td>
<td align="left">66.3&#x0025;<break/>72.2&#x0025;</td>
<td align="left">65.6&#x0025;<break/>68.8&#x0025;</td>
</tr>
<tr>
<td align="left">Stacked unidirectional-LSTM<break/>Stacked bidirectional-LSTM<break/>Stacked unidirectional-LSTM</td>
<td align="left">80.5&#x0025;<break/>82.2&#x0025;<break/>80.4&#x0025;</td>
<td align="left">78.1&#x0025;<break/>79.5&#x0025;<break/>79.4&#x0025;</td>
<td align="left">79.2&#x0025;<break/>80.2&#x0025;<break/>79.3&#x0025;</td>
</tr>
<tr>
<td align="left">Deep residual-CNN</td>
<td align="left">84.7&#x0025;</td>
<td align="left">75.3&#x0025;</td>
<td align="left">74.7&#x0025;</td>
</tr>
<tr>
<td align="left">Combined unidirectional LSTM-CNN<break/>Combined bidirectional LSTM-CNN</td>
<td align="left">83.4&#x0025;<break/>93.2&#x0025;</td>
<td align="left">77.7&#x0025;<break/>74.8&#x0025;</td>
<td align="left">79.6&#x0025;<break/>76.8&#x0025;</td>
</tr>
<tr>
<td align="left">Proposed RBFNN</td>
<td align="left">99&#x0025;</td>
<td align="left">84.4&#x0025;</td>
<td align="left">98.5&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparison of classification metrics</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" colspan="17">Classification metrics comparison</th>
</tr>
<tr>
<th align="left" colspan="1">Rhythm</th>
<th align="center" colspan="4">BDLSTM</th>
<th align="center" colspan="4">Residual</th>
<th align="center" colspan="4">LSTM-CNN</th>
<th align="center" colspan="4">Proposed-RBFNN</th>
</tr>
<tr>
<td align="left">Class</td>
<td align="left">R</td>
<td align="left">P</td>
<td align="left">S</td>
<td align="left">F1</td>
<td align="left">R</td>
<td align="left">P</td>
<td align="left">S</td>
<td align="left">F1</td>
<td align="left">R</td>
<td align="left">P</td>
<td align="left">S</td>
<td align="left">F1</td>
<td align="left">R</td>
<td align="left">P</td>
<td align="left">S</td>
<td align="left">F1</td>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Sinus rhythm</td>
<td align="left">0.82</td>
<td align="left">0.83</td>
<td align="left">0.94</td>
<td align="left">0.84</td>
<td align="left">0.64</td>
<td align="left">0.88</td>
<td align="left">0.86</td>
<td align="left">0.76</td>
<td align="left">0.79</td>
<td align="left">0.80</td>
<td align="left">0.95</td>
<td align="left">0.79</td>
<td align="left">0.85</td>
<td align="left">0.87</td>
<td align="left">0.96</td>
<td align="left">0.89</td>
</tr>
<tr>
<td align="left">Artifact/noice</td>
<td align="left">0.88</td>
<td align="left">0.82</td>
<td align="left">0.94</td>
<td align="left">0.83</td>
<td align="left">0.89</td>
<td align="left">0.97</td>
<td align="left">0.94</td>
<td align="left">0.82</td>
<td align="left">0.81</td>
<td align="left">0.83</td>
<td align="left">0.94</td>
<td align="left">0.81</td>
<td align="left">0.89</td>
<td align="left">0.85</td>
<td align="left">0.92</td>
<td align="left">0.84</td>
</tr>
<tr>
<td align="left">Ventricular tachycardia</td>
<td align="left">0.16</td>
<td align="left">0.51</td>
<td align="left">0.95</td>
<td align="left">0.26</td>
<td align="left">0.48</td>
<td align="left">0.92</td>
<td align="left">0.96</td>
<td align="left">0.08</td>
<td align="left">0.56</td>
<td align="left">0.57</td>
<td align="left">0.97</td>
<td align="left">0.43</td>
<td align="left">0.55</td>
<td align="left">0.34</td>
<td align="left">0.94</td>
<td align="left">0.67</td>
</tr>
<tr>
<td align="left">Atrial brillation</td>
<td align="left">0.81</td>
<td align="left">0.83</td>
<td align="left">0.94</td>
<td align="left">0.82</td>
<td align="left">0.78</td>
<td align="left">0.93</td>
<td align="left">0.92</td>
<td align="left">0.76</td>
<td align="left">0.73</td>
<td align="left">0.69</td>
<td align="left">0.89</td>
<td align="left">0.84</td>
<td align="left">0.88</td>
<td align="left">0.81</td>
<td align="left">0.97</td>
<td align="left">0.81</td>
</tr>
<tr>
<td align="left">Bigeminy</td>
<td align="left">0.72</td>
<td align="left">0.65</td>
<td align="left">0.82</td>
<td align="left">0.67</td>
<td align="left">0.89</td>
<td align="left">0.98</td>
<td align="left">0.98</td>
<td align="left">0.16</td>
<td align="left">0.67</td>
<td align="left">0.67</td>
<td align="left">0.96</td>
<td align="left">0.55</td>
<td align="left">0.84</td>
<td align="left">0.83</td>
<td align="left">0.91</td>
<td align="left">0.80</td>
</tr>
<tr>
<td align="left">Pvc</td>
<td align="left">0.78</td>
<td align="left">0.76</td>
<td align="left">0.88</td>
<td align="left">0.76</td>
<td align="left">0.78</td>
<td align="left">0.93</td>
<td align="left">0.93</td>
<td align="left">0.83</td>
<td align="left">0.79</td>
<td align="left">0.77</td>
<td align="left">0.92</td>
<td align="left">0.72</td>
<td align="left">0.81</td>
<td align="left">0.82</td>
<td align="left">0.95</td>
<td align="left">0.89</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The training, validation and testing efficiencies of the proposed approach are compared with the conventional methods. The training efficiency of this present method is higher than the other methods.</p>
<p>From <xref ref-type="table" rid="table-3">Tab. 3</xref>, the overall f1 score of the proposed method is 90.2&#x0025;, which is higher than the existing methods.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>F1 score class comparison</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" colspan="5">F1 score class comparison</th>
</tr>
<tr>
<th align="left">Rhythm class</th>
<th align="left">BDLSTM</th>
<th align="left">RESIDUAL</th>
<th align="left">LSTM-CNN</th>
<th align="left">Proposed-RBFNN</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Sinus rhythm</td>
<td align="left">0.812</td>
<td align="left">0.734</td>
<td align="left">0.793</td>
<td align="left">0.883</td>
</tr>
<tr>
<td align="left">Artifact/noise</td>
<td align="left">0.834</td>
<td align="left">0.818</td>
<td align="left">0.843</td>
<td align="left">0.923</td>
</tr>
<tr>
<td align="left">Ventricular tachycardia</td>
<td align="left">0.265</td>
<td align="left">0.169</td>
<td align="left">0.417</td>
<td align="left">0.721</td>
</tr>
<tr>
<td align="left">Atrial Brillation</td>
<td align="left">0.837</td>
<td align="left">0.763</td>
<td align="left">0.764</td>
<td align="left">0.852</td>
</tr>
<tr>
<td align="left">Bigeminy</td>
<td align="left">0.663</td>
<td align="left">0.136</td>
<td align="left">0.553</td>
<td align="left">0.754</td>
</tr>
<tr>
<td align="left">Pvc</td>
<td align="left">0.769</td>
<td align="left">0.821</td>
<td align="left">0.724</td>
<td align="left">0.912</td>
</tr>
<tr>
<td align="left">Overall</td>
<td align="left">0.813</td>
<td align="left">0.728</td>
<td align="left">0.742</td>
<td align="left">0.902</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>By considering the classification methods, the performance is improved as shown in <xref ref-type="table" rid="table-4">Tab. 4</xref>.</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>F1 score class comparison by considering classification methods</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" colspan="9">F1 score class comparison</th>
</tr>
<tr>
<th align="left">Rhythm class</th>
<th align="center" colspan="2">BDLSTM</th>
<th align="center" colspan="2">Residual</th>
<th align="center" colspan="2">LSTM-CNN</th>
<th align="center" colspan="2">Proposed-RBFNN</th>
</tr>
<tr>
<td align="left"><bold>&#x00A0;</bold></td>
<td align="left"><inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mrow><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mrow><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mrow><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mrow><mml:mi>M</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:math>
</inline-formula></td>
<td align="left"><italic>Single</italic></td>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Sinus rhythm</td>
<td align="left">0.812</td>
<td align="left">0.612</td>
<td align="left">0.734</td>
<td align="left">0.692</td>
<td align="left">0.793</td>
<td align="left">0.702</td>
<td align="left">0.883</td>
<td align="left">0.813</td>
</tr>
<tr>
<td align="left">Artifact/noise</td>
<td align="left">0.834</td>
<td align="left">0.734</td>
<td align="left">0.818</td>
<td align="left">0.746</td>
<td align="left">0.843</td>
<td align="left">0.774</td>
<td align="left">0.923</td>
<td align="left">0.874</td>
</tr>
<tr>
<td align="left">Ventricular tachycardia</td>
<td align="left">0.265</td>
<td align="left">0.065</td>
<td align="left">0.169</td>
<td align="left">0.085</td>
<td align="left">0.417</td>
<td align="left">0.145</td>
<td align="left">0.721</td>
<td align="left">0.835</td>
</tr>
<tr>
<td align="left">Atrial Brillation</td>
<td align="left">0.837</td>
<td align="left">0.337</td>
<td align="left">0.763</td>
<td align="left">0.797</td>
<td align="left">0.764</td>
<td align="left">0.717</td>
<td align="left">0.852</td>
<td align="left">0.857</td>
</tr>
<tr>
<td align="left">Bigeminy</td>
<td align="left">0.663</td>
<td align="left">0.263</td>
<td align="left">0.136</td>
<td align="left">0.073</td>
<td align="left">0.553</td>
<td align="left">0.523</td>
<td align="left">0.754</td>
<td align="left">0.873</td>
</tr>
<tr>
<td align="left">Pvc</td>
<td align="left">0.769</td>
<td align="left">0.669</td>
<td align="left">0.821</td>
<td align="left">0.709</td>
<td align="left">0.724</td>
<td align="left">0.709</td>
<td align="left">0.912</td>
<td align="left">0.879</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>The proposed work enhances the diagnosis accuracy by eliminating the redundant and noise highlights. The specified algorithm provides sensitivity and accuracy above 98.5&#x0025;. These algorithms are computationally facile and aids in the processing of massive set of database. By this work, the artifacts are detected with extreme accuracy. It gives better acknowledgement performance than the other existing frameworks.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Miao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Tian</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Hossain</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Muhammad</surname></string-name></person-group>, &#x201C;<article-title>Research and implementation of ECG-based biological recognition parallelization</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>18</volume>, no. <issue>3</issue>, pp. <fpage>161</fpage>&#x2013;<lpage>164</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>ECG analysis using multiple instance learning for myocardial infarction detection</article-title>,&#x201D; <source>IEEE Transactions on Biomedical Engineering</source>, vol. <volume>59</volume>, no. <issue>12</issue>, pp. <fpage>3348</fpage>&#x2013;<lpage>3356</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. D.</given-names> <surname>Poian</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Bernardini</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Rinaldo</surname></string-name></person-group>, &#x201C;<article-title>Separation and analysis of fetal-ECG signals from compressed sensed abdominal ECG recordings</article-title>,&#x201D; <source>IEEE Transactions on Biomedical Engineering</source>, vol. <volume>63</volume>, no. <issue>6</issue>, pp. <fpage>1269</fpage>&#x2013;<lpage>1279</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Bayasi</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Tekeste</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Saleh</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Mohammad</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Khandoker</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Low-power ECG-based processor for predicting ventricular arrhythmia</article-title>,&#x201D; <source>IEEE Transactions on Very Large Scale Integration (VLSI) Systems</source>, vol. <volume>24</volume>, no. <issue>5</issue>, pp. <fpage>1962</fpage>&#x2013;<lpage>1974</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhai</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Tin</surname></string-name></person-group>, &#x201C;<article-title>Automated ECG classification using dual heartbeat coupling based on convolutional neural network</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, no. <issue>5</issue>, pp. <fpage>27466</fpage>&#x2013;<lpage>27472</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. J.</given-names> <surname>Mollakazemi</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Asadi</surname></string-name>, <string-name><given-names>H. E.</given-names> <surname>Orimi</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Atyabi</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Uzelac</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Estimation of extent damage tissue by multi resolution analysis of the electrocardiogram and arterial blood pressure</article-title>,&#x201D; <source>Computing in Cardiology Conf. (CinC)</source>, Nice, France, vol. <volume>42</volume>, no. <issue>9</issue>, pp. <fpage>1113</fpage>&#x2013;<lpage>1116</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal">Y. Xia <italic>et al.,</italic> &#x201C;An Automatic Cardiac Arrhythmia Classification System with Wearable Electrocardiogram,&#x201D; <italic>IEEE Access,</italic> vol. 6, pp. 16529&#x2013;16538, 2018.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. K.</given-names> <surname>Yadav</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Sinha</surname></string-name> and <string-name><given-names>P. K.</given-names> <surname>Bora</surname></string-name></person-group>, &#x201C;<article-title>Electrocardiogram signal denoising using non-local wavelet transform domain filtering</article-title>,&#x201D; <source>IET Signal Processing</source>, vol. <volume>9</volume>, no. <issue>2</issue>, pp. <fpage>88</fpage>&#x2013;<lpage>96</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. D.</given-names> <surname>Hesar</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mohebbi</surname></string-name></person-group>, &#x201C;<article-title>A multi rate marginalized particle extended kalman filter for P and T wave segmentation in ECG signals</article-title>,&#x201D; <source>IEEE Journal of Biomedical and Health Informatics</source>, vol. <volume>23</volume>, no. <issue>1</issue>, pp. <fpage>112</fpage>&#x2013;<lpage>122</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">H. M. Lynn, S. B. Pan and P. Kim</person-group>, &#x201C;<article-title>A deep bidirectional GRU network model for biometric electrocardiogram classification based on recurrent neural networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>145395</fpage>&#x2013;<lpage>145405</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. K.</given-names> <surname>Bashar</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>A. J.</given-names> <surname>Walkey</surname></string-name>, <string-name><given-names>D. D.</given-names> <surname>McManus</surname></string-name> and <string-name><given-names>K. H.</given-names> <surname>Chon</surname></string-name></person-group>, &#x201C;<article-title>Noise detection in electrocardiogram signals for intensive care unit patients</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>7</issue>, pp. <fpage>88357</fpage>&#x2013;<lpage>88368</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Detection of fetal ECG R wave from single-lead abdominal ECG using a combination of RR time-series smoothing and template-matching approach</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>5</issue>, pp. <fpage>66633</fpage>&#x2013;<lpage>66643</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Jain</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Bajaj</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name></person-group>, &#x201C;<article-title>Riemann liouvelle fractional integral based empirical mode decomposition for ECG denoising</article-title>,&#x201D; <source>IEEE Journal of Biomedical and Health Informatics</source>, vol. <volume>22</volume>, no. <issue>7</issue>, pp. <fpage>1133</fpage>&#x2013;<lpage>1139</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>She</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nahavandi</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Kouzani</surname></string-name></person-group>, &#x201C;<article-title>Human identification from ECG signals via sparse representation of local segments</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>20</volume>, no. <issue>10</issue>, pp. <fpage>937</fpage>&#x2013;<lpage>940</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. K.</given-names> <surname>Khavar</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Tavakolian</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Blaber</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Menon</surname></string-name></person-group>, &#x201C;<article-title>Automatic and robust delineation of the fiducial points of the seismocardiogram signal for noninvasive estimation of cardiac time intervals</article-title>,&#x201D; <source>IEEE Transactions on Biomedical Engineering</source>, vol. <volume>64</volume>, no. <issue>8</issue>, pp. <fpage>1701</fpage>&#x2013;<lpage>1710</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. A.</given-names> <surname>Atienza</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Morgado</surname></string-name>, <string-name><given-names>L. F.</given-names> <surname>Mart&#x00ED;nez</surname></string-name>, <string-name><given-names>A. G.</given-names> <surname>Alberola</surname></string-name> and <string-name><given-names>J. L. R.</given-names> <surname>&#x00C1;lvarez</surname></string-name></person-group>, &#x201C;<article-title>Detection of life-threatening arrhythmias using feature selection and support vector machines</article-title>,&#x201D; <source>IEEE Transactions on Biomedical Engineering</source>, vol. <volume>61</volume>, no. <issue>3</issue>, pp. <fpage>832</fpage>&#x2013;<lpage>840</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Raj</surname></string-name> and <string-name><given-names>K. C. A.</given-names> <surname>Ray</surname></string-name></person-group>, &#x201C;<article-title>ECG signal analysis using DCT-based DOST and PSO optimized SVM</article-title>,&#x201D; <source>IEEE Transactions on Instrumentation and Measurement</source>, vol. <volume>66</volume>, no. <issue>3</issue>, pp. <fpage>470</fpage>&#x2013;<lpage>478</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. R.</given-names> <surname>Moosavi</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Nigussie</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Levorato</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Virtanen</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Isoaho</surname></string-name></person-group>, &#x201C;<article-title>Low-latency approach for secure ECG feature based cryptographic key generation</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, no. <issue>2</issue>, pp. <fpage>428</fpage>&#x2013;<lpage>442</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. O.</given-names> <surname>Bicen</surname></string-name>, <string-name><given-names>N. Z.</given-names> <surname>Gurel</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Dorier</surname></string-name> and <string-name><given-names>O. T.</given-names> <surname>Inan</surname></string-name></person-group>, &#x201C;<article-title>Improved pre-ejection period estimation from ballistocardiogram and electrocardiogram signals by fusing multiple timing interval features</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>17</volume>, no. <issue>7</issue>, pp. <fpage>4172</fpage>&#x2013;<lpage>4180</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Satija</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Ramkumar</surname></string-name> and <string-name><given-names>M. S.</given-names> <surname>Manikandan</surname></string-name></person-group>, &#x201C;<article-title>A new automated signal quality-aware ECG beat classification method for unsupervised ECG diagnosis environments</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>19</volume>, no. <issue>1</issue>, pp. <fpage>277</fpage>&#x2013;<lpage>286</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Arrhythmia recognition and classification using ECG morphology and segment feature analysis</article-title>,&#x201D; <source>IEEE/ACM Transactions on Computational Biology and Bioinformatics</source>, vol. <volume>16</volume>, no. <issue>2</issue>, pp. <fpage>131</fpage>&#x2013;<lpage>138</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Q. A.</given-names> <surname>Rahman</surname></string-name>, <string-name><given-names>L. G.</given-names> <surname>Tereshchenko</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Kongkatong</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Abraham</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Abraham</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Utilizing ECG-based heartbeat classification for hypertrophic cardiomyopathy identification</article-title>,&#x201D; <source>IEEE Transactions on Nano Bioscience</source>, vol. <volume>14</volume>, no. <issue>7</issue>, pp. <fpage>505</fpage>&#x2013;<lpage>512</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>A parallel GRU recurrent network model and its application to multi-channel time-varying signal classification</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>8</issue>, pp. <fpage>118739</fpage>&#x2013;<lpage>118748</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kiranyaz</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Ince</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Gabbouj</surname></string-name></person-group>, &#x201C;<article-title>Real-time patient-specific ECG classification by 1-d convolutional neural networks</article-title>,&#x201D; <source>IEEE Transactions on Biomedical Engineering</source>, vol. <volume>63</volume>, no. <issue>3</issue>, pp. <fpage>664</fpage>&#x2013;<lpage>675</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>He</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yuan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Automatic cardiac arrhythmia classification using combination of deep residual network and bidirectional LSTM</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, no. <issue>7</issue>, pp. <fpage>102119</fpage>&#x2013;<lpage>102135</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Zhai</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Tin</surname></string-name></person-group>, &#x201C;<article-title>Automated ECG classification using dual heartbeat coupling based on convolutional neural network</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>6</volume>, no. <issue>5</issue>, pp. <fpage>27466</fpage>&#x2013;<lpage>27472</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Pu</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Method of fetal electrocardiogram extraction based on &#x03BD;-support vector regression</article-title>,&#x201D; <source>IET Signal Processing</source>, vol. <volume>9</volume>, no. <issue>7</issue>, pp. <fpage>430</fpage>&#x2013;<lpage>439</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. G.</given-names> <surname>Sutar</surname></string-name> and <string-name><given-names>A. G.</given-names> <surname>Kothari</surname></string-name></person-group>, &#x201C;<article-title>Intelligent electrocardiogram pattern classification and recognition using low-cost cardio-care system</article-title>,&#x201D; <source>IET Science, Measurement &#x0026; Technology</source>, vol. <volume>9</volume>, no. <issue>5</issue>, pp. <fpage>134</fpage>&#x2013;<lpage>143</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. E.</given-names> <surname>Saadawy</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Tantawi</surname></string-name>, <string-name><given-names>H. A.</given-names> <surname>Shedeed</surname></string-name> and <string-name><given-names>M. F.</given-names> <surname>Tolba</surname></string-name></person-group>, &#x201C;<article-title>Hybrid hierarchical method for electrocardiogram heartbeat classification</article-title>,&#x201D; <source>IET Signal Processing</source>, vol. <volume>12</volume>, no. <issue>5</issue>, pp. <fpage>506</fpage>&#x2013;<lpage>513</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Smruthy</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Suchetha</surname></string-name></person-group>, &#x201C;<article-title>Real-time classification of healthy and apnea subjects using ECG signals with variational mode decomposition</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>17</volume>, no. <issue>5</issue>, pp. <fpage>3092</fpage>&#x2013;<lpage>3099</lpage>, <year>2017</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>