<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">12077</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2021.012077</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Mammographic Image Classification Using Deep Neural Network for Computer-Aided Diagnosis</article-title><alt-title alt-title-type="left-running-head">Mammographic Image Classification Using Deep Neural Network for Computer-Aided Diagnosis</alt-title><alt-title alt-title-type="right-running-head">Mammographic Image Classification Using Deep Neural Network for Computer-Aided Diagnosis</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Arputham</surname>
<given-names>Charles</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
<email>maryarputhamcharles1@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>Nagappan</surname>
<given-names>Krishnaraj</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>Russeliah</surname>
<given-names>Lenin Babu</given-names>
</name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western">
<surname>Russeliah</surname>
<given-names>AdalineSuji</given-names>
</name>
<xref ref-type="aff" rid="aff-4">4</xref>
</contrib>
<aff id="aff-1">
<label>1</label><institution>Department of Electronics and Communication Engineering, Government College of Engineering</institution>, <addr-line>Bargur, Tamil Nadu</addr-line>, <country>India</country></aff>
<aff id="aff-2">
<label>2</label><institution>Department of Computer Science and Engineering, SRM Institute of Science and Technology</institution>, <addr-line>Kattankulathur, 603203, Tamil Nadu</addr-line>, <country>India</country></aff>
<aff id="aff-3">
<label>3</label>Data Scientist at ConverSight.ai, <addr-line>Indiana</addr-line>, <country>USA</country></aff>
<aff id="aff-4">
<label>4</label><institution>Department of Computer Science and Engineering, Kalaignar Karunanidhi Institute of Technology</institution>, <addr-line>Coimbatore, Tamil Nadu</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1">&#x002A;Corresponding Author: Charles Arputham. Email: <email>maryarputhamcharles1@gmail.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2020-12-14">
<day>14</day>
<month>12</month>
<year iso-8601-date="2020">2020</year>
</pub-date>
<volume>27</volume>
<issue>3</issue>
<fpage>747</fpage>
<lpage>759</lpage>
<history>
<date date-type="received">
<day>30</day>
<month>8</month>
<year iso-8601-date="2020">2020</year>
</date>
<date date-type="accepted">
<day>15</day>
<month>11</month>
<year iso-8601-date="2020">2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Arputham et al.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Arputham 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_IASC_12077.pdf"></self-uri>
<abstract>
<p>Breast cancer detection is a crucial topic in the healthcare sector. Breast cancer is a major reason for the increased mortality rate in recent years among women, specifically in developed and underdeveloped countries around the world. The incidence rate is less in India than in developed countries, but awareness must be increased. This paper focuses on an efficient deep learning-based diagnosis and classification technique to detect breast cancer from mammograms. The model includes preprocessing, segmentation, feature extraction, and classification. At the initial level, Laplacian filtering is applied to identify the portions of edges in mammogram images that are highly sensitive to noise. Subsequently, segmentation is done using modified adaptively regularized kernel-based fuzzy C means (ARKFCM). Feature extraction is accomplished using the morphological, texture, and moment invariants. The corresponding feature values are provided as inputs to a deep neural network (DNN) model that classifies the normal and abnormal portions in the mammogram images. The performance of the proposed model is validated with the Mammographic Image Analysis Society (MIAS) database. The efficiency of the proposed classifier is experimentally proved by comparing the various classifiers with respect to their statistical performances. On an applied database, the proposed model offered a maximum classification with the highest accuracy level of 99.13%.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Breast cancer</kwd>
<kwd>classification</kwd>
<kwd>feature extraction</kwd>
<kwd>Laplacian filter</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Breast cancer is a widespread disease among women, with a significant increase in its mortality rate. A survey in 2012 found that around 25.2% of women globally were directly affected by breast cancer. An earlier study by the American Cancer Society stated that around 246,660 females and 2,600 males would be identified with persistent breast cancer in 2016 [<xref ref-type="bibr" rid="ref-1">1</xref>]. The study was proved correct, and the number of patients has been increasing rapidly. Therefore, to increase human lifespans, the disease must be predicted at an earlier stage, which would increase the survival rate by up to 90% [<xref ref-type="bibr" rid="ref-2">2</xref>]. Regular monitoring and primary detection are necessary to avoid further adverse developments in breast cancer. There are various methods to detect cancer, including mammography, ultrasound, X-ray, and positron emission tomography (PET). X-ray mammography utilizes lower amounts of X-ray energy to create the pixels of the disease. These images are helpful in early diagnosis. Many reviews have underscored the threat of exposure to radiation [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. Mostly, women at the age of 40 years are observed to face more difficulty during ordinary mammography screening procedures than elderly women. A study on mammogram results stated that 1,212 of 10,000 women showed false positives for breast cancer at the age of 40 years. The injurious impacts of mammography include overtreatment, unwanted and persistent follow-up testing, and stress related to false-positive test results. Moreover, X-ray mammography necessitates the encoding of the breast as it lies flat during the examination process, which causes pain. Distinguishing tumors from mammogram images is a complex process [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>] because of the similar appearances of the cancer and the massive cell growths that appear white in color in the mammogram pixels and the fatty cells that are black in color. In <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, tiny cancer cells are noticeable in the fatty breast; At the same time, the formed breast tissue in the heterogeneous large breasts has a possible 4 cm tumor.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Sample breast cancer image</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<p>Ultrasound employs sound waves to view the internal structure of the body. It has a frequency greater than 20 kHz. A transducer is fixed on the skin; this transmits ultrasound pulses inside the body to detect echoes so as to create ultrasound images. It protects the body from harmful effects of radiation and can differentiate cancerous from non-cancerous tumors. However, ultrasound is used only as an alternative when the results of a mammogram are unclear. The magnetic resonance image (MRI) employs radio waves and robust magnetic fields to produce images of the internal body. This method uses various levels of absorption energy for different kinds of cells. When applied to delicate tissues such as the breast, the contrast liquid is used to generate clear images. The MRI is conventionally used in detection to provide additional estimations of the reasonable findings. It is used prior to surgical procedures, such as breast consuming lumpectomy or mastectomy. Therefore, MRI is effective and adaptable technique for primary tumor detection. PET uses injected combinations of radioactive materials and glucose, which undergoes synthetization inside the human body. This study develops an efficient deep learning-based diagnosis and categorization of breast cancer in mammograms.</p>
<p>The proposed model has four levels: Preprocessing, segmentation, feature extraction, and classification. Laplacian filtering is applied in the initial level to identify portions of the edges in the mammogram images. Segmentation takes place with the help of modified adaptively regularized kernel-based Fuzzy-C-means (ARKFCM), an effective machine learning (ML) process that localizes objects in a complicated template. The corresponding feature values are provided as inputs to a classification model, a deep neural network (DNN) that classifies normal and abnormal regions in mammogram images. The MIAS database is employed to evaluate the effectiveness of the proposed machine diagnostic system.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Survey</title>
<p>Techniques for the auto-prediction of clusters of mammary calcifications have been discussed in the literature. In classification, the spatial features of these lesions were considered. Taking into account the appearance of breast microcalcification (MC) as a local high-intensity variable, this study developed a method focused on the application of an effective mammogram threshold function, which was subsequently used for the regular extraction of lesions. Netsch et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] proposed an alternate scheme for detecting the MC pipeline with multiple resolutions, and an alternate machine learning technique was deployed for predicting the micro-calcifications on the basis of the Laplacian scale-space. The application of SVM to design a detection algorithm was also investigated [<xref ref-type="bibr" rid="ref-6">6</xref>]. In a few scenarios, these models were found to attain the best sensitivity levels. For example, a method achieved sensitivity of up to 94%, although some methods suffered from problems of false-positives [<xref ref-type="bibr" rid="ref-7">7</xref>]. It is a disadvantage of the direct impact of greater heterogeneity in breast cells that should be considered in order to minimize the lack of true positive in multiple mammograms.</p>
<p>A deeper local search algorithm for parameterized and approximation-based algorithms was developed [<xref ref-type="bibr" rid="ref-8">8</xref>]. A method using a convolutional neural network (CNN) and an extreme learning machine (ELM) model was presented for ECG analysis [<xref ref-type="bibr" rid="ref-9">9</xref>]. Two efficient lightweight networks were presented to attain the maximum traffic sign detection rates with the minimum number of trainable model parameters [<xref ref-type="bibr" rid="ref-10">10</xref>]. A new model to concatenate transfer edges was presented [<xref ref-type="bibr" rid="ref-11">11</xref>]. The character interval allowed for the representation of successive characters to minimize transfer edge counts. A model-based grammatical evolution (MGE) [<xref ref-type="bibr" rid="ref-12">12</xref>] was based on the terms and conditions of previous grammar models (a finite state transition system). The features and issues of finite state automata were investigated to enhance non-deterministic finite automata by minimizing a conversion edge to reduce memory utilization [<xref ref-type="bibr" rid="ref-13">13</xref>]. Two Dense-MobileNet models, Dense1-MobileNet and Dense2-MobileNet, were developed to eliminate the parameter count and limit computational complexity [<xref ref-type="bibr" rid="ref-14">14</xref>]. Real-time images searched for and obtained online were segmented, where feature extraction was accomplished by the DenseNet architecture [<xref ref-type="bibr" rid="ref-15">15</xref>]. A continuous object tracking scheme based on the spatial and conventional features of a CNN was investigated [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>Minimization of tracking effects due to changes in the scale ratio was discussed [<xref ref-type="bibr" rid="ref-17">17</xref>]. The HPCA algorithm was used to extract features and reduce dimensionality-based issues. Zhao et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] investigated the methods of enhancing packet classification accuracy in software, specifically in the OpenFlow protocol in software-defined networking (SDN). The packet classification algorithm used in this research exhibits a more effective performance than the other approaches. A face image method combining a Gabor filter, local binary pattern, and local phase quantization was proposed [<xref ref-type="bibr" rid="ref-19">19</xref>]. As a result of the inherent drawbacks in classical approaches, recent research has stressed nonlinear approaches based on the CNN. These tools have been found useful in the elimination of handcrafted characteristics, generation of autofeature extractions, and evaluation. CNN architecture has achieved state-of-the-art performance using individual studies employing deep learning [<xref ref-type="bibr" rid="ref-20">20</xref>]. Later, Wang et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] designed the mammogram analysis as a bipartite pattern describing a methodology for detecting the MC that contains 2sub networks. The first network performs on the local image windows, and the second network connects the image background. These networks filtered the features from the mammograms simultaneously and provided the requirements collectively in a completely distributed and linked layer for classifying the instance window with or without the MC.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows a block diagram of the presented model, whose procedures are explained below.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Overall process of proposed model</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Preprocessing</title>
<p>The MIAS database is employed to evaluate the effectiveness of a machine diagnostic system. This benchmark database is easily accessed for all types of studies. Once the mammogram images are acquired, the Laplacian filter can be utilized for preprocessing due to its simplicity and ability to eliminate noise. This is a smoothing operator that can transform noisy images to noiseless images; hence, there is a chance to directly obtain objects from raw mammogram images. It plays a significant role in detecting the boundaries of obtained images. The Laplacian formula is</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>X</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msup></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p>where i denotes the horizontal axis, j indicates the vertical axis, and &#x03C3; is the standard deviation.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Image Segmentation</title>
<p>Segmentation is performed on preprocessed images obtained from mammograms. An efficient model based on ARKFCM is used to portion cancerous and non-cancerous parts of mammogram breast images. ARKFCM is stronger in collecting the parameters used to decrease operational charges; hence, it provides extended decisions for the overlapping database. An altered ARKFCM scheme deploys and employs differences in the grayscales with respect to neighborhood factors to estimate the local contextual data. These modified models comprise Euclidean distances appropriately replaced by the correlating operation. The common template for the modified ARKFCM technique is represented as</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mo>&#x2211;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>k</mml:mi><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>c</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</alternatives></disp-formula></p>
<p>where G<sub>xy</sub> represents the changed fuzzy factor, <inline-formula id="ieqn-1">
<alternatives><inline-graphic xlink:href="ieqn-1.png"/>
<mml:math id="mml-ieqn-1"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">w</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">x</mml:mi><mml:mi mathvariant="normal">K</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math>
</alternatives></inline-formula> is the fuzzy factor of i, C is the correlation function, m is a weight exponent of the regularization corresponding to the degree of fuzziness, u<sub>xy</sub> is the membership value for each pixel x in the y<sup>th</sup> cluster, and 1-C(i<sub>x</sub>-v<sub>y</sub>) is the correlation metric function.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Determination of Wavelet Coefficients Using DWT</title>
<p>Segmented mammogram images are used in calculations concerning wavelet coefficients with the help of DWT. By applying a square-shaped function will assist in the creation of a family of wavelets. It utilizes a fuzzy denoising rule that offers shifting sub-bands, extended directional sensitivities, and lower redundancies. The multiresolution procedure estimates the original texture of the mammogram using the zoom in and zoom out patterns. The first step is to decompose the image into sub-images, so as to preserve both the lower- and higher-frequency levels. This property helps DWT to extract texture-based data. The square integrable function f(i), the corresponding wavelet transform that is organized as an inner product f and a real-valued function &#x03C8;(i), is</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>
<mml:math id="mml-eqn-3" display="block"><mml:mi>w</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:msubsup><mml:mrow><mml:mo largeop="false">&#x222B;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msubsup><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo></mml:math>
</alternatives></disp-formula></p>
<p>where<inline-formula id="ieqn-2">
<alternatives><inline-graphic xlink:href="ieqn-2.png"/>
<mml:math id="mml-ieqn-2"><mml:mspace width="thickmathspace"></mml:mspace><mml:msubsup><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msqrt><mml:mi>s</mml:mi><mml:msubsup><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>s</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</alternatives></inline-formula> represents the wavelet family, and s &#x03B5; t, &#x03C4;, and k &#x03B5; {h,v,d}, respectively, represent the scale, orientation parameters, and translation. Orientation parameters <inline-formula id="ieqn-3">
<alternatives><inline-graphic xlink:href="ieqn-3.png"/>
<mml:math id="mml-ieqn-3"><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow></mml:math>
</alternatives></inline-formula>v, d, and h denote the vertical, diagonal, and horizontal directions, respectively. Dyadic wavelet decomposition can be reached when <inline-formula id="ieqn-4">
<alternatives><inline-graphic xlink:href="ieqn-4.png"/>
<mml:math id="mml-ieqn-4"><mml:mrow><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</alternatives></inline-formula> and &#x03C4; &#x003D; 2x, n, y, n. The subsequent wavelet decomposition applies dyadic wavelets executed by the employment of an accurate reconstruction filter bank. Based on the wavelet function &#x03C8;(i) and scaling function (i), the wavelet and scaling family can be formed as</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>
<mml:math id="mml-eqn-4" display="block"><mml:msubsup><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">y</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>y</mml:mi></mml:msup></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>y</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/>
<mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">y</mml:mi><mml:mi mathvariant="normal">Y</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>y</mml:mi></mml:msup></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>y</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p>Orthonormal-based subspaces are relevant to the resolution 2<sup>y</sup>. Wavelet atoms are organized by scaling and three parental atoms: &#x03C8;<sup>h</sup>, &#x03C8;<sup>v</sup>, and &#x03C8;<sup>d</sup>. These mother atoms are validated as a tensor product of the 1D &#x03C8;(i) and (i):</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x03C6;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mi>d</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mi mathvariant="normal">&#x03A8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math>
</alternatives></disp-formula></p>
<p>Digital filter banks consist of low-pass (h) and high-pass (<italic>g</italic>) filters. The organization of the wavelet comprises of a number of filter, categorized based on the resolution. In case of 2-dimensional images, DWT is processed with the help of independent wavelet functions. The vertical and horizontal mammogram images are single in nature, they are operated in a dimensional wavelet transform for establishing a two-dimensional wavelet coefficient. The actual mammogram image A<sub>2y&#x002B;1</sub>, with resolution of 2<sup>y&#x002B;1</sup>, is decompressed as a four-sub-band image in the frequency domain. Between these sub-bands, only three images, <inline-formula id="ieqn-5">
<alternatives><inline-graphic xlink:href="ieqn-5.png"/>
<mml:math id="mml-ieqn-5"><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow></mml:math>
</alternatives></inline-formula>, represent the mammogram images at a resolution of 2<sup>y</sup> in the horizontal, vertical, and diagonal directions, respectively. Followed by an approximation image, A<sub>2</sub>yf is identified in the coarse resolution; hence, the entire mammogram image A<sub>2</sub>y&#x002B;1 is represented as</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mi>y</mml:mi><mml:mo>&#x002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">D</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msubsup><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>y</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo>.</mml:mo></mml:math>
</alternatives></disp-formula></p>
<p>The decomposed mammogram sub-image is observed as a 2D orthogonal wavelet presentation. Simulation of the decomposing wavelets in a mammogram image results in four orthogonal sub-bands, low-high (LH), low-low (LL), high-high (HH), and high-low (HL), corresponding to the sub-images <inline-formula id="ieqn-6">
<alternatives><inline-graphic xlink:href="ieqn-6.png"/>
<mml:math id="mml-ieqn-6"><mml:msubsup><mml:mi>D</mml:mi><mml:mn>2</mml:mn><mml:mi>h</mml:mi></mml:msubsup><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mn>2</mml:mn><mml:mi>v</mml:mi></mml:msubsup><mml:mi>f</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>x</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mi>d</mml:mi></mml:msubsup><mml:mi>f</mml:mi></mml:math>
</alternatives></inline-formula>, and A<sub>2</sub>yf, respectively.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Feature Extraction</title>
<p>It offers an effective outcome in Computer Aided Diagnosis (CAD) quality. Feature extraction determines the parameters that are to be separated among the ROI features [<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>Morphological Features</title>
<p>Morphological features are noticeable by humans, and straight features can be described only by radiologists. These are meant to handle various types of shapes. Since the MCC morphology with respect to the physical shape determines the existence of ROI, it is important for the presented diagnostic model to identify morphological organizations that can remain invisible.</p>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>Moment Invariant</title>
<p>Moment variants have been used as features for processing images, which is done by calculating the seven invariant moments based on the rotation of the images. Moment invariants &#x03D5;x, 1&#x2264; X&#x2264; 7, are helpful in performing tasks such as image scaling and rotating mechanisms. It is validated across the structure of the boundary and the inner region. The main objective of feature selection is to reduce the number of features by deleting the predicted information. In this research, the Fisher score is used to decrease the characteristics and increase accurate detections. Consequently, classification is the final stage in the CAD system and is used to select the important features, which are used to classify abnormal lesions into cancerous and non-cancerous types. The classification models utilized to recognize the classes of images are KNN, ANN, and SVM. In this work, automatic and conventional schemes of ANN are projected. A different model of SVM is developed to classify results with the help of quadratic, linear, and radial basis function (RBF) kernels.</p>
</sec>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>DNN-Based Classification</title>
<p>Once the feature extraction is completed, classification commences on the feature vectors. The classification process is described as a boundary among the various classes with respect to the measured characteristics. In such a case, the DNN classification process will have undergone classification of usual and unusual mammogram images, such as benign and malignant types [<xref ref-type="bibr" rid="ref-23">23</xref>]. In the absence of sharing data, DNN must be considered for classification procedures. Data flow from the input layer to the output layer can be witnessed during the absence of the looping function. The DNN classification model assists in the execution of the dividing operation whenever the probability of a missing value is lower. The DNN model permits the implementation of a single layer at an unsupervised pretraining level. It allocates a classification score f(i) at the time of prediction. All input data samples i &#x003D; [i<sub>1</sub>, &#x2026;&#x2026;..i<sub>N</sub>] are observed as a forward pass. Normally, f is the function, which includes a sequence of layers for computing (T<sub>xy</sub>):</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">X</mml:mi></mml:mrow><mml:mi>x</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">W</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>;</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>x</mml:mi></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x002B;</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math>
</alternatives></disp-formula></p>
<p>where the input of the layer is represented is defined as i<sub>x</sub>, the output layer is i<sub>y</sub>, w<sub>xy</sub> represents the model parameters, and g(T<sub>y</sub>) realizes the matching function. Layer-wise propagation decomposes the classification process output f(i) by means of the relevance&#x2019;s r<sub>x</sub> attribute for all the input element i<sub>x</sub> that involves in the classification decision is defined as</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/>
<mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p>where r<sub>y</sub> &#x003E; 0 denotes positive evidence that supports the classifying solution, and r<sub>x</sub> &#x003C; 0 is negative evidence; otherwise, it is termed neutral evidence, although the relevant attribute r<sub>x</sub> is validated as</p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-11.png"/>
<mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:msub></mml:mrow><mml:mo>&#x003D;</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>y</mml:mi></mml:msub><mml:mstyle scriptlevel="0" displaystyle="true"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>x</mml:mi></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>.</mml:mo></mml:mstyle></mml:math>
</alternatives></disp-formula></p>
<p>The general structure of the DNN is portrayed in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The DNN has the capability of investigating the unknown characteristics of the coherent inputs. It offers a hierarchical feature training model. A maximum level of features is retrieved from the lower-level features using greedy layer-wise unsupervised pretraining information. The main objective of the DNN is to manage the difficult operations that can be represented in a higher-level abstraction.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>DNN architecture</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Performance validation</title>
<p>Experiments were conducted using the freely available MIAS dataset (<uri xlink:href="http://www.mammoimage.org/databases/">http://www.mammoimage.org/databases/</uri>). Experimental results were analyzed using a set of performance measures consisting of sensitivity, specificity, accuracy, and F-score. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the sample original mammogram images and the preprocessed images. The figure clearly shows that the images were properly preprocessed for discarding unwanted details.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>(a) (c) Original, (b) (d) Pre-processed images</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the sample preprocessed mammogram images along with the segmented images. From the figure, it is clear that the images were properly segmented.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>(a) (c) Pre-processed mammogram image, (b) (d) Segmented image</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-5.png"/>
</fig>
<sec id="s4_1">
<label>4.1</label>
<title>Results Analysis on Normal and Abnormality Classification</title>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> shows the classifier results under various features with respect to the performance measures. <xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the accuracy analysis of the various models. In the presence of the energy features, the NN classifier offers poor classification of concerned features and attains the lowest accuracy level of 58.80% and F-score of 50.69%. The NB model achieves an accuracy level of 92.20% and F-score of 92.16%. The SVM model exhibits moderate classification, with an accuracy level of 92.40% and F-score of 93.06%. The DNN model provides effective classification, attaining the best accuracy level of 93.80% and F-score of 93.50%. In the presence of the homogeneity feature, the NN classifier offers poor classification, attaining the lowest accuracy level of 58.80% and an F-score of 37.12%. The SVM model exhibits better results, with an accuracy level of 94.40% and F-score of 94.91%. The NB model shows moderate classification, with an accuracy level of 97.40% and F-score of 97.42%. The DNN model shows effective classification, with the best accuracy level of 97.80% and F-score of 97.85%.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of the diverse models under the Normal &#x0026; the Abnormal Classifications</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Features</th>
<th>Model</th>
<th>Accu. (%)</th>
<th>Sens. (%)</th>
<th>Spec. (%)</th>
<th>F-score (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="3">Energy</td>
<td>NN</td>
<td>58.8</td>
<td>96.8</td>
<td>59.2</td>
<td>50.69</td>
</tr>
<tr>
<td>SVM</td>
<td>92.40</td>
<td>85.20</td>
<td>99.60</td>
<td>93.06</td>
</tr>
<tr>
<td>NB</td>
<td>92.20</td>
<td>92.40</td>
<td>92.00</td>
<td>92.16</td>
</tr><tr>
<td/>
<td>DNN</td>
<td>93.8</td>
<td>96.8</td>
<td>90.8</td>
<td>93.5</td>
</tr>
<tr>
<td rowspan="4">Homogeneity</td>
<td>NN</td>
<td>55.8</td>
<td>97.6</td>
<td>44.8</td>
<td>37.12</td>
</tr>
<tr>
<td>SVM</td>
<td>94.40</td>
<td>88.80</td>
<td>97.04</td>
<td>94.91</td>
</tr>
<tr>
<td>NB</td>
<td>97.40</td>
<td>97.20</td>
<td>97.60</td>
<td>97.42</td>
</tr>
<tr>
<td>DNN</td>
<td>97.8</td>
<td>97.6</td>
<td>99.04</td>
<td>97.85</td>
</tr>
<tr>
<td rowspan="3">HOG</td>
<td>NN</td>
<td>48.4</td>
<td>88.4</td>
<td>61.6</td>
<td>51.51</td>
</tr>
<tr>
<td>SVM</td>
<td>72.60</td>
<td>80.80</td>
<td>64.40</td>
<td>69.70</td>
</tr>
<tr>
<td>NB</td>
<td>71.60</td>
<td>78.00</td>
<td>65.20</td>
<td>69.28</td>
</tr><tr>
<td/>
<td>DNN</td>
<td>92.4</td>
<td>88.4</td>
<td>96.4</td>
<td>92.74</td>
</tr>
<tr>
<td rowspan="4">Hybrid features</td>
<td>NN</td>
<td>42.8</td>
<td>97.6</td>
<td>45.2</td>
<td>39.1</td>
</tr>
<tr>
<td>SVM</td>
<td>98.00</td>
<td>96.00</td>
<td>100</td>
<td>98.11</td>
</tr>
<tr>
<td>NB</td>
<td>96.60</td>
<td>97.60</td>
<td>95.60</td>
<td>96.49</td>
</tr>
<tr>
<td>DNN</td>
<td>98.8</td>
<td>97.6</td>
<td>100</td>
<td>98.85</td>
</tr>
<tr>
<td>Proposed</td>
<td>DNN</td>
<td>99.13</td>
<td>98.06</td>
<td>100</td>
<td>99.15</td>
</tr>
</tbody>
</table></table-wrap>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Accuracy analysis under various features of the normal and the abnormal classifications</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-6.png"/>
</fig>
<p>With the HOG feature, the NN classifier offers poor classification, with the lowest accuracy level of 48.40% and F-score of 51.51%. The NB model achieves somewhat better results, with accuracy of 71.60% and an F-score of 69.28%. The SVM model shows moderate classification, with accuracy of 72.60% and an F-score of 69.70%. The DNN model provides effective classification, with the best accuracy level, 92.40%, and an F-score of 92.74%. With hybrid features, the NN classifier offers poor classification, with an accuracy level of 42.80% and F-score of 39.10%. Next is the NB model with an accuracy level of 96.60% and F-score of 96.49%. The SVM model shows moderate classification, with accuracy of 98.00% and F-score of 98.11%. The DNN model provides effective classification, with the best accuracy level, 98.80%, and an F-score of 98.85%. With the proposed features, the DNN classification model achieves the best accuracy level, 99.13%, and an F-score of 99.15%.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Result Analysis on Malignant and Benign Classification</title>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> shows the classifier results with respect to the malignant and benign classifications under various measures. <xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the accuracy analysis of the various models. Under the presence of an energy feature, the NB classifier offers poor classification, with the lowest accuracy level, 50.20%, and an F-score of 55.81%. The NN model achieves somewhat better results, with an accuracy level of 51.40% and F-score of 42.60%. The SVM model shows moderate classification, with an accuracy level of 54.20% and F-score of 44.95%. DNN provides effective classification, with the best accuracy level, 58.80%, and F-score of 59.25%.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Comparative analysis of the diverse models under the Benign and the Malignant Classifications</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Features</th>
<th>Classifiers</th>
<th>Accu. (%)</th>
<th>Sens. (%)</th>
<th>Spec. (%)</th>
<th>F-score (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="4">Energy</td>
<td>NN</td>
<td>51.4</td>
<td>56.8</td>
<td>56.4</td>
<td>42.6</td>
</tr>
<tr>
<td>SVM</td>
<td>54.20</td>
<td>69.90</td>
<td>38.80</td>
<td>44.95</td>
</tr>
<tr>
<td>NB</td>
<td>50.20</td>
<td>26.40</td>
<td>74.00</td>
<td>55.81</td>
</tr>
<tr>
<td>DNN</td>
<td>58.8</td>
<td>56.8</td>
<td>60.8</td>
<td>59.25</td>
</tr>
<tr>
<td rowspan="4">Homogeneity</td>
<td>NN</td>
<td>49.2</td>
<td>54.4</td>
<td>39.2</td>
<td>30.81</td>
</tr>
<tr>
<td>SVM</td>
<td>52.20</td>
<td>37.60</td>
<td>66.80</td>
<td>53.86</td>
</tr>
<tr>
<td>NB</td>
<td>52.00</td>
<td>32.00</td>
<td>72.00</td>
<td>56.24</td>
</tr>
<tr>
<td>DNN</td>
<td>56.8</td>
<td>54.4</td>
<td>59.2</td>
<td>57.51</td>
</tr>
<tr>
<td rowspan="4">HOG</td>
<td>NN</td>
<td>49.0</td>
<td>38.4</td>
<td>53.6</td>
<td>39.67</td>
</tr>
<tr>
<td>SVM</td>
<td>45.20</td>
<td>57.60</td>
<td>32.80</td>
<td>32.06</td>
</tr>
<tr>
<td>NB</td>
<td>42.60</td>
<td>38.00</td>
<td>47.20</td>
<td>42.37</td>
</tr>
<tr>
<td>DNN</td>
<td>47.0</td>
<td>38.4</td>
<td>55.6</td>
<td>50.16</td>
</tr>
<tr>
<td rowspan="4">Hybrid</td>
<td>NN</td>
<td>52.0</td>
<td>58.4</td>
<td>64.4</td>
<td>52.4</td>
</tr>
<tr>
<td>SVM</td>
<td>53.20</td>
<td>58.00</td>
<td>48.40</td>
<td>48.75</td>
</tr>
<tr>
<td>NB</td>
<td>47.60</td>
<td>28.00</td>
<td>67.20</td>
<td>51.95</td>
</tr>
<tr>
<td>DNN</td>
<td>59.60</td>
<td>58.40</td>
<td>60.80</td>
<td>59.61</td>
</tr>
<tr>
<td>Proposed</td>
<td>DNN</td>
<td>86.90</td>
<td>84.30</td>
<td>87.23</td>
<td>87.12</td>
</tr>
</tbody>
</table></table-wrap>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Accuracy analysis under various features of the benign and the malignant classifications</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-7.png"/>
</fig>
<p>In the presence of a homogeneity feature, the NN classifier offers poor classification, with 49.20% accuracy, and an F-score of 30.81%. The NB model is somewhat better, with an accuracy level of 52.00% and F-score of 56.24%. The SVM model exhibits moderate classification at an accuracy level of 52.20%, with an F-score of 53.86%. The DNN model provides effective classification with the best accuracy level, 56.80%, and an F-score of 57.51%.</p>
<p>In the presence of the HOG feature, the NB classifier offers poor classification, with an accuracy level of 42.60%, and an F-score of 42.37%. The SVM model is somewhat better, with an accuracy level of 45.20% and F-score of 32.06%. The DNN model shows moderate classification, with an accuracy of 47.00% and F-score of 50.16%. The NN model demonstrates effective classification, with the best accuracy, 49.00%, and an F-score of 39.67%.</p>
<p>In the presence of the hybrid features, the NB classifier offers poor classification, with the lowest accuracy level, 47.60%, and an F-score of 51.95%. The NN model achieves better results, with an accuracy level of 52.00% and an F-score of 52.40%. The SVM model exhibits moderate classification, with an accuracy level of 53.20% and F-score of 48.75%. The proposed DNN model provides a maximum accuracy of 86.90% and anF score of 87.12%.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Comparison with Recently Proposed Methods</title>
<p>To further assess the performance of the proposed model, a comparative analysis with recently presented techniques was performed, with results as shown in <xref ref-type="table" rid="table-3">Tab. 3</xref> and <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. From the table, it is seen that the poorest results were realized by the weighted association rule-based classifier, with accuracy of 89.68%. NN achieved better results, with an accuracy level of 95.98%. The SVM model had manageable results, with an accuracy level of 96%. The modified ARKFCM-DNN performed competitively, with an accuracy level of 98.80%.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Accuracy analysis with recently proposed methods</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-8.png"/>
</fig>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison of presented model with state of art methods</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Classification approach</th>
<th>Accuracy (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td>NN</td>
<td>95.98%</td>
</tr>
<tr>
<td>SVM</td>
<td>96%</td>
</tr>
<tr>
<td>RBFNN</td>
<td>93.98%</td>
</tr>
<tr>
<td>Weighted association rule based classifier</td>
<td>89.685%</td>
</tr>
<tr>
<td>Modified ARKFCM-DNN</td>
<td>98.80%</td>
</tr>
<tr>
<td>Proposed</td>
<td>99.13%</td>
</tr>
</tbody>
</table></table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>We developed an efficient DL-based diagnosis and categorization technique to identify breast cancer in mammograms. The model has the four levels of preprocessing, segmentation, feature extraction, and classification. At the initial level, Laplacian filtering is applied to identify portions of the edges in mammogram images that are highly sensitive to noise factors. Subsequently, segmentation takes place with the help of the modified ARKFCM. Corresponding feature values are provided as inputs to a DNN classification model, which perfectly classifies normal and abnormal regions in mammogram images. The MIAS database was employed to evaluate the effectiveness of the proposed machine diagnostic system. On the applied database, the presented model offered the best classification of the concerned features, with an accuracy level of 99.13%. The model can be implemented in real-time scenarios.</p>
</sec>
</body>
<back>
<ack>
<p>We thank LetPub (<uri xlink:href="https://www.letpub.com">www.letpub.com</uri>) for its linguistic assistance during the preparation of this manuscript.</p>
</ack><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The author(s) declares that no specific funding received for this research work.</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="other">
<person-group person-group-type="author">
<collab>A. C. Society</collab>
</person-group>, 
<article-title>&#x201C;Cancer facts &#x0026; figures&#x201D;, The Society</article-title>. 
<publisher-loc>New York, NY, USA</publisher-loc>, 
<year iso-8601-date="2016">2016</year>. [Online]. Available: <uri>https://commed.vcu.edu/Chronic_Disease/Cancers/2017/CASocF&#x0026;F2016.pdf</uri>.</mixed-citation>
</ref>
<ref id="ref-2">
<label>[2]</label><mixed-citation publication-type="other">
<person-group person-group-type="author">
<collab>K. B. C. Society</collab>
</person-group>, 
<article-title>Breast Cancer Facts &#x0026; Figures 2014</article-title>. 
<comment>Korean Breast Cancer Society, Seoul, South Korea</comment>, 
<year iso-8601-date="2014">2014</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. L.</given-names> 
<surname>Humphrey</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Helfand</surname></string-name>, <string-name>
<given-names>B. K. S.</given-names> 
<surname>Chan</surname></string-name> and <string-name>
<given-names>S. H.</given-names> 
<surname>Woolf</surname></string-name>
</person-group>, &#x201C;
<article-title>Breast cancer screening: A summary of the evidence for the U.S. Preventive Services Task Force</article-title>,&#x201D; 
<source>Annals of Internal Medicine</source>, vol. 
<volume>137</volume>, no. 
<issue>5</issue>, pp. 
<fpage>347</fpage>&#x2013;
<lpage>360</lpage>, 
<year iso-8601-date="2002">2002</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>A. L.</given-names> 
<surname>Siu</surname></string-name>
</person-group>, &#x201C;
<article-title>Screening for breast cancer: U.S. Preventive services task force recommendation statement</article-title>,&#x201D; 
<source>Annals of Internal Medicine</source>, vol. 
<volume>164</volume>, no. 
<issue>4</issue>, pp. 
<fpage>279</fpage>&#x2013;
<lpage>296</lpage>, 
<year iso-8601-date="2016">2016</year>.</mixed-citation>
</ref>
<ref id="ref-5">
<label>[5]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>T.</given-names> 
<surname>Netsch</surname></string-name> and <string-name>
<given-names>H. O.</given-names> 
<surname>Peitgen</surname></string-name>
</person-group>, &#x201C;
<article-title>Scale-space signatures for the detection of clustered microcalcifications in digital mammograms</article-title>,&#x201D; 
<source>IEEE Transactions on Medical Imaging</source>, vol. 
<volume>18</volume>, no. 
<issue>9</issue>, pp. 
<fpage>774</fpage>&#x2013;
<lpage>786</lpage>, 
<year iso-8601-date="1999">1999</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>I.</given-names> 
<surname>El-Naqa</surname></string-name>, <string-name>
<given-names>Y.</given-names> 
<surname>Yongyi</surname></string-name>, <string-name>
<given-names>M. N.</given-names> 
<surname>Wernick</surname></string-name>, <string-name>
<given-names>N. P.</given-names> 
<surname>Galatsanos</surname></string-name> and <string-name>
<given-names>R. M.</given-names> 
<surname>Nishikawa</surname></string-name>
</person-group>, &#x201C;
<article-title>A support vector machine approach for detection of microcalcifications</article-title>,&#x201D; 
<source>IEEE Transactions on Medical Imaging</source>, vol. 
<volume>21</volume>, no. 
<issue>12</issue>, pp. 
<fpage>1552</fpage>&#x2013;
<lpage>1563</lpage>, 
<year iso-8601-date="2002">2002</year>.</mixed-citation>
</ref>
<ref id="ref-7">
<label>[7]</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>J. J.</given-names> 
<surname>Mordang</surname></string-name>, <string-name>
<given-names>T.</given-names> 
<surname>Janssen</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Bria</surname></string-name>, <string-name>
<given-names>T.</given-names> 
<surname>Kooi</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Gubern-M&#x00E9;rida</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Automatic microcalcification detection in multi-vendor mammography using convolutional neural networks</article-title>,&#x201D; in <conf-name>Proc. of the Int. Workshop on Digital Mammography</conf-name>, 
<publisher-loc>Malm&#x00F6;, Sweden</publisher-loc>, 
<publisher-name>Springer</publisher-name>, pp. 
<fpage>35</fpage>&#x2013;
<lpage>42</lpage>, 
<year iso-8601-date="2016">2016</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>J.</given-names> 
<surname>Li</surname></string-name>, <string-name>
<given-names>Y. X.</given-names> 
<surname>Cao</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Chen</surname></string-name> and <string-name>
<given-names>J. X.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree</article-title>,&#x201D; 
<source>Information and Computation</source>, vol. 
<volume>252</volume>, pp. 
<fpage>187</fpage>&#x2013;
<lpage>200</lpage>, 
<year iso-8601-date="2017">2017</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>R.</given-names> 
<surname>Zhou</surname></string-name> and <string-name>
<given-names>B.</given-names> 
<surname>Tan</surname></string-name>
</person-group>, &#x201C;
<article-title>Electrocardiogram soft computing using hybrid deep learning CNN-ELM</article-title>,&#x201D; 
<source>Applied Soft Computing</source>, vol. 
<volume>86</volume>, 
<fpage>105778</fpage>, 
<year iso-8601-date="2020">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>M.</given-names> 
<surname>Zhang</surname></string-name>, <string-name>
<given-names>W.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>C. Q.</given-names> 
<surname>Lu</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>A. K.</given-names> 
<surname>Sangaiah</surname></string-name>
</person-group>, &#x201C;
<article-title>Lightweight deep network for traffic sign classification</article-title>,&#x201D; 
<source>Annals of Telecommunications</source>, vol. 
<volume>75</volume>, no. 
<issue>7&#x2013;8</issue>, pp. 
<fpage>369</fpage>&#x2013;
<lpage>379</lpage>, 
<year iso-8601-date="2019">2019</year>.</mixed-citation>
</ref>
<ref id="ref-11">
<label>[11]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Sun</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Shi</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Yin</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>An improved method in deep packet inspection based on regular expression</article-title>,&#x201D; 
<source>Journal of Supercomputing</source>, vol. 
<volume>75</volume>, no. 
<issue>6</issue>, pp. 
<fpage>3317</fpage>&#x2013;
<lpage>3333</lpage>, 
<year iso-8601-date="2019">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>P.</given-names> 
<surname>He</surname></string-name>, <string-name>
<given-names>Z.</given-names> 
<surname>Deng</surname></string-name>, <string-name>
<given-names>C.</given-names> 
<surname>Gao</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Li</surname></string-name>
</person-group>, &#x201C;
<article-title>Model approach to grammatical evolution: Deep-structured analyzing of model and representation</article-title>,&#x201D; 
<source>Soft Computing</source>, vol. 
<volume>21</volume>, no. 
<issue>18</issue>, pp. 
<fpage>5413</fpage>&#x2013;
<lpage>5423</lpage>, 
<year iso-8601-date="2017">2017</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>Y.</given-names> 
<surname>Yin</surname></string-name>, <string-name>
<given-names>H. Y.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Yin</surname></string-name>, <string-name>
<given-names>R. X.</given-names> 
<surname>Sun</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Improved deep packet inspection in data stream detection</article-title>,&#x201D; 
<source>Journal of Supercomputing</source>, vol. 
<volume>75</volume>, no. 
<issue>8</issue>, pp. 
<fpage>4295</fpage>&#x2013;
<lpage>4308</lpage>, 
<year iso-8601-date="2019">2019</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>W.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>Y. T.</given-names> 
<surname>Li</surname></string-name>, <string-name>
<given-names>T.</given-names> 
<surname>Zou</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>J. Y.</given-names> 
<surname>You</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>A novel image classification approach via Dense-MobileNet models</article-title>,&#x201D; 
<source>Mobile Information Systems</source>, vol. 2020, no.7602384, pp. 1&#x2013;8, 
<year iso-8601-date="2020">2020</year>.</mixed-citation>
</ref>
<ref id="ref-15">
<label>[15]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>Y.</given-names> 
<surname>Luo</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Qin</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Xiang</surname></string-name>, <string-name>
<given-names>Y.</given-names> 
<surname>Tan</surname></string-name>, <string-name>
<given-names>Q.</given-names> 
<surname>Liu</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Coverless real-time image information hiding based on image block matching and dense convolutional network</article-title>,&#x201D; 
<source>Journal of Real-Time Image Processing</source>, vol. 
<volume>17</volume>, no. 
<issue>1</issue>, pp. 
<fpage>125</fpage>&#x2013;
<lpage>135</lpage>, 
<year iso-8601-date="2020">2020</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>J.</given-names> 
<surname>Zhang</surname></string-name>, <string-name>
<given-names>X. K.</given-names> 
<surname>Jin</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Sun</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>A. K.</given-names> 
<surname>Sangaiah</surname></string-name>
</person-group>, &#x201C;
<article-title>Spatial and semantic convolutional features for robust visual object tracking</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>79</volume>, no. 
<issue>21&#x2013;22</issue>, pp. 
<fpage>15095</fpage>&#x2013;
<lpage>15115</lpage>, 
<year iso-8601-date="2020">2020</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>Y.</given-names> 
<surname>Chen</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Liu</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Chen</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Xiong</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Multiscale fast correlation filtering tracking algorithm based on a feature fusion model</article-title>,&#x201D; 
<source>Concurrency and Computation: Practice and Experience</source>, vol. 
<volume>47</volume>, no. 
<issue>5</issue>, 
<fpage>e5533</fpage>, 
<year iso-8601-date="2019">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>Y.</given-names> 
<surname>Zhao</surname></string-name>, <string-name>
<given-names>Z. G.</given-names> 
<surname>Hu</surname></string-name>, <string-name>
<given-names>B.</given-names> 
<surname>Xiong</surname></string-name> and <string-name>
<given-names>K. Q.</given-names> 
<surname>Li</surname></string-name>
</person-group>, &#x201C;
<article-title>Accelerating packet classification with counting bloom filters for virtual OpenFlow switching</article-title>,&#x201D; 
<source>China Communications</source>, vol. 
<volume>15</volume>, no. 
<issue>10</issue>, pp. 
<fpage>117</fpage>&#x2013;
<lpage>128</lpage>, 
<year iso-8601-date="2018">2018</year>.</mixed-citation>
</ref>
<ref id="ref-19">
<label>[19]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Zhou</surname></string-name>, <string-name>
<given-names>J. P.</given-names> 
<surname>Yin</surname></string-name> and <string-name>
<given-names>J. M.</given-names> 
<surname>Zhang</surname></string-name>
</person-group>, &#x201C;
<article-title>Local binary pattern (LBP) and local phase quantization (LBQ) based on Gabor filter for face representation</article-title>,&#x201D; 
<source>Neurocomputing</source>, vol. 
<volume>116</volume>, pp. 
<fpage>260</fpage>&#x2013;
<lpage>264</lpage>, 
<year iso-8601-date="2013">2013</year>.</mixed-citation>
</ref>
<ref id="ref-20">
<label>[20]</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>K.</given-names> 
<surname>Simonyan</surname></string-name> and <string-name>
<given-names>A.</given-names> 
<surname>Zisserman</surname></string-name>
</person-group>, &#x201C;
<article-title>Very deep convolutional networks for large-scale image recognition</article-title>,&#x201D; in <conf-name>Proc. of Int. Conf. on Learning Representations 2015</conf-name>, 
<publisher-loc>CA, USA</publisher-loc>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>14</lpage>, 
<year iso-8601-date="2015">2015</year>. </mixed-citation>
</ref>
<ref id="ref-21">
<label>[21]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>Y.</given-names> 
<surname>Yang</surname></string-name>
</person-group>, &#x201C;
<article-title>A context-sensitive deep learning approach for microcalcification detection in mammograms</article-title>,&#x201D; 
<source>Pattern Recognition</source>, vol. 
<volume>78</volume>, pp. 
<fpage>12</fpage>&#x2013;
<lpage>22</lpage>, 
<year iso-8601-date="2018">2018</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>M. S.</given-names> 
<surname>Mabrouk</surname></string-name>, <string-name>
<given-names>H. M.</given-names> 
<surname>Afify</surname></string-name> and <string-name>
<given-names>S. Y.</given-names> 
<surname>Marzouk</surname></string-name>
</person-group>, &#x201C;
<article-title>Fully automated computer-aided diagnosis system for micro calcifications cancer based on improved mammographic image techniques</article-title>,&#x201D; 
<source>Ain Shams Engineering Journal</source>, vol. 
<volume>10</volume>, no. 
<issue>3</issue>, pp. 
<fpage>517</fpage>&#x2013;
<lpage>527</lpage>, 
<year iso-8601-date="2019">2019</year>.</mixed-citation>
</ref>
<ref id="ref-23">
<label>[23]</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Suresh</surname></string-name>, <string-name>
<given-names>A. N.</given-names> 
<surname>Rao</surname></string-name> and <string-name>
<given-names>B. E.</given-names> 
<surname>Reddy</surname></string-name>
</person-group>, &#x201C;
<article-title>Detection and classification of normal and abnormal patterns in mammograms using deep neural network</article-title>,&#x201D; 
<source>Concurrency and Computation: Practice and Experience</source>, vol. 
<volume>31</volume>, no. 
<issue>14</issue>, 
<fpage>5293</fpage>, 
<year iso-8601-date="2019">2019</year>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>