<?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">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">21716</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.021716</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Deep Learning Based Intelligent Industrial Fault Diagnosis Model</article-title>
<alt-title alt-title-type="left-running-head">Deep Learning Based Intelligent Industrial Fault Diagnosis Model</alt-title>
<alt-title alt-title-type="right-running-head">Deep Learning Based Intelligent Industrial Fault Diagnosis Model</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Surendran</surname><given-names>R.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<email>dr.surendran.cse@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Khalaf</surname><given-names>Osamah Ibrahim</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Tavera Romero</surname><given-names>Carlos Andres</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Center for Artificial Intelligence &#x0026; Research (CAIR), Chennai Institute of Technology</institution>, <addr-line>Chennai, 600069</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Al-Nahrain Nanorenewable Energy Research Center, Al-Nahrain University</institution>, <addr-line>Baghdad, 64074</addr-line>, <country>Iraq</country></aff>
<aff id="aff-3"><label>3</label><institution>COMBA I&#x002B;D Research Group of Universidad Santiago de Cali</institution>, <addr-line>Santiago de Cali</addr-line>, <country>Colombia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: R. Surendran. Email: <email>dr.surendran.cse@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-10-02"><day>2</day><month>10</month><year>2021</year>
</pub-date>
<volume>70</volume>
<issue>3</issue>
<fpage>6323</fpage>
<lpage>6338</lpage>
<history>
<date date-type="received"><day>12</day><month>7</month><year>2021</year></date>
<date date-type="accepted"><day>18</day><month>8</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Surendran et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Surendran et al.</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_CMC_21716.pdf"></self-uri>
<abstract>
<p>In the present industrial revolution era, the industrial mechanical system becomes incessantly highly intelligent and composite. So, it is necessary to develop data-driven and monitoring approaches for achieving quick, trustable, and high-quality analysis in an automated way. Fault diagnosis is an essential process to verify the safety and reliability operations of rotating machinery. The advent of deep learning (DL) methods employed to diagnose faults in rotating machinery by extracting a set of feature vectors from the vibration signals. This paper presents an Intelligent Industrial Fault Diagnosis using Sailfish Optimized Inception with Residual Network (IIFD-SOIR) Model. The proposed model operates on three major processes namely signal representation, feature extraction, and classification. The proposed model uses a Continuous Wavelet Transform (CWT) is for preprocessed representation of the original vibration signal. In addition, Inception with ResNet v2 based feature extraction model is applied to generate high-level features. Besides, the parameter tuning of Inception with the ResNet v2 model is carried out using a sailfish optimizer. Finally, a multilayer perceptron (MLP) is applied as a classification technique to diagnose the faults proficiently. Extensive experimentation takes place to ensure the outcome of the presented model on the gearbox dataset and a motor bearing dataset. The experimental outcome indicated that the IIFD-SOIR model has reached a higher average accuracy of 99.6&#x0025; and 99.64&#x0025; on the applied gearbox dataset and bearing dataset. The simulation outcome ensured that the proposed model has attained maximum performance over the compared methods.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Intelligent models</kwd>
<kwd>fault diagnosis</kwd>
<kwd>industrial control</kwd>
<kwd>deep learning</kwd>
<kwd>feature extraction</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>In recent times, the operational status observance and fault analysis of rotating machinery is highly significant. Rotating machineries are becoming essential equipment in the industrial sector [<xref ref-type="bibr" rid="ref-1">1</xref>]. In the last decades, the robust deployment of effective rotating machinery like the latest supersonic vector aircraft engine, massive generator set, accurate machine tool spindle, and efficient marine propulsion motor, and many other devices are developed for achieving automation, unmanned operations, and maximum speed. To approve their security and scalability, it is mandatory to develop proficient and smart fault diagnosis and health monitoring models. Generally, vital faults progress from incipient micro faults gradually. Incipient faults provide minimal consequence on the reliability of the rotating machinery , and are highly simple and easily managed. Therefore, the characteristics of incipient faults are not so reliable, while predicting the micro-faults is complex when compared with normal faults. In recent times, incipient micro-fault analysis and observation models are examined extensively in fault diagnosis. Fault diagnosis approaches are classified into two classes namely, a mechanism analytical model as well as data-driven models. The major requirement is to develop a higher precision numerical approach for defining the establishment of fault diagnosis. Even though better results can be obtained, it is not possible to achieve higher precision in such a model. Additionally, the newly developed method is highly tedious to transplant and resolve related issues [<xref ref-type="bibr" rid="ref-2">2</xref>]. Hence, in the enhancing complexities of mechanical systems, fault diagnosis models have relied on mechanical analytical methods that are applied to a certain extent.</p>
<p>In recent times, an extensive application of the Internet of Things (IoT), advanced intelligent sensing devices, and data collection methodologies are applied vastly in rotating machinery automation. Most of the monitor data like vibrations, sound, temperature, power, and pressure of rotating machinery can be attained effortlessly, and the previous data saves the health details of rotating machinery from starting to the termination of the service. Hence, engineers compute fault diagnosis using statistical analysis of massive historical information. Currently, the data-driven fault diagnosis technique is well-known and used in several applications [<xref ref-type="bibr" rid="ref-3">3</xref>]. For instance, the Yangtze Three Gorges Hydropower Station of China is composed of huge hydroelectric generator sets. Every generator set has to observe various status indications like vibrations, artifacts, pressure enhancement, and so on. The data observation of every indicator is represented by Terabytes (TB). Thus, it becomes impossible to know the experience of engineers for examining the faults while computing feature extraction manually. It is highly prominent in maximum applications like aircraft engines, smart ships, unattended vehicles, and independent ships. Therefore, it is significant to develop intelligent, automated, and adaptive data-driven fault analysis models. Recently, with the considerable development of Machine Learning (ML) and Deep Learning (DL) methodologies, fault diagnosis approaches rely on them is now being current research.</p>
<p>Contrasting from conventional fault diagnosis models relied on the signal processing method; intelligent diagnosing schemes are used for extracting applicable features from monitoring data in the industrial sector. The general intelligent diagnosis models have 3 phases namely, feature extraction, feature selection (FS), and fault classification. Initially, feature extraction transforms the actual data signals gathered by numerous sensors in both the time and frequency domain to reliable representative features for fault identification. Secondly, FS eliminates lower sensitivity and unwanted data from collected features. Thirdly, fault identification feeds the collected features to the fault classifier and compute pattern analysis and, lastly, results in classification results by frequent iterative training. By the utilization and validation, the predefined approaches have inferior feature extraction potential because of the shallow network architecture, and it is not easy to apply in the alternate application, especially for big data [<xref ref-type="bibr" rid="ref-4">4</xref>]. Presently, developers have unified manual feature extraction and shallow ML methodologies for computing intelligent fault diagnosis [<xref ref-type="bibr" rid="ref-5">5</xref>]. In recent times, DL and Deep Neural Networks (DNN) models have gained maximum attention among researchers and are used in mechanical fault diagnosing operations.</p>
<p>This paper develops an Intelligent Industrial Fault Diagnosis using Sailfish Optimized Inception with Residual Network (IIFD-SOIR) Model. The proposed model involves three processes such as signal representation, feature extraction, and classification. Initially, the Continuous Wavelet Transform (CWT) is applied to achieve a pre-processed representation of raw vibration signals. Afterward, Inception with ResNet v2 (IRV2) based feature extraction model is employed to create a set of high-level features. It is chosen over the other DL models because it possesses a shortcut connection at the left of each module. In addition, it has roughly the computational cost of Inception-v4. Additionally, the training of the IRV2 model is faster and got slightly better final accuracy than Inception-v4. Also, the way of fixing the hyperparameters of the IRV2 model necessitates knowledge and widespread trial and error. As there are no simpler and easy methods available for fixing the hyperparameters of the IRV2, the proposed model makes use of a sailfish optimizer (SFO) to tune them. Lastly, a multilayer perceptron (MLP) is applied as a classification tool to identify the faults capably. The utilization of SFO for the hyperparameter tuning of IRV2 in the fault diagnosis process shows the novelty of the work. Extensive experimentation takes place to ensure the effective outcome of the IIFD-SOIR method on the gearbox dataset and a motor bearing dataset.</p>
<p>The organization of the paper is given as follows. Section 2 briefs the related works, Section 3 proposes the IIFD-SOIR model, Section 4 simulates the presented model, and finally, Section 5 concludes the paper.</p>
</sec>
<sec id="s2"><label>2</label><title>Literature Review</title>
<p>Awan et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] projected a 5-layer DNN approach such as 3 hidden layers under the application of a deep autoencoder scheme to identify faults in rolling bearing and planetary gearbox; however, the actual data required is converted to the frequency spectrum. Khan et al. [<xref ref-type="bibr" rid="ref-7">7</xref>] applied a DNN framework based on Deep Belief Network (DBN) applied to diagnose faults in aircraft engines and a power transformer. Li et al. [<xref ref-type="bibr" rid="ref-8">8</xref>] employed a 3 layer DNN that relied on DBN to identify faults in rolling bearing and devices. But, in this approach, the faults are accelerated by grooving, and the fault characteristics are considered as an essential fault, that shows the efficiency and capability of the method while resolving the problems of micro-fault diagnosis. Convolutional Neural Network (CNN) was coined by Prasad et al. [<xref ref-type="bibr" rid="ref-9">9</xref>]. It is highly significant in the DL application [<xref ref-type="bibr" rid="ref-10">10</xref>]. When compared with DNN, the CNN approach consists of a minimum number of parameters because of shared filters [<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>CNN is significantly capable of extracting effective features and is mainly employed in image analysis [<xref ref-type="bibr" rid="ref-12">12</xref>]. Recently, developers have used CNN for the application of identifying faults. Xia et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] projected a DNN technique by stacked CNN for diagnosing faults in rolling bearing and gearbox. Thus, it still requires additional frequency spectra of actual data. Abdulsaheb et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] employed a DL model under the application of the CNN technique for fault diagnosis of rolling element bearings. Though the predefined methods are applied in the CNN model, it still requires a classical traditional feature extraction technology for extracting useful features from original vibration data. Additionally, this model has not applied the entire efficiency of CNN in extracting features that have a minimum enhancement in diagnosing faults. Zhang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] applied a 2-D representation of actual vibration signals input for a CNN approach and compute the fault diagnosis of bearings. Even though these models are lagging in manual feature extraction from actual data, a major limitation is present in this scheme. In the CNN model, the Fully Connected (FC) network has been employed. The parameter quantity of FC structure in the CNN model is maximum and results in massive time consumption for training and testing. These constraints have an undesirable effect on quick fault identification as well as real-time prediction of micro-faults.</p>
</sec>
<sec id="s3"><label>3.</label><title>The Proposed IIFD-SOIR Model</title>
<p><?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the process involved in the IIFD-SOIR model. As depicted in the figure, the data acquisition process takes place to collect the data. Then, the Continuous Wavelet Transform Scalogram (CWTS) model is applied to preprocess and crop the vibration signals. Followed by, the SFO algorithm tuned Inception with ResNetv2 model is implemented as a feature extractor. Finally, MLP is applied as a classification model to identify the different kinds of faults.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Block diagram of IIFD-SOIR model</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-1.png"/></fig>
<sec id="s3_1"><label>3.1</label><title>Data Collection and Preprocessing</title>
<p>Rotating machinery is a function of different rotating speeds and loads. For performing fault identification in several functioning states, the vibration signal from the machine in the total speed and load range required for obtaining to train it [<xref ref-type="bibr" rid="ref-16">16</xref>]. But, when the instance frequency of the signals is dissimilar to the rotating frequencies, several rotating speeds are the reason for an extensive variation in CWTS. For eliminating these controls, the vibration signal is gathered with the rotating speed data. Noticeably, the rotating speed in the training sample is regarded as constant as it can be gathered if the machinery is in a constant functioning form. Initially, the DC module of the vibration signal is eliminated as it does not provide error analysis. A DC part is eliminated by performing subtraction of the mean value of the signal. As the rotating speed modifies in function if the functioning mode modifies, load modifies, and in start-up and shutdowns, the CWTS gives essentially several outcomes when the signals at rotating speed are not preprocessed. For eliminating the control of rotating speed on CWTS, signal re-sampling with a virtual re-sampling frequency (VSF) is established. For vibration signal in the training samples, since its rotating speed is identified, VSF is a group as a frequency namely <italic>q</italic> multiples of the rotating speed. Noticeably, <italic>q</italic> stays similar to every training sample. By this re-sampled vibration signal, all rotations of the rotor have the Assume the vibration signal <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>x</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></inline-formula> it is gathered at a sampling frequency <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mi>z</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> with <italic>m</italic> sample datapoints. Rotating speed is <italic>n</italic> (rpm), equivalent to a machine rotating frequency <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>n</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>60</mml:mn></mml:math></inline-formula>. Determine <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as the virtual <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula>-sampling frequency which is the needed several times of the <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> i.e., <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>q</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, in which <italic>q</italic> is the needed several numbers. For unifying the sampling frequency as <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the data is processed as follows.</p>
<p>By resampling frequency <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the k-th resampled data point must be <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>k</mml:mi><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. When <italic>f</italic> is a multiple of <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, after that, it only requires selecting <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> as the novel <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. If not, utilizing a quartic polynomial interpolation operation <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:math></inline-formula> through the actual instances about <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>x</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>k</mml:mi><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, the novel <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:mover><mml:mi>x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is attained by utilizing <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:</p>
<p><disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mrow><mml:mover><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mover><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mrow><mml:mover><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mover accent='true'><mml:mi mathvariant='bold-italic'>K</mml:mi>
<mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant='bold-italic'>kf</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>f</mml:mi><mml:mi mathvariant='bold-italic'>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant='bold-italic'>kf</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>f</mml:mi><mml:mi mathvariant='bold-italic'>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant='bold-italic'>kf</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>f</mml:mi><mml:mi mathvariant='bold-italic'>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant='bold-italic'>kf</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>f</mml:mi><mml:mi mathvariant='bold-italic'>d</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mrow><mml:mover><mml:mi mathvariant="bold-italic">X</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x230B;</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x230B;</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula>
</p>
<p>Every data has a comparable length behind pre-processing at sampling frequencies that are similar multiples of the rotational frequencies. The wavelet transform decays a signal in the time-frequency field by utilizing relatives of wavelet functions. Scaling and translation of an essential wavelet function are defined by:</p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>&#x03A8;</mml:mi><mml:mrow><mml:mi mathvariant='bold-italic'>a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>b</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant='bold-italic'>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x007C;</mml:mo><mml:mi mathvariant='bold-italic'>a</mml:mi><mml:msup><mml:mo>&#x007C;</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:msup><mml:mi mathvariant='bold-italic'>&#x03A8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant='bold-italic'>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant='bold-italic'>b</mml:mi></mml:mrow><mml:mi mathvariant='bold-italic'>a</mml:mi></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant='bold-italic'>a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;b</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi mathvariant='bold-italic'>Ra</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mn>0</mml:mn><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a continuous wavelet, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow></mml:math></inline-formula>is the scalable variable, and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:math></inline-formula>, the translational variable, correspondingly.</p>
<p>CWT take over and made the localization design of the short-time Fourier transform (STFT). A CWT is used for signal time-frequency diagnosis and processing. A CWT of a signal <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is determined as the convolution of the signal <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> with the wavelet function <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. During this technique, the CWT is performed for decomposing the information from scale 1 to <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:math></inline-formula>, in which <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:math></inline-formula> is generally equivalent or superior to, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mn mathvariant="bold">2</mml:mn><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi></mml:mrow></mml:math></inline-formula>:</p>
<p><disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo>&#x222B;</mml:mo></mml:mrow><mml:mrow></mml:mrow><mml:mrow></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:math></disp-formula>
in which <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>C</mml:mi><mml:mi mathvariant='bold-italic'>a</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant='bold-italic'>a</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the wavelet coefficient of <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> at the <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow></mml:math></inline-formula> th scale and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mo stretchy="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the difficult conjugate of the wavelet operation at scaling <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow></mml:math></inline-formula> and translation <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:math></inline-formula> The CWT creates the coefficients on the several parts of the signal in several scaling factors. Utilizing this wavelet coefficient, a signal in the time-frequency field is straightly illustrated by a 2-D image. A graph of the wavelet coefficients generates the CWTS.</p>
<p>Getting every wavelet coefficient in a matrix <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:mi mathvariant='bold-italic'>P</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant='bold-italic'>C</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:msub><mml:mi mathvariant='bold-italic'>C</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:msub><mml:mi mathvariant='bold-italic'>C</mml:mi><mml:mi mathvariant='bold-italic'>l</mml:mi></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, it is changed to a gray matrix <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> by:</p>
<p><disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">m</mml:mi><mml:mi mathvariant="bold">i</mml:mi><mml:mi mathvariant="bold">n</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">m</mml:mi><mml:mi mathvariant="bold">a</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">m</mml:mi><mml:mi mathvariant="bold">i</mml:mi><mml:mi mathvariant="bold">n</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mn mathvariant="bold">255</mml:mn></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:mfrac></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">m</mml:mi><mml:mi mathvariant="bold">i</mml:mi><mml:mi mathvariant="bold">n</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold">m</mml:mi><mml:mi mathvariant="bold">a</mml:mi><mml:mi mathvariant="bold">x</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the minimum and maximum elements of <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow></mml:math></inline-formula>, correspondingly. A value of the element in <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> refers to a gray value in the series from <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:mn mathvariant="bold">0</mml:mn></mml:mrow></mml:math></inline-formula> to 255. So, <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the CWTS of the original signal.</p>
<p>Massive image recognition necessitates a more complicated CNN architecture and more calculations, which takes longer to train and calculate. Conversely, a massive image is reducing the result of tiny local features and decrease the sensitivity and accuracy of fault analysis. For accommodating this, CWTS cropping is performed using 3 rules:
<list list-type="bullet">
<list-item><p>A cropping effect should include at worst the CWT coefficients of 1 whole rotating duration.</p></list-item>
<list-item><p>The length of the one side of the square outcome should be superior to 2q.</p></list-item>
</list></p>
<p>When the pixel&#x0027;s coordinate points are greater than the coordinate points on the time axis, the pixel cannot be used as a result. <italic>2.2. Inception with ResNetv2 Model</italic></p>
<p>CNN is a variation of multilayer FC feedforward neural networks (FFNN) that can remove local features to classify data in an automated way. It is extremely utilized in varied computer vision functions. While several variations of the CNN method are made, a structure of the usual CNN is created with a convolution layer, pooling or sub-sampling layer, and FC layer as in a typical multiple NN.</p>
<p>The convolution layer is the important building block of CNN. It can be generally developed for a group of learnable kernels and one trainable bias for every feature map. In the convolutional layer, all filters are linked to the local patches in the feature map of the preceding layer [<xref ref-type="bibr" rid="ref-17">17</xref>]. For input <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mrow><mml:mtext>-</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:math></inline-formula> 1 of the <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> layer, the next layer&#x0027;s feature map is illustrated as follows:</p>
<p><disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2217;</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">k</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:math></inline-formula> is the kernel count in <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> layer; <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:math></inline-formula> is the <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow></mml:math></inline-formula>th feature map in the <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:math></inline-formula>th layer; <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mrow><mml:mi mathvariant="bold-italic">k</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:math></inline-formula> are the equivalent convolutional kernel and additive bias, and <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> illustrates the non-linear activation function.</p>
<p>Behind the convolution layer, it is necessary of adding a pooling layer among the CNN layers. It joins the outcome of the neighboring neurons at 1 layer to an individual neuron in the subsequent layer. Individual groups amongst several feature maps are optimal for obtaining further abstract feature illustrations. It can be used for shorting the calculations and manage overfitting by decreasing the dimensionality of the input for reducing the count of parameters. When an input map is available, after that resultant map with diminished size would be attained using a pooling function that is illustrated as:</p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B2;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">j</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
where <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> signifies a sub-sampling or pooling operation, <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B2;</mml:mi></mml:mrow></mml:math></inline-formula> is the multiplicative bias and <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:mi mathvariant="bold-italic">b</mml:mi></mml:mrow></mml:math></inline-formula> is the additive bias to all feature maps. A final result generally is the softmax that is utilized for classifying the input data into many class labels. Afterward, the training model to CNN is similar to which the usual NN by backpropagation and gradient descent technique.</p>
<p>Inception-ResNet-V2 (IRV2) was developed by Google Company in 2018 which is applied in place of existing approaches for the fault diagnosis of machinery. It is defined as the integration of GoogLeNet and ResNet. This method is composed of 10 portions, where each portion has its responsibility in role orientation as well as function. Here, Inception is a common network with parallel layer infrastructure used in GoogleNet. The filters have parallel connections with various sizes of 1x1, 3x3, and 5x5. The tiny size leads to a convolutional kernel and extracts the image features effectively and limits the model variables. When compared with other sizes, the large-scale convolution kernel would maximize the variables of the model matrix, hence various small-scaled convolution kernels are interchanged in a parallel fashion for eliminating the functional variables. Consequently, the method is applied extensively and more reliable when compared with the former network with Inception. Inception v1&#x2013;v4 is the general approach of GoogleNet. Thus, the residual learning enabled ResNet is an extension of ILSVRC 2015 that applies 152 layers. ResNet&#x0027;s core assumption is to incorporate a direct link to this method, which is referred to as Highway Network informally. The traditional network structure is defined as a non-linear conversion of functional input, whereas Highway Network enables a limited ratio of a result in the existing network layer. As a result, the actual input data is forwarded directly to the upcoming layer. At the same time, ResNet secures the data by direct transmission of input to output. The entire network has to know the variations among input and output that signifies the learning objectives as well as complexities. ResNet-50, ResNet-101, and ResNet-152 are few modules in ResNet. In Residual-Inception system (<?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref>), the the Inception block has been applied as it has minimum processing complexity when compared with the actual Inception module. <xref ref-type="fig" rid="fig-2">Figs. 2a</xref>&#x2012;<xref ref-type="fig" rid="fig-2">2c</xref> implies the Inception ResNet layers, such as Inception ResNet A, Inception ResNet B, and Inception ResNet C. The count of layers is 5, 10, and 5, correspondingly. <xref ref-type="fig" rid="fig-2">Figs. 2d</xref> and <xref ref-type="fig" rid="fig-2">2e</xref> illustrate the Reduction Layer of IRV2, in which Reduction A and Reduction B. Every Inception block is linked to a filter layer for dimension transformation and accomplishes the input mapping. It compensates for the dimensionality reduction in the Inception block. Based on the traditional studies [<xref ref-type="bibr" rid="ref-18">18</xref>], IRV2 evolved from Inception ResNet V1 (IRV1) matches the actual cost of the Inception-v4 network. Regarding this, a small variation among residual and non-residual Inception, especially in Inception-ResNet, is batch normalization (BN) applied in traditional layers. Because tests have shown that using the maximal activation size requires a lot of GPU RAM, large Inception modules may be made by removing the BN layer once the activation is finished. Also, a method becomes highly effective and pr&#x00E9;cised. Furthermore, when the filter count is above 1000, then the residual network becomes unstable, and premature death will exist in the network training process. Followed by, a huge number of training data is applied, and layer present before the average pooling generates zeroes. It cannot be removed by minimizing the learning rate as well as including BN layers.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>(a) Architecture of inception ResNet V2 (b) Inception ResNet A, (c) Inception ResNet B, (d) Inception ResNet C, (e) Reduction-A, and (f) Reduction-B</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-2.png"/></fig>
</sec>
<sec id="s3_2"><label>3.3</label><title>Sailfish Optimizer Based Parameter Optimization</title>
<p>In the Inception with the ResNet v2 model, few main hyperparameters exist namely kernel size, filter count, hidden node count, and penalty coefficient, which majorly influence the overall results. Practically, it is time-consuming and hard to select the proper combination of parameters. To choose the optimal parameters of Inception with the ResNet v2 model, the SFO algorithm is employed. In general, SFO [<xref ref-type="bibr" rid="ref-19">19</xref>] is defined as a population relied meta-heuristic approach that is based on the attack-alternation principle of a group of hunting sailfishes. Sailfishes are assumed to be distributed in the search space, while the place of sardines assists in finding <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:math></inline-formula> optimal solution in search space. It has an optimal fitness measure is named as &#x2018;elite&#x2019; sailfish and the place at <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> iteration is provided by <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. For sardine, the affected is a one which has better fitness value and the location at <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> iteration is provided by <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. For all iterations, the place of sardines and sailfishes is maximized. For <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> iteration, a novel position <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msubsup></mml:math></inline-formula> of a sailfish is upgraded by applying &#x2018;elite&#x2019; sailfish and &#x2018;affected sardine as given in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>.</p>
<p><disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">s</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">j</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:mfrac><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> implies the former place of <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> sailfish, <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:math></inline-formula> defined as an arbitrary value among <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mn>0</mml:mn></mml:math></inline-formula>-1 and <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> refers to a coefficient produced as per <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>.</p>
<p><disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">&#x03BC;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">D</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">D</mml:mi></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">D</mml:mi></mml:mrow></mml:math></inline-formula> describes prey density, which represents the count of prey for all iterations. Followed by, the measure of <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">D</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> is valued by <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>, reduces as the number of preys is limited while group hunting.</p>
<p><disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">D</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
where <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> refers to the value of sailfishes and sardines correspondingly.</p>
<p><disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">l</mml:mi><mml:mi mathvariant="bold-italic">f</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">c</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow></mml:math></inline-formula> defines the ratio of sardine population which develops an initial sailfish population. The primary number of sardines is assumed as superior to the number of sailfishes. The sardine places get upgraded in all iterations as provided by <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>.</p>
<p><disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:msubsup><mml:mi mathvariant='bold-italic'>P</mml:mi><mml:mrow><mml:mi mathvariant='bold-italic'>Srd</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant='bold-italic'>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi mathvariant='bold-italic'>rnd</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant='bold-italic'>&#x00A0;</mml:mi><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi mathvariant='bold-italic'>P</mml:mi><mml:mrow><mml:mi mathvariant='bold-italic'>SLfBest</mml:mi></mml:mrow><mml:mi mathvariant='bold-italic'>i</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi mathvariant='bold-italic'>P</mml:mi><mml:mrow><mml:mi mathvariant='bold-italic'>Srd</mml:mi></mml:mrow><mml:mi mathvariant='bold-italic'>i</mml:mi></mml:msubsup><mml:mo>+</mml:mo><mml:mi mathvariant='bold-italic'>ATK</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mn mathvariant="bold">1</mml:mn></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi>&#x03BA;</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
where <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msubsup><mml:mrow><mml:mi mathvariant="bold-italic">P</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the former and current locations of sardine correspondingly and <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:math></inline-formula> implies the sailfish&#x0027;s attacking efficiency at iteration <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi></mml:mrow></mml:math></inline-formula>. Then, the count of sardines which upgrades the place and number of displacements are based on <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:math></inline-formula>. The minimization of <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi>T</mml:mi><mml:mi>K</mml:mi></mml:mrow></mml:math></inline-formula> helps the convergence of the search agent. Under the application of variable <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> the number of sardines which upgrades the location <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B3;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and count of variables of them <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B4;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are determined in <xref ref-type="disp-formula" rid="eqn-13">Eqs. (13)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-14">(14)</xref>:</p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B3;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">&#x03B4;</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">v</mml:mi></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mrow><mml:mi mathvariant="bold-italic">v</mml:mi></mml:mrow></mml:math></inline-formula> denotes the value of variables and <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> implies the count of sardines. When the sardines are facilitated as a fitter compared to any sailfish, the sailfish maximizes the place, as well as the sardine, is removed from its population. Random selection of sailfishes and sardines ensures the identification of the search area. Since the attacking ability of sailfish reduces for all iterations and it offers a chance of escaping from a sailfish, that helps in exploitation. The <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">T</mml:mi><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:math></inline-formula> variable manages to identify a tradeoff among exploration and exploitation. <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref> depicts the workflow of the SFO algorithm.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>Flowchart of SFO algorithm</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-3.png"/></fig>
</sec>
<sec id="s3_3"><label>3.4</label><title>MLP Based Classification</title>
<p>MLP is defined as a NN method with several hidden layers, and neurons among adjacent layers are linked together. The structural representation of this method is depicted in <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<p>The parameter selection is composed of newly presented MLP depends upon the experience and experiment. The hidden layer selection is computed by comparing the experiment by fixing 2, 4, 6, and 8 hidden layers and the attained results demonstrate the layer with enhanced time cost whereas the accuracy is not maximized. If the layer is fixed as 2, the classification accuracy is reduced. Hence, the accuracy and time cost can be balanced by 4 hidden layers applied in this approach. The count of neurons present in a hidden layer is fixed based on multiple trial performance, and the principle is balanced with time cost and accuracy. The activation functions, as well as loss functions, are ReLU and softmax cross-entropy along with logits is employed, correspondingly. The flow of extraction is composed of 3 phases namely, sample selection, model training, and classification generation.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Structure of MLP</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-4.png"/></fig>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Performance Validation</title>
<sec id="s4_1"><label>4.1</label><title>Implementation Data</title>
<p>The performance of the proposed model is simulated using the Python tool. To ensure the effective outcome of the presented model in the identification of various fault class labels, two datasets namely automotive gearbox and bearing fault from Case Western Reserve University Bearing Data Center [<xref ref-type="bibr" rid="ref-20">20</xref>]. The first dataset holds 7 types of health status like an outer race bearing fault, a minor chipped gear fault, a missed tooth gear fault, and three types of compound faults (Normal, Minor chipped tooth, Missing tooth (0.2&#x2005;mm), and Missing tooth (2&#x2005;mm)). Under every class label, 1200000 samples are gathered and divided into 100 instances with 0.5&#x2005;s. Besides, a set of 300 sample instances are attained under every health status with varying speed rates. At last, a dataset with 2100 sample instances is attained. The second dataset has both normal and fault data. The types of bearing fault have Inner race (IF), Outer race (OF), and Ball faults (BF). Therefore, there are atotally of 10 kinds of bearing health status under varying loads. Every sample has a set of 2000 data points, which are again transformed into a time-frequency representation utilizing WT [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>]. Every health status comprises 60 instances under every load. There are 2400 sample instances gathered to verify the algorithm&#x0027;s performance<bold>.</bold></p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Results Analysis</title>
<p><?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Fig. 5</xref> investigates the accuracy analysis of the different fault classes by the IIFD-SOIR model on the applied Gearbox dataset. On the applied gearbox dataset 1, the IIFD-SOIR, FFT-SVM, CNN, and CNN2 models have reached a maximum accuracy of 100&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; whereas the FFT-KNN, FFT-DBN, and FFT-SAE models have demonstrated slightly lower performance with the accuracy of 85.44&#x0025;, 98.90&#x0025;, 99.97&#x0025; respectively. Likewise, on the given gearbox dataset 2, the IIFD-SOIR, FFT-SVM, CNN, and CNN2 methodologies have attained a higher accuracy of 100&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; while the FFT-KNN, FFT-DBN, and FFT-SAE methodologies have depicted minimal function with the accuracy of 93.46&#x0025;, 98.87&#x0025;, 99.98&#x0025; correspondingly. Likewise, on the applied gearbox dataset 3, the FFT-SVM, FFT-KNN, FFT-SAE, and FFT-DBN approaches have accomplished higher accuracy of 99.89&#x0025;, 99.71&#x0025;, 99.64&#x0025;, and 99.50&#x0025; whereas the IIFD-SOIR, CNN, and CNN2 methods have illustrated moderate performance with the accuracy of 99.34&#x0025;, 98.58&#x0025;, 98&#x0025; respectively. Meanwhile, on the applied gearbox dataset 4, the FFT-SVM, FFT-KNN, FFT-SAE, and CNN frameworks have achieved a maximum accuracy of 100&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; while the IIFD-SOIR, CNN2, and FFT-DBN technologies have depicted considerable function with the accuracy of 99.85&#x0025;, 99.77&#x0025;, 99.49&#x0025; respectively. Then, on the applied gearbox dataset 5, the IIFD-SOIR, FFT-SAE, CNN, and CNN2 schemes have gained optimal accuracy of 100&#x0025;, 99.98&#x0025;, 100&#x0025;, and 100&#x0025; whereas the FFT-KNN, FFT-DBN, and FFT-SVM approaches have depicted moderate function with the accuracy of 88.07&#x0025;, 99.41&#x0025;, 99.90&#x0025; correspondingly. Moreover, on the applied gearbox dataset 6, the IIFD-SOIR, FFT-SAE, CNN, and CNN2 technologies have attained higher accuracy of 99.26&#x0025;, 98.24&#x0025;, 99.76&#x0025;, and 97.74&#x0025; while the FFT-KNN, FFT-DBN, and FFT-SVM scheme have exhibited medium performance with the accuracy of 69.38&#x0025;, 96.50&#x0025;, 97.22&#x0025; respectively. In addition, on the applied gearbox dataset 7, the IIFD-SOIR, FFT-SAE, FFT-DBN, and CNN2 frameworks have achieved the highest accuracy of 98.75&#x0025;, 96.81&#x0025;, 95.23&#x0025;, and 92.51&#x0025;, and the CNN, FFT-SVM, and FFT-KNN methods have represented better performance with the accuracy of 89.79&#x0025;, 88.68&#x0025;, 68.41&#x0025; respectively.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Accuracy analysis of IFD-SOIR approach on gearbox dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-5.png"/></fig>
<p>Average accuracy analysis of the IIFD-SOIR model with the existing models is also made. The experimental values stated that the FFT-KNN model has exhibited worse performance with the least average accuracy of 86.353&#x0025;. At the same time, the FFT-SVM model has offered slightly better performance with an average accuracy of 97.956&#x0025;. Followed by, the FFT-DBN, CNN2, and CNN models have appeared moderate and closer average accuracy of 98.271&#x0025;, 98.289&#x0025;, and 98.304&#x0025; respectively. Though the FFT-SAE model has obtained a high average accuracy of 99.231&#x0025;, the proposed IIFD-SOIR model has demonstrated superior performance with an average accuracy of 99.6&#x0025;.</p>
<p><?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Fig. 6</xref> examines the accuracy analysis of various fault classes by the IIFD-SOIR method on the applied Bearing dataset. On the given bearing dataset 1, the IIFD-SOIR, FFT-SVM, FFT-DBN, and FFT-SAE methodologies have gained higher accuracy of 99.82&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; while the FFT-KNN, CNN, and CNN2 methods have showcased moderate function with the accuracy of 99&#x0025;, 99.77&#x0025;, 99.41&#x0025; correspondingly. Similarly, on the applied bearing dataset 2, the IIFD-SOIR, FFT-DBN, FFT-SAE, and FFT-KNN approaches have achieved higher accuracy of 99.10&#x0025;, 98.64&#x0025;, 98.24&#x0025;, and 97.72&#x0025; whereas the FFT-SVM, CNN, and CNN2 methods have exhibited reasonable function with the accuracy of 96.56&#x0025;, 95.87&#x0025;, 93.24&#x0025; respectively. In line with this, on the applied bearing dataset 3, the FFT-SVM, IIFD-SOIR, FFT-SAE, CNN, and CNN2 schemes have attained supreme accuracy of 100&#x0025;, 100&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; while the FFT-DBN and FFT-KNN schemes have illustrated acceptable function with the accuracy of 99.94&#x0025; and 99&#x0025; correspondingly. Meanwhile, on the applied bearing dataset 4, the FFT-SVM, IIFD-SOIR, CNN, and CNN2 technologies have accomplished the best accuracy of 99.57&#x0025;, 99.45&#x0025;, 99.26&#x0025;, and 98.99&#x0025; while the FFT-DBN, FFT-SAE and FFT-KNN approaches have depicted moderate function with the accuracy of 98.79&#x0025;, 98.38&#x0025;, 95.39&#x0025; respectively. Then, on the applied bearing dataset 5, the IIFD-SOIR, CNN, FFT-SVM, and FFT-DBN technologies have attained higher accuracy of 99.81&#x0025;, 99.72&#x0025;, 99.30&#x0025;, and 98.64&#x0025; while the FFT-SAE, CNN2, and FFT-KNN techniques have illustrated considerable performance with the accuracy of 98.23&#x0025;, 97.78&#x0025;, 97.56&#x0025; respectively.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Accuracy analysis of IFD-SOIR approach on bearing dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-6.png"/></fig>
<p>In addition, on the applied bearing dataset 6, the IIFD-SOIR, CNN, CNN2, and FFT-KNN methods have accomplished high accuracy of 99.56&#x0025;, 99.09&#x0025;, 99.10&#x0025;, and 98.53&#x0025; while the FFT-SAE, FFT-DBN, and FFT-SVM frameworks have depicted reasonable performance with the accuracy of 97.32&#x0025;, 97.78&#x0025;, 92.52&#x0025; correspondingly. In addition, on the applied bearing dataset 7, the IIFD-SOIR, FFT-SVM, CNN, and CNN2 methodologies have achieved superior accuracy of 100&#x0025;, 100&#x0025;, 100&#x0025;, and 100&#x0025; while the FFT-DBN, FFT-SAE, and FFT-KNN technologies have represented the least performance with the accuracy of 99.51&#x0025;, 99.43&#x0025;, 98.97&#x0025; respectively. Followed by, on the applied bearing dataset 8, the IIFD-SOIR, CNN, FFT-KNN, and FFT-DBN schemes have obtained higher accuracy of 98.80&#x0025;, 98.20&#x0025;, 95.49&#x0025;, and 95.22&#x0025;, and the FFT-SVM, FFT-SAE, and CNN2 technologies have illustrated minimum performance with the accuracy of 95.31&#x0025;, 95.15&#x0025;, 94.18&#x0025; correspondingly. Moreover, on the applied bearing dataset 9, the FFT-SVM, FFT-SAE, IIFD-SOIR, and CNN schemes have accomplished the best accuracy of 100&#x0025;, 100&#x0025;, 99.96&#x0025;, and 99.94&#x0025; whereas the FFT-DBN, CNN, and FFT-KNN techniques have exhibited considerable function with the accuracy of 99.76&#x0025;, 99.94&#x0025;, 99&#x0025; respectively. Next, on the applied bearing dataset 10, the IIFD-SOIR, CNN, CNN2, and FFT-KNN frameworks have achieved the best accuracy of 99.97&#x0025;, 99.94&#x0025;, 99.94&#x0025;, and 97.61&#x0025; while the FFT-SVM, FFT-DBN, and FFT-SAE methods have depicted lower function with the accuracy of 87.80&#x0025;, 96.19&#x0025;, 95.49&#x0025; respectively.</p>
<p>Average accuracy analysis of the IIFD-SOIR method with the previous approaches is also made. The experimental measures have revealed that the FFT-SVM technique has represented inferior function with the lower average accuracy of 97.106&#x0025;. Simultaneously, the FFT-SVM technique has provided moderate function with an average accuracy of 97.827&#x0025;. Besides, the FFT-DBN, FFT-SAE, and CNN2 methodologies have displayed considerable and closer average accuracy of 98.447&#x0025;, 98.224&#x0025;, and 98.084&#x0025; correspondingly. Although the CNN approach has attained maximum average accuracy of 99.179&#x0025;, the projected IIFD-SOIR framework has depicted a supreme function with an average accuracy of 99.647&#x0025;.</p>
<p><?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref> and <?A3B2 "fig7",5,"anchor"?><?A3B2 "fig8",5,"anchor"?><xref ref-type="fig" rid="fig-7">Figs. 7</xref> and <xref ref-type="fig" rid="fig-8">8</xref> investigate the average accuracy analysis of the IIFD-SOIR model of the training and testing on the applied gearbox and Bearing dataset. On the applied gearbox dataset the FFT-KNN model has achieved the worst performance of an average training and testing accuracy of 90.84&#x0025; and 86.35&#x0025; respectively. Similarly, the FFT-SVM method achieved a moderate function of average training and testing accuracy of 98.58&#x0025; and 97.95&#x0025;, respectively, using a moderate function of average training and testing accuracy. According to this, the CNN2 technique has a higher average training and testing accuracy of 98.87&#x0025; and 98.29&#x0025;, respectively. Next, the CNN framework has obtained a reasonable function of average training and testing accuracy of 99.33&#x0025; and 98.30&#x0025; respectively. Simultaneously, the FFT-DBN framework has obtained moderate performance of average training and testing accuracy of 100&#x0025; and 98.27&#x0025; respectively. At the same time, the FFT-SAE approach has obtained maximum performance of average training and testing accuracy of 100&#x0025; and 99.23&#x0025; respectively. Moreover, the IIFD-SOIR scheme has achieved higher performance of average training and testing accuracy of 100&#x0025; and 99.60&#x0025; respectively.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Average result analysis of training and testing of different methods</title></caption>

<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Methods</th>
<th align="left" colspan="2">Gearbox dataset</th>
<th align="left" colspan="2">Bearing dataset</th>
</tr>
<tr>
<th align="left">Training</th>
<th align="left">Testing</th>
<th align="left">Training</th>
<th align="left">Testing</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">FFT-KNN</td>
<td align="left">90.84</td>
<td align="left">86.35</td>
<td align="left">98.28</td>
<td align="left">97.83</td>
</tr>
<tr>
<td align="left">FFT-SVM</td>
<td align="left">98.58</td>
<td align="left">97.95</td>
<td align="left">98.75</td>
<td align="left">97.11</td>
</tr>
<tr>
<td align="left">FFT-DBN</td>
<td align="left">100</td>
<td align="left">98.27</td>
<td align="left">99.46</td>
<td align="left">98.45</td>
</tr>
<tr>
<td align="left">FFT-SAE</td>
<td align="left">100</td>
<td align="left">99.23</td>
<td align="left">99.11</td>
<td align="left">98.22</td>
</tr>
<tr>
<td align="left">CNN</td>
<td align="left">99.33</td>
<td align="left">98.30</td>
<td align="left">99.61</td>
<td align="left">99.18</td>
</tr>
<tr>
<td align="left">CNN2</td>
<td align="left">98.87</td>
<td align="left">98.29</td>
<td align="left">99.12</td>
<td align="left">98.08</td>
</tr>
<tr>
<td align="left">IIFD-SOIR</td>
<td align="left">100</td>
<td align="left">99.60</td>
<td align="left">99.83</td>
<td align="left">99.65</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>On the applied bearing gearbox dataset the FFT-KNN method has accomplished poor function of an average training and testing accuracy of 98.28&#x0025; and 97.83&#x0025; correspondingly. Likewise, the FFT-SVM approach has attained a moderate function of average training and testing accuracy of 98.75&#x0025; and 97.11&#x0025; respectively. In line with this, the FFT-SAE model has obtained maximum performance of average training and testing accuracy of 99.11&#x0025; and 98.22&#x0025; respectively. Then, the CNN2 technique has accomplished moderate performance of average training and testing accuracy of 99.12&#x0025; and 98.08&#x0025; correspondingly. Meanwhile, the FFT-DBN approach has attained the least function of average training and testing accuracy of 99.46&#x0025; and 98.45&#x0025; respectively. At the same time, the CNN framework has accomplished the maximum function of average training and testing accuracy of 99.61&#x0025; and 99.18&#x0025; respectively. Additionally, the IIFD-SOIR model has achieved optimal performance of average training and testing accuracy of 99.83&#x0025; and 99.65&#x0025; respectively. From the above-mentioned experimental values, it is evident that the IIFD-SOIR model has resulted in effective performance over the compared methods due to the following reasons. The employed IRV2 model achieves a faster training rate with certainly better accuracy over the Inception v4 model. Besides, the parameter tuning of the DL model using the SFO algorithm also plays a vital role in the improved classification performance.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>Average accuracy analysis of IIFD-SOIR model on gearbox dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-7.png"/></fig>
<fig id="fig-8"><label>Figure 8</label><caption><title>Average accuracy analysis of IFD-SOIR model on bearing dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="CMC_21716-fig-8.png"/></fig>
</sec>
</sec>
<sec id="s5"><label>4</label><title>Conclusion</title>
<p>This paper has developed an IIFD-SOIR model to identify faults in rotating machinery. Initially, the data acquisition process takes place to collect the data. Then, the CWTS model is applied to preprocess and crop the vibration signals. Followed by, the SFO algorithm tuned Inception with ResNet v2 model is applied as a feature extractor. The parameter tuning of Inception with the ResNet v2 model takes place using the SFO algorithm. Finally, MLP is applied as a classification model to identify the different kinds of faults. Extensive experimentation takes place to ensure the outcome of the IIFD-SOIR model on the gearbox dataset and a motor bearing dataset. The experimental outcome indicated that the IIFD-SOIR model has reached a higher average accuracy of 99.6&#x0025; and 99.64&#x0025; on the applied gearbox dataset and bearing dataset. The IIFD-SOIR model can be employed as an appropriate tool for diagnosing faults in rotating machienry. In the future, the IIFD-SOIR model can be employed in real-time industries for diagnosis faults.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This research has been funded by Direcci&#x00F3;n General de Investigaciones of Universidad Santiago de Cali under call No. 01-2021. The authors would like to thank Chennai Institute of Technology for providing us with various resources and unconditional support for carrying out this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.</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>H.</given-names> <surname>Shao</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Ying</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>A novel method for intelligent fault diagnosis of rolling bearings using ensemble deep auto-encoders</article-title>,&#x201D; <source>Mechanical Systems and Signal Processing</source>, vol. <volume>102</volume>, pp. <fpage>278</fpage>&#x2013;<lpage>297</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>G.</given-names> <surname>Suryanarayana</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chandran</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Alotaibi</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Alsufyani</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Accurate magnetic resonance image super-resolution using deep networks and Gaussian filtering in the stationary wavelet domain</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>71406</fpage>&#x2013;<lpage>71417</lpage>, <year>2021</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>L.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Gao</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A new convolutional neural network-based data-driven fault diagnosis method. IEEE trans</article-title>,&#x201D; in <source>IEEE Transactions on Industrial Electronics</source>, vol. <volume>65</volume>, no. <issue>7</issue>, pp. <fpage>5990</fpage>&#x2013;<lpage>5998</lpage>, <year>2018</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>G. M.</given-names> <surname>Abdulsahib</surname></string-name> and <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name></person-group>, &#x201C;<article-title>An improved cross-layer proactive congestion in wireless networks</article-title>,&#x201D; <source>International Journal of Advances in Soft Computing and its Applications</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>178</fpage>&#x2013;<lpage>192</lpage>, <year>2021</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>Y.</given-names> <surname>Yu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Yu</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Cheng</surname></string-name></person-group>, &#x201C;<article-title>A roller bearing fault diagnosis method based on EMD energy entropy and ANN</article-title>,&#x201D; <source>Journal of Sound and Vibration</source>, vol. <volume>294</volume>, no. <issue>1&#x2013;2</issue>, pp. <fpage>269</fpage>&#x2013;<lpage>277</lpage>, <year>2006</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>Awan</surname></string-name>, <string-name><given-names>M. S. M.</given-names> <surname>Rahim</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Nobanee</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>U.</given-names> <surname>Ishfaq</surname></string-name></person-group>, &#x201C;<article-title>A big data approach to black Friday sales</article-title>,&#x201D; <source>Intelligent Automation and Soft Computing</source>, vol. <volume>27</volume>, no. <issue>3</issue>, pp. <fpage>785</fpage>&#x2013;<lpage>797</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name></person-group>, &#x201C;<article-title>Urban water resource management for sustainable environment planning using artificial intelligence techniques</article-title>,&#x201D; <source>Environmental Impact Assessment Review</source>, vol. <volume>86</volume>, pp. <fpage>106515</fpage>, <year>2020</year>.</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>W.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Shan</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Zeng</surname></string-name></person-group>, &#x201C;<article-title>Bearing fault identification based on deep belief network</article-title>,&#x201D; <source>Journal of Vibration Engineering</source>, vol. <volume>29</volume>, pp. <fpage>340</fpage>&#x2013;<lpage>347</lpage>, <year>2016</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>S. K.</given-names> <surname>Prasad</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Rachna</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>D. N.</given-names> <surname>Le</surname></string-name></person-group>, &#x201C;<article-title>Map matching algorithim real time location tracking for smart security application</article-title>,&#x201D; <source>Telecommunications and Radio Engineering</source>, vol. <volume>79</volume>, no. <issue>13</issue>, pp. <fpage>1189</fpage>&#x2013;<lpage>1203</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A deep convolutional neural network with new training methods for bearing fault diagnosis under noisy environment and different working load</article-title>,&#x201D; <source>Mechanical Systems and Signal Processing</source>, vol. <volume>100</volume>, pp. <fpage>439</fpage>&#x2013;<lpage>453</lpage>, <year>2018</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>K. A.</given-names> <surname>Ogudo</surname></string-name>, <string-name><given-names>D. M. J.</given-names> <surname>Nestor</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>H. D.</given-names> <surname>Kasmaei</surname></string-name></person-group>, &#x201C;<article-title>A device performance and data analytics concept for smartphones&#x2019; IoT services and machine-type communication in cellular networks</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>11</volume>, no. <issue>4</issue>, pp. <fpage>593</fpage>&#x2013;<lpage>609</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>Y.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Jia</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Du</surname></string-name> <etal>et al.</etal></person-group>,&#x201C;<article-title>Image based fruit category classification by 13-layer deep convolutional neural network and data augmentation</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>78</volume>, pp. <fpage>3613</fpage>&#x2013;<lpage>3632</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>M.</given-names> <surname>Xia</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>C. W.</given-names> <surname>de Silva</surname></string-name></person-group>, &#x201C;<article-title>Fault diagnosis for rotating machinery using multiple sensors and convolutional neural networks</article-title>,&#x201D; in <source>IEEE/ASME Transactions on Mechatronics</source>, vol. <volume>23</volume>, no. <issue>1</issue>, pp. <fpage>101</fpage>&#x2013;<lpage>110</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>G. M.</given-names> <surname>Abdulsaheb</surname></string-name>, <string-name><given-names>G. M.</given-names> <surname>Abdulsahib</surname></string-name> and <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name></person-group>, &#x201C;<article-title>Comparison and evaluation of cloud processing models in cloud-based networks</article-title>,&#x201D; <source>International Journal of Simulation Systems Science and Technology</source>, vol. <volume>19</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>22</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Peng</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Bearings fault diagnosis based on convolutional neural networks with 2-D representation of vibration signals as input</article-title>,&#x201D; in <conf-name>Proc. of the 2016 the 3rd Int. Conf. on Mechatronics and Mechanical Engineering (ICMME 2016)</conf-name>, <conf-loc>Shanghai, China</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2016</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>S.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Gao</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A novel fault diagnosis method for rotating machinery based on a convolutional neural network</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>18</volume>, no. <issue>5</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>16</lpage>, <year>2018</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>Z.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Gryllias</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Mechanical fault diagnosis using convolutional neural networks and extreme learning machine</article-title>,&#x201D; <source>Mechanical Systems and Signal Processing</source>, vol. <volume>133</volume>, pp. <fpage>106272</fpage>&#x2013;<lpage>106284</lpage>, <year>2019</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>X.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Shen</surname></string-name></person-group>, &#x201C;<article-title>Hierarchical adaptive deep convolution neural network and its application to bearing fault diagnosis</article-title>,&#x201D; <source>Measurement: Journal of the International Measurement Confederation</source>, vol. <volume>93</volume>, pp. <fpage>490</fpage>&#x2013;<lpage>502</lpage>, <year>2016</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>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>G. M.</given-names> <surname>Abdulsahib</surname></string-name></person-group>, &#x201C;<article-title>Frequency estimation by the method of minimum mean squared error and P-value distributed in the wireless sensor network</article-title>,&#x201D; <source>Journal of Information Science and Engineering</source>, vol. <volume>35</volume>, no. <issue>5</issue>, pp. <fpage>1099</fpage>&#x2013;<lpage>1112</lpage>, <year>2019</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>R.</given-names> <surname>Saravanakumar</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Krishnaraj</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Venkatraman</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Sivakumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Prasanna</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Hierarchical symbolic analysis and particle swarm optimization based fault diagnosis model for rotating machineries with deep neural networks</article-title>,&#x201D; <source>Measurement</source>, vol. <volume>171</volume>, no. <issue>108771</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Sulaiman</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Abdulsahib</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>M. N.</given-names> <surname>Mohammed</surname></string-name></person-group>, &#x201C;<article-title>Effect of using different propagations of olsr and dsdv routing protocols</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Intelligent Systems Structuring and Simulation</conf-name>, <conf-loc>Liverpool, United Kingdom</conf-loc>, vol. <volume>1</volume>, pp. <fpage>540</fpage>&#x2013;<lpage>545</lpage>, <year>2014</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>S.</given-names> <surname>Sengan</surname></string-name>, <string-name><given-names>P. V.</given-names> <surname>Sagar</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Ramesh</surname></string-name>, <string-name><given-names>O. I.</given-names> <surname>Khalaf</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Dhanapal</surname></string-name></person-group>, &#x201C;<article-title>The optimization of reconfigured real-time datasets for improving classification performance of machine learning algorithms</article-title>,&#x201D; <source>Mathematics in Engineering, Science and Aerospace</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>21</lpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>