<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">23745</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.023745</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Detection of Osteoarthritis Based on EHO Thresholding</article-title>
<alt-title alt-title-type="left-running-head">Detection of Osteoarthritis Based on EHO Thresholding</alt-title>
<alt-title alt-title-type="right-running-head">Detection of Osteoarthritis Based on EHO Thresholding</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Kanthavel</surname><given-names>R.</given-names></name><xref ref-type="aff" rid="aff-1">1</xref>
<email>kanthavel2005@gmail.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Dhaya</surname><given-names>R.</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>Venusamy</surname><given-names>Kanagaraj</given-names></name><xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Engineering, King Khalid University</institution>, <addr-line>Abha</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science, King Khalid University, Sarat Abidha Campus</institution>, <addr-line>Abha</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Engineering, University of Technology and Applied Sciences</institution>, <addr-line>Al Mussanah</addr-line>, <country>Sultanate of Oman</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: R. Kanthavel. Email: <email>kanthavel2005@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-xx-xx"><day>11</day>
<month>01</month>
<year>2022</year></pub-date>
<volume>71</volume>
<issue>3</issue>
<fpage>5783</fpage>
<lpage>5798</lpage>
<history>
<date date-type="received"><day>19</day><month>9</month><year>2021</year></date>
<date date-type="accepted"><day>10</day><month>11</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Kanthavel et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Kanthavel et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_23745.pdf"></self-uri>
<abstract>
<p>Knee Osteoarthritis (OA) is a joint disease that is commonly observed in people around the world. Osteoarthritis commonly affects patients who are obese and those above the age of 60. A valid knee image was generated by Computed Tomography (CT). In this work, efficient segmentation of CT images using Elephant Herding Optimization (EHO) optimization is implemented. The initial stage employs, the CT image normalization and the normalized image is incited to image enhancement through histogram correlation. Consequently, the enhanced image is segmented by utilizing Niblack and Bernsen algorithm. The (EHO) optimized outcome is evaluated in two steps. The initial step includes image enhancement with the measure of Mean square error (MSE), Peak signal to noise ratio (PSNR) and Structural similarity index (SSIM). The following step includes the segmentation which includes the measure of Accuracy, Sensitivity and Specificity. The comparative analysis of EHO provides 95&#x0025; of accuracy, 94&#x0025; of specificity and 93&#x0025; of sensitivity than that of Active contour and Otsu threshold.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Osteoarthritis</kwd>
<kwd>CT images</kwd>
<kwd>correlation histogram</kwd>
<kwd>thresholding</kwd>
<kwd>Niblack &#x0026; Bernsen algorithm</kwd>
<kwd>EH optimization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Osteoarthritis is a type of disease that mainly destruct the joint in knee, hip and hand and this disorder may happen when the cartilage cushion down the knee which starts to wear down [<xref ref-type="bibr" rid="ref-1">1</xref>]. Arthritis is joint inflammation which is characterized by joint stiffness which can lead to poor function. This mainly happens to age down and over weighted people. In osteoarthritis there are two main types which can be primary that happens to aged people and the secondary may occur to earlier stage due to injury in accidents, weak body conditions, and some diseases like diabetes. In our paper we are considering a CT image also termed as CT scans; to scan a knee image [<xref ref-type="bibr" rid="ref-2">2</xref>]. CT scan may show the cross-sectional images of knee so that the disorder can be defined clearly through image. The body is circled by a CT scanner and it transfers pictures to a computer. These pictures are used by the machine to create detailed images. This helps the joints, cartilage, ligaments, vessels, and bones that make up the knee to be seen by physicians and qualified technicians. CT images can be introduced with main advantages like quick access of image detection in knee, painless, availability is better compared with MRI scanning; the bones structures are visualized in good view [<xref ref-type="bibr" rid="ref-3">3</xref>]. CT scan may also view an image of a small portion of knee [<xref ref-type="bibr" rid="ref-4">4</xref>]. <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the CT scan image of knee joint destruction<bold>.</bold></p>
<fig id="fig-1"><label>Figure 1</label><caption><title>CT scan image of knee joint destruction</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-1.png"/></fig>
<p>In Osteoarthritis there are several imaging techniques applied to restore the images from the disadvantage of unclear images and accuracy in image. The techniques are as follows: deep learning algorithm using Conventional Neural Networks (CNN) and for segmentation Active Contour Algorithm may be existed [<xref ref-type="bibr" rid="ref-5">5</xref>]. Though they were used to restore the clear image with accuracy still there might be a disadvantage in getting the image of knee perfectly [<xref ref-type="bibr" rid="ref-6">6</xref>]. Many Papers were done on the basis of knee joint destruction using many techniques. Most methods used previously are locating the knee joint and severity quantification. Separate models for knee joint location using either handcrafted features or CNN are not always very accurate and add more complexity while testing the existing method [<xref ref-type="bibr" rid="ref-7">7</xref>]. In order to overcome these circumstances, we are proposing an alternate method to enhance the knee image is Correlation Histogram Analysis [<xref ref-type="bibr" rid="ref-8">8</xref>]. The modification of the original histograms is often used in image enhancement procedures [<xref ref-type="bibr" rid="ref-9">9</xref>]. This segmentation method can be helpful in detecting the knee joint destruction by extracting the features by accepting the pixels in the form of arrays [<xref ref-type="bibr" rid="ref-10">10</xref>]. The main objective is to minimize the error function of the knee image. Our proposed segmentation method to optimize the knee OA is EHO. This optimization can be inspired from the herding of elephant group by nature. In order to address an optimization problem, this herding behavior of the elephant is modeled into clan updating and separation operator. The optimization of the EH is used in this work to isolate the worst pixel in the segmented grey scale image.</p>
</sec>
<sec id="s2"><label>2</label><title>Preliminary Studies</title>
<p>This section of this paper explains the related papers that deal with the Detection of Osteoarthritis Based on Thresholding methods. In 2019, Shiva and Gornale et al., have proposed a segmentation technique for evaluating knee osteoarthritis to overcome the disease using different segmentation methods. Though they have used the Prewit and Sobel edge methods, the accuracy enhancement and the classification rate are the main limitations. In 2019, Sicheng Wang et al., have done research on segmentation aware of denoising without true segmentation to generate image denoisers with better quality with no ground truth segmentation. enhancing U-SAID&#x0027;s generalizability in three ways: denoising unseen types of images, denoising as pre-processing for segmenting unseen noisy images, and denoising for unseen high-level tasks. To improve the accuracy of the image and to enable automatic evaluation, in 2018, Archit Raj et al., proposed an automatic knee cartilage segmentation using CNN in a 3D structure. Despite the fact that they proposed a technique to improve image accuracy, they are still in the limitation stage. In 2017, Shivan and Gornale et al., proposed a determination of OA using a histogram of oriented gradients and multiclass SVM. This method uses a HOG technique and can be processed using multiclass SVM for evaluating the KL grading system. Its results can be evaluated by medical expertizers. Still has the disadvantage of segmentation accuracy and could improve the classification rate with improved techniques for segmentation and preprocessing.</p>
<p>In 2019, Prajna desai et al., had proposed a paper called &#x201C;Knee cartilage segmentation and thickness measurement from 2D ultrasound. This paper proposes local-phase based image processing to enhance the modality of the image, and different segmentation techniques are proposed called RW, Watershed, and graph-cut-based methods. This existing method also tried to improve the accuracy. Though it doesn&#x0027;t fulfill the objective of improving accuracy. In 2020, Ridhma et al., proposed a paper on the Review of automated segmentation approaches for knee images, owning the different accuracy and difficulty of the various data sets of the knee image. This paper gives various segmentation techniques in detail for making a proposal. They did a lot of research to get better results for knee image segmentation. To separate the original histogram of a 16 bit biomedical image into two Gaussian that cover the pixel region and bright pixel regions was proposed by Joyce Sia Sin Yin et al. in 2020 in &#x201C;Prominent Region of Interest Contrast Enhancement for Knee MRI: Data from the Osteoarthritis Initiative&#x201D;, though it has a trade-off of longer time in image processing. It is observed from the review of the literature that the existing papers talked about Detection of Osteoarthritis based on Thresholding methods. Hence, there is a need to develop an efficient Thresholding methods model for Detection of Osteoarthritis.</p>
</sec>
<sec id="s3"><label>3</label><title>Methodology</title>
<p>The color and contrast of an image can be analyzed and processed in digital images using a tool called image histograms. In our proposed work, the knee osteoarthritis image can be enhanced using a method called Correlation Histogram dependent on the gray scale level of CT images, referred to as the CHA_CT algorithm. They are ideally suited for analyzing the effect of various processing and coding algorithms. The image can be fed up with a number of pixels. Each pixel represents a tissue in a CT image, and a gray-scale value between 0 and 255 is assigned to it. <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref> represents the block diagram of knee Osteoarthritis Image Enhancement.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Block diagram of knee osteoarthritis image enhancement</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-2.png"/></fig>
<sec id="s3_1"><label>3.1</label><title>Image Filtering</title>
<p>In order to reduce the noise of the image along with less blurring, Median Filter can be used in our research. Because of the black and white spots that are overlaid in it, it must be called pepper and salt noise [<xref ref-type="bibr" rid="ref-11">11</xref>]. A nonlinear method for removing noise from images is median filtering. It&#x0027;s widely used because it&#x0027;s very good at removing noise while keeping the edges. The median filter replaces each value with the median value of neighboring pixels as it moves through the image pixel by pixel. Because the median is a more robust average than the mean, a single highly unrepresentative pixel in a neighborhood will have little impact on the median value. In median filter by considering a input image f (a, b), we are obtaining a adaptive median filter can be expressed as;
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>g</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mspace width="thinmathspace" /><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
</p>
</sec>
<sec id="s3_2"><label>3.2</label><title>Pre-Processing</title>
<p>We extracted a Region of Interest (ROI) of 140&#x2009;&#x00D7;&#x2009;140 mm for each knee to pre-process the Osteoarthritis Initiative (OAI) images utilizing an ad-hoc template and Bone Finder software31 that allows precise completely anatomical. To standardize the communication frame between patients and data acquisition centers, this Technique was made [<xref ref-type="bibr" rid="ref-12">12</xref>]. We rotated all the knee photos after finding the bone landmarks so that the tibial layer was horizontal. The objective of pre-processing is to enhance image data that suppresses unnecessary distortions or improves some of the image features that are essential for further processing [<xref ref-type="bibr" rid="ref-13">13</xref>]. In our proposed technique pre-processing may be based on the following procedures:
<list list-type="bullet">
<list-item><p>ROI extraction</p></list-item>
<list-item><p>Creating histogram analysis</p></list-item>
<list-item><p>Correlation of histogram</p></list-item>
<list-item><p>Analyze image contrast</p></list-item>
<list-item><p>Enhanced image</p></list-item>
</list></p>
<p><bold>ROI extraction:</bold> A ROI is a part of an image chosen in any manner to process or work on [<xref ref-type="bibr" rid="ref-14">14</xref>]. A Biologically Motivated Selective Attention Model is used to create a Region of Interest based image segmentation method. How to choose a semantic object region according to a given goal is one of the most critical difficulties in image segmentation based on a ROI. In our paper we have taken a CT image to extract the particular region for enhancing to detect knee osteoarthritis. ROI extraction of knee image is representing in <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>ROI extraction of knee image</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-3.png"/></fig>
<p>To convert knee image into binary image in ROI extraction to enhance the knee,
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>==</mml:mo><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>==</mml:mo><mml:mrow><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">y</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
</p>
<p><bold>Creating a Histogram Analysis:</bold> By creating a histogram analysis modifies the histogram of an input image so as to improve the visual quality of the image. Equalization may spread out the gray level in an image so what they are evenly distributed. This technique provides a flat image result as possible [<xref ref-type="bibr" rid="ref-15">15</xref>]. In ROI output image each pixel has pixel value intensity. To evaluate the centre pixel of the square between the neighboring eight-pixel intensity distributions, a 3&#x2009;&#x00D7;&#x2009;3 matrix is used. Both the neighbor pixel and centre pixel intensity are alike [<xref ref-type="bibr" rid="ref-16">16</xref>]. To evaluate the image using correlation histogram, we followed the equation be,
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>p</mml:mi></mml:munderover><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><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>0</mml:mn></mml:mrow><mml:mi>q</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">H</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">W</mml:mi><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">P</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">R</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">W</mml:mi><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn></mml:mrow></mml:math></disp-formula>where, CP be the centre of pixel, W be the windows. The n1, n2, n3&#x2026; are denoted as 1 and m be considered as 0. All pixels can be scanned using 3&#x2009;&#x00D7;&#x2009;3 matrixes. The histogram method is applied over the knee image made a result. <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Fig. 4</xref> denotes the histogram equalization of knee image.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Histogram equalization of knee image</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-4.png"/></fig>
<p>The standard deviation of the region of interest can be calculated. The enhancement parameter is calculated by,
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>R</mml:mi><mml:mi>O</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:mfrac><mml:mspace width="thickmathspace" /></mml:msqrt><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>&#x03BC;</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>R</mml:mi><mml:mi>O</mml:mi><mml:mi>I</mml:mi></mml:mrow></mml:mfrac><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mi>&#x03C3;</mml:mi></mml:mrow><mml:mn>4</mml:mn></mml:mfrac></mml:math></disp-formula>where, RP is the number of pixels of the Region of interest,</p>
<p><italic>P</italic> is the estimation of every pixel of the ROI and</p>
<p>l is the mean estimation of the Region of interest</p>
<p>The outcome is then analyzed by qualitative and quantitative analysis to determine the fundamental features of the equalized histogram image, using a total of 10 patients that are used to contrast the image for research.</p>
<p><bold>Image Segmentation:</bold> This paper proposes a multilevel image thresholding strategy based on EHO for image segmentation. Image segmentation is a method for distinguishing image areas that are not overlapping [<xref ref-type="bibr" rid="ref-17">17</xref>]. A lot of techniques for segmenting image objects have been developed until now, such as thresholding-based, edge-based, region based, map cut and connectivity preserving. However, in various applications, most researchers use threshold segmentation because it is simple, accurate and durable [<xref ref-type="bibr" rid="ref-18">18</xref>]. Segmentation process block diagram is shown in <?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Fig. 5</xref>. Threshold technique is one of the important techniques in image segmentation. This technique can be expressed as:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">T</mml:mi></mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">p</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">f</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula>where, T is the threshold value.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Block diagram of segmentation process</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-5.png"/></fig>
<p>a, b are the coordinates of the threshold value point p (a, b)</p>
<p>f (a, b) are points the gray level image pixels.</p>
<p>Threshold image g (a, b) can be defined:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mi mathvariant="normal">g</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thinmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2264;</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
</p>
<p><bold>Niblack Algorithm:</bold> Niblack algorithm is a local binarization method that evaluate threshold based on local mean and local standard deviation. In Niblack method a rectangular sliding window of different size is used determine the threshold value of each pixel in the grey scale image [<xref ref-type="bibr" rid="ref-19">19</xref>]. The threshold at pixel (a, b) is calculated as;
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>K</mml:mi><mml:mrow><mml:mo>.</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where, <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>&#x03BC;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> implies local mean,</p>
<p>K implies constant adjacent object boundary and</p>
<p><inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> implies local standard deviation
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mrow><mml:mi mathvariant="normal">S</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:math></disp-formula></p>
<p>Here N represents number of pixels in the gray scale image. <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>T</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">(</mml:mo></mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> implies the threshold value of pixel. The value of K is constant but it may differ in accordance with noise in the background of image.</p>
<p><bold>Bernsen Algorithm:</bold> The bernsen algorithm is adaptive binarization technique that divides the image into 5&#x2009;&#x00D7;&#x2009;5 segment then it finds the T<sub>max</sub> and T<sub>min</sub> gray level value within the segment [<xref ref-type="bibr" rid="ref-20">20</xref>]. It analyzes the nearby pixel values and limits the contrast level. The threshold value of each pixel is calculated by below equation;
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></mml:mrow><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="normal">T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="normal">T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo></mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo></mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the highest and lowest pixel value in 5&#x2009;&#x00D7;&#x2009;5 segmented gray scale image. The intensity measure of each pixel can be calculated by the given equation.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></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:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></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:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi mathvariant="normal">a</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></disp-formula>
</p>
<p>The contrast measure of bernsen algorithm includes the following steps;</p>
<p>Step 1: It defines the maximum and minimum value of segmented 5&#x2009;&#x00D7;&#x2009;5 gray scale image.</p>
<p>Step 2: It calculate the local contract with predefined value d</p>
<p>Step 3: if d &#x003E; <italic>I</italic>(<italic>x</italic>, <italic>y</italic>) then it determines the segment as background value.</p>
<p>Step 4: if d &#x003C; <italic>I</italic>(<italic>x</italic>, <italic>y</italic>) contrast value, then the local contrast value is assumed as threshold value.</p>
</sec>
<sec id="s3_3"><label>3.3</label><title>Elephant Herding Optimization</title>
<p>The detection of osteoarthritis in the knee using EH Optimized Thresholding Based Segmentation is a unique method. Thresholding is used to create binary images from a grayscale image in this manner. EHO is a metaheuristic optimization method inspired by nature and based on the herding behavior of pictures. It&#x0027;s used to solve the problem of multilevel image thresholding. The EHO optimization mechanism is as follows.</p>
<p><bold>Step 1:</bold> Initialization</p>
<p>The elephant clan is selected during initialization, i.e., the gray scale section of pixels was chosen. Solution creation means that initiation is a crucial step in the process of optimization, leading you to identify the optimal solution easily.</p>
<p><bold>Step 2:</bold> Fitness Calculation.</p>
<p>The pixel with absolute value is considered as the best pixel and considered as matriarch. After generating the solution, the fitness function is evaluated and then chooses the best solution. Optimization algorithm for the most part relies upon its fitness function to acquire the best solution.</p>
<p><bold>Step 3:</bold> Updation</p>
<p>The movement of elephant in the clan the following state is approached through matron, then desired new location is given as,
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>,</mml:mo></mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2217;</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2013;signifies the new position of the elephant f in the clan <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>Z</mml:mi><mml:mi>E</mml:mi><mml:mi>k</mml:mi><mml:mo>,</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x2009;&#x003D;&#x2009;early position of the elephant <italic>f</italic> in the clan <italic>E</italic></p>
<p><inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D;&#x2009;suitable elephant in clan <italic>E</italic></p>
<p>The suitable elephant,
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>w</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thinmathspace" /><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>
</p>
<p>The suitable position of the elephant is obtained by the gathering of information&#x0027;s from all Elephants
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mi>T</mml:mi><mml:mo>+</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mi>T</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C6;</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mi>T</mml:mi><mml:mo>+</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>T</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
</p>
<p>The centre of the clan is given by <italic>d<sup>th</sup></italic> dimension
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> -rate of elephants in clan <italic>E</italic>.</p>
<p><italic>E</italic>, <italic>d</italic>-<italic>d<sup>th</sup></italic> Dimension of the elephant in the clan <italic>E</italic>. Separation operator</p>
<p>The elephant clutches in the time the male elephants reach adolescence and they travel and survive solitarily [<xref ref-type="bibr" rid="ref-21">21</xref>]. The exploring ability is enhanced by the solitary action and the worst fitness is given by,
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mrow><mml:mi mathvariant="normal">T</mml:mi><mml:mi mathvariant="normal">w</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mo>,</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></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:msub></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></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:msub></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">T</mml:mi></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:msub></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2217;</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:math></disp-formula>where, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> --lower boundary of individual elephant</p>
<p><inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> &#x2013;Upper boundary of individual elephant</p>
<p>The evolution of EHO is obtained by the separation and the updating operator. The obtained optimum threshold value from EHO is fed to the processing and segmentation of gray scale image using Benson and Niblack algorithm to obtain the resulted image [<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Results and Discussion</title>
<p>The proposed method was implemented by Matlab 2017. The outcome of the proposed method shows the result of pre-processing and segmentation of CT image for knee osteoarthritis and the performance was evaluated with different measurement parameters as accuracy, sensitivity and specificity. To evaluate the efficiency, the output of proposed med technique is compared with different existing techniques.</p>
<sec id="s4_1"><label>4.1</label><title>Data Description</title>
<p>In our proposed work, the sample CT bone images were considered from CT-ORG database. The sample dataset has 140 images of which 85 images were healthy (training set) and rests were used for testing purpose [<xref ref-type="bibr" rid="ref-23">23</xref>]. The resolution of the image is normalized as 512&#x2009;&#x00D7;&#x2009;512 pixel that demonstrates a clear deception of cartilage and joint [<xref ref-type="bibr" rid="ref-24">24</xref>].</p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Experimental Analysis</title>
<p>The experimental result of Knee OA CT image using a correlation histogram analysis and the optimized thresholding is analysed through different steps;</p>
<p>From the experimental analysis, it is obvious that the osteoarthritis can be analysed and processed by this technique. As we mentioned in <?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Fig. 6b</xref> the input CT image is enhanced using correlation histogram analysis that increased the intensity of the image. In <xref ref-type="fig" rid="fig-6">Fig. 6c</xref> thresholding concept is applied that segmented the enhanced CT image based on Niblack and Bernsen algorithm as shown in <xref ref-type="fig" rid="fig-6">Fig. 6d</xref>. Finally the segmented image is optimized using Elephant Herding optimization that isolated the osteoarthritis. Experimental result of the proposed technique is compared with different existing techniques to evaluate its performance.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Experimental result of the proposed method with CT image samples (a) Sample images (b) Contrast enhanced image using correlation histogram (c) Thresholding (d) Niblack and Bernsen output (e) EH Optimized image</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-6.png"/></fig>
</sec>
<sec id="s4_3"><label>4.3</label><title>Performance Evaluation</title>
<p>The experimental results were evaluated with MSE, PSNR and SSIM [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p><bold>MSE:</bold> In the data, the MSE calculates the average square difference between the expected value and the present value of the errors. MSE represents the error ratio between the original and denoised images.
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><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:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula>where, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> &#x2013;number of data points</p>
<p><inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> &#x2013;observed value</p>
<p><inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>&#x2013;predicted value</p>
<p><bold>PSNR:</bold> The MSE calculates the sum of the squares of the errors, i.e., the mean squared difference between the expected values and the actual value [<xref ref-type="bibr" rid="ref-26">26</xref>].
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:mspace width="thinmathspace" /><mml:mo>.</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mrow><mml:msup><mml:mi>X</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
</p>
<p><bold>SSI:</bold> The similarity comparison of original and de-noised images is referred to as SSIM. The calculated performance evaluation metrics were averaged over the whole slice. The performance evaluation of knee OA enhancement technique is tabulated in <?A3B2 "tbl1",5,"anchor"?><xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Performance evaluation of knee OA enhancement technique</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Patient number</th>
<th align="left" colspan="3">Local phase based bone enhancement</th>
<th align="left" colspan="3">Bone shadow region enhancement</th>
<th align="left" colspan="3">Proposed correlation histogram</th>
</tr>
<tr>
<th align="left"/>
<th align="left">PSNR</th>
<th align="left">SSIM</th>
<th align="left">MSE</th>
<th align="left">PSNR</th>
<th align="left">SSIM</th>
<th align="left">MSE</th>
<th align="left">PSNR</th>
<th align="left">SSIM</th>
<th align="left">MSE</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">56.41</td>
<td align="left">0.966</td>
<td align="left">0.48</td>
<td align="left">67.98</td>
<td align="left">0.99</td>
<td align="left">0.10</td>
<td align="left">69.72</td>
<td align="left">0.999</td>
<td align="left">0.01</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">55.42</td>
<td align="left">0.976</td>
<td align="left">0.46</td>
<td align="left">66.49</td>
<td align="left">0.991</td>
<td align="left">0.20</td>
<td align="left">68.97</td>
<td align="left">0.999</td>
<td align="left">0.023</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">55.98</td>
<td align="left">0.945</td>
<td align="left">0.42</td>
<td align="left">65.53</td>
<td align="left">0.958</td>
<td align="left">0.25</td>
<td align="left">67.88</td>
<td align="left">0.999</td>
<td align="left">0.15</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">53.32</td>
<td align="left">0.954</td>
<td align="left">0.441</td>
<td align="left">65.25</td>
<td align="left">0.967</td>
<td align="left">0.18</td>
<td align="left">66.65</td>
<td align="left">0.999</td>
<td align="left">0.126</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">53.99</td>
<td align="left">0.975</td>
<td align="left">0.53</td>
<td align="left">64.98</td>
<td align="left">0.988</td>
<td align="left">0.114</td>
<td align="left">66.43</td>
<td align="left">0.998</td>
<td align="left">0.17</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">52.65</td>
<td align="left">0.966</td>
<td align="left">0.56</td>
<td align="left">64.61</td>
<td align="left">0.97</td>
<td align="left">0.13</td>
<td align="left">66.41</td>
<td align="left">0.998</td>
<td align="left">0.19</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">51.34</td>
<td align="left">0.949</td>
<td align="left">0.57</td>
<td align="left">63.78</td>
<td align="left">0.977</td>
<td align="left">0.25</td>
<td align="left">65.89</td>
<td align="left">0.998</td>
<td align="left">0.26</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">51.10</td>
<td align="left">0.952</td>
<td align="left">0.59</td>
<td align="left">62.01</td>
<td align="left">0.964</td>
<td align="left">0.26</td>
<td align="left">64.21</td>
<td align="left">0.997</td>
<td align="left">0.28</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">50.66</td>
<td align="left">0.962</td>
<td align="left">0.61</td>
<td align="left">62.50</td>
<td align="left">0.960</td>
<td align="left">0.12</td>
<td align="left">63.52</td>
<td align="left">0.996</td>
<td align="left">0.33</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">50.12</td>
<td align="left">0.931</td>
<td align="left">0.62</td>
<td align="left">61.09</td>
<td align="left">0.944</td>
<td align="left">0.21</td>
<td align="left">62.11</td>
<td align="left">0.995</td>
<td align="left">0.31</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_4"><label>4.4</label><title>Performance Analysis</title>
<p><?A3B2 "fig7",5,"anchor"?><?A3B2 "fig8",5,"anchor"?><?A3B2 "fig9",5,"anchor"?><xref ref-type="fig" rid="fig-7 fig-8 fig-9">Figs. 7&#x2013;9</xref> represents the comparative analysis of the proposed technique with different existing enhancement techniques such as Local phase-based bone enhancement (LPBE) &#x0026; Bone shadow region enhancement (BSRE). The analysis compares the PSNR, SSIM &#x0026;MSR value of the proposed and existing techniques. Considering MSE, the proposed algorithm attains a minimum MSE of 0.01 at the maximum iteration. Considering PSNR, the highest PSNR value is attained 62.1 to 69.7 for the proposed. Considering SSIM, the graph linearly increases from 0.91 to 0.99 for the iterations. Compared to other techniques, the proposed algorithm attains a better SSIM of 0.999 at the maximum iteration. From the analysis graph it clearly shown that the proposed technique has better enhancement output. <?A3B2 "tbl2",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref> signifies the Performance evaluation of knee OA segmentation.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>Comparative analysis of PSNR existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-7.png"/>
</fig>
<fig id="fig-8"><label>Figure 8</label><caption><title>Comparative analysis of SSIM existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-8.png"/></fig>
<fig id="fig-9"><label>Figure 9</label><caption><title>Comparative analysis of MSE existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-9.png"/>
</fig>
<table-wrap id="table-2">
<label>Table 2</label><caption><title>Performance evaluation of knee OA segmentation</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Patient number</th>
<th align="left" colspan="3">Active contour</th>
<th align="left" colspan="3">Ostu threshold</th>
<th align="left" colspan="3">Proposed threshold tech<break/>(Niblack Bernsen)</th>
</tr>
<tr>
<th align="left"/>
<th align="left">Accuracy</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
<th align="left">Accuracy</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
<th align="left">Accuracy</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">70.5</td>
<td align="left">72.3</td>
<td align="left">78.4</td>
<td align="left">77.2</td>
<td align="left">76.0</td>
<td align="left">80.1</td>
<td align="left">98.3</td>
<td align="left">98.1</td>
<td align="left">89.2</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">87.5</td>
<td align="left">77.3</td>
<td align="left">76.6</td>
<td align="left">78.9</td>
<td align="left">71.5</td>
<td align="left">85.4</td>
<td align="left">96.3</td>
<td align="left">95.7</td>
<td align="left">88.2</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">82.1</td>
<td align="left">66.4</td>
<td align="left">77.3</td>
<td align="left">75.6</td>
<td align="left">66.5</td>
<td align="left">76.5</td>
<td align="left">98.6</td>
<td align="left">89.4</td>
<td align="left">98.1</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">69.8</td>
<td align="left">81.5</td>
<td align="left">69.1</td>
<td align="left">65.5</td>
<td align="left">76.8</td>
<td align="left">77.1</td>
<td align="left">89.2</td>
<td align="left">88.3</td>
<td align="left">96.2</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">66.5</td>
<td align="left">79.9</td>
<td align="left">88.2</td>
<td align="left">71.3</td>
<td align="left">67.6</td>
<td align="left">74.2</td>
<td align="left">97.5</td>
<td align="left">87.4</td>
<td align="left">96.4</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">70.5</td>
<td align="left">83.2</td>
<td align="left">83.4</td>
<td align="left">72.4</td>
<td align="left">66.8</td>
<td align="left">77.4</td>
<td align="left">99.1</td>
<td align="left">98.4</td>
<td align="left">95.4</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">73.4</td>
<td align="left">88.2</td>
<td align="left">87.4</td>
<td align="left">75.4</td>
<td align="left">78.9</td>
<td align="left">76</td>
<td align="left">91.7</td>
<td align="left">95.6</td>
<td align="left">97.9</td>
</tr>
<tr>
<td align="left">8</td>
<td align="left">87.1</td>
<td align="left">69.4</td>
<td align="left">77.9</td>
<td align="left">79.5</td>
<td align="left">79.1</td>
<td align="left">74.5</td>
<td align="left">93.6</td>
<td align="left">93.5</td>
<td align="left">95.7</td>
</tr>
<tr>
<td align="left">9</td>
<td align="left">65.8</td>
<td align="left">71.4</td>
<td align="left">76.8</td>
<td align="left">86.3</td>
<td align="left">74.2</td>
<td align="left">77.7</td>
<td align="left">95.4</td>
<td align="left">94.3</td>
<td align="left">91.4</td>
</tr>
<tr>
<td align="left">10</td>
<td align="left">75.9</td>
<td align="left">73.5</td>
<td align="left">73.0</td>
<td align="left">88.4</td>
<td align="left">76.3</td>
<td align="left">74.5</td>
<td align="left">92.2</td>
<td align="left">90.1</td>
<td align="left">99.1</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The comparative analysis of existing techniques with our proposed may show the outcome of accuracy of Knee OA segmentation technique is shown in <?A3B2 "fig10",5,"anchor"?><xref ref-type="fig" rid="fig-10">Fig. 10</xref>. Accuracy refers to the degree to which reliable information in a spatial point is consistent with data on the categorized image. It&#x0027;s simple to figure out by dividing the number of correct guesses by the total number of predictions. The accuracy may be high when compared with existing techniques like Active contour and Ostu thresholding technique.</p>
<fig id="fig-10"><label>Figure 10</label><caption><title>Comparative analysis of accuracy existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-10.png"/></fig>
<p>The percentage of actual positive values that are accurately detected is measured by sensitivity, while the percentage of negative values that are correctly identified is measured by specificity. The proportion of people who got a positive response on this test who truly have the illness is called sensitivity. The sensitivity had increased in our proposed technique when comparing with existing methods like active contour and Ostu thresholding technique is represented in <?A3B2 "fig11",5,"anchor"?><xref ref-type="fig" rid="fig-11">Fig. 11</xref>.</p>
<fig id="fig-11"><label>Figure 11</label><caption><title>Comparative analysis of sensitivity existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-11.png"/></fig>
<p>The sensitivity had increased in our proposed technique when comparing with existing methods like active contour and Ostu thresholding technique, which is shown in <?A3B2 "fig12",5,"anchor"?><xref ref-type="fig" rid="fig-12">Fig. 12</xref>. Comparison result of specificity shows our proposed technique increases. The average difference between the existing and proposed method had a great change. By using position checking and a semantic measure, Accuracy enhancement is the limitation of the work.</p>
<fig id="fig-12"><label>Figure 12</label><caption><title>Specificity comparison of existing with our proposed</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23745-fig-12.png"/></fig>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Conclusion</title>
<p>This paper proposes an EHO algorithm based on thresholding and segmentation to improve the efficiency of the CT image. The efficiency can be evaluated by accuracy, sensitivity and specificity. The image characteristics become more significant when the image is enhanced. The CT image enhancement relies on the image normalization followed by the enhancement of the image using histogram correlation. The further segmentation of the image takes place using the thresholding techniques named by EHO assimilated Niblack and Bernsen optimization. The time-efficient utility is needed to be enhanced in this approach for future enhancement.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This research work was fully supported by King Khalid University, Abha, Kingdom of Saudi Arabia, for funding this work through a General Research Project under grant number RGP/119/42.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> All authors declare that they have no conflicts of interest regarding the publication of this manuscript.</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>C.</given-names> <surname>Kokkotis</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Moustakidis</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Papageorgiou</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Giakas</surname></string-name> and <string-name><given-names>D. E.</given-names> <surname>Tsaopoulos</surname></string-name></person-group>, &#x201C;<article-title>Machine learning in knee osteoarthritis: A review</article-title>,&#x201D; <source>Osteoarthritis and Cartilage</source>, vol. <volume>2</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>13</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>J.</given-names> <surname>Victor</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Van Doninck</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Labey</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Innocenti</surname></string-name>, <string-name><given-names>P. M.</given-names> <surname>Parizel</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>How precise can bony landmarks be determined on a CT scan of the knee?</article-title>,&#x201D; <source>The Knee</source>, vol. <volume>16</volume>, no. <issue>5</issue>, pp. <fpage>358</fpage>&#x2013;<lpage>365</lpage>, <year>2009</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. H.</given-names> <surname>McCollough</surname></string-name>, <string-name><given-names>J. T.</given-names> <surname>Bushberg</surname></string-name>, <string-name><given-names>J. G.</given-names> <surname>Fletcher</surname></string-name> and <string-name><given-names>L. J.</given-names> <surname>Eckel</surname></string-name></person-group>, &#x201C;<article-title>Answers to common questions about the use and safety of CT scans</article-title>,&#x201D; <source>Mayo Clinic Proceedings</source>, vol. <volume>90</volume>, no. <issue>10</issue>, pp. <fpage>1380</fpage>&#x2013;<lpage>1392</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Antony</surname></string-name>, <string-name><given-names>K.</given-names> <surname>McGuinness</surname></string-name>, <string-name><given-names>N. E.</given-names> <surname>O&#x0027;Connor</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Moran</surname></string-name></person-group>, &#x201C;<article-title>Quantifying radiographic knee osteoarthritis severity using deep convolutional neural networks</article-title>,&#x201D; in <conf-name>23rd Int. Conf. on Pattern Recognition (ICPR)</conf-name>, <conf-loc>Cancun, Mexico</conf-loc>, pp. <fpage>1195</fpage>&#x2013;<lpage>1200</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Raj</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Vishwanathan</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Ajani</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Krishnan</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Automatic knee cartilage segmentation using fully volumetric convolutional neural networks for evaluation of osteoarthritis</article-title>,&#x201D; in <conf-name>IEEE 15th Int. Symposium on Biomedical Imaging</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, pp. <fpage>851</fpage>&#x2013;<lpage>854</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Jang</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Samsonov</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Zhao</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Deep convolutional neural network and 3D deformable approach for tissue segmentation in musculoskeletal magnetic resonance imaging</article-title>,&#x201D; <source>Magnetic Resonance in Medicine</source>, vol. <volume>79</volume>, no. <issue>4</issue>, pp. <fpage>2379</fpage>&#x2013;<lpage>2391</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P. R.</given-names> <surname>Desai</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hacihaliloglu</surname></string-name></person-group>, &#x201C;<article-title>Enhancement and automated segmentation of ultrasound knee cartilage for early diagnosis of knee osteoarthritis</article-title>,&#x201D; in <conf-name>IEEE 15th Int. Symposium on Biomedical Imaging (ISBI 2018)</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, pp. <fpage>1471</fpage>&#x2013;<lpage>1474</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Merkle</surname></string-name>, <string-name><given-names>J. B.</given-names> <surname>Singla</surname></string-name>, <string-name><given-names>K.</given-names> <surname>M&#x00FC;ller</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Wiegand</surname></string-name></person-group>, &#x201C;<article-title>Correlation histogram analysis of depth-enhanced 3D video coding</article-title>,&#x201D; in <conf-name>IEEE Int. Conf. on Image Processing</conf-name>, <conf-loc>Hong Kong, China</conf-loc>, pp. <fpage>2605</fpage>&#x2013;<lpage>2608</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H. B.</given-names> <surname>Kekre</surname></string-name> and <string-name><given-names>S. D.</given-names> <surname>Thepade</surname></string-name></person-group>, &#x201C;<article-title>Color traits transfer to grayscale images</article-title>,&#x201D; in <conf-name>First Int. Conf. on Emerging Trends in Engineering and Technology</conf-name>, <conf-loc>Nagpur, India</conf-loc>, pp. <fpage>82</fpage>&#x2013;<lpage>85</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Vincent</surname></string-name></person-group>, &#x201C;<article-title>Grayscale area openings and closings, their efficient implementation and applications</article-title>,&#x201D; in <conf-name>EURASIP Workshop on Mathematical Morphology and its Applications to Signal Processing</conf-name>, <conf-loc>Barcelona, Spain</conf-loc>, pp. <fpage>22</fpage>&#x2013;<lpage>27</lpage>, <year>1993</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Qin</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Image segmentation based on histogram analysis utilizing the cloud model</article-title>,&#x201D; <source>Computers &#x0026; Mathematics with Applications</source>, vol. <volume>62</volume>, no. <issue>7</issue>, pp. <fpage>2824</fpage>&#x2013;<lpage>2833</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. Y.</given-names> <surname>Chai</surname></string-name>, <string-name><given-names>T. T.</given-names> <surname>Swee</surname></string-name>, <string-name><given-names>G. H.</given-names> <surname>Seng</surname></string-name> and <string-name><given-names>L. K.</given-names> <surname>Wee</surname></string-name></person-group>, &#x201C;<article-title>Multipurpose contrast enhancement on epi-physeal plates and ossification centers for bone age assessment</article-title>,&#x201D; <source>Biomedical Engineering</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>19</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y. C.</given-names> <surname>Hum</surname></string-name>, <string-name><given-names>K. W.</given-names> <surname>Lai</surname></string-name> and <string-name><given-names>M. I.</given-names> <surname>Mohamad Salim</surname></string-name></person-group>, &#x201C;<article-title>Multiobjectives bihistogram equalization for image contrast enhancement</article-title>,&#x201D; <source>Complexity</source>, vol. <volume>20</volume>, no. <issue>2</issue>, pp. <fpage>22</fpage>&#x2013;<lpage>36</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Wongsritong</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Kittayaruasiriwat</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Cheevasuvit</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Dejhan</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Somboonkaew</surname></string-name></person-group>, &#x201C;<article-title>Contrast enhancement using multipeak histogram equalization with brightness preserving</article-title>,&#x201D; in <conf-name>APCCAS IEEE Asia-Pacific Conf. on Circuits and Systems. Microelectronics and Integrating Systems Proc.</conf-name>, <conf-loc>Chiang Mai, Thailand</conf-loc>, pp. <fpage>455</fpage>&#x2013;<lpage>458</lpage>, <year>1998</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. M.</given-names> <surname>Fatihin</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Baskoro</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Anifah</surname></string-name></person-group>, &#x201C;<article-title>Texture analysis of knee osteoarthritis using contrast limited adaptive histogram equalization based gray level co-occurrent matrix</article-title>,&#x201D; in <conf-name>Third Int. Conf. on Vocational Education and Electrical Engineering (ICVEE)</conf-name>, <conf-loc>Surabaya, Indonesia</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>4</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kashyap</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Rao</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Sonka</surname></string-name></person-group>, &#x201C;<article-title>Learning-based cost functions for 3-d and 4-d multi-surface multi-object segmentation of knee mri: Data from the osteoarthritis initiative</article-title>,&#x201D; <source>IEEE Transactions on Medical Imaging</source>, vol. <volume>37</volume>, no. <issue>5</issue>, pp. <fpage>1103</fpage>&#x2013;<lpage>1113</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Raj</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Vishwanathan</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Ajani</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Krishnan</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Automatic knee cartilage segmentation using fully volumetric convolutional neural networks for evaluation of osteoarthritis</article-title>,&#x201D; in <conf-name>IEEE 15th Int. Symposium on Biomedical Imaging (ISBI 2018)</conf-name>, <conf-loc>Washington, DC, USA</conf-loc>, pp. <fpage>851</fpage>&#x2013;<lpage>854</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. S.</given-names> <surname>Gornale</surname></string-name>, <string-name><given-names>P. U.</given-names> <surname>Patravali</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Uppin</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Hiremath</surname></string-name></person-group>, &#x201C;<article-title>Study of segmentation techniques for assessment of osteoarthritis in knee X-ray images</article-title>,&#x201D; <source>International Journal of Image, Graphics and Signal Processing (IJIGSP)</source>, vol. <volume>11</volume>, no. <issue>2</issue>, pp. <fpage>48</fpage>&#x2013;<lpage>57</lpage>, <year>2019</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>H.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Xie</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Cui</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhao</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Ning</surname></string-name></person-group>, &#x201C;<article-title>Hyper spectral image restoration via CNN denoiser prior regularized low-rank tensor recovery</article-title>,&#x201D; <source>Computer Vision and Image Understanding</source>, vol. <volume>197</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>11</lpage>, <year>2020</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>Wang</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Wen</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Tao</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Segmentation-aware image denoising without knowing true segmentation</article-title>,&#x201D; ArXiv preprint ArXiv, arXiv:1905.08965, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. S.</given-names> <surname>Gornale</surname></string-name>, <string-name><given-names>P. U.</given-names> <surname>Patravali</surname></string-name>, <string-name><given-names>K. S.</given-names> <surname>Marathe</surname></string-name> and <string-name><given-names>P. S.</given-names> <surname>Hiremath</surname></string-name></person-group>, &#x201C;<article-title>Determination of osteoarthritis using histogram of oriented gradients and multiclass SVM</article-title>,&#x201D; <source>International Journal of Image, Graphics and Signal Processing</source>, vol. <volume>9</volume>, no. <issue>12</issue>, pp. <fpage>41</fpage>&#x2013;<lpage>49</lpage>, <year>2017</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>P.</given-names> <surname>Desai</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hacihaliloglu</surname></string-name></person-group>, &#x201C;<article-title>Knee-cartilage segmentation and thickness measurement from 2D ultrasound</article-title>,&#x201D; <source>Journal of Imaging</source>, vol. <volume>5</volume>, no. <issue>4</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>17</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Kaur</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Sofat</surname></string-name> and <string-name><given-names>D. K.</given-names> <surname>Chouhan</surname></string-name></person-group>, &#x201C;<article-title>Review of automated segmentation approaches for knee images</article-title>,&#x201D; <source>IET Image Processing</source>, vol. <volume>15</volume>, no. <issue>2</issue>, pp. <fpage>302</fpage>&#x2013;<lpage>324</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. S. S.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>T. T.</given-names> <surname>Swee</surname></string-name>, <string-name><given-names>A. B.</given-names> <surname>Yahya</surname></string-name>, <string-name><given-names>M. T. F.</given-names> <surname>Thye</surname></string-name>, <string-name><given-names>K. L. C.</given-names> <surname>Hiik</surname></string-name> <etal>et al.</etal></person-group>, &#x201C;<article-title>Prominent region of interest contrast enhancement for knee MR images: Data from the OAI</article-title>,&#x201D; <source>Journal Kejuruteraan</source>, vol. <volume>32</volume>, no. <issue>3</issue>, pp. <fpage>145</fpage>&#x2013;<lpage>155</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. Y.</given-names> <surname>Chai</surname></string-name>, <string-name><given-names>T. T.</given-names> <surname>Swee</surname></string-name>, <string-name><given-names>G. H.</given-names> <surname>Seng</surname></string-name> and <string-name><given-names>L. K.</given-names> <surname>Wee</surname></string-name></person-group>, &#x201C;<article-title>Multipurpose contrast enhancement on epiphysis plates and ossification centers for bone age assessment</article-title>,&#x201D; <source>Biomedical Engineering</source>, vol. <volume>12</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>19</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Kang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Engelke</surname></string-name> and <string-name><given-names>W. A.</given-names> <surname>Kalender</surname></string-name></person-group>, &#x201C;<article-title>A new accurate and precise 3-D segmentation method for skeletal structures in volumetric CT data</article-title>,&#x201D; <source>IEEE Transactions on Medical Imaging</source>, vol. <volume>22</volume>, no. <issue>5</issue>, pp. <fpage>586</fpage>&#x2013;<lpage>598</lpage>, <year>2003</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>