<?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">30872</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.030872</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Intelligent Machine Learning Enabled Retinal Blood Vessel Segmentation and Classification</article-title>
<alt-title alt-title-type="left-running-head">Intelligent Machine Learning Enabled Retinal Blood Vessel Segmentation and Classification</alt-title>
<alt-title alt-title-type="right-running-head">Intelligent Machine Learning Enabled Retinal Blood Vessel Segmentation and Classification</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alkhaldi</surname><given-names>Nora Abdullah</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>nalkhaldi@kfu.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Halawani</surname><given-names>Hanan T.</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, College of Computer Science and Information Technology, King Faisal University</institution>, P.O. Box 400, <addr-line>AlAhsa, 31982</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>College of Computer Science and Information Systems, Najran University</institution>, <addr-line>Najran, 61441</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Nora Abdullah Alkhaldi. Email: <email>nalkhaldi@kfu.edu.sa</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-16"><day>16</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>74</volume>
<issue>1</issue>
<fpage>399</fpage>
<lpage>414</lpage>
<history>
<date date-type="received"><day>04</day><month>4</month><year>2022</year></date>
<date date-type="accepted"><day>06</day><month>5</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Alkhaldi and Halawani</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Alkhaldi and Halawani</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_30872.pdf"></self-uri>
<abstract>
<p>Automated segmentation of blood vessels in retinal fundus images is essential for medical image analysis. The segmentation of retinal vessels is assumed to be essential to the progress of the decision support system for initial analysis and treatment of retinal disease. This article develops a new Grasshopper Optimization with Fuzzy Edge Detection based Retinal Blood Vessel Segmentation and Classification (GOFED-RBVSC) model. The proposed GOFED-RBVSC model initially employs contrast enhancement process. Besides, GOAFED approach is employed to detect the edges in the retinal fundus images in which the use of GOA adjusts the membership functions. The ORB (Oriented FAST and Rotated BRIEF) feature extractor is exploited to generate feature vectors. Finally, Improved Conditional Variational Auto Encoder (ICAVE) is utilized for retinal image classification, shows the novelty of the work. The performance validation of the GOFED-RBVSC model is tested using benchmark dataset, and the comparative study highlighted the betterment of the GOFED-RBVSC model over the recent approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Edge detection</kwd>
<kwd>blood vessel segmentation</kwd>
<kwd>retinal fundus images</kwd>
<kwd>image classification</kwd>
<kwd>deep learning</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Recent advancements permit fundus images to be done by using smartphones with a traditional handheld indirect ophthalmoscopy lens. Several medical experts, namely orthoptists, ophthalmologists, and optometrists, check for conditions or healthcare problems through retinal fundus images [<xref ref-type="bibr" rid="ref-1">1</xref>]. Additionally, observing the retina change in fundus images is a means to check a person undergoing anti-malarial therapy [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. Retinal vessel segmentation is an effective method to examine arteries and veins in the retinal area. Medical experts use fundus imaging to find several kinds of healthcare problems, and blood vessel segmentation is very important in the analysis method [<xref ref-type="bibr" rid="ref-4">4</xref>]. In recent times, fundus vessel segmentation method was created because of its significance. The output from a manual segmentation is the correct form of output. Manual segmentation is as easy; however, it is a dull process [<xref ref-type="bibr" rid="ref-5">5</xref>]. It may also be subject to mistakes owing to its tiredness. Moreover, there are variances among segmentation outcomes from different individuals because each person may convert the image differently. Therefore, simpler and quicker segmentation techniques must be designed [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>The way towards sorting and positioning sharp discontinuities in an image is termed edge detection [<xref ref-type="bibr" rid="ref-7">7</xref>]. The discontinuities are immediate variations in pixel concentration that identify the blood vessels in a retinal image [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>]. Conventional methods for edge recognition link with convolving the image by an operator, which is enhanced to be sharp to massive gradients in the image though returning value of zero in uniform zones. There is a lot of edge detecting approaches offered; every technique is planned to be perceptive to specific forms of edges [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Orujov&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-11">11</xref>] propose a contour recognition based image processing technique based Mamdani (Type-2) fuzzy rules. The presented technique employs the green channel dataset from retinal fundus image as input, median filter for excluding background, and contrast limited adaptive histogram equalization (CLAHE) is applied for enhancing contrast. The researchers in [<xref ref-type="bibr" rid="ref-12">12</xref>] present the retinal image extraction and segmentation of blood vessels through thresholding, morphological processing, adaptive histogram equalization, and edge recognition. Roy&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-13">13</xref>] designed a Clifford matched filter as a mask that operates for extracting retinal blood vessels. The edge point is denoted as a scalar unit or Grade-0 vector. Discrete edge point alongside the edge of blood vessel is the edge pixel rather than constant edge.</p>
<p>Ooi&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-14">14</xref>] developed the operation of semi-automatic image segmentation in retinal images through a user interface based operation that enables distinct edge recognition variables on distinct regions of similar images. Tchinda&#x00A0;et&#x00A0;al.&#x00A0;[<xref ref-type="bibr" rid="ref-15">15</xref>] introduces a novel methodology for segmenting blood vessels. This technique depends on traditional edge recognition filter and artificial neural network (ANN). Initially, edge detection filter is exploited for extracting the feature vector. The resultant feature is utilized for training an ANN system.</p>
<p>This article develops a new Grasshopper Optimization with Fuzzy Edge Detection based Retinal Blood Vessel Segmentation and Classification (GOFED-RBVSC) model. The proposed GOFED-RBVSC model initially employs contrast enhancement process. Besides, GOAFED approach is employed to detect the edges in the retinal fundus images in which the membership functions are adjusted by the use of grasshopper optimization algorithm (GOA). Followed by ORB (Oriented FAST and Rotated BRIEF) feature extractor is exploited to generate feature vectors. Finally, Improved Conditional Variational Auto Encoder (ICAVE) is utilized for retinal image classification. The performance validation of the GOFED-RBVSC model is tested using a benchmark dataset.</p>
</sec>
<sec id="s2"><label>2</label><title>The Proposed Model</title>
<p>In this study, a new GOFED-RBVSC model has been developed for effectively detecting the blood vessels and classifying retinal fundus images. Primarily, the GOFED-RBVSC model employed contrast enhancement process. In addition, GOAFED technique is exploited to recognize the edges in the retinal fundus images in which the membership functions are adjusted by the use of GOA. Followed by, ORB feature extractor is exploited to generate feature vectors. Finally, ICAVE model can be employed to classify retinal images. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> demonstrates the overall block diagram of GOFED-RBVSC technique.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Block diagram of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-1.png"/></fig>
<sec id="s2_1"><label>2.1</label><title>Edge Detection Using GOAFED Model</title>
<p>At the preliminary level, the images are pre-processed, and the edges are identified using the GOAFED model. Fuzzy set <italic>A</italic> denotes the set of collectively arranged pairs composed of the components <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>&#x03C7;</mml:mi></mml:math></inline-formula> of the universal set <italic>X</italic> and the membership degree <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></disp-formula></p>
<p>Now <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> indicates a membership function that take value in the linear order subset within <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula> The presented technique employs the Gaussian membership operation defined in the following equation:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03BA;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>Now <italic>m</italic> and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>&#x03BA;</mml:mi></mml:math></inline-formula> indicate the center and width of fuzzy subset <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>A</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula> The Mamdani (Type-2) fuzzy rule was utilized. Fuzzy operation is executed as two Type- 1 membership functions: Footprint of Uncertainty (FOU), Upper Membership Function (UMF) and Lower Membership Function (LMF). Amongst this function is the region of ambiguity where the technique selects the suitable variable. Parameter for membership function was carefully chosen for all the images. From the abovementioned, there are two linguistic parameters. Input membership function is Gaussian function [<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>Four characteristics: Vertical Gradient <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, Horizontal Gradient <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, Anti-diagonal Gradient <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></inline-formula> and Diagonal Gradient <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>Z</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are utilized by the crisp input. The Fuzzifier employs Gaussian membership function for <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>&#x03C7;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> with the linguistic variable. The primary value for the UMF have been experimentally chosen, whereas the primary value for the LMF is chosen for all the images separately, with the statistical model. Multi-threshold Otsu approach has been utilized for finding the thresholding values and later utilized in LMF method for Input Membership Function.</p>
<p>The rest of the features are configured correspondingly with two linguistic parameters. In the fuzzy scheme, the following rule has been determined when the input value from each gradient are black, as well as determine NotEdge. The primary value for the UMF and LMF functions are experimentally chosen.</p>
<p>Fuzzy edge detection can be implemented according to the fuzzy selection of the maximal gradient. The scheme was capable of adapting all the images through the Fuzzy Type-2 operation.</p>
<p>To optimally tune the MFs involved in the FED model, the GOA is utilized. A Grasshopper is an insect and separated into a bug. Generally, the plant harvest fails when it uses all the plant crops. The grasshopper swarm composed of distinctive trademark, in which the adults and swarm nymph [<xref ref-type="bibr" rid="ref-16">16</xref>] are existing. The swarming nymph has significant positioning in a larval phase. It can be expressed in the following equation.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Gravit</mml:mtext></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>
Whereas <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mspace width="thickmathspace" /><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> symbolizes a wind advection, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>S</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the social transmission, and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:mtext mathvariant="italic">Gravit</mml:mtext></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the gravity force on i-th grasshoppers. To solve the grasshopper problem, certain functions are emerged from gravitational force, social transmission and wind advection. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates the flowchart of GOA. With small benefits, it is impossible to generate varied solid energy amongst grasshoppers with wide separations amongst others. This issue could be solved by utilizing grasshoppers&#x2019; isolation and mapping [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. Therefore, it can be illustrated as follows
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>S</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>j</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mi>S</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Flowchart of GOA</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-2.png"/></fig>
<p>Thus, <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> whereas <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the distance from <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>j</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> grasshopper, Soc indicates the efficacy of social force and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes a unit vector from <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>j</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:math></inline-formula> grasshoppers. <italic>N</italic> signifies the amount of grasshoppers. The <italic>s</italic> function describes the social force as defined in the following:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>S</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext mathvariant="italic">force</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mi>f</mml:mi><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>k</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>
Whereas <italic>l</italic> denotes the attractive length scale, <italic>f</italic> illustrates the intensity of attraction, and the capability can be illustrated. The gravitational force <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="italic">Gravit</mml:mtext></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> of grasshopper is operated in the below equations. A nymph grasshopper does not have wings, and the deployment exceeds the wind direction.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mtext mathvariant="italic">Gravit</mml:mtext></mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>z</mml:mi><mml:mi>l</mml:mi><mml:mi>g</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mtext mathvariant="italic">drift</mml:mtext></mml:mrow></mml:math></disp-formula></p>
<p>Now, <italic>g</italic> represents the gravitational constant, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>g</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> denotes a unity vector, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>l</mml:mi></mml:math></inline-formula> denotes a constant drift and <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>g</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mrow><mml:mtext mathvariant="italic">drift</mml:mtext></mml:mrow></mml:math></inline-formula> characterizes a unit vector toward the wind direction. To resolve the issue, stochastic technique needs to execute exploration and exploitation phases to choose precise estimation of global optimal that is given in the following equation,
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mi>S</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>&#x2212;</mml:mo><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>z</mml:mi><mml:mi>l</mml:mi><mml:mi>g</mml:mi><mml:mi>r</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mrow><mml:mtext mathvariant="italic">drift</mml:mtext></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The arithmetical approach is effective by limited parameters for exploitation and exploration in optimization phases.</p>
</sec>
<sec id="s2_2"><label>2.2</label><title>ORB Feature Extractor</title>
<p>Next to the edge detection process, the ORB feature extractor is exploited to make feature vectors. The pre-processed image was distributed to the ORB-based feature extracted to generate a valuable group of features. Orientation elements were more in FAST, which utilizes robust measured of corner orientations [<xref ref-type="bibr" rid="ref-17">17</xref>]. The patch moment was utilized for detecting centroid as:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mtext>q</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:msup><mml:mi>x</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mi>y</mml:mi><mml:mrow><mml:mrow><mml:mtext>q</mml:mtext></mml:mrow></mml:mrow></mml:msup><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
Whereas <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mtext>q</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> signifies the <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>+</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> order moment of images their intensity <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> vary as a function of <italic>x</italic> &#x0026; <italic>y</italic> image co-ordinate.</p>
<p>Consider the moment in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>, the centroid was reached by using the following equation:
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>00</mml:mn></mml:mrow></mml:msub></mml:mfrac><mml:mrow><mml:mtext>&#x2032;</mml:mtext></mml:mrow><mml:mfrac><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>01</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>00</mml:mn></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The vector was developed in the centre of centroid <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mover><mml:mrow><mml:mi>O</mml:mi><mml:mi>C</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> afterward, the patch direction developed:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>&#x03B8;</mml:mi><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>01</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
Whereas atan2 implies the quadrant aware form of arctan. Let the concern of illumination parameters of corners which could not be deliberated due to the angle measured endure similar irrespective of corners. The rotational invariance was improved by promising the moment viz., estimated in terms of <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:math></inline-formula> &#x0026; <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo>,</mml:mo></mml:math></inline-formula> which remained from the circular region of <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow></mml:math></inline-formula> radius. A better selective for patch size signifies <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow></mml:math></inline-formula> that assures run of <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow></mml:math></inline-formula> is in &#x2013;r and r. Generally, utilizing Hessian measure, the <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mtext>C</mml:mtext></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></inline-formula> value is developed zero, it developed unstable however it could not occur utilizing FAST, promising to the scheme capabilities. Next, ORB has rotation aware modules called <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow></mml:math></inline-formula>-BRIEF; that is, an introduced procedure of steered BRIEF descriptor combined with compared learning step was defined to detect lesser correlated binary feature. To make sure an effectual Rotation of BRIEF, a bit string depiction of image patches was developed in a gathered binary intensity test [<xref ref-type="bibr" rid="ref-17">17</xref>]. In order to optimal depiction of convention BRIEF, previous an orientation elements were more to ORB whereas there is a smooth image patch&#x00A0;<inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow></mml:math></inline-formula>. Next, the binary test <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> is formulated as:
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>;</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>:</mml:mo></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>:</mml:mo></mml:mtd><mml:mtd><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>In which <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:mtext>p</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the intensity of patch pat and offered points <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mtext>x</mml:mtext></mml:mrow><mml:mo>.</mml:mo></mml:math></inline-formula></p>
<p>Accordingly, the feature is a patch function assumed as vector of <italic>n</italic> binary test was offered as:
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></mml:msubsup><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>During this case, it can be utilize Gaussian distribution nearby the centre of patches and selective vector length <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:math></inline-formula> as 256 (exhibited for producing reasonably result). Assumed that the feature subset of <italic>n</italic> binary test at particular location <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> A <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow></mml:math></inline-formula> matrix was defined as:
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mtable columnalign="left left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mtext>&#x2032;</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mrow><mml:mtext>&#x2032;</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Afterward, utilizing <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> (equivalent rotation matrix), and <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> (patch positioning) a steered versions <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of S was obtained as:
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow></mml:msub><mml:mi>S</mml:mi></mml:math></disp-formula></p>
<p>Afterward, the BRIEF steering function was provided as:
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03B8;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>:=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>&#x03B8;</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
</sec>
<sec id="s2_3"><label>2.3</label><title>Image Classification</title>
<p>In the final stage, the ICAVE model can be employed to classify retinal images [<xref ref-type="bibr" rid="ref-18">18</xref>]. It is modelled by conditioning the encoder and decoder to class <italic>Y</italic>. Now, the encoder <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" 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:math></inline-formula> is conditional on two parameters <italic>X</italic> and <italic>Y</italic>, as well as the decoder <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is conditioned on two parameters <italic>Z</italic> and Y. Therefore, the variation lower bound objective of CVAE [<xref ref-type="bibr" rid="ref-19">19</xref>] is described in the following:
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" 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 fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" 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:mrow><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mo>[</mml:mo></mml:mrow><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>]</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>[</mml:mo></mml:mrow><mml:mi>Q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The conditional likelihood distribution of CVAE encoder and decoder is associated with class label Y. Hence, it is given in the following:
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" 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:mrow><mml:mo>]</mml:mo><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mo>[</mml:mo></mml:mrow><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>]</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>[</mml:mo></mml:mrow><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo><mml:mo>.</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:mrow><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mtext>log</mml:mtext></mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>]</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>[</mml:mo></mml:mrow><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo><mml:mo>.</mml:mo></mml:math></disp-formula></p>
<p>Here, <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>,</mml:mo><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> comprises two parts: a KL divergence <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>K</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">[</mml:mo><mml:mi>Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula> and <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>log</mml:mi></mml:math></inline-formula> reconstruction possibility Elog <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>]. The initial term is to recrate <italic>X</italic> through the conditional likelihood distribution <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Z</mml:mi><mml:mo>,</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo></mml:math></inline-formula> and the next term employs the KL divergence metric to describe the, encoder distribution <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>Q</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>Z</mml:mi><mml:mi>X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> approximate the previous distribution <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>Y</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Result and Discussion</title>
<p>In this section, the experimental validation of the GOFED-RBVSC model is tested using the benchmark diabetic retinopathy [<xref ref-type="bibr" rid="ref-20">20</xref>] from Kaggle repository, which contains images under five distinct classes.</p>
<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> shows the sample set of images obtained by the edge detection process. The first row indicates the input fundus images (mild), and the edge detected image is shown in second row. The next row represnets the moderate retinal fundus image, and the respective edge detected version is given in the last row.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>a (Mild) and b (Moderate)</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-3.png"/></fig>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> demonstrates the confusion matrices offered by the GOFED-RBVSC model. On 70&#x0025; of training set (TRS), the GOFED-RBVSC model has recognized 17845 samples as normal, 1645 samples as mild, 3345 samples as moderate, 169 samples as severe, and 301 samples as proliferative. In addition, on 30&#x0025; of testing set (TSS), the GOFED-RBVSC method has identified 7676 samples as normal, 661 samples as mild, 1414 samples as moderate, 97 samples as severe, and 142 samples as proliferative.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Confusion matrix of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-4.png"/></fig>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> reports the overall classifier results of the GOFED-RBVSC model on different classes.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Result analysis of GOFED-RBVSC technique with distinct measures and classes</title></caption>
<table frame="hsides">
<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">Class labels</th>
<th align="left">Accuracy</th>
<th align="left">Precision</th>
<th align="left">Sensitivity</th>
<th align="left">Specificity</th>
<th align="left">F-score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" colspan="6">Training Set (70&#x0025;)</td>
</tr>
<tr>
<td align="left">Normal</td>
<td align="left">96.10</td>
<td align="left">95.88</td>
<td align="left">98.92</td>
<td align="left">88.30</td>
<td align="left">97.38</td>
</tr>
<tr>
<td align="left">Mild</td>
<td align="left">98.84</td>
<td align="left">89.65</td>
<td align="left">94.49</td>
<td align="left">99.17</td>
<td align="left">92.00</td>
</tr>
<tr>
<td align="left">Moderate</td>
<td align="left">97.52</td>
<td align="left">93.67</td>
<td align="left">89.70</td>
<td align="left">98.92</td>
<td align="left">91.64</td>
</tr>
<tr>
<td align="left">Severe</td>
<td align="left">98.10</td>
<td align="left">82.04</td>
<td align="left">28.17</td>
<td align="left">99.85</td>
<td align="left">41.94</td>
</tr>
<tr>
<td align="left">Proliferative</td>
<td align="left">99.02</td>
<td align="left">82.69</td>
<td align="left">62.97</td>
<td align="left">99.74</td>
<td align="left">71.50</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">97.91</td>
<td align="left">88.79</td>
<td align="left">74.85</td>
<td align="left">97.19</td>
<td align="left">78.89</td>
</tr>
<tr>
<td align="left" colspan="6">Testing Set (30&#x0025;)</td>
</tr>
<tr>
<td align="left">Normal</td>
<td align="left">96.24</td>
<td align="left">96.23</td>
<td align="left">98.78</td>
<td align="left">89.12</td>
<td align="left">97.49</td>
</tr>
<tr>
<td align="left">Mild</td>
<td align="left">98.73</td>
<td align="left">87.67</td>
<td align="left">94.16</td>
<td align="left">99.05</td>
<td align="left">90.80</td>
</tr>
<tr>
<td align="left">Moderate</td>
<td align="left">97.67</td>
<td align="left">93.52</td>
<td align="left">90.52</td>
<td align="left">98.91</td>
<td align="left">92.00</td>
</tr>
<tr>
<td align="left">Severe</td>
<td align="left">98.17</td>
<td align="left">85.09</td>
<td align="left">35.53</td>
<td align="left">99.83</td>
<td align="left">50.13</td>
</tr>
<tr>
<td align="left">Proliferative</td>
<td align="left">98.79</td>
<td align="left">78.45</td>
<td align="left">61.74</td>
<td align="left">99.62</td>
<td align="left">69.10</td>
</tr>
<tr>
<td align="left">Average</td>
<td align="left">97.92</td>
<td align="left">88.19</td>
<td align="left">76.15</td>
<td align="left">97.31</td>
<td align="left">79.90</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> portrays the retinal fundus classification outcomes of the GOFED-RBVSC model on 70&#x0025; of TRS. The GOFED-RBVSC model has recognized normal images with <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.10&#x0025;, 95.88&#x0025;, 98.92&#x0025;, 88.30&#x0025;, and 97.38&#x0025; respectively. At the same time, Moreover, the GOFED-RBVSC method has identified Proliferative images with <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 99.02&#x0025;, 82.69&#x0025;, 62.97&#x0025;, 99.74&#x0025;, and 71.50&#x0025; correspondingly.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>Result analysis of GOFED-RBVSC technique on 70&#x0025; of TRS</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-5.png"/></fig>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> depicts the retinal fundus classification outcomes of the GOFED-RBVSC method on 30&#x0025; of TSS. The GOFED-RBVSC model has recognized normal images with <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 96.24&#x0025;, 96.23&#x0025;, 98.78&#x0025;, 89.12&#x0025;, and 97.49&#x0025; respectively. At the same time, Furthermore, the GOFED-RBVSC model has detected Proliferative images with <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mrow><mml:mtext mathvariant="italic">score</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> of 98.79&#x0025;, 78.45&#x0025;, 61.74&#x0025;, 99.62&#x0025;, and 69.10&#x0025; correspondingly.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>Result analysis of GOFED-RBVSC technique on 30&#x0025; of TSS</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-6.png"/></fig>
<p>The training accuracy (TA) and validation accuracy (VA) attained by the GOFED-RBVSC model on test dataset is demonstrated in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The experimental outcomes implied that the GOFED-RBVSC model had gained maximum values of TA and VA. In specific, the VA is seemed to be higher than TA.</p>
<fig id="fig-7"><label>Figure 7</label><caption><title>TA and VA graph analysis of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-7.png"/></fig>
<p>The training loss (TL) and validation loss (VL) achieved by the GOFED-RBVSC model on test dataset are established in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The experimental outcomes inferred that the GOFED-RBVSC model had accomplished least values of TL and VL. In specific, the VL is seemed to be lower than TL.</p>
<fig id="fig-8"><label>Figure 8</label><caption><title>TL and VL graph analysis of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-8.png"/></fig>
<p>A brief precision-recall examination of the GOFED-RBVSC model on test dataset is portrayed in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. By observing the figure, it is noticed that the GOFED-RBVSC model has accomplished maximum precision-recall performance under all classes.</p>
<fig id="fig-9"><label>Figure 9</label><caption><title>Precision-recall curve analysis of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-9.png"/></fig>
<p>A detailed ROC investigation of the GOFED-RBVSC model on test dataset is portrayed in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. The results indicated that the GOFED-RBVSC model had exhibited its ability in categorizing five different classes such as normal, mild, moderate, severe, and proliferative on the test datasets.</p>
<fig id="fig-10"><label>Figure 10</label><caption><title>ROC curve analysis of GOFED-RBVSC technique</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-10.png"/></fig>
<p>Extensive comparative study of the GOFED-RBVSC model with other models is made in <xref ref-type="table" rid="table-2">Tab. 2</xref> [<xref ref-type="bibr" rid="ref-21">21</xref>&#x2013;<xref ref-type="bibr" rid="ref-23">23</xref>].</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Comparative analysis of GOFED-RBVSC technique with existing approaches</title></caption>
<table frame="hsides">
<colgroup>
<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">Sensitivity</th>
<th align="left">Specificity</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">GOFED-RBVSC</td>
<td align="left">97.92</td>
<td align="left">76.15</td>
<td align="left">97.31</td>
</tr>
<tr>
<td align="left">RestNet-101</td>
<td align="left">90.54</td>
<td align="left">75.08</td>
<td align="left">93.49</td>
</tr>
<tr>
<td align="left">ResNet model</td>
<td align="left">84.10</td>
<td align="left">67.14</td>
<td align="left">88.93</td>
</tr>
<tr>
<td align="left">VGG-s model</td>
<td align="left">74.78</td>
<td align="left">33.17</td>
<td align="left">94.71</td>
</tr>
<tr>
<td align="left">VGG-16 model</td>
<td align="left">49.18</td>
<td align="left">74.89</td>
<td align="left">30.56</td>
</tr>
<tr>
<td align="left">VGG-19 model</td>
<td align="left">82.55</td>
<td align="left">55.09</td>
<td align="left">95.33</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> reports a detailed <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> examination of the GOFED-RBVSC model with existing models. The results indicated that the visual geometry group (VGG)-16 model has reached ineffectual outcome with lower <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 49.18&#x0025;. Followed by the VGG-s model has resulted in slightly enhanced performance with <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 74.78&#x0025;. At the same time, ResNet and VGG-19 models have obtained closer <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 84.10&#x0025; and 82.55&#x0025;, respectively. However, the GOFED-RBVSC model has attained higher <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.92&#x0025;.</p>
<fig id="fig-11"><label>Figure 11</label><caption><title><inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of GOFED-RBVSC technique with existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-11.png"/></fig>
<p><xref ref-type="fig" rid="fig-12">Fig. 12</xref> reports a comprehensive <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> inspection of the GOFED-RBVSC model with existing models. The result indicates that the VGG-s model has reached unsuccessful outcome with lower <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 33.17&#x0025;. Followed by the VGG-16 model has resulted in slightly enhanced performance with <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 74.89&#x0025;. Simultaneously, ResNet and VGG-19 models have attained closer <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 67.14&#x0025; and 55.09&#x0025; correspondingly. But, the GOFED-RBVSC model has accomplished high <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 76.15&#x0025;.</p>
<fig id="fig-12"><label>Figure 12</label><caption><title><inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of GOFED-RBVSC technique with existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-12.png"/></fig>
<p><xref ref-type="fig" rid="fig-13">Fig. 13</xref> reports a comprehensive <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> inspection of the GOFED-RBVSC model with existing models. The result indicates that the VGG-16 model has reached ineffectual outcome with lower <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 30.56&#x0025;. Followed by the VGG-s model has resulted in slightly enhanced performance with <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 94.71&#x0025;. Simultaneously, ResNet and VGG-19 models have obtained closer <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> values of 88.93&#x0025; and 95.33&#x0025; correspondingly. However, the GOFED-RBVSC model has accomplished high <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of 97.13&#x0025;. After examining the detailed results and discussion, it is evident that the GOFED-RBVSC model has accomplished improved performance over the other models.</p>
<fig id="fig-13"><label>Figure 13</label><caption><title><inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>S</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> analysis of GOFED-RBVSC technique with existing approaches</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_30872-fig-13.png"/></fig>
</sec>
<sec id="s4"><label>4</label><title>Conclusion</title>
<p>In this study, a new GOFED-RBVSC model has been developed for effectively segmenting the blood vessels and classifying retinal fundus images. Primarily, the GOFED-RBVSC model employed contrast enhancement process. In addition, GOAFED technique is applied to detect the edges in the retinal fundus images in which the use of GOA adjusts the membership functions. Followed by, ORB feature extractor is exploited to generate feature vectors. Finally, ICAVE model can be employed to classify retinal images. The performance validation of the GOFED-RBVSC model is tested using benchmark dataset, and the comparative study highlighted the betterment of the GOFED-RBVSC model over the recent approaches. In future, deep instance segmentation models can be derived to improve the overall classification performance.</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>B.</given-names> <surname>Gui</surname></string-name>, <string-name><given-names>R. J.</given-names> <surname>Shuai</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>Optic disc localization algorithm based on improved corner detection</article-title>,&#x201D; <source>Procedia Computer Science</source>, vol. <volume>131</volume>, pp. <fpage>311</fpage>&#x2013;<lpage>319</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Moccia</surname></string-name>, <string-name><given-names>E. D.</given-names> <surname>Momi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>El Hadji</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Mattos</surname></string-name></person-group>, &#x201C;<article-title>Blood vessel segmentation algorithms&#x2014;Review of methods, datasets and evaluation metrics</article-title>,&#x201D; <source>Computer Methods and Programs in Biomedicine</source>, vol. <volume>158</volume>, pp. <fpage>71</fpage>&#x2013;<lpage>91</lpage>, <year>2018</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>Y.</given-names> <surname>Lin</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Automatic retinal vessel segmentation via deeply supervised and smoothly regularized network</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>57717</fpage>&#x2013;<lpage>57724</lpage>, <year>2019</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>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Detecting COVID-19 patients in X-ray images based on MAI-nets</article-title>,&#x201D; <source>International Journal of Computational Intelligence Systems</source>, vol. <volume>14</volume>, no. <issue>1</issue>, pp. <fpage>1607</fpage>&#x2013;<lpage>1616</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Gui</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Zeng</surname></string-name></person-group>, &#x201C;<article-title>Joint learning of visual and spatial features for edit propagation from a single image</article-title>,&#x201D; <source>the Visual Computer</source>, vol. <volume>36</volume>, no. <issue>3</issue>, pp. <fpage>469</fpage>&#x2013;<lpage>482</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>W.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>Y. T.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Zou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>J. Y.</given-names> <surname>You</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A novel image classification approach via dense-MobileNet models</article-title>,&#x201D; <source>Mobile Information Systems</source>, <year>2020</year>. <uri xlink:href="https://doi.org/10.1155/2020/7602384">https://doi.org/10.1155/2020/7602384</uri>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. R.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>J. P.</given-names> <surname>Yin</surname></string-name> and <string-name><given-names>J. M.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>Local binary pattern (LBP) and local phase quantization (LBQ) based on gabor filter for face representation</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>116</volume>, pp. <fpage>260</fpage>&#x2013;<lpage>264</lpage>, <year>2013</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>Y.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Tang</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Local and nonlocal constraints for compressed sensing video and multi-view image recovery</article-title>,&#x201D; <source>Neurocomputing</source>, vol. <volume>406</volume>, pp. <fpage>34</fpage>&#x2013;<lpage>48</lpage>, <year>2020</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>F.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Ou</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gui</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Xiang</surname></string-name></person-group>, &#x201C;<article-title>Instant edit propagation on images based on bilateral grid</article-title>,&#x201D; <source>Computers Materials &#x0026; Continua</source>, vol. <volume>61</volume>, no. <issue>2</issue>, pp. <fpage>643</fpage>&#x2013;<lpage>656</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. M.</given-names> <surname>Samuel</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Veeramalai</surname></string-name></person-group>, &#x201C;<article-title>VSSC net: Vessel specific skip chain convolutional network for blood vessel segmentation</article-title>,&#x201D; <source>Computer Methods and Programs in Biomedicine</source>, vol. <volume>198</volume>, pp. <fpage>105769</fpage>, <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>F.</given-names> <surname>Orujov</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Maskeli&#x016B;nas</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Dama&#x0161;evi&#x010D;ius</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Wei</surname></string-name></person-group>, &#x201C;<article-title>Fuzzy based image edge detection algorithm for blood vessel detection in retinal images</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>94</volume>, pp. <fpage>106452</fpage>, <year>2020</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. N.</given-names> <surname>Sangeethaa</surname></string-name> and <string-name><given-names>P. U.</given-names> <surname>Maheswari</surname></string-name></person-group>, &#x201C;<article-title>An intelligent model for blood vessel segmentation in diagnosing dr using cnn</article-title>,&#x201D; <source>Journal of Medical Systems</source>, vol. <volume>42</volume>, no. <issue>10</issue>, pp. <fpage>175</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Roy</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mitra</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Roy</surname></string-name> and <string-name><given-names>S. K.</given-names> <surname>Setua</surname></string-name></person-group>, &#x201C;<article-title>Blood vessel segmentation of retinal image using clifford matched filter and clifford convolution</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>78</volume>, no. <issue>24</issue>, pp. <fpage>34839</fpage>&#x2013;<lpage>34865</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. Z. H.</given-names> <surname>Ooi</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Embong</surname></string-name>, <string-name><given-names>A. I. A.</given-names> <surname>Hamid</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Zainon</surname></string-name>, <string-name><given-names>S. L.</given-names> <surname>Wang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Interactive blood vessel segmentation from retinal fundus image based on canny edge detector</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>21</volume>, no. <issue>19</issue>, pp. <fpage>6380</fpage>, <year>2021</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>B. S.</given-names> <surname>Tchinda</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Tchiotsop</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Noubom</surname></string-name>, <string-name><given-names>V. L.</given-names> <surname>Dorr</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Wolf</surname></string-name></person-group>, &#x201C;<article-title>Retinal blood vessels segmentation using classical edge detection filters and the neural network</article-title>,&#x201D; <source>Informatics in Medicine Unlocked</source>, vol. <volume>23</volume>, pp. <fpage>100521</fpage>, <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>S.</given-names> <surname>Mirjalili</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Saremi</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Faris</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Aljarah</surname></string-name></person-group>, &#x201C;<article-title>Grasshopper optimization algorithm for multi-objective optimization problems</article-title>,&#x201D; <source>Applied Intelligence</source>, vol. <volume>48</volume>, no. <issue>4</issue>, pp. <fpage>805</fpage>&#x2013;<lpage>820</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>J.</given-names> <surname>Weberruss</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Kleeman</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Boland</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Drummond</surname></string-name></person-group>, &#x201C;<article-title>FPGA acceleration of multilevel ORB feature extraction for computer vision</article-title>,&#x201D; in <conf-name>2017 27th Int. Conf. on Field Programmable Logic and Applications (FPL)</conf-name>, <conf-loc>Ghent, Belgium</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Wu</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Improving the classification effectiveness of intrusion detection by using improved conditional variational autoencoder and deep neural network</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>19</volume>, no. <issue>11</issue>, pp. <fpage>2528</fpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name>C. Zhang, R. Barbano and B. Jin</string-name></person-group>, &#x201C;<article-title>Conditional variational autoencoder for learned image reconstruction</article-title>,&#x201D; <source>Computation</source>, vol. 9, no. 11, p. 114, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name>Diabetic Retinopathy Detection</string-name></person-group>, <source>Kaggle.com</source>, Accessed: 23-Apr-2022, <uri xlink:href="https://www.kaggle.com/c/diabetic-retinopathy-detection/data">https://www.kaggle.com/c/diabetic-retinopathy-detection/data</uri>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Yazhini</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Loganathan</surname></string-name></person-group>, &#x201C;<chapter-title>Artificial intelligence-based optimal residual network model for diabetic retinopathy image classification</chapter-title>,&#x201D; in <source>Artificial Intelligence Applications for Smart Societies, Studies in Distributed Intelligence</source>, <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>147</fpage>&#x2013;<lpage>159</lpage>, <year>2021</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>R. F.</given-names> <surname>Mansour</surname></string-name></person-group>, &#x201C;<article-title>Deep-learning-based automatic computer-aided diagnosis system for diabetic retinopathy</article-title>,&#x201D; <source>Biomedical Engineering Letters</source>, vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>41</fpage>&#x2013;<lpage>57</lpage>, <year>2018</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. F.</given-names> <surname>Mansour</surname></string-name>, <string-name><given-names>E. M.</given-names> <surname>Abdelrahim</surname></string-name> and <string-name><given-names>A. S.</given-names> <surname>Al-Johani</surname></string-name></person-group>, &#x201C;<article-title>Identification of diabetic retinal exudates in digital color images using support vector machine</article-title>,&#x201D; <source>Journal of Intelligent Learning Systems and Applications</source>, vol. <volume>5</volume>, no. <issue>3</issue>, pp. <fpage>135</fpage>&#x2013;<lpage>142</lpage>, <year>2013</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>