<?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">31202</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.031202</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>SNCDM: Spinal Tumor Detection from MRI Images Using Optimized Super-Pixel Segmentation</article-title><alt-title alt-title-type="left-running-head">SNCDM: Spinal Tumor Detection from MRI Images Using Optimized Super-Pixel Segmentation</alt-title><alt-title alt-title-type="right-running-head">SNCDM: Spinal Tumor Detection from MRI Images Using Optimized Super-Pixel Segmentation</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Merlin Inbamalar</surname><given-names>T.</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref><email>merlininbamalar@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Samiappan</surname><given-names>Dhandapani</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>Ramesh</surname><given-names>R.</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electronics and Instrumentation Engineering, Saveetha Engineering College</institution>, <addr-line>Chennai, Tamilnadu</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Electronics and Communication Engineering, Saveetha Engineering College</institution>, <addr-line>Chennai</addr-line>,<addr-line>Tamilnadu</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Electronics and Communication Engineering, Tagore Engineering College</institution>, <addr-line>Chennai, Tamilnadu</addr-line>, <country>India</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: T. Merlin Inbamalar. Email: <email>merlininbamalar@gmail.com</email></corresp></author-notes>
<pub-date publication-format="print" date-type="pub" iso-8601-date="2022-12-17"><day>17</day><month>12</month><year>2022</year></pub-date>
<volume>36</volume>
<issue>2</issue>
<fpage>1899</fpage>
<lpage>1913</lpage>
<history>
<date date-type="received"><day>12</day><month>4</month><year>2022</year></date>
<date date-type="accepted"><day>12</day><month>5</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Merlin Inbamalar et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Merlin Inbamalar 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_31202.pdf"></self-uri>
<abstract>
<p>Conferring to the American Association of Neurological Surgeons (AANS) survey, 85&#x0025; to 99&#x0025; of people are affected by spinal cord tumors. The symptoms are varied depending on the tumor&#x2019;s location and size. Up-to-the-minute, back pain is one of the essential symptoms, but it does not have a specific symptom to recognize at the earlier stage. Numerous significant research studies have been conducted to improve spine tumor recognition accuracy. Nevertheless, the traditional systems are consuming high time to extract the specific region and features. Improper identification of the tumor region affects the predictive tumor rate and causes the maximum error-classification problem. Consequently, in this work, Super-pixel analytics Numerical Characteristics Disintegration Model (SNCDM) is used to segment the tumor affected region. Estimating the super-pixels of the affected region by this method reduces the variance between the identified pixels. Further, the super-pixels are selected according to the optimized convolution network that effectively extracts the vertebral super-pixels features. Derived super-pixels improve the network learning and training process, which minimizes the maximum error classification problem also the efficiency of the system was evaluated using experimental results and analysis.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Maximum error-classification problem</kwd>
<kwd>optimized convolution network</kwd>
<kwd>super-pixel analytics numerical characteristics disintegration model (SNCDM)</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Development of the abnormal tissues in the spinal column or spinal cord [<xref ref-type="bibr" rid="ref-1">1</xref>] is a spinal tumor. These abnormal tissues are grown uncontrollably, influencing and controlling normal cell growth. The spinal tumor [<xref ref-type="bibr" rid="ref-2">2</xref>] has two subtitles primary and secondary tumors. The spinal cord originated abnormal cells are primary and cancer spreading from another region to the spine is a secondary or metastatic tumor. The tumors are identified in two ways: region (sacrum, lumbar, thoracic, and cervical) and locations (Intradural-extramedullary,Intramedullary, and Extradural) [<xref ref-type="bibr" rid="ref-3">3</xref>]. The intradural tumors have occurred in the thin region of the spinal cord, around 40&#x0025; [<xref ref-type="bibr" rid="ref-4">4</xref>]. The intramedullary tumor cells are developed inside the cord obtained from ependymal cells, and 5&#x0025; in frequency of occurrence [<xref ref-type="bibr" rid="ref-5">5</xref>]. Then, extradural is located outside of the dura, and 55&#x0025; [<xref ref-type="bibr" rid="ref-6">6</xref>] is the frequency of occurrence. These abnormal tissues encompass the nerve roots. In addition to this, bone metastasis is one of the general bony spinal which experience almost 30&#x0025; to 70&#x0025; of patients [<xref ref-type="bibr" rid="ref-7">7</xref>]. The bone spine is vertebral hemangiomas are benign lesions that have rare symptoms like pain. Lower or middle back pain is the most common spinal tumor symptom [<xref ref-type="bibr" rid="ref-8">8</xref>]. The back pain not only occurred by injuries; it also happened physical and stress activities. The main spread from the back to the legs, hips, arms, and feet aggravates over time. Additionally, a spine tumor has several symptoms: muscle weakness, sensation loss, stiff back, neurological symptoms, walking difficulties, sensitivity loss, paralysis, and scoliosis [<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
<p>Once the patient suffers from these symptoms, a medical examination must require to diagnose spinal tumors. The radiological tests [<xref ref-type="bibr" rid="ref-10">10</xref>] include computed tomography (CT scan), X-ray, Magnetic Resonance Imaging (MRI), and Bone Scan. These radiological experiments investigated the inner details that help to identify the tumor types. However, a biopsy [<xref ref-type="bibr" rid="ref-11">11</xref>] needs to diagnosis the unclear findings to maximize the treatment procedures. During the treatment, abnormal tissues or neoplasms are classified by examining spinal canal involvement, soft tissues, and bony. Then, abdomen and lung scanning are suggested to confirm the spine tumors. The manual medical examination consumes more time as well as failure to identify the exact affected area. Therefore, various medical analysis is performed to create an automated computer-aided system for detecting the spine tumor [<xref ref-type="bibr" rid="ref-12">12</xref>]. The computerized system utilizes radiological images to achieve clinical examination using image processing and machine learning techniques. The automated system utilizes the MRI images [<xref ref-type="bibr" rid="ref-13">13</xref>] to detect the spine tumor because the MRI images can identify the tumor position, size, and type with minimum effort. It can discriminate the normal small tissues and tissue density changes and mutations linked with tumors. The main reason for choosing an MRI image is, it does not have any ionizing radiation. The captured MRI images are investigated by segmentation techniques [<xref ref-type="bibr" rid="ref-14">14</xref>] that predict the spine modalities, which helps identify the tumor issues accurately.</p>
<p>The image segmentation process identifies the affected region by minimizing the manual delineation time consumption. The segmenting process locates the density changed tissues by contouring the MRI images. This process identifies the irregular boundaries and tissue interest variation from images effectively. Although, the exact tumor detection is a complex task while overlapping between the normal and abnormal tissues. Then most of the tissues are heterogeneous in tumor size, shape, appearance, and position, so the abnormal tissues [<xref ref-type="bibr" rid="ref-15">15</xref>] affect average tissue growth. The MRI high-resolution images are needs high computational resources and memory to segment the affected region. Different types of methods were introduced to overcome the spinal MRI image segmentation process. The segmentation process decomposes the images into 2D slices processed sequentially while training the MRI image features. The second method decomposes the images into patches that effectively process the volumetric data. However, the traditional techniques are facing difficulties while investigating image topological changes like splitting and merging issues. This causes slow convergence and optimal local problems, which reduces the overall tumor detection accuracy.</p>
<p>Several researchers utilize advanced techniques that include integrating machine learning and swarm intelligent techniques to resolve the convergence issues. The swarm techniques optimize the system&#x2019;s performance by updating the network parameters, and the global solution is obtained during the updating process. However, the region interest intensity should be identified to improve the recognition accuracy. For this, an intense training set is needed to enhance the system performance with minimum difficulties. Thus the primary intention of this study is to improve the tumor segmentation accuracy with minimum complexity. In this paper, the super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) approach is utilized. The SNCDM approach segments the region based on the super-pixels that minimize the variance between the identified pixels. The vertebral super-pixel is examined that extracts the spinal features based on the super-pixel using the optimized convolution neural networks. This process reduces the maximum inaccurate segmentation problem (MIS) successfully. The effectiveness of the system is evaluated using MATLAB tool with respective performance metrics.</p>
<p>Then the rest of the paper is organized as follows; Section 2 discusses the various researchers&#x2019; analyses about spinal tumor detection&#x2014;Section 3 analyzes the SNCDM method-based spinal tumor detection framework. Section 4 evaluates the effectiveness of the system discussed, and the conclusion is summarized in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<p>Alafri 2019 [<xref ref-type="bibr" rid="ref-16">16</xref>] recommended deep neural networks to detect lumbar spinal stenosis from MRI images. The method investigates the boundary of the spine images according to the lumbar spine characteristics. The method uses the network layers that classifies the changes in MRI image. The method maintains the system&#x2019;s consistency, quality, and confidence while segmenting the affected region. In addition, the Jaccard metric shows that the deep learning approach has highly differentiated the normal and abnormal tissues in MRI images.</p>
<p>Liu, et al., 2019 [<xref ref-type="bibr" rid="ref-17">17</xref>] apply convolution neural network technique to identify and detect the lumbar in MRI images. The method uses the convolute layers that speed up the computation process and store the memory. The method derives the S1 shapes from the spine image, and L1-L5 features are extracted from the round region. The discussed system attains 98.9&#x0025; of accuracy while detecting Lumbar.</p>
<p>In MRI image analysis, Alam et al., 2019 [<xref ref-type="bibr" rid="ref-18">18</xref>] introduced fuzzy c-means clustering to detect brain tumors. Initially, the image grey level intensity value is estimated, which helps to identify the cluster center. Then fuzzy membership values are computed to group the similar pixel, and this computation is updated according to the membership values. The clustered details are investigated to extract entropy, energy, contrast, homogeneity, dissimilarity, correlation, and entropy value. According to these features, the affected tumor region was detected with minimum time.</p>
<p>Chmelik et al., 2018 [<xref ref-type="bibr" rid="ref-19">19</xref>] detected spinal lesions from 3D CT data by applying the deep convolutional network. Here, convolution networks are utilized to extract the automatic features without depending on the patient&#x2019;s activities. The extracted features are processed by a random forest approach that classifies the lesion region. Then medial axis transform is applied to improve the overall segmentation approach.</p>
<p>Anter et al., 2019 [<xref ref-type="bibr" rid="ref-20">20</xref>] applying neutrosophic fuzzy c-means and adaptive watershed algorithm to segment the tumor region from CT liver image. The CT images are processed by median filter and histogram equalization approach to eliminate noise and improve the quality of the image. Then, a clustering algorithm is applied to differentiate the image regions. Here, morphological and adaptive threshold values are utilized to determine the segmenting strategies. This process ensures 95&#x0025; of accuracy and minimum time while segmenting the tumor-affected region.</p>
<p>Punarselvam et al., 2019 [<xref ref-type="bibr" rid="ref-21">21</xref>] analyzed MRI spine images for detecting tumors by applying the soft computing and finite element approaches. The gathered MRI images are continuously analysed to detect the boundary lines. The region boundaries are predicted using different methods like Roberts, Prewitt, Sobel, and canny edges. The predicted edges are smoothened by noise removal techniques that help to improve the overall spine tumor detection accuracy. In addition to this, the method investigating the L4 and L5 lumbar predicts changes in spinal structure effectively.</p>
<p>Jena et al., 2020 [<xref ref-type="bibr" rid="ref-22">22</xref>] recommend a canny, morphological, and Sobel (CMS) edge detection approach to predict image edges. The method uses mathematical operators to identify the edges in the color and greyscale images. The extracted edges are more powerful to derive the affected region. The obtained results are compared with Laplacian of Gaussian, Roberts, Sobel, and Prewitt detection approaches.</p>
<p>Reza et al., 2019 [<xref ref-type="bibr" rid="ref-23">23</xref>] segmenting tumor region from spine MRI images using cascaded convolution neural networks. This paper uses the auto context model that uses the learners to identify the tumor voxel and fine-tuning procedure applied to classify the tumor region. The method predicts the correlation between the features with maximum accuracy and minimum deviations. According to the various researcher&#x2019;s analyses, the MRI image segmentation is performed by applying different image processing and machine learning techniques. However, the existing approaches consume more time and create a segmentation problem. Therefore, in this paper, Super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) is utilized to improve the overall segmentation accuracy. The detailed working process of this study is illustrated in Section 3.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Spinal Tumor Detection Using SNCDM Framework</title>
<p>The SNCDM framework-based spinal tumor prediction process is illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. This system aims to overcome the maximum inaccurate segmentation problem (MIS) by segmenting the relevant region from an MRI image. The images are investigated via super pixels because it helps to identify the pixel characteristics during the segmentation. The super pixel identifies the relationship between the pixels, ensuring the changes in region intensity, position, and size. The successive identification of the affected region solves the maximum error classification while classifying the spinal tumor. The SNCDM framework is illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>SNCDM framework</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-1.png"/>
</fig>
<p>The captured spinal cord images are analyzed by elliptical Fourier descriptors used to get the vertebral shape. This process does not consider the aliasing issues in different resolution images but produces continuous descriptors. The captured spinal cord image <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> is defined as a vector function that has position points <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">c</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</inline-formula> which are presented in the two orthonormal axes. Then, the spinal region has axial coordinates <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>c</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">z</mml:mi></mml:mrow></mml:mrow><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> and the spinal cord is represented in the mathematical form in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref><disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</disp-formula></p>
<p>The <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> and <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> values are estimated according to the Fourier descriptor derivation concerning the <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math>
</inline-formula> defined in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>. Here <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:msub><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>10</mml:mn></mml:mrow><mml:msup><mml:mo stretchy="false">]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:math>
</inline-formula> and <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:msub><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>01</mml:mn></mml:mrow><mml:msup><mml:mo stretchy="false">]</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:math>
</inline-formula>. The coordinate values are calculated as follows</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The descriptor coefficients are derived from the trigonometry computation of angular frequency (<inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>&#x03C9;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> and harmonic number (<inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. These coefficients in both directions help identify the spinal tumor-affected region by solving the maximum error-rate classification problem. Here, the Fourier descriptor coefficients <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula>, <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula>, <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula> are computed using <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mstyle></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The coefficients <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula>, <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula>, <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:math>
</inline-formula> computed from the sampling points <italic>n</italic> both axial position <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> of the j shape model. These sampling points are more used to identify the shape of the spinal cord concerning the <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">c</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</inline-formula> points. Considering these mathematical computations, the spinal cord region-related descriptors are estimated and simplified as <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">c</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>From the investigated regions in <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>, L1-L5 lumbar region is more beneficial to identify the tumor-related spot. The computed <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">c</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</inline-formula> in discrete cosine components helps to compute the sharp ROC model with maximum frequency. The computed tumor-related coefficients axial points are estimated in <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>.<disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x221E;</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The derived coefficients are more valuable to identify the super-pixel (SP) in the spinal image. The SP computation helps to get the features from the images by considering the image boundaries, shapes, and location characteristics. This process converts the images into a sequential representation which helps to identify the exact tumor affected region. Here, the <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">d</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> images are divided into grid cells (small images). The spinal MRI images have a height (H) and width (W) denoted as <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mi>I</mml:mi><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>W</mml:mi></mml:math>
</inline-formula>. Then the I is divided into small images with a size of <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:mi>h</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>w</mml:mi></mml:math>
</inline-formula>. Initially, every grid cell has super pixels (seed) that are more useful for identifying the tumor-affected region. Each pixel in the image <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>u</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">b</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>l</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> is mapped with the super pixel <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>j</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. The mathematical form of mapping is defined as <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:msub><mml:mi>g</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. If the mapping process <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:msub><mml:mi>g</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>v</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> returns one as value, then the pixel belonging to super-pixel else not. According to the super-pixel, the remaining pixels are grouped that are segmented for further analysis. To reduce the computation complexity, here, <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> matching process performed in defined small grids <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula>. For every computation, almost 9 grid cells are utilized to perform the mapping process. This grid cell-based mapping minimizes the maximum inaccurate segmentation problem (MIS). Therefore, the mapping is written as <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">G</mml:mi></mml:mrow></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="normal">Z</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mi>H</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:msup></mml:math>
</inline-formula>.</p>
<p>In the image, the <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> they are computed using the encoder-decoder network design. Here, convolution networks use the input images and give the high-level feature maps are output. The derived feature maps are more helpful in identifying the tumor-affected region performed in the encoder phase. After that, the decoder utilizes the de-convolution layer functionalities to up sample the features from the encoder layer. The max-pooling ReLU activation process is performed during this process to get the output from the feature vector. The last layer uses the softmax activation function to obtain the <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> value from the collection of image pixels. This encoder-decoder convolution networks based <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> analysis reduces the loss functions and increases the flexibilities. The identified <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> value should be preserved because the remaining pixels are grouped according to <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:mspace width="thickmathspace" /><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula>. For every <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula>, it has a location vector <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> and property vector <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula>; then the center <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> value is written as <inline-formula id="ieqn-43">
<mml:math id="mml-ieqn-43"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. These values are computed using <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>.<disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>:&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>:&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mi>s</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>:</mml:mo><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mi>P</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>:</mml:mo><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The super-pixel <inline-formula id="ieqn-44">
<mml:math id="mml-ieqn-44"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula> characteristics are computed from the <italic>P</italic> surrounding pixels <inline-formula id="ieqn-45">
<mml:math id="mml-ieqn-45"><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:math>
</inline-formula> and predicting probability <inline-formula id="ieqn-46">
<mml:math id="mml-ieqn-46"><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> of <inline-formula id="ieqn-47">
<mml:math id="mml-ieqn-47"><mml:mi>P</mml:mi><mml:mspace width="thickmathspace" /></mml:math>
</inline-formula> associated with <inline-formula id="ieqn-48">
<mml:math id="mml-ieqn-48"><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:math>
</inline-formula>. The <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> computation is carried out for the entire pixel involved in the spinal image. For pixels in images have property values that have been reconstructed as,<disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>According to this computation, the loss function <xref ref-type="disp-formula" rid="eqn-8">(Eq. (8)</xref>) is computed from the property of interest and super-pixel spatially compact.<disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mi>L</mml:mi><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>P</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mi>m</mml:mi><mml:mi>S</mml:mi></mml:mfrac></mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:msubsup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>The loss function (<inline-formula id="ieqn-49">
<mml:math id="mml-ieqn-49"><mml:mi>L</mml:mi><mml:mi>F</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> computed from the distance of pixel properties <inline-formula id="ieqn-50">
<mml:math id="mml-ieqn-50"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> Weight balancing of two-term <italic>m</italic> and super-sampling interval S. The super-pixel extraction process is illustrated in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Super-pixel identification process using convolution networks</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-2.png"/>
</fig>
<p>With the help of the computed super-pixel, vertebral features are extracted to identify the affected region precisely. For each super-pixel, a set of features are extracted that helps to quantify the pixel orientation, position, and shape. Initially, orientation and position-related features are extracted concerning the super-pixel. The super-pixel centroid value <inline-formula id="ieqn-51">
<mml:math id="mml-ieqn-51"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> is calculated respective to the image dimension in <inline-formula id="ieqn-52">
<mml:math id="mml-ieqn-52"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">x</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-53">
<mml:math id="mml-ieqn-53"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">y</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> the said Lumbar MRI region is obtained by assigning in the supine position during the scanning time axis. Then, the orientation of the SP should be computed in &#x04FF; axis of the ellipse. The calculated orientation and centroid information identify the availability of the medical images. These two values are analyzed the super-pixels form the recorded vertebral. The orientation and position feature extraction process is illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Orientation and position feature analysis</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-3.png"/>
</fig>
<p>After that, complexity features such as fractal and shape information is retrieved from the MRI spinal image. Generally, the MRI images are obtained from a specific orientation and frame, which helps derive the complexity features with minimum cost. Here, fractal features <inline-formula id="ieqn-54">
<mml:math id="mml-ieqn-54"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:msup><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mi>A</mml:mi></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula> are derived in three ways such as superpixel boundaries are measurement is challenging one; therefore, it has been calculated by taking the ratio between the square of the perimeter <inline-formula id="ieqn-55">
<mml:math id="mml-ieqn-55"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:msup><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> And area <inline-formula id="ieqn-56">
<mml:math id="mml-ieqn-56"><mml:mo stretchy="false">(</mml:mo><mml:mi>A</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> of superpixel. The calculated fractal features are varied from standard spinal image and abnormal spinal image. The standard MRI image fractal value is square, which is varied in odd images. Then shape features like solidity and extent features are extracted from the MRI image. Solidity <inline-formula id="ieqn-57">
<mml:math id="mml-ieqn-57"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula> is computed between the ratio of superpixel area (SP-A) and convex hull area <inline-formula id="ieqn-58">
<mml:math id="mml-ieqn-58"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. The computed solidity values are convex that have the value of 1 else 0. The Extent feature <inline-formula id="ieqn-59">
<mml:math id="mml-ieqn-59"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mfrac><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula> value is also calculated by taking the ratio between super-pixel areas bounding box areas (<inline-formula id="ieqn-60">
<mml:math id="mml-ieqn-60"><mml:msub><mml:mi>A</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. The extent value must be high due to the square shape characteristics of the super-pixel. According to the super-pixel characteristics and feature vectors, tumor affected region is identified effectively. This process identifies the vertebral changes in MRI images. The complexity feature extraction process is illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Complexity feature extraction process</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-4.png"/>
</fig>
<p>The maximum error-rate classification problem is reduced by applying the effective training process. Consider, the training set has a set of images <inline-formula id="ieqn-61">
<mml:math id="mml-ieqn-61"><mml:mrow><mml:mi mathvariant="script">I</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">I</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</inline-formula>. The training images are T training set of MRI images and pre-selected super-pixel <inline-formula id="ieqn-62">
<mml:math id="mml-ieqn-62"><mml:mrow><mml:mi mathvariant="script">S</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math>
</inline-formula>. The superpixel selection procedure selects the vertebral parameter represented as <inline-formula id="ieqn-63">
<mml:math id="mml-ieqn-63"><mml:mrow><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</inline-formula>. With the help of these parameter settings, a training label set <inline-formula id="ieqn-64">
<mml:math id="mml-ieqn-64"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> is created for image <inline-formula id="ieqn-65">
<mml:math id="mml-ieqn-65"><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula> According to <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>.<disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>For the entire super-pixel relative training process illustrated with respective parameter settings <inline-formula id="ieqn-66">
<mml:math id="mml-ieqn-66"><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> represented as <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>.<disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mi>T</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The successful computation of these training parameters generate <italic>S</italic> value and the collective training response shown in <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref><disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>From the derived <inline-formula id="ieqn-67">
<mml:math id="mml-ieqn-67"><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>s</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo><mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:math>
</inline-formula> superpixel, different features <inline-formula id="ieqn-68">
<mml:math id="mml-ieqn-68"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">F</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> are extracted using the training parameter settings <inline-formula id="ieqn-69">
<mml:math id="mml-ieqn-69"><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula>. The derived features for superpixel with g dimensionality are defined in <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>.<disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">F</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mrow></mml:math>
</disp-formula></p>
<p>Then the collective response of the feature set for the entire super-pixel is denoted as,<disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The extracted features <inline-formula id="ieqn-70">
<mml:math id="mml-ieqn-70"><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow></mml:math>
</inline-formula> are overlapped with the super-pixel, if it has high overlap, then the region is affected, and the value is labeled as 1 else 0. Then labeling <inline-formula id="ieqn-71">
<mml:math id="mml-ieqn-71"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> for every feature <inline-formula id="ieqn-72">
<mml:math id="mml-ieqn-72"><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> Is represented as <xref ref-type="disp-formula" rid="eqn-14">Eq. (14)</xref>.<disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The derived features and labels are fed into the convolution network that uses the softmax activation function to classify the tumor-affected region effectively. According to the above process, training is performed with minimum computation complexity. The training process requires network parameter updating, which is done by applying the genetic bee optimization algorithm&#x2014;the network parameter updating working according to the genetic and bee algorithm characteristics. The algorithm uses the onlooker, employee, and scout bees that choose the optimized parameters. The parameters are selected in a specific population space <inline-formula id="ieqn-73">
<mml:math id="mml-ieqn-73"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> and the limited number of parameters to select the network parameters. In every layer, the network computes the optimized parameter to compute the output value. The solution is derived using <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref>.<disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">]</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">x</mml:mi></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>Here, a solution is to get from minimum (<inline-formula id="ieqn-74">
<mml:math id="mml-ieqn-74"><mml:msubsup><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> and maximum (<inline-formula id="ieqn-75">
<mml:math id="mml-ieqn-75"><mml:msubsup><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> boundary values with decision variable j and index i. The selected parameter, the objective function, is applied to get the network parameter values. The chosen values are processed by the employee bee that is performed similarly to the food searching behaviour. The estimated values are higher; it has been selected in memory for a further network updating procedure. Then the searching process is increased to the next level to updating searching process.<disp-formula id="eqn-16"><label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The selected solution probability value is computed to identify the best parameter, using <xref ref-type="disp-formula" rid="eqn-17">Eq. (17)</xref>.<disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>This updating process reduces the binary optimization problem and the selected criteria defined in <xref ref-type="disp-formula" rid="eqn-18">Eq. (18)</xref>.<disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="normal">U</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">N</mml:mi></mml:mrow><mml:mo>;</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">u</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">j</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>G</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>G</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mn>0.5</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The choice principles are defined based on the uniformly distributed values of <inline-formula id="ieqn-76">
<mml:math id="mml-ieqn-76"><mml:mi>G</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. Thus the practical computation of each pixel, super-pixel, and image complexity features are more helpful to identify the normal and abnormal regions from captured spinal MRI images. The discussed system effectiveness was evaluated using experimental results and discussion.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussions</title>
<p>The effectiveness of introduced Super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) based tumor region segmentation is discussed in this section. This work uses the Lumbar Spine MRI Dataset information to apply the introduced SNCDM framework.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Dataset Discussion</title>
<p>The dataset has a collection of MRI images captured from 515 patients who were having back pain. The MRI images are scanned in axial view or sagittal view of vertebrae, and each patient is instructed to scan many times. MRI images are taken in the axial view&#x2019;s three most small vertebra details: one between the last and sacrum vertebrae. In most cases, the orientation of the vertebra should be considered while scanning the patient&#x2019;s spine. The total number of slices is varied from 12 to 15; in most cases, it can vary up to 20 slices. According to the instrumental setup and technical analysis, around 48345 MRI images are scanned. The scanned images are 320&#x002A;310 resolution. The pixels have a 12-bit pixel precision value more significant than the standard greyscale images (8 bit). The straight and perpendicular pixel spacing is 0.6875&#x2005;mm, and the adjacent slice is 4.4&#x2005;mm. The patients are clinically examined, and the MRI images are recorded in the head-first supine position. In the resting stage, feet-first supine position related MRI images is taken. Therefore, this clinical analysis uses has 15 to 45-minute duration to record patient spinal details. Then the sample spinal cord images are illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Sample spine MRI images</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-5.png"/>
</fig>
<p>The collected images are processed by applying the above-discussed approaches, which recognize the super-pixels from the image. Then various features are extracted to get the tumor details that help to predict the tumor region. The identified region is more useful in post-processing. Then the created system effectiveness is evaluated using different performance metrics such as Jaccard Index (JI), Dice similarity, sensitivity, specificity, accuracy, recall, and precision metrics. These metrics are computed using the below equations.</p>
<p><disp-formula id="eqn-19"><label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mn>100</mml:mn></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-20"><label>(20)</label>
<mml:math id="mml-eqn-20" display="block"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-21"><label>(21)</label>
<mml:math id="mml-eqn-21" display="block"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>100</mml:mn></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-22"><label>(22)</label>
<mml:math id="mml-eqn-22" display="block"><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-23"><label>(23)</label>
<mml:math id="mml-eqn-23" display="block"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>The <xref ref-type="table" rid="table-1">Tab. 1</xref> clearly illustrates that the introduced Super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) based tumor region segmentation attains higher accuracy (accuracy-98.9&#x0025;, specificity-98.7&#x0025;, precision&#x2013;98.7&#x0025;, recall-99&#x0025;, and specificity-99.4&#x0025;). The obtained SNCDM approach results are higher compared to the other existing methods discussed in related works. The introduced method uses the training set that consists of a set of MRI images <inline-formula id="ieqn-77">
<mml:math id="mml-ieqn-77"><mml:mrow><mml:mi mathvariant="script">I</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">I</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2026;</mml:mo><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</inline-formula>, parameters<inline-formula id="ieqn-78">
<mml:math id="mml-ieqn-78"><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>N</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> and selected super-pixels <inline-formula id="ieqn-79">
<mml:math id="mml-ieqn-79"><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula>. The entire process performed according to <inline-formula id="ieqn-80">
<mml:math id="mml-ieqn-80"><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> which helps to identify the tumor-affected region with minimum deviation error. According to the training process, network label <inline-formula id="ieqn-81">
<mml:math id="mml-ieqn-81"><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">L</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:math>
</inline-formula> Therefore, the entire classification accuracy improved by reducing the maximum error-rate classification problem. To the input images. Then the respective graphical analysis is illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Segmentation efficiency</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Methods</th>
<th align="left">Accuracy</th>
<th align="left">Specificity</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">Sensitivity</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-16">16</xref>]</td>
<td align="left">0.754</td>
<td align="left">0.835</td>
<td align="left">0.898</td>
<td align="left">0.902</td>
<td align="left">0.897</td>
</tr>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td align="left">0.856</td>
<td align="left">0.876</td>
<td align="left">0.902</td>
<td align="left">0.923</td>
<td align="left">0.902</td>
</tr>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td align="left">0.87</td>
<td align="left">0.897</td>
<td align="left">0.89</td>
<td align="left">0.9321</td>
<td align="left">0.912</td>
</tr>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-19">19</xref>]</td>
<td align="left">0.897</td>
<td align="left">0.923</td>
<td align="left">0.902</td>
<td align="left">0.92</td>
<td align="left">0.8925</td>
</tr>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-20">20</xref>]</td>
<td align="left">0.876</td>
<td align="left">0.899</td>
<td align="left">0.912</td>
<td align="left">0.931</td>
<td align="left">0.943</td>
</tr>
<tr>
<td align="left">In [<xref ref-type="bibr" rid="ref-21">21</xref>]</td>
<td align="left">0.86</td>
<td align="left">0.902</td>
<td align="left">0.934</td>
<td align="left">0.942</td>
<td align="left">0.94</td>
</tr>
<tr>
<td align="left">SNCDM</td>
<td align="left">0.989</td>
<td align="left">0.987</td>
<td align="left">0.987</td>
<td align="left">0.99</td>
<td align="left">0.994</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Efficiency of segmentation techniques</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-6.png"/>
</fig>
<p>From the <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, it clearly shows that introduced SNCDM system attains the high efficiency while classifying the MRI images. The successful identification of each pixels and relationship between the pixels according to the properties. Here, the image descriptors are identified based on various image directions with cosine <inline-formula id="ieqn-82">
<mml:math id="mml-ieqn-82"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x2026;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">p</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="fraktur">c</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math>
</inline-formula> helps to compute the sharp ROC model with maximum frequency. The segmented regions are more useful while performing the post processing. The method uses the optimization techniques for improving the network parameter updating process. Therefore, the deviation between the identified pixels and actual tumor affected pixels are very low. This step is investigated using error rate (MSE) and fit rate metrics.</p>

<p><disp-formula id="eqn-24"><label>(24)</label>
<mml:math id="mml-eqn-24" display="block"><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">q</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">M</mml:mi><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:msub><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mo>.</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-25"><label>(25)</label>
<mml:math id="mml-eqn-25" display="block"><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>R</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>F</mml:mi><mml:mi>R</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:msqrt><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mn>100</mml:mn><mml:mo>%</mml:mo></mml:math>
</disp-formula></p>
<p>These metrics are utilized to perform the SNCDM approach is compared with various methods in terms of number of superpixels and number of patients. The obtained results are illustrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Error rate analysis of (a) &#x0023; Superpixels (b) &#x0023; Patients</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-7.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> illustrates that the error rate analysis introduced SNCDM approach with several existing approaches. Here the comparison is made with the number of super pixels and number of patients. The system consumes minimum error rate while analysing the super pixel on given MRI images. The method continuously update the network parameters according to the genetic bee operators. The network utilizes the <inline-formula id="ieqn-83">
<mml:math id="mml-ieqn-83"><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msubsup><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2061;</mml:mo><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:msub><mml:mi>t</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</inline-formula> probability value for every parameter computation process. In addition to this, uniform distribution value helps to select the optimized network parameters. Then the network uses the <inline-formula id="ieqn-84">
<mml:math id="mml-ieqn-84"><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi>S</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="script">J</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mi mathvariant="script">P</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> in training process that helps to identify the extreme super pixels from the MRI image. The continuous training process minimize the error-rate problem. The identified superpixels are more helpful to extract the tumor related features <inline-formula id="ieqn-85">
<mml:math id="mml-ieqn-85"><mml:mrow><mml:mi mathvariant="script">F</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mi mathvariant="script">F</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:mrow><mml:mi>N</mml:mi></mml:msub><mml:mo fence="false" stretchy="false">}</mml:mo></mml:mrow></mml:math>
</inline-formula> which identify the tumor region successfully. Therefore, it clearly shows that extracted features and superpixel fit with this process and the obtained results are illustrated in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Fit rate analysis of (a) &#x0023; Superpixels (b) &#x0023; Patients</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31202-fig-8.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-8">Fig. 8</xref> illustrated that the fit rate analysis of different segmentation process such as [<xref ref-type="bibr" rid="ref-16">16</xref>&#x2013;<xref ref-type="bibr" rid="ref-21">21</xref>] and introduced SNCDM. The method predicts the image coordinates with respective super pixel values <inline-formula id="ieqn-86">
<mml:math id="mml-ieqn-86"><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x2135;</mml:mi><mml:mi>P</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math>
</inline-formula> with their property and minimum loss function <inline-formula id="ieqn-87">
<mml:math id="mml-ieqn-87"><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mi>P</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mrow><mml:mi>f</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:mfrac><mml:mi>m</mml:mi><mml:mi>S</mml:mi></mml:mfrac></mml:mrow><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:msubsup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup></mml:math>
</inline-formula> value directly indicates that the system has high fit rate compared to the other methods. The effective examination of image super pixel, complexity features, shape features and relationship between the features recognize the tumor region with high recognition accuracy. Thus the system ensures high results on number of super-pixels (98.043&#x0025;) and number of patients 98.487&#x0025;) while segmenting the spine tumors. Further, the excellence of the system is evaluated using Jaccard index and dice score and the obtained results are illustrated in <xref ref-type="table" rid="table-2">Tab. 2</xref> and <xref ref-type="table" rid="table-3">Tab. 3</xref>.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparative analysis for number of super-pixel</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Metrics</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-16">16</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-17">17</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-18">18</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-19">19</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-20">20</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-21">21</xref>]</th>
<th align="left">SNCDM</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Jaccard index</td>
<td align="left">0.7456</td>
<td align="left">0.823</td>
<td align="left">0.845</td>
<td align="left">0.867</td>
<td align="left">0.89</td>
<td align="left">0.923</td>
<td align="left">0.97</td>
</tr>
<tr>
<td align="left">Dice score</td>
<td align="left">0.83</td>
<td align="left">0.845</td>
<td align="left">0.87</td>
<td align="left">0.923</td>
<td align="left">0.94</td>
<td align="left">0.965</td>
<td align="left">0.978</td>
</tr>
<tr>
<td align="left">Accuracy (&#x0025;)</td>
<td align="left">66.5825</td>
<td align="left">73.681</td>
<td align="left">77.714</td>
<td align="left">81.427</td>
<td align="left">92.421</td>
<td align="left">95.7235</td>
<td align="left">98.043</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Comparative analysis for number of patients</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Metrics</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-16">16</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-17">17</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-18">18</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-19">19</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-20">20</xref>]</th>
<th align="left">In [<xref ref-type="bibr" rid="ref-21">21</xref>]</th>
<th align="left">SNCDM</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Jaccard index</td>
<td align="left">0.765</td>
<td align="left">0.834</td>
<td align="left">0.86</td>
<td align="left">0.878</td>
<td align="left">0.893</td>
<td align="left">0.934</td>
<td align="left">0.968</td>
</tr>
<tr>
<td align="left">Dice score</td>
<td align="left">0.845</td>
<td align="left">0.862</td>
<td align="left">0.88</td>
<td align="left">0.943</td>
<td align="left">0.956</td>
<td align="left">0.976</td>
<td align="left">0.983</td>
</tr>
<tr>
<td align="left">Accuracy (&#x0025;)</td>
<td align="left">66.22</td>
<td align="left">73.36</td>
<td align="left">77.75</td>
<td align="left">81.53</td>
<td align="left">92.405</td>
<td align="left">95.2</td>
<td align="left">98.94</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The proposed SNCDM maximize the region identification accuracy (98.04&#x0025;) on number of super pixel identification from MRI images. The identified regions are more similar to the expected outcome that is identified in Jaccard Index (0.978&#x0025;) and Dice Score (0.97&#x0025;).</p>
<p>According to the above discussions, the optimized Super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) algorithm successfully matches the trained tumor region with test tumor region while predicting the spinal tumor. The effective recognition of spinal tumor manages the system reliability, scalability and efficiency.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>Thus the paper analyzing the Super-pixel analytics Numerical characteristics Disintegration Model (SNCDM) based spinal tumor segmentation process. In this work uses the Lumbar Spine MRI Dataset information which are processed by applying the introduced machine learning approach. The gathered images are investigated in both axis to obtain the Fourier descriptors. The derived descriptors further examined to obtain the super-pixels which match with other pixels presented in the image. Then, different features such as complexity and shape related information extracted to classify the tumor relevant pixels successfully. The segmentation performance improved because of effective training process with respective labels. Then the efficiency of the system evaluated using experimental results in which system attains high recognition accuracy and minimum error rate. In future, the effectiveness of the system improved by applying the optimized segmentation techniques.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Hauwe</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Luc</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Pia</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sundgren</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Flanders</surname></string-name></person-group>, &#x201C;<article-title>Spinal trauma and spinalcord injury (SCI),&#x201D; <italic>Diseases of the Brain, Head and Neck</italic></article-title>,&#x201D; <source>Spine</source>, vol. <volume>2</volume>, pp. <fpage>2020</fpage>&#x2013;<lpage>2023</lpage>, <year>2020</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>X.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Qi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Fenghuangand</surname></string-name> <string-name><given-names>A.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>Prognosticnomograms to predict overall survival and cancer-specific survival in sacrum/pelvic chondrosarcoma (SC) patients: A population-based propensity score&#x2013;matched study</article-title>,&#x201D; <source>Clinical Spine Surgery</source>, vol. <volume>34</volume>, no. <issue>3</issue>, pp. <fpage>177</fpage>&#x2013;<lpage>185</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>C.</given-names> <surname>Chhabra</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Shobhit</surname></string-name>, <string-name><given-names>B.</given-names> <surname>More</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Ranade</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Punia</surname></string-name></person-group>, &#x201C;<article-title>Clinical profile, management and surgical outcome of spinal cord tumors</article-title>,&#x201D; <source>International Surgery Journal</source>, vol. <volume>8</volume>, no. <issue>10</issue>, pp. <fpage>3013</fpage>&#x2013;<lpage>3018</lpage>, <year>2021</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>H.</given-names> <surname>Hwang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Hwan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Park</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Chung</surname></string-name></person-group>, &#x201C;<article-title>How to approach anatomical compartment: Intradural pial-extrapialtumor</article-title>,&#x201D; <source>Surgery of Spinal Cord Tumors Based on Anatomy</source>, vol. <volume>112</volume>, pp. <fpage>111</fpage>&#x2013;<lpage>120</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>R. Y.</given-names> <surname>Shih</surname></string-name> and <string-name><given-names>K. K.</given-names> <surname>Koeller</surname></string-name></person-group>, &#x201C;<article-title>Intramedullary masses of the spinal cord: Radiologic-pathologic correlation</article-title>,&#x201D; <source>RadioGraphics</source>, vol. <volume>40</volume>, pp. <fpage>1125</fpage>&#x2013;<lpage>1145</lpage>, <year>2020</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>L.</given-names> <surname>Jun</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Chung</surname></string-name></person-group>, &#x201C;<article-title>How to approach anatomical compartment; extradural intracanal tumor</article-title>,&#x201D; <source>in Surgery of Spinal Cord Tumors Based on Anatomy</source>, vol. <volume>110</volume>, pp. <fpage>77</fpage>&#x2013;<lpage>84</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>W.</given-names> <surname>Patrick</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Shotaro</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Naganawaand</surname></string-name> <string-name><given-names>T.</given-names> <surname>Moritani</surname></string-name></person-group>, &#x201C;<article-title>Primary and metastatic spine tumors, &#x201C; <italic>In Diffusion-Weighted MR Imaging of the Brain</italic></article-title>, <source>Head and Neck, and Spine</source>, vol. <volume>105</volume>, pp. <fpage>803</fpage>&#x2013;<lpage>838</lpage>, <year>2021</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>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Xu</surname></string-name> and <string-name><given-names>P. P.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Deformation expression of soft tissue based on BP neural network</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>32</volume>, no. <issue>2</issue>, pp. <fpage>1041</fpage>&#x2013;<lpage>1053</lpage>, <year>2022</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>J.</given-names> <surname>Jankovic</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Josephand</surname></string-name> <string-name><given-names>E.</given-names> <surname>Lang</surname></string-name></person-group>, &#x201C;<article-title>Diagnosis and assessment of Parkinson disease and other movement disorders</article-title>,&#x201D; <source>Bradley&#x2019;s Neurology in Clinical Practice E-Book</source>, vol. <volume>10</volume>, pp. <fpage>175</fpage>&#x2013;<lpage>198</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>K.</given-names> <surname>Khalid</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Muzammil</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Mohammed</surname></string-name>, <string-name><given-names>l.</given-names> <surname>Ghamdi</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Khalid</surname></string-name></person-group>, &#x201C;<article-title>A comparative systematic literature review on knee bone reports from mri, x-rays and ct scans using deep learning and machine learning methodologies</article-title>,&#x201D; <source>Diagnostics</source>, vol. <volume>10</volume>, no. <issue>8</issue>, pp. <fpage>518</fpage>&#x2013;<lpage>531</lpage>, <year>2021</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>C.</given-names> <surname>Paola</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Kapetas</surname></string-name>, <string-name><given-names>A.</given-names> <surname>St&#x00F6;ttinger</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Bumberger</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Baltzer</surname></string-name></person-group>, &#x201C;<article-title>A risk stratification algorithm for lesions of uncertain malignant potential diagnosed by vacuum-assisted breast biopsy (VABB) of mammographic microcalcifications</article-title>,&#x201D; <source>European Journal of Radiology</source>, vol. <volume>135</volume>, pp. <fpage>109</fpage>&#x2013;<lpage>128</lpage>, <year>2021</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>S. 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>, pp. <fpage>198</fpage>&#x2013;<lpage>209</lpage>, <year>2020</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>A.</given-names> <surname>Alhassanand</surname></string-name> <string-name><given-names>W.</given-names> <surname>Zainon</surname></string-name></person-group>, &#x201C;<article-title>BAT algorithm with fuzzy C-ordered means (BAFCOM) clustering segmentation and enhanced capsule networks (ECN) for brain cancer MRI images classification</article-title>.&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>201741</fpage>&#x2013;<lpage>201751</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Alsiddiky</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Abdulmonem</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Awwad</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Bakarman</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Mahmoud</surname></string-name></person-group>, &#x201C;<article-title>Magnetic resonance imaging evaluation of vertebral tumor prediction using hierarchical hidden Markov random field model on Internet of Medical Things (IOMT) platform</article-title>,&#x201D; <source>Measurement</source>, vol. <volume>159</volume>, pp. <fpage>821</fpage>&#x2013;<lpage>851</lpage>, <year>2019</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>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Sangaiah</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Small object detection via precise region-based fully convolutional networks,&#x201D; <italic>Computers</italic></article-title>, <source>Materials and Continua</source>, vol. <volume>69</volume>, no. <issue>2</issue>, pp. <fpage>1503</fpage>&#x2013;<lpage>1517</lpage>, <year>2021</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>A.</given-names> <surname>Alafri</surname></string-name></person-group>, &#x201C;<article-title>Boundary delineation of mriImages for lumbar spinal stenosis detection through semantic segmentation using deep neural networks</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>43487</fpage>&#x2013;<lpage>43501</lpage>, <year>2019</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>Liu</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Automatic lumbar mri detection and identification based on deep learning</article-title>,&#x201D;<source>Journal Digit Imaging</source>, vol. <volume>32</volume>, pp. <fpage>513</fpage>&#x2013;<lpage>520</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>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Nie</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Using CFW-net deep learning models for X-ray images to detect COVID-19 patients</article-title>,&#x201D; <source>International Journal of Computational Intelligence Systems</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>199</fpage>&#x2013;<lpage>207</lpage>, <year>2021</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>C.</given-names> <surname>Chmelik</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Jiri</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Jakubicek</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Gavelli</surname></string-name></person-group>, &#x201C;<article-title>Deep convolutional neural network-based segmentation and classification of difficult to define metastatic spinal lesions in 3D CT data</article-title>,&#x201D; <source>Medical Image Analysis</source>, vol. <volume>49</volume>, pp. <fpage>76</fpage>&#x2013;<lpage>88</lpage>, <year>2018</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>S.</given-names> <surname>He</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Liao</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Li</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Parameters compressing in deep learning</article-title>,&#x201D; <source>Computers Materials &#x0026; Continua</source>, vol. <volume>62</volume>, no. <issue>1</issue>, pp. <fpage>321</fpage>&#x2013;<lpage>336</lpage>, <year>2020</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>P.</given-names> <surname>Punarselvam</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Suresh</surname></string-name></person-group>, &#x201C;<article-title>Investigation on human lumbar spine mriimage using finite element method and soft computing techniques</article-title>,&#x201D; <source>Cluster Computing</source>, vol. <volume>22</volume>, no. <issue>6</issue>, pp. <fpage>13591</fpage>&#x2013;<lpage>13607</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Jena</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mishra</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Mishra</surname></string-name></person-group>, &#x201C;<article-title>An algorithmic approach based on cmsedge detection technique for the processing of digital images</article-title>,&#x201D; in <source>Examining Fractal Image Processing and Analysis</source>, vol. <volume>21</volume>, pp. <fpage>252</fpage>&#x2013;<lpage>272</lpage>, <year>2020</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>Reza</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Parkand</surname></string-name> <string-name><given-names>A.</given-names> <surname>Butman</surname></string-name></person-group>, &#x201C;<article-title>Cascaded convolutional neural networks for spine chordoma tumor segmentation from MRI</article-title>,&#x201D; <source>Medical Imaging 2019: Biomedical Applications in Molecular, Structural, and Functional Imaging</source>, vol. <volume>10953</volume>, pp. <fpage>1095</fpage>&#x2013;<lpage>1125</lpage>, <year>2019</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>










