<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">abb</journal-id>
      <journal-title-group>
        <journal-title>Advances in Bioscience and Biotechnology</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2156-8502</issn>
      <issn pub-type="ppub">2156-8456</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/abb.2026.1710034</article-id>
      <article-id pub-id-type="publisher-id">abb-154537</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Biomedical</subject>
          <subject>Life Sciences</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Classification of Poikilocytes Using ResNet18 and MobileNetV2 Optimized by a Multi-Objective Approach (Pareto Front and TOPSIS)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Koffi</surname>
            <given-names>Patrice Kouamé</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0000-0002-8841-2469</contrib-id>
          <name name-style="western">
            <surname>Ouattara</surname>
            <given-names>Sié</given-names>
          </name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Vangah</surname>
            <given-names>Joseph Wognin</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Clement</surname>
            <given-names>Alain</given-names>
          </name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Alico</surname>
            <given-names>Nango Jerôme</given-names>
          </name>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Digital Research and Expertise Unit (UREN), Virtual University of Côte d’Ivoire (UVCI), Abidjan, Côte d’Ivoire </aff>
      <aff id="aff2"><label>2</label> Institut National Polytechnique Houphouët (INPHB), Yamoussoukro, Côte d’Ivoire </aff>
      <aff id="aff3"><label>3</label> School of Geomatics and Territory (EGT), Abidjan, Côte d’Ivoire </aff>
      <aff id="aff4"><label>4</label> LARIS, SFR Mathstic, University of Angers, Angers, France </aff>
      <aff id="aff5"><label>5</label> Preparatory Class for Grandes Écoles (CPGE), University of San Pédro (USP), San Pédro, Côte d’Ivoire </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare that they have no conflict of interest related to this work.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>10</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <volume>17</volume>
      <issue>10</issue>
      <fpage>586</fpage>
      <lpage>613</lpage>
      <history>
        <date date-type="received">
          <day>17</day>
          <month>08</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>13</day>
          <month>10</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>16</day>
          <month>10</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/abb.2026.1710034">https://doi.org/10.4236/abb.2026.1710034</self-uri>
      <abstract>
        <p>Morphological and colorimetric analysis of red blood cells from blood smears constitutes an essential step of hematological diagnosis, yet it remains a lengthy and subjective task that is strongly dependent on the observer’s expertise. To address these limitations, we propose an automated approach combining two (02) pre-trained deep convolutional neural networks, ResNet18 and MobileNetV2, for the classification of five (05) pathological erythrocyte morphologies (acanthocytes, drepanocytes, elliptocytes, ovalocytes and echinocytes). The database used comprises 560 red-blood-cell image patches extracted from blood smears, pre-processed and resized to 224 × 224 × 3 pixels. Training relies on a 5-fold stratified cross-validation and two optimizers, SGDM and Adam, whose hyperparameters (number of epochs, learning rate, batch size) are selected through a grid search followed by a multi-objective optimization combining the Pareto Front and the TOPSIS method on a seven (07)-criterion vector integrating accuracy (F1, MCC, AUC), generalization gaps (GapAcc, GapLoss) and computational cost (number of parameters, latency). The results show that the four retained configurations achieve high and broadly comparable performance (F1 &gt; 0.95; MCC &gt; 0.93; AUC &gt; 0.995); moreover, the model-optimizer pairs (ResNet18, Adam) and (MobileNetV2, Adam) provide the best overall compromise (F1 ≈ 0.966). Beyond the above performance, ResNet18 offers the best generalization robustness, while MobileNetV2, with nearly five times fewer parameters, constitutes a relevant alternative for resource-constrained environments, although its latency measured in practice remains, counter-intuitively, higher than that of ResNet18. These results confirm the value of transfer learning and multi-objective optimization for developing robust, interpretable and reproducible erythrocyte classification systems, while identifying additional validation avenues (per-class confusion matrix, statistical tests) that are necessary before clinical deployment.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Red Blood Cell Classification</kwd>
        <kwd>ResNet18</kwd>
        <kwd>MobileNetV2</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Optimizers</kwd>
        <kwd>SGDM</kwd>
        <kwd>Adam</kwd>
        <kwd>5-Fold Stratified Cross-Validation</kwd>
        <kwd>Multi-Objective Optimization</kwd>
        <kwd>Pareto Front</kwd>
        <kwd>TOPSIS</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Morphological analysis of red blood cells by means of blood smears is an essential step of hematological diagnosis. Certain anemias and pathologies result in visible alterations of the shape of red blood cells, such as echinocytes, acanthocytes, elliptocytes, drepanocytes and ovalocytes. These clinically significant morphologies point to a variety of conditions that are difficult to distinguish by microscopic examination alone. Manual identification remains lengthy, subjective and strongly dependent on the observer’s expertise, while also being affected by smear quality, staining artifacts and the morphological proximity between certain classes.</p>
      <p>These limitations motivate automated approaches to red blood cell isolation and classification, which can reduce inter-observer variability and make hematological expertise more accessible. Among them, modern convolutional neural architectures, such as ResNet18 and MobileNetV2, have demonstrated their effectiveness in biomedical image classification. Their use, combined with transfer learning techniques and rigorous validation strategies, constitutes a promising avenue for improving the detection and classification of erythrocyte abnormalities. The objective of this work is to propose and evaluate an integrated approach combining pre-trained convolutional neural networks and multi-objective hyperparameter optimization, in order to develop a robust, interpretable and reproducible system for digital hematology.</p>
      <p><bold>The con</bold><bold>tributions of this work are threefold.</bold>First, we propose a complete pipeline for isolating and classifying the five main pathological erythrocyte morphologies, based on transfer learning using ResNet18 and MobileNetV2. Second, we introduce a multi-objective hyperparameter optimization strategy combining grid search, the Pareto Front and the TOPSIS method on a seven-criterion vector integrating both classification performance (F1, MCC, AUC) and computational cost (number of parameters, latency, generalization gaps). Third, we provide a systematic comparison of four architecture-optimizer configurations (ResNet18/MobileNetV2 × SGDM/Adam), in order to objectify the trade-off between accuracy and computational efficiency for deployment in a resource-limited environment.</p>
      <p>The remainder of this article is organized as follows: Section 2 presents a synthesis of the state of the art on the segmentation and classification of red blood cells; Section 3 details the material, the experimental protocol and the multi-objective optimization methodology; Section 4 presents the isolation and classification method implemented, then discusses the results obtained; finally, Section 5 concludes this work and proposes research perspectives.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Works</title>
      <p>Morphological analysis of red blood cells on blood smears remains a fundamental step of hematological diagnosis [<xref ref-type="bibr" rid="B1">1</xref>]. Certain anemias result in visible alterations of the shape of red blood cells, among which acanthocytes, echinocytes, drepanocytes, elliptocytes and ovalocytes can notably be distinguished [<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B3">3</xref>]. These morphologies are clinically significant, as they point to various conditions that are sometimes difficult to distinguish by microscopic examination alone [<xref ref-type="bibr" rid="B3">3</xref>]. However, their manual identification remains lengthy, subjective and strongly dependent on the observer’s expertise [<xref ref-type="bibr" rid="B4">4</xref>]. It is further affected by smear quality, staining artifacts, cell overlaps and the morphological proximity between certain classes, such as acanthocytes and echinocytes, or elliptocytes and ovalocytes [<xref ref-type="bibr" rid="B1">1</xref>]-[<xref ref-type="bibr" rid="B3">3</xref>].</p>
      <p>In this context, automating the isolation and classification of red blood cells appears to be a relevant solution for reducing inter-observer variability, speeding up analysis and making hematological expertise more accessible in resource-limited environments [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B4">4</xref>]. Existing approaches fall into several main families: classical segmentation and classification methods, hybrid approaches combining segmentation and machine learning, and recent deep-learning-based methods [<xref ref-type="bibr" rid="B1">1</xref>].</p>
      <p>Traditional segmentation methods historically constitute the basis of red blood cell isolation [<xref ref-type="bibr" rid="B1">1</xref>]. Otsu’s method relies on maximizing inter-class variance and remains a reference for global thresholding [<xref ref-type="bibr" rid="B5">5</xref>]. However, in real blood smears, intensity variations, staining heterogeneity and background noise often limit its performance [<xref ref-type="bibr" rid="B5">5</xref>]. For this reason, multi-threshold variants optimized by metaheuristics have been proposed to improve the separation between cells and background [<xref ref-type="bibr" rid="B5">5</xref>]. Local thresholding methods, such as Niblack, Sauvola or Bernsen, adapt the threshold according to the neighborhood and offer better robustness to local lighting variations [<xref ref-type="bibr" rid="B6">6</xref>]-[<xref ref-type="bibr" rid="B8">8</xref>]. Likewise, thresholding in color spaces, notably RGB and HSV, exploits the chromatic properties of red blood cells to strengthen segmentation [<xref ref-type="bibr" rid="B1">1</xref>]. Morphological operations, such as opening, closing and the morphological gradient, are then used to remove artifacts and correct certain binarization imperfections [<xref ref-type="bibr" rid="B9">9</xref>]. Finally, the Watershed algorithm, often combined with the distance transform and morphological markers, remains one of the most effective techniques for separating cells that are in contact or partially overlapping [<xref ref-type="bibr" rid="B9">9</xref>].</p>
      <p>Hybrid approaches combine classical segmentation and machine learning in order to leverage the simplicity of traditional methods while adding a higher discrimination capacity [<xref ref-type="bibr" rid="B3">3</xref>]. Some strategies rely on an initial segmentation of red blood cells, followed by the extraction of morphological parameters such as area, perimeter, circularity, eccentricity or convexity, before classification using algorithms such as SVM or random forests [<xref ref-type="bibr" rid="B10">10</xref>][<xref ref-type="bibr" rid="B11">11</xref>]. These methods have the advantage of being relatively interpretable and effective on modest-sized datasets [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B10">10</xref>][<xref ref-type="bibr" rid="B11">11</xref>]. They nevertheless remain sensitive to the quality of the initial segmentation, which can limit their robustness in the presence of overlaps, artifacts or poor-quality slides [<xref ref-type="bibr" rid="B3">3</xref>].</p>
      <p>Deep-learning-based automatic segmentation methods represent a major advance in blood-cell image analysis [<xref ref-type="bibr" rid="B1">1</xref>]. U-Net-type architectures and their variants have become reference approaches for semantic segmentation in medical imaging [<xref ref-type="bibr" rid="B12">12</xref>]. Their ability to learn multi-scale representations enables them to better handle irregular boundaries and complex shapes [<xref ref-type="bibr" rid="B12">12</xref>]. For instance segmentation, Mask R-CNN provides a robust solution for detecting and separating individual cells [<xref ref-type="bibr" rid="B13">13</xref>]. More recent approaches based on hybrid CNN-Transformer architectures seek to combine the local feature-extraction capabilities of convolutional networks with the global dependency modeling offered by Transformers [<xref ref-type="bibr" rid="B14">14</xref>]. Specialized tools such as CellPose, StarDist, and CellViT have also demonstrated strong potential for segmenting cells with diverse shapes and handling overlapping objects [<xref ref-type="bibr" rid="B14">14</xref>]-[<xref ref-type="bibr" rid="B16">16</xref>]. This methodological evolution is particularly relevant to red blood cells, whose morphology can vary considerably according to the pathological condition and slide-preparation conditions [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>][<xref ref-type="bibr" rid="B15">15</xref>].</p>
      <p>Morphological classification by deep learning strongly depends on the quality of the dataset used [<xref ref-type="bibr" rid="B1">1</xref>]. Classes must be well defined, sufficiently represented and ideally balanced [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B17">17</xref>]. However, in medical applications, annotated data are often scarce, costly to produce and imbalanced [<xref ref-type="bibr" rid="B17">17</xref>]. This is why data augmentation, oversampling and loss-weighting techniques are frequently used to improve generalization [<xref ref-type="bibr" rid="B18">18</xref>]. Residual architectures, such as ResNet-18 and ResNet-50, as well as lighter models such as MobileNetV2, benefit from transfer learning from generic datasets such as ImageNet [<xref ref-type="bibr" rid="B19">19</xref>]-[<xref ref-type="bibr" rid="B21">21</xref>]. DenseNet121 stands out for its dense connections, which reduce feature redundancy, while some lighter CNNs can achieve better performance than deeper architectures on small datasets [<xref ref-type="bibr" rid="B22">22</xref>]. The most recent trends are moving towards hybrid models combining detection, segmentation and classification within a single architecture, in order to simultaneously handle cell localization and morphology identification [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B16">16</xref>].</p>
      <p>Another essential aspect concerns dataset splitting and the validation strategy [<xref ref-type="bibr" rid="B1">1</xref>]. Fixed 70/15/15 or 80/10/10 splits are simple to implement, but they can produce unstable estimates when data are limited [<xref ref-type="bibr" rid="B1">1</xref>]. K-fold cross-validation, in particular stratified 10-fold, is generally more robust because it reduces estimation variance and allows a more reliable performance evaluation [<xref ref-type="bibr" rid="B1">1</xref>]. LOOCV provides an almost unbiased estimate, but its computational cost makes it poorly suited to deep networks [<xref ref-type="bibr" rid="B1">1</xref>]. In medical deep learning, the choice between holdout, k-fold and cross-validation therefore depends on the trade-off between statistical stability and computational feasibility [<xref ref-type="bibr" rid="B1">1</xref>].</p>
      <p>Hyperparameter optimization also plays a decisive role in the final quality of the model [<xref ref-type="bibr" rid="B23">23</xref>]. Among the most sensitive parameters are the learning rate, the batch size and the number of epochs [<xref ref-type="bibr" rid="B23">23</xref>]. The most commonly used search methods are Grid Search, Random Search and Bayesian optimization [<xref ref-type="bibr" rid="B23">23</xref>][<xref ref-type="bibr" rid="B24">24</xref>]. The learning rate often remains the critical parameter, as a value that is too high can prevent convergence, while a value that is too low slows down learning [<xref ref-type="bibr" rid="B23">23</xref>]. Optimizers such as Adam, SGD with momentum and AdamW are frequently used depending on the size of the dataset and the complexity of the model [<xref ref-type="bibr" rid="B25">25</xref>][<xref ref-type="bibr" rid="B26">26</xref>]. Finally, regularization techniques such as Dropout, L2 regularization and Batch Normalization help limit overfitting and improve generalization [<xref ref-type="bibr" rid="B27">27</xref>][<xref ref-type="bibr" rid="B28">28</xref>].</p>
      <p>In summary, the state of the art shows a clear evolution from classical segmentation methods towards increasingly automated pipelines, and then towards deep-learning solutions capable of integrating segmentation, detection and classification [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B14">14</xref>]. For the isolation of red blood cells and their morphological classification, hybrid approaches and deep architectures currently appear to be the most promising, provided that sufficiently well-annotated data, rigorous validation and an appropriate optimization strategy are available [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B17">17</xref>][<xref ref-type="bibr" rid="B23">23</xref>]. The main challenge remains to develop robust, interpretable and reproducible systems capable of operating reliably on real, often noisy and heterogeneous smears [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>].</p>
    </sec>
    <sec id="sec3">
      <title>3. Materials and Methods</title>
      <p>The experiments were conducted on color microscopic images of blood smears, from which an image-patch dataset was constructed using the improved algorithm of Alico <italic>et al.</italic> (2020) [<xref ref-type="bibr" rid="B29">29</xref>]. The dataset comprises five (05) classes of abnormal red blood cells: acanthocytes, drepanocytes, elliptocytes, ovalocytes, and echinocytes. The image patches were preprocessed and then used to train the ResNet18 and MobileNetV2 convolutional neural networks under 5-fold stratified cross-validation. Hyperparameter selection was based on a multi-objective vector optimized using the Pareto Front and TOPSIS. <xref ref-type="fig" rid="fig1">Figure 1</xref> presents the flowchart of the adopted processing pipeline.</p>
      <sec id="sec3dot1">
        <title>3.1. Data Provenance and Reference Standard</title>
        <p>Data provenance. The blood-smear images used to construct the dataset were provided by the Blood Transfusion Center (CTS) and the Regional Hospital Center (CHR) of Yamoussoukro, with an additional occasional contribution from the CTS of Abidjan. The authors thank Dr. D. Bosso (CTS Yamoussoukro), Dr. C. Houedanou (CHR Yamoussoukro), K. Hermann (CHR Yamoussoukro), Dr. B. Dembélé (CTS Abidjan), K. Eugène (CHR Yamoussoukro), and T. Abalé (CTS Abidjan) for their collaboration in the production of this work.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId19.jpeg?20261016013741" />
        </fig>
        <p><bold>Figure 1.</bold> Flowchart of the blood-smear red-blood-cell classification process.</p>
        <p>Ethical status. Data collection was carried out as part of a previous collaboration of the research group, with authorization from the CTS and CHR laboratories in Yamoussoukro to use blood-smear images for research purposes. This authorization was granted institutionally by the partner laboratories; it does not constitute formal approval by an independent ethics committee, and no record of individual patient consent was available to the authors of the present study. The images used contain no nominative or identifying information that would allow them to be traced back to an individual patient.</p>
        <p>Acknowledged limitation—patient/smear traceability and selection criteria. The smear images were provided to the authors as an already assembled collection, without information on the number of distinct patients from whom the 470 smears originated or on the criteria used to select these smears from all examinations performed by the partner institutions.</p>
        <p>Diagnostic reference and adjudication process. Assignment of each image patch to one of the five morphological classes followed a three-level hierarchical procedure: first, a literature review was used to establish the reference morphological criteria for each class; laboratory technicians then annotated the smear images according to these criteria; the annotations were subsequently confirmed or rejected by biological-analysis engineers; finally, hematology laboratory physicians adjudicated the remaining disputed cases. Cells for which disagreement or ambiguity persisted after this procedure were removed from the dataset rather than assigned a default label—this exclusion concerned only a marginal number of cells (approximately 20).</p>
        <p>Annotator qualifications. The annotation team consisted of two laboratory physicians specialized in hematology, two biological-analysis engineers from the hematology department, and three laboratory technicians.</p>
        <p>Classifier scope. The classifier developed in this study operates exclusively on pre-isolated single-cell image patches and recognizes only the five morphological classes included in the training data. A cell exhibiting a pathological morphology outside these five classes would, in the current version of the system, necessarily be incorrectly assigned to one of the five known classes; accordingly, the clinical-diagnostic claims made in this manuscript are restricted to this scope.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Dataset and Acquisition Equipment</title>
        <p>The raw image consists of 470 color BMP smear images with a resolution of 1024 × 768 pixels, acquired without Giemsa staining. Images were captured at 1000× total magnification using a 100× objective lens and a 10× eyepiece. Illumination was provided by a 6V-220W halogen lamp. Acquisition was performed with a Moticam2 2 MP color CMOS camera, and images were transferred to a computer via USB 3.0.</p>
        <p>The improved cell-isolation algorithm of Alico <italic>et al.</italic> (2020) [<xref ref-type="bibr" rid="B29">29</xref>] was applied to generate the image patches composing the dataset. <xref ref-type="fig" rid="fig2">Figure 2</xref> shows an example of a blood-smear image, and <xref ref-type="fig" rid="fig3">Figure 3</xref> presents examples of image patches after cell isolation.</p>
        <p>Red blood cell extraction was performed in MATLAB on an HP computer with an Intel i5-3230M CPU, 12 GB RAM, and a 477 GB SSD. Model training was conducted on an MSI workstation with a Core i7 processor and an NVIDIA GTX 1070 GPU.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId20.jpeg?20261016013741" />
        </fig>
        <p><bold>Figure 2.</bold> Example blood-smear image obtained from the acquisition protocol.</p>
        <p>Furthermore, the distribution of our dataset by morphological class is as follows: echinocytes (86 images), acanthocytes (92 images), elliptocytes (138 images), drepanocytes (106 images) and ovalocytes (138 images), for a total of 560 image patches. To ensure a balanced representation of each class during model evaluation, a 5-fold stratified cross-validation was applied, preserving the relative proportions of the five classes in each fold. This approach guarantees that the minority classes (echinocytes and acanthocytes) are systematically present in the training and validation subsets, see <bold>Table 1</bold>.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId21.jpeg?20261016013742" />
        </fig>
        <p><bold>Figure 3.</bold> Red blood cells isolated from blood-smear images (Alico <italic>et al.</italic>, 2020 [<xref ref-type="bibr" rid="B29">29</xref>]). (a): Echinocytes, (b): Acanthocytes, (c): Elliptocytes, (d): Drepanocytes, (e): Ovalocytes.</p>
        <p><bold>Table 1.</bold> Distribution of image patches by class and by cross-validation fold.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>RBC class</bold>
                </td>
                <td>
                  <bold>Total</bold>
                </td>
                <td>
                  <bold>Validation per fold</bold>
                </td>
                <td>
                  <bold>Training per fold</bold>
                </td>
              </tr>
              <tr>
                <td>Echinocytes</td>
                <td>86</td>
                <td>≈17</td>
                <td>≈69</td>
              </tr>
              <tr>
                <td>Acanthocytes</td>
                <td>92</td>
                <td>≈18</td>
                <td>≈74</td>
              </tr>
              <tr>
                <td>Elliptocytes</td>
                <td>138</td>
                <td>≈28</td>
                <td>≈110</td>
              </tr>
              <tr>
                <td>Drepanocytes</td>
                <td>106</td>
                <td>≈21</td>
                <td>≈85</td>
              </tr>
              <tr>
                <td>Ovalocytes</td>
                <td>138</td>
                <td>≈28</td>
                <td>≈110</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Preprocessing</title>
        <p>The acquired images comprise several red blood cells at once, with different morphological and colorimetric shades, and these occupy on average a memory space of 2.305 MB. First, pre-processing was carried out, consisting of extracting each cell from its surroundings, without resizing the original image. The dataset obtained consists of individual red blood cells, called image patches, showing various morphologies, distributed among the five (05) classes retained. Next, in order to reduce the number of parameters of the models to be estimated, the image patches were resized to 224 × 224 × 3 pixels, in accordance with the input data requirements of the ResNet18 and MobileNetV2 models. Finally, each image was labeled according to its class for model training.</p>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. CNN Architecture</title>
        <p>Automatic classification of pathological red blood cells is carried out using two deep convolutional neural architectures: ResNet18 and MobileNetV2. This choice is based on the relatively limited size of the database (560 images distributed across five morphological classes), the need to obtain good generalization capacity, and the use of transfer learning from models pre-trained on ImageNet.</p>
        <p>Indeed, ResNet18 (Residual Network with 18 weighted layers), proposed by He <italic>et al.</italic> (2016), introduces the concept of residual connections, allowing deep networks to learn residual functions rather than complete transformations. This innovation facilitates gradient propagation and limits the performance degradation observed as network depth increases. With approximately 11.7 million parameters, ResNet18 offers an attractive trade-off between representation capacity, computational cost and the risk of overfitting on a limited database. The overall architecture of ResNet18 used in this study is shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId22.jpeg?20261016013743" />
        </fig>
        <p><bold>Figure 4.</bold> ResNet18 architecture.</p>
        <p>As for MobileNetV2, it was developed by Sandler <italic>et al.</italic> (2018) and designed to offer excellent computational efficiency while maintaining good classification performance. Its architecture relies on inverted residual blocks combined with linear bottlenecks and depthwise separable convolutions, which considerably reduces the number of parameters and the cost of operations. With approximately 3.5 million parameters, MobileNetV2 constitutes a compact architecture, favoring reduced training and inference times. The corresponding MobileNetV2 architecture is illustrated in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p>
        <p>The choice of these two architectures is motivated by their complementarity: ResNet18 favors a deep representation of morphological features thanks to its residual connections, while MobileNetV2 relies on an efficient representation based on a lightweight architecture. Since few studies have jointly evaluated these two architectures on the simultaneous classification of the five erythrocyte morphologies considered here, this comparison appears relevant. Before training, all images are resized to 224 × 224 × 3 pixels; the features extracted by the convolutional layers are passed to a classification layer whose outputs are converted into probabilities by the Softmax function.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId23.jpeg?20261016013743" />
        </fig>
        <p><bold>Figure 5.</bold> MobileNetV2 architecture.</p>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Transfer Learning</title>
        <p>The limited availability of large annotated databases constitutes one of the main difficulties of automatic classification of pathological red blood cells. Since our database comprises only 560 images patches distributed across five classes, training from a random initialization would expose the deep architectures to a high risk of overfitting. We therefore resort to transfer learning, which consists of reusing the representations learned by a deep network on a large-scale source task (ImageNet, approximately 1.28 million images distributed across 1000 categories) for a target task with few examples.</p>
        <p>The adopted process comprises five steps: 1) loading the ResNet18 and MobileNetV2 weights pre-trained on ImageNet; 2) replacing the final classifier (1000 categories) with a new five-neuron layer corresponding to the five morphological classes studied; 3) feature extraction, where the pre-trained convolutional layers are frozen and only the new classification layers are trained; 4) fine-tuning, where part of the last blocks is progressively unfrozen to adapt the deep representations to erythrocyte morphologies; 5) final classification via the Softmax function. This principle is applied identically to both architectures, with the only difference being the nature of the blocks unfrozen during fine-tuning (residual blocks for ResNet18, inverted residual blocks for MobileNetV2).</p>
      </sec>
      <sec id="sec3dot6">
        <title>3.6. Hyperparameter Optimization</title>
        <p>Optimization of the training hyperparameters—learning rate, number of epochs and mini-batch size—is carried out by grid search. The values tested are the batch size (12, 16, 24, 28, 32) and the learning rate (10<sup>−4</sup>, 3.10<sup>−4</sup>, 5.10<sup>−4</sup>, 10<sup>−3</sup>), <italic>i.e.</italic> 20 combinations per architecture-optimizer pair. The number of epochs is not fixed manually: the 5-fold stratified cross-validation incorporates an early-stopping mechanism, which halts training as soon as validation performance stops improving, thus limiting overfitting. For k = 5, each configuration in the table produces 5 training runs, <italic>i.e.</italic> 100 training runs per architecture-optimizer pair (5 × 20), and 400 training runs in total across the four configurations studied (ResNet18/MobileNetV2 × SGDM/Adam).</p>
        <p>Two optimizers are compared. Stochastic gradient descent with momentum (SGDM) introduces an inertia term that dampens gradient-descent oscillations and accelerates convergence (<xref ref-type="fig" rid="fig6">Figure 6</xref>). The Adam optimizer (Adaptive Moment Estimation) computes an adaptive learning-rate step for each parameter from exponential moving averages of the first and second moments of the gradient, with bias correction.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId24.jpeg?20261016013744" />
        </fig>
        <p><bold>Figure 6.</bold> Damping of stochastic-gradient-descent oscillations by the momentum method (SGDM).</p>
        <p><bold>Formulation of the Adam optimizer (first- and second-order moments, bias correction)</bold></p>
        <p>Adam [<xref ref-type="bibr" rid="B26">26</xref>], is a method that computes a learning-rate step described as adaptive for each parameter. During training, in addition to storing an exponentially decaying average of the squares of the previous gradients as with RMSprop, the algorithm also keeps the exponentially decaying average of the previous gradients according to the equations: </p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>
              </mml:mo>
              <mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>β</mml:mi>
                    <mml:mn>1</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:msub>
                <mml:mi>g</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>
              </mml:mo>
              <mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:msub>
                <mml:mi>v</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>β</mml:mi>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:msubsup>
                <mml:mi>g</mml:mi>
                <mml:mi>t</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msubsup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>It should be noted that <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> updates the exponential moving average of the gradient and is referred to as the first-order (“1”) moment estimate. As for <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , it updates the exponential moving average of the squared gradients and is referred to as the second-order (“2”) moment estimate. According to the authors, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> m </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> v </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are initialized as vectors of “0” and are biased towards this point during the initial steps, particularly when the decay coefficients (<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> β </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> ) are small (close to “1”). They propose a bias correction for the estimates using the following relations:</p>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>m</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>
              </mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>m</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:msubsup>
                    <mml:mi>β</mml:mi>
                    <mml:mn>1</mml:mn>
                    <mml:mi>t</mml:mi>
                  </mml:msubsup>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mover accent="true">
                  <mml:mi>v</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>v</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:msubsup>
                    <mml:mi>β</mml:mi>
                    <mml:mn>2</mml:mn>
                    <mml:mi>t</mml:mi>
                  </mml:msubsup>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Then comes the parameter update (<inline-formula><mml:math><mml:mi> θ </mml:mi></mml:math></inline-formula> ):</p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>θ</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>θ</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mi>η</mml:mi>
                <mml:mrow>
                  <mml:msqrt>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>v</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msqrt>
                  <mml:mo>+</mml:mo>
                  <mml:mi>ε</mml:mi>
                </mml:mrow>
              </mml:mfrac>
              <mml:mo>⋅</mml:mo>
              <mml:mo>
              </mml:mo>
              <mml:msub>
                <mml:mi>m</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><inline-formula><mml:math><mml:mi> η </mml:mi></mml:math></inline-formula> , the learning rate, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , damping coefficients (typically close to “1”, for example, 0.9 and 0.999),<inline-formula><mml:math><mml:mi> ε </mml:mi></mml:math></inline-formula> , a small constant added to avoid division by zero.</p>
        <p>For the parameters <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mi> ε </mml:mi></mml:math></inline-formula> , the authors propose default values of 0.9, 0.999, and <inline-formula><mml:math><mml:mrow><mml:msup><mml:mrow><mml:mn> 10 </mml:mn></mml:mrow><mml:mrow><mml:mo> − </mml:mo><mml:mn> 8 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> .</p>
        <p>The advantages provided by <italic>Adam</italic>, make it the most widely used optimizer in neural network training. </p>
        <p>3.6.1. Multi-Objective Vector</p>
        <p>Each hyperparameter configuration <italic>x</italic> = (Epoch, Learning Rate, Batch Size) is evaluated using seven criteria representing both classification performance and model complexity:</p>
        <p><italic>f</italic>(<italic>x</italic>) = (1 − F1, 1 − MCC, 1 − AUC, GapAcc, GapLoss, Params_norm, Latency_norm) (6)</p>
        <p>1 − F1: error associated with the F1-score (macro average over the five classes);1 − MCC: error associated with the Matthews correlation coefficient;1 − AUC: error associated with the area under the ROC curve (macro, one-vs-rest average);GapAcc: gap between training and validation accuracy;GapLoss: gap between training and validation loss;Params_norm: number of model parameters, normalized by the maximum observed;Latency_norm: inference latency, normalized by the maximum observed.</p>
        <p>As all components are formulated as minimization criteria, the problem is written as: minimize f(x).</p>
        <p>3.6.2. Pareto Front and TOPSIS Method</p>
        <p>In multi-criteria optimization, a configuration <italic>A</italic> dominates a configuration <italic>B</italic> (<italic>A</italic> ≤ <italic>B</italic>) if <italic>f</italic><italic><sub>i</sub></italic>(<italic>A</italic>) ≤ <italic>f</italic><italic><sub>i</sub></italic>(<italic>B</italic>) for all criteria <italic>i</italic>, and if there exists at least one criterion <italic>j</italic> such that <italic>f</italic><italic><sub>j</sub></italic>(<italic>A</italic>) &lt; <italic>f</italic><italic><sub>j</sub></italic>(<italic>B</italic>). The non-dominated solutions constitute the Pareto Front, which reduces the search space to the optimal trade-offs only.</p>
        <p>The Pareto Front identifies optimal solutions but does not allow them to be ranked. The TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) method ranks these solutions using two fictitious references: an ideal solution (best values observed for each criterion) and an anti-ideal solution (worst values observed). For each configuration, the Euclidean distance D<sup>+</sup> to the ideal solution and D<sup>−</sup> to the anti-ideal solution are computed, then the closeness coefficient Ci = D<sup>−</sup>/(D<sup>+</sup> + D<sup>−</sup>), with 0 ≤ Ci ≤ 1. The closer Ci is to 1, the more the configuration is simultaneously close to the ideal and far from the anti-ideal. The Pareto Front thus acts as a qualitative filter, and TOPSIS as a geometric quantifier used to designate the best configuration within each search block.</p>
      </sec>
      <sec id="sec3dot7">
        <title>3.7. Evaluation Metrics</title>
        <p>Classification performance is evaluated from the multi-class confusion matrix, aggregated over the 5 cross-validation folds, using the following metrics:</p>
        <p>F1-score (macro):</p>
        <p>F1 = 2 × (Precision × Recall)/(Precision + Recall) (7)</p>
        <p>It is averaged over the five classes (computed from the cumulative confusion matrix of the 5 folds). Assesses the precision/recall balance, giving equal weight to each class, even minority ones.</p>
        <p>MCC (Matthews Correlation Coefficient):</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:mo>
              </mml:mo>
              <mml:mtext>MCC</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                  <mml:mo>⋅</mml:mo>
                  <mml:mtext>TN</mml:mtext>
                  <mml:mo>−</mml:mo>
                  <mml:mtext>FP</mml:mtext>
                  <mml:mo>⋅</mml:mo>
                  <mml:mtext>FN</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:msqrt>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>TP</mml:mtext>
                          <mml:mo>+</mml:mo>
                          <mml:mtext>FP</mml:mtext>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>TP</mml:mtext>
                          <mml:mo>+</mml:mo>
                          <mml:mtext>FN</mml:mtext>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>TN</mml:mtext>
                          <mml:mo>+</mml:mo>
                          <mml:mtext>FP</mml:mtext>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>TN</mml:mtext>
                          <mml:mo>+</mml:mo>
                          <mml:mtext>FN</mml:mtext>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msqrt>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Measures the model’s overall consistency, robust to class imbalance.</p>
        <p>AUC: area under the ROC curve</p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math>
            <mml:mrow>
              <mml:mtext>AUC</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:mrow>
                  <mml:munderover>
                    <mml:mo>∫</mml:mo>
                    <mml:mn>0</mml:mn>
                    <mml:mn>1</mml:mn>
                  </mml:munderover>
                  <mml:mrow>
                    <mml:mtext>TPR</mml:mtext>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mrow>
                        <mml:mtext>FPR</mml:mtext>
                      </mml:mrow>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                    <mml:mtext>d</mml:mtext>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mrow>
                        <mml:mtext>FPR</mml:mtext>
                      </mml:mrow>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where TPR = TP/(TP + FN) and FPR = FP/(FP + TN).</p>
        <p>Computed from the cumulative confusion matrix of the 5 folds. Indicates the model’s ability to correctly separate classes, independently of the chosen threshold.</p>
        <p>GapAcc = |Accuracy_training – Accuracy_validation| (10)</p>
        <p>Overfitting indicator based on accuracy.</p>
        <p>GapLoss = |Loss_training – Loss_validation| (11)</p>
        <p>overfitting indicator based on the loss function.</p>
        <p>Params_norm = Nb_model_parameters/Nb_max_parameters (12)</p>
        <p>Number of model parameters normalized with respect to a fixed reference ceiling of 12 × 10<sup>6</sup>, selected as a safety margin above the parameter count of the largest architecture evaluated in this study (ResNet18, ≈11.18 million parameters after adaptation to a five-class output layer).</p>
        <p>Latency_norm = Model_latency/Max_latency (13)</p>
        <p>Inference time normalized relative to the slowest configuration tested.</p>
        <p>The selection of the optimal configurations combines the Pareto Front, which retains the non-dominated solutions, and the TOPSIS method, which ranks them according to their proximity to the ideal solution, in order to identify the best trade-off between accuracy, generalization capacity and computational cost.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Results and Discussion</title>
      <sec id="sec4dot1">
        <title>4.1. Experimental Setup</title>
        <p>The experiments are conducted on the 560 image patches described in Section 3.1, using a 5-fold stratified cross-validation applied independently to each of the four architecture-optimizer configurations (ResNet18/MobileNetV2 × SGDM/Adam). For each configuration, a grid search of 20 combinations (5 batch sizes × 4 learning rates) is evaluated, <italic>i.e.</italic> 100 training runs per configuration and 400 training runs in total. The number of epochs is determined automatically by early stopping. Each combination is summarized by the seven-component multi-objective vector defined in Section 3.5, then filtered by the Pareto Front and ranked by TOPSIS in order to identify, for each learning-rate value, the best (epoch, batch size) combination, before a final selection among the four retained candidates.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Results</title>
        <p>4.2.1. Hyperparameter Optimization via Grid Search</p>
        <p><bold>Tables 2-5</bold> present, for each of the four configurations, the best (epoch, batch size) combination retained by the Pareto Front + TOPSIS for each of the four learning-rate values tested, along with the associated metrics. For the sake of readability, the 20 raw training runs per configuration (100 per architecture-optimizer pair in total) are not fully reproduced here; they are available as supplementary material.</p>
        <p>4.2.2. Comparison of the Optimal Configurations</p>
        <p><bold>Table 6</bold> gathers, for the four configurations ultimately retained following the TOPSIS selection, the values converted into directly interpretable metrics as well as the complexity and generalization indicators.</p>
        <p><bold>Table 2.</bold> ResNet18 + SGDM—best configuration for each learning-rate value (Pareto Front + TOPSIS). Selected configuration: Epoch = 25, LR = 10<sup>−</sup><sup>4</sup>, BS = 24.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Learning rate</bold>
                </td>
                <td>
                  <bold>Epoch*</bold>
                </td>
                <td>
                  <bold>Mini-batch size*</bold>
                </td>
                <td>
                  <bold>F1</bold>
                </td>
                <td>
                  <bold>MCC</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
                <td>
                  <bold>GapAcc</bold>
                </td>
                <td>
                  <bold>GapLoss</bold>
                </td>
                <td>
                  <bold>Pareto status</bold>
                </td>
                <td>
                  <bold>Ci</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>25</td>
                <td>24</td>
                <td>0.9626</td>
                <td>0.9533</td>
                <td>0.9975</td>
                <td>0.0188</td>
                <td>0.0405</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.7144</bold>
                </td>
              </tr>
              <tr>
                <td>
                  3.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>27</td>
                <td>32</td>
                <td>0.9665</td>
                <td>0.9580</td>
                <td>0.9962</td>
                <td>0.0170</td>
                <td>0.0792</td>
                <td>Dominated</td>
                <td>
                  <bold>0.2258</bold>
                </td>
              </tr>
              <tr>
                <td>
                  5.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>20</td>
                <td>32</td>
                <td>0.9682</td>
                <td>0.9607</td>
                <td>0.9969</td>
                <td>0.0192</td>
                <td>0.0743</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.3820</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>3</sup>
                </td>
                <td>18</td>
                <td>24</td>
                <td>0.9667</td>
                <td>0.9585</td>
                <td>0.9967</td>
                <td>0.0165</td>
                <td>0.0783</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.3124</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 3.</bold> ResNet18 + Adam—best configuration for each learning-rate value. Selected configuration: Epoch = 14, LR = 10<sup>−</sup><sup>4</sup>, BS = 32.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Learning rate</bold>
                </td>
                <td>
                  <bold>Epoch*</bold>
                </td>
                <td>
                  <bold>Mini-batch size*</bold>
                </td>
                <td>
                  <bold>F1</bold>
                </td>
                <td>
                  <bold>MCC</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
                <td>
                  <bold>GapAcc</bold>
                </td>
                <td>
                  <bold>GapLoss</bold>
                </td>
                <td>
                  <bold>Pareto status</bold>
                </td>
                <td>
                  <bold>Ci</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>14</td>
                <td>32</td>
                <td>0.9659</td>
                <td>0.9574</td>
                <td>0.9970</td>
                <td>0.0210</td>
                <td>0.0907</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.9957</bold>
                </td>
              </tr>
              <tr>
                <td>
                  3.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>14</td>
                <td>32</td>
                <td>0.9386</td>
                <td>0.9251</td>
                <td>0.9933</td>
                <td>0.0246</td>
                <td>0.1013</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.5304</bold>
                </td>
              </tr>
              <tr>
                <td>
                  5.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>17</td>
                <td>28</td>
                <td>0.9378</td>
                <td>0.9223</td>
                <td>0.9954</td>
                <td>0.0259</td>
                <td>0.0908</td>
                <td>Dominated</td>
                <td>
                  <bold>0.6163</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>3</sup>
                </td>
                <td>16</td>
                <td>28</td>
                <td>0.9181</td>
                <td>0.8984</td>
                <td>0.9882</td>
                <td>0.0313</td>
                <td>0.1197</td>
                <td>Dominated</td>
                <td>
                  <bold>0.0063</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 4.</bold> MobileNetV2 + SGDM—best configuration for each learning-rate value. Selected configuration: Epoch = 40, LR = 10<sup>−</sup><sup>4</sup>, BS = 28.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Learning rate</bold>
                </td>
                <td>
                  <bold>Epoch*</bold>
                </td>
                <td>
                  <bold>Mini-batch size*</bold>
                </td>
                <td>
                  <bold>F1</bold>
                </td>
                <td>
                  <bold>MCC</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
                <td>
                  <bold>GapAcc</bold>
                </td>
                <td>
                  <bold>GapLoss</bold>
                </td>
                <td>
                  <bold>Pareto status</bold>
                </td>
                <td>
                  <bold>Ci</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>40</td>
                <td>28</td>
                <td>0.9512</td>
                <td>0.9384</td>
                <td>0.9968</td>
                <td>0.0241</td>
                <td>0.0458</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.8420</bold>
                </td>
              </tr>
              <tr>
                <td>
                  3.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>21</td>
                <td>12</td>
                <td>0.9527</td>
                <td>0.9409</td>
                <td>0.9973</td>
                <td>0.0263</td>
                <td>0.0770</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.9995</bold>
                </td>
              </tr>
              <tr>
                <td>
                  5.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>21</td>
                <td>12</td>
                <td>0.9559</td>
                <td>0.9449</td>
                <td>0.9964</td>
                <td>0.0214</td>
                <td>0.0823</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.8430</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>3</sup>
                </td>
                <td>21</td>
                <td>16</td>
                <td>0.9472</td>
                <td>0.9349</td>
                <td>0.9960</td>
                <td>0.0335</td>
                <td>0.0872</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.6830</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 5.</bold> MobileNetV2 + Adam—best configuration for each learning-rate value. Selected configuration: Epoch = 16, LR = 3.10<sup>−</sup><sup>4</sup>, BS = 32.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Learning rate</bold>
                </td>
                <td>
                  <bold>Epoch*</bold>
                </td>
                <td>
                  <bold>Mini-batch size*</bold>
                </td>
                <td>
                  <bold>F1</bold>
                </td>
                <td>
                  <bold>MCC</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
                <td>
                  <bold>GapAcc</bold>
                </td>
                <td>
                  <bold>GapLoss</bold>
                </td>
                <td>
                  <bold>Pareto status</bold>
                </td>
                <td>
                  <bold>Ci</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>18</td>
                <td>12</td>
                <td>0.9476</td>
                <td>0.9350</td>
                <td>0.9957</td>
                <td>0.0170</td>
                <td>0.0894</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.9856</bold>
                </td>
              </tr>
              <tr>
                <td>
                  3.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>16</td>
                <td>32</td>
                <td>0.9659</td>
                <td>0.9570</td>
                <td>0.9954</td>
                <td>0.0201</td>
                <td>0.0623</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.9202</bold>
                </td>
              </tr>
              <tr>
                <td>
                  5.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>15</td>
                <td>16</td>
                <td>0.9182</td>
                <td>0.8996</td>
                <td>0.9891</td>
                <td>0.0237</td>
                <td>0.1253</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.7569</bold>
                </td>
              </tr>
              <tr>
                <td>
                  1.10
                  <sup>−</sup>
                  <sup>3</sup>
                </td>
                <td>18</td>
                <td>24</td>
                <td>0.9172</td>
                <td>0.8977</td>
                <td>0.9914</td>
                <td>0.0237</td>
                <td>0.0659</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.8255</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 6.</bold> Comparison of the four optimal configurations (architecture × optimizer).</p>
        <table-wrap id="tbl6">
          <label>Table 6</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Configuration</bold>
                </td>
                <td>
                  <bold>Epoch</bold>
                </td>
                <td>
                  <bold>LR</bold>
                </td>
                <td>
                  <bold>BS</bold>
                </td>
                <td>
                  <bold>F1</bold>
                </td>
                <td>
                  <bold>MCC</bold>
                </td>
                <td>
                  <bold>AUC</bold>
                </td>
                <td>
                  <bold>GapAcc</bold>
                </td>
                <td>
                  <bold>GapLoss</bold>
                </td>
                <td>
                  <bold>Params</bold>
                  <bold>_</bold>
                  <bold>norm</bold>
                </td>
                <td>
                  <bold>Lat</bold>
                  <bold>_</bold>
                  <bold>norm</bold>
                </td>
                <td>
                  <bold>Pareto status</bold>
                </td>
                <td>
                  <bold>Ci</bold>
                </td>
              </tr>
              <tr>
                <td>ResNet18 + SGDM</td>
                <td>25</td>
                <td>
                  10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>24</td>
                <td>0.9626</td>
                <td>0.9533</td>
                <td>0.9975</td>
                <td>0.0188</td>
                <td>0.0405</td>
                <td>0.9320</td>
                <td>0.1786</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.9134</bold>
                </td>
              </tr>
              <tr>
                <td>ResNet18 + Adam</td>
                <td>14</td>
                <td>
                  10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>32</td>
                <td>0.9659</td>
                <td>0.9574</td>
                <td>0.9970</td>
                <td>0.0210</td>
                <td>0.0907</td>
                <td>0.9320</td>
                <td>0.1774</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.5307</bold>
                </td>
              </tr>
              <tr>
                <td>MobileNetV2 + SGDM</td>
                <td>40</td>
                <td>
                  10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>28</td>
                <td>0.9512</td>
                <td>0.9384</td>
                <td>0.9968</td>
                <td>0.0241</td>
                <td>0.0458</td>
                <td>0.1873</td>
                <td>0.3254</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.4913</bold>
                </td>
              </tr>
              <tr>
                <td>MobileNetV2 + Adam</td>
                <td>16</td>
                <td>
                  3.10
                  <sup>−</sup>
                  <sup>4</sup>
                </td>
                <td>32</td>
                <td>0.9659</td>
                <td>0.9570</td>
                <td>0.9954</td>
                <td>0.0201</td>
                <td>0.0623</td>
                <td>0.1873</td>
                <td>0.3206</td>
                <td>Non-dominated</td>
                <td>
                  <bold>0.4470</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>4.2.3. Cumulative Confusion Matrices (5 Folds)</p>
        <p>In order to document the nature of the residual errors between morphologically close classes, the cumulative confusion matrix over the 5 cross-validation folds is presented below for each of the four optimal configurations retained (<bold>Table 6</bold>). Each matrix aggregates the validation predictions of the 5 folds; the percentages at the bottom of each column indicate the precision per predicted class (proportion of image patches correctly classified among those predicted in that class), the classes being coded ACH (Acanthocytes), DRE (Drepanocytes), ECH (Echinocytes), ELL (Elliptocytes) and OVA (Ovalocytes).</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId67.jpeg?20261016013749" />
        </fig>
        <p><bold>Figure 7.</bold> Cumulative confusion matrix over 5 folds: ResNet18 + SGDM (Epoch = 25, LR = 10<sup>−</sup><sup>4</sup>, BS = 24).</p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId68.jpeg?20261016013749" />
        </fig>
        <p><bold>Figure 8.</bold> Cumulative confusion matrix over 5 folds: ResNet18 + Adam (Epoch = 14, LR = 10<sup>−</sup><sup>4</sup>, BS = 32).</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId69.jpeg?20261016013749" />
        </fig>
        <p><bold>Figure 9.</bold> Cumulative confusion matrix over 5 folds: MobileNetV2 + SGDM (Epoch = 40, LR = 10<sup>−</sup><sup>4</sup>, BS = 28).</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId70.jpeg?20261016013749" />
        </fig>
        <p><bold>Figure 10.</bold> Cumulative confusion matrix over 5 folds: MobileNetV2 + Adam (Epoch = 16, LR = 3.10<sup>−</sup><sup>4</sup>, BS = 32).</p>
        <p><bold>Table 7.</bold> Precision per predicted class (%), read at the bottom of the cumulative confusion matrices (<xref ref-type="fig" rid="fig7">Figures 7-10</xref>).</p>
        <table-wrap id="tbl7">
          <label>Table 7</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Configuration</bold>
                </td>
                <td>
                  <bold>ACH (%)</bold>
                </td>
                <td>
                  <bold>DRE (%)</bold>
                </td>
                <td>
                  <bold>ECH (%)</bold>
                </td>
                <td>
                  <bold>ELL (%)</bold>
                </td>
                <td>
                  <bold>OVA (%)</bold>
                </td>
              </tr>
              <tr>
                <td>ResNet18 + SGDM</td>
                <td>97.8</td>
                <td>97.2</td>
                <td>97.5</td>
                <td>97.1</td>
                <td>93.1</td>
              </tr>
              <tr>
                <td>ResNet18 + Adam</td>
                <td>96.7</td>
                <td>99.1</td>
                <td>96.4</td>
                <td>97.1</td>
                <td>94.4</td>
              </tr>
              <tr>
                <td>MobileNetV2 + SGDM</td>
                <td>98.9</td>
                <td>98.1</td>
                <td>97.6</td>
                <td>95.6</td>
                <td>88.1</td>
              </tr>
              <tr>
                <td>MobileNetV2 + Adam</td>
                <td>100.0</td>
                <td>97.2</td>
                <td>97.6</td>
                <td>96.3</td>
                <td>93.1</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Reading <xref ref-type="fig" rid="fig7">Figures 7-10</xref> and <bold>Table 7</bold> confirms the hypotheses formulated in Section 2: the Ovalocytes (OVA) class systematically shows the lowest precision of the five classes, regardless of configuration (88.1% to 94.4%), which is consistent with the morphological proximity between elliptocytes and ovalocytes already reported in the literature. This effect is most pronounced for MobileNetV2 + SGDM (88.1%), a configuration for which the Ovalocytes class visibly concentrates the most prediction errors among the four configurations studied. Conversely, the Acanthocytes (ACH) and Drepanocytes (DRE) classes achieve a precision above 96.7% in all configurations, and up to 100% for Acanthocytes with MobileNetV2 + Adam, indicating that these morphologies are the most easily discriminated by both architectures. These observations qualify the ranking obtained on the global metrics (<bold>Table 6</bold>): two configurations displaying an almost identical global F1 (ResNet18 + Adam and MobileNetV2 + Adam, F1 ≈ 0.966) may nevertheless show different per-class error profiles, a criterion to take into account depending on the targeted clinical use (for example, if reliable detection of ovalocytes is a priority).</p>
        <p>4.2.4. Learning Curves (Representative Fold)</p>
        <p><xref ref-type="fig" rid="fig11">Figures 11-14</xref> illustrate, for a representative fold among the five cross-validation folds, the evolution of accuracy and the loss function during training for each of the four optimal configurations. These curves make it possible to qualitatively verify the stability of convergence and the absence of divergence between the training and validation curves, complementing the GapAcc and GapLoss indicators reported in <bold>Tables 2-6</bold>.</p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId71.jpeg?20261016013750" />
        </fig>
        <p><bold>Figure 11.</bold> Learning curves (representative fold): ResNet18 + SGDM.</p>
        <fig id="fig12">
          <label>Figure 12</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId72.jpeg?20261016013750" />
        </fig>
        <p><bold>Figure 12.</bold> Learning curves (representative fold): ResNet18 + Adam.</p>
        <fig id="fig13">
          <label>Figure 13</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId73.jpeg?20261016013750" />
        </fig>
        <p><bold>Figure 13.</bold> Learning curves (representative fold): MobileNetV2 + SGDM.</p>
        <fig id="fig14">
          <label>Figure 14</label>
          <graphic xlink:href="https://html.scirp.org/file/7302299-rId74.jpeg?20261016013750" />
        </fig>
        <p><bold>Figure 14.</bold> Learning curves (representative fold): MobileNetV2 + Adam.</p>
        <p>In line with the GapLoss values reported in <bold>Table 6</bold>, the curves of the configurations trained with Adam (<xref ref-type="fig" rid="fig12">Figure 12</xref> and <xref ref-type="fig" rid="fig14">Figure 14</xref>) reach a high validation accuracy in a smaller number of epochs, at the cost of a slightly more pronounced training/validation gap on the loss function than for the SGDM configurations (<xref ref-type="fig" rid="fig11">Figure 11</xref> and <xref ref-type="fig" rid="fig13">Figure 13</xref>), whose convergence is more gradual but results in a smaller final gap.</p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Comparison with Previous Studies</title>
        <p>The performance obtained in this study (F1 between 0.951 and 0.968, MCC between 0.938 and 0.961, AUC above 0.995 for all four configurations) lies in the upper range of recent work using residual or lightweight architectures for deep-learning-based classification of erythrocyte morphologies [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B4">4</xref>]. Unlike several earlier studies that evaluate ResNet18 and MobileNetV2 separately or on a reduced number of classes, this work proposes a joint and systematic comparison of the two architectures on five pathological morphologies simultaneously, combined with multi-objective hyperparameter optimization—an approach still uncommon in the literature dedicated to digital hematology [<xref ref-type="bibr" rid="B3">3</xref>][<xref ref-type="bibr" rid="B4">4</xref>]. This direct comparison, although carried out on a modest-sized dataset as is often the case in this field, makes it possible to document an accuracy/complexity trade-off that is rarely quantified as explicitly in existing work.</p>
        <p>Recent peer-reviewed studies further help position this contribution within the broader landscape of multiclass red-blood-cell morphology classification. Dhar <italic>et al.</italic> [<xref ref-type="bibr" rid="B30">30</xref>] proposed a hyperparameter-optimized KNN classifier for poikilocytosis classification, whereas Dhar <italic>et al.</italic> [<xref ref-type="bibr" rid="B31">31</xref>] developed a hybrid CNN-SVM approach for the same task; both studies, evaluated on datasets of comparable size, reported competitive classification performance without explicitly addressing the trade-off among predictive accuracy, generalization, model complexity, and inference latency. At a larger scale, Routt <italic>et al.</italic> [<xref ref-type="bibr" rid="B4">4</xref>] achieved approximately 98% accuracy using an ensemble of four CNNs for a seven-class red-blood-cell morphology classification task on a substantially larger dataset. Compared with these studies, the present work introduces an explicit multi-objective selection framework (Pareto Front and TOPSIS) that jointly balances classification performance, generalization indicators, model complexity, and inference latency—a dimension not addressed in [<xref ref-type="bibr" rid="B30">30</xref>][<xref ref-type="bibr" rid="B31">31</xref>] or [<xref ref-type="bibr" rid="B4">4</xref>].</p>
      </sec>
      <sec id="sec4dot4">
        <title>4.4. Discussion</title>
        <p>The four optimal configurations achieve an F1 above 0.95 and an MCC above 0.93, with an AUC systematically above 0.995 (<bold>Table 6</bold>). This level of performance, obtained on a database limited to 560 image patches distributed across five morphological classes, confirms the value of transfer learning: the generic representations inherited from ImageNet, combined with partial fine-tuning, are sufficient to effectively discriminate morphologies that are nonetheless visually close (echinocytes/acanthocytes, elliptocytes/ovalocytes), despite the small size of the dataset. The AUC varies very little between configurations (0.9954 to 0.9975), which indicates that it saturates quickly and loses its discriminating power for distinguishing between hyperparameters: it is essentially the pair (1 − F1, 1 − MCC), more sensitive to errors on minority classes, that drives the TOPSIS selection—consistent with the attention paid to preserving minority classes (echinocytes, acanthocytes) through stratified cross-validation (Section 3.1).</p>
        <p>For the same Adam optimizer, ResNet18 and MobileNetV2 achieve an almost identical F1 (0.9659 versus 0.9659) and a very close MCC (0.9574 versus 0.9570). The deeper architecture of ResNet18 therefore does not provide a measurable discriminative advantage here over the lighter architecture of MobileNetV2, which confirms a posteriori the complementarity hypothesis formulated in Section 3.3: on a five-class problem with a limited dataset, the additional depth of ResNet18 does not bring a decisive representational gain. On the other hand, the gap is clear in terms of model complexity: the Params_norm parameter goes from 0.932 (ResNet18) to 0.187 (MobileNetV2), a direct reflection of the roughly 3.3 ratio between the ~11.7 million parameters of ResNet18 and the ~3.5 million of MobileNetV2. A more unexpected result concerns the normalized latency: it is systematically higher for MobileNetV2 (0.32 - 0.33) than for ResNet18 (0.177 - 0.179), whereas this architecture is designed for fast inference. This counter-intuitive result is likely explained by the fact that the depthwise separable convolutions of MobileNetV2, although less costly in terms of parameters and theoretical operations, are often less well optimized than classical dense convolutions by the libraries and hardware used (MATLAB implementation, GTX 1070 GPU), which do not necessarily benefit from the specialized kernels available on more recent frameworks. The theoretical gain in lightness therefore does not automatically translate into a measured gain in inference time, which constitutes a limitation to be documented more precisely in future work, through a framework-independent latency measurement.</p>
        <p>The Adam optimizer consistently converges in a markedly lower number of epochs than SGDM, for an equivalent architecture: 14 epochs versus 25 for ResNet18 (a reduction of about 44%), and 16 epochs versus 40 for MobileNetV2 (a reduction of about 60%). This acceleration of convergence is consistent with Adam’s adaptive properties (Section 3.5), which individually adjust the learning-rate step per parameter, unlike SGDM, whose inertia improves the stability of the descent without necessarily accelerating its speed. This speed, however, has an observable counterpart on GapLoss, the overfitting indicator: for ResNet18, Adam shows a GapLoss of 0.0907 versus 0.0405 for SGDM, more than double; for MobileNetV2, the gap goes in the same direction although less pronounced (0.0623 versus 0.0458). Adam thus appears to converge more quickly towards an optimum that generalizes slightly less well than the one reached more gradually by SGDM, even though the early-stopping mechanism limits this risk by halting training as soon as validation stops improving. This trade-off between convergence speed and generalization qualifies the common belief that Adam is strictly superior to SGDM.</p>
        <p>Examination of <bold>Tables 2-5</bold> shows that the value LR = 10<sup>−4</sup> recurs frequently among the configurations selected by TOPSIS (three of the four optimal configurations), confirming its position as a robust convergence value. Higher learning rates (5.10<sup>−4</sup>, 10<sup>−3</sup>) tend to reduce the number of epochs required but generally degrade F1 and MCC, reflecting the learning instability inherent to high learning rates. The optimal batch size varies more depending on the architecture and the optimizer (12 to 32 depending on the case), without as clear a trend as for the learning rate, which suggests a secondary sensitivity of this parameter within the tested range.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Conclusions</title>
      <p>This study proposed an integrated approach for the isolation and morphological classification of pathological red blood cells from blood-smear images. By combining pre-trained convolutional neural network architectures (ResNet18 and MobileNetV2) with a multi-objective hyperparameter optimization strategy (Pareto Front and TOPSIS), we showed that it is possible to obtain robust performance (F1 &gt; 0.95; MCC &gt; 0.93; AUC &gt; 0.995) despite the limited size of the dataset. The use of 5-fold stratified cross-validation helped strengthen the reliability of the results and reduce the risk of overfitting.</p>
      <p>The results obtained confirm the relevance of transfer learning for biomedical applications where annotated databases are scarce and costly to produce. ResNet18 stood out for its ability to extract deep, discriminative representations, with the lowest GapLoss, while MobileNetV2 demonstrated almost equivalent performance with nearly five times fewer parameters, although its latency measured in practice remains higher than that of ResNet18. This complementarity opens up prospects for the development of accessible and reproducible automated systems in clinical hematology, with the choice between the two architectures ultimately depending on deployment constraints (maximum accuracy sought versus model lightness).</p>
    </sec>
    <sec id="sec6">
      <title>Supplementary Material</title>
      <p>Pareto status and TOPSIS closeness coefficient (Ci) for all 20 hyperparameter configurations tested for each architecture-optimizer combination (5 mini-batch sizes × 4 learning rates), provided to ensure full reproducibility of the two-stage selection process described in Section 3.6. Within each learning-rate block (5 rows), the highlighted row corresponds to the configuration selected by TOPSIS for that learning rate.</p>
      <p><bold>Table S1.</bold> ResNet18 + SGDM—20 configurations tested.</p>
      <table-wrap id="tbl8">
        <label>Table 8</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>LR</bold>
              </td>
              <td>
                <bold>BS</bold>
              </td>
              <td>
                <bold>Epoch</bold>
              </td>
              <td>
                <bold>Pareto status</bold>
              </td>
              <td>
                <bold>Ci</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>12</td>
              <td>21</td>
              <td>Non-dominated</td>
              <td>0.5878</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>16</td>
              <td>22</td>
              <td>Non-dominated</td>
              <td>0.4875</td>
            </tr>
            <tr>
              <td>
                <bold>1e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>24</bold>
              </td>
              <td>
                <bold>25</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9767</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>28</td>
              <td>25</td>
              <td>Non-dominated</td>
              <td>0.2206</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>32</td>
              <td>28</td>
              <td>Dominated</td>
              <td>0.0909</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>12</td>
              <td>18</td>
              <td>Non-dominated</td>
              <td>0.7096</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>16</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.6201</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>24</td>
              <td>28</td>
              <td>Non-dominated</td>
              <td>0.2158</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>28</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.4015</td>
            </tr>
            <tr>
              <td>
                <bold>3e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>32</bold>
              </td>
              <td>
                <bold>27</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.7902</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>12</td>
              <td>20</td>
              <td>Non-dominated</td>
              <td>0.6110</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>16</td>
              <td>18</td>
              <td>Dominated</td>
              <td>0.0390</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>24</td>
              <td>17</td>
              <td>Dominated</td>
              <td>0.4401</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>28</td>
              <td>17</td>
              <td>Non-dominated</td>
              <td>0.8868</td>
            </tr>
            <tr>
              <td>
                <bold>5e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>32</bold>
              </td>
              <td>
                <bold>20</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8927</bold>
              </td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>12</td>
              <td>12</td>
              <td>Dominated</td>
              <td>0.0086</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>16</td>
              <td>16</td>
              <td>Non-dominated</td>
              <td>0.6448</td>
            </tr>
            <tr>
              <td>
                <bold>1e</bold>
                <bold>−</bold>
                <bold>3</bold>
              </td>
              <td>
                <bold>24</bold>
              </td>
              <td>
                <bold>18</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9677</bold>
              </td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>28</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.9116</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>32</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.9172</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p><bold>Table S2.</bold>ResNet18 + Adam—20 configurations tested.</p>
      <table-wrap id="tbl9">
        <label>Table 9</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>LR</bold>
              </td>
              <td>
                <bold>BS</bold>
              </td>
              <td>
                <bold>Epoch</bold>
              </td>
              <td>
                <bold>Pareto status</bold>
              </td>
              <td>
                <bold>Ci</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>12</td>
              <td>17</td>
              <td>Non-dominated</td>
              <td>0.8525</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>16</td>
              <td>16</td>
              <td>Dominated</td>
              <td>0.7642</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>24</td>
              <td>15</td>
              <td>Non-dominated</td>
              <td>0.3872</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>28</td>
              <td>16</td>
              <td>Dominated</td>
              <td>0.3864</td>
            </tr>
            <tr>
              <td>
                <bold>1e−4</bold>
              </td>
              <td>
                <bold>32</bold>
              </td>
              <td>
                <bold>14</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8803</bold>
              </td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>12</td>
              <td>14</td>
              <td>Non-dominated</td>
              <td>0.6638</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>16</td>
              <td>15</td>
              <td>Non-dominated</td>
              <td>0.5414</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>24</td>
              <td>13</td>
              <td>Dominated</td>
              <td>0.6063</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>28</td>
              <td>14</td>
              <td>Dominated</td>
              <td>0.0130</td>
            </tr>
            <tr>
              <td>
                <bold>3e−4</bold>
              </td>
              <td>
                <bold>32</bold>
              </td>
              <td>
                <bold>14</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9825</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>12</td>
              <td>10</td>
              <td>Non-dominated</td>
              <td>0.2905</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>16</td>
              <td>13</td>
              <td>Dominated</td>
              <td>0.1997</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>24</td>
              <td>13</td>
              <td>Dominated</td>
              <td>0.7328</td>
            </tr>
            <tr>
              <td>
                <bold>5e−4</bold>
              </td>
              <td>
                <bold>28</bold>
              </td>
              <td>
                <bold>17</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9794</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>32</td>
              <td>12</td>
              <td>Non-dominated</td>
              <td>0.8841</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>12</td>
              <td>12</td>
              <td>Non-dominated</td>
              <td>0.4117</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>16</td>
              <td>12</td>
              <td>Dominated</td>
              <td>0.3176</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>24</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.5253</td>
            </tr>
            <tr>
              <td>
                <bold>1e−3</bold>
              </td>
              <td>
                <bold>28</bold>
              </td>
              <td>
                <bold>16</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8428</bold>
              </td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>32</td>
              <td>13</td>
              <td>Dominated</td>
              <td>0.2720</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p><bold>Table S3.</bold>MobileNetV2 + SGDM—20 configurations tested.</p>
      <table-wrap id="tbl10">
        <label>Table 10</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>LR</bold>
              </td>
              <td>
                <bold>BS</bold>
              </td>
              <td>
                <bold>Epoch</bold>
              </td>
              <td>
                <bold>Pareto status</bold>
              </td>
              <td>
                <bold>Ci</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>12</td>
              <td>24</td>
              <td>Dominated</td>
              <td>0.3057</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>16</td>
              <td>27</td>
              <td>Non-dominated</td>
              <td>0.8069</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>24</td>
              <td>36</td>
              <td>Dominated</td>
              <td>0.2063</td>
            </tr>
            <tr>
              <td>
                <bold>1e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>28</bold>
              </td>
              <td>
                <bold>40</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8417</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>32</td>
              <td>40</td>
              <td>Dominated</td>
              <td>0.3742</td>
            </tr>
            <tr>
              <td>
                <bold>3e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>12</bold>
              </td>
              <td>
                <bold>21</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9995</bold>
              </td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>16</td>
              <td>20</td>
              <td>Non-dominated</td>
              <td>0.0707</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>24</td>
              <td>21</td>
              <td>Dominated</td>
              <td>0.5755</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>28</td>
              <td>25</td>
              <td>Dominated</td>
              <td>0.5110</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>32</td>
              <td>28</td>
              <td>Dominated</td>
              <td>0.6748</td>
            </tr>
            <tr>
              <td>
                <bold>5e</bold>
                <bold>−</bold>
                <bold>4</bold>
              </td>
              <td>
                <bold>12</bold>
              </td>
              <td>
                <bold>21</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8432</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>16</td>
              <td>21</td>
              <td>Dominated</td>
              <td>0.2076</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>24</td>
              <td>18</td>
              <td>Non-dominated</td>
              <td>0.6734</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>28</td>
              <td>27</td>
              <td>Dominated</td>
              <td>0.5044</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>32</td>
              <td>22</td>
              <td>Dominated</td>
              <td>0.5179</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>12</td>
              <td>17</td>
              <td>Non-dominated</td>
              <td>0.4705</td>
            </tr>
            <tr>
              <td>
                <bold>1e</bold>
                <bold>−</bold>
                <bold>3</bold>
              </td>
              <td>
                <bold>16</bold>
              </td>
              <td>
                <bold>21</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.6828</bold>
              </td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>24</td>
              <td>15</td>
              <td>Dominated</td>
              <td>0.1526</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>28</td>
              <td>17</td>
              <td>Dominated</td>
              <td>0.3538</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>32</td>
              <td>19</td>
              <td>Non-dominated</td>
              <td>0.5351</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p><bold>Table S4.</bold> MobileNetV2 + Adam—20 configurations tested.</p>
      <table-wrap id="tbl11">
        <label>Table 11</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>LR</bold>
              </td>
              <td>
                <bold>BS</bold>
              </td>
              <td>
                <bold>Epoch</bold>
              </td>
              <td>
                <bold>Pareto status</bold>
              </td>
              <td>
                <bold>Ci</bold>
              </td>
            </tr>
            <tr>
              <td>
                <bold>1e−4</bold>
              </td>
              <td>
                <bold>12</bold>
              </td>
              <td>
                <bold>18</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9856</bold>
              </td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>16</td>
              <td>18</td>
              <td>Dominated</td>
              <td>0.1633</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>24</td>
              <td>16</td>
              <td>Non-dominated</td>
              <td>0.4254</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>28</td>
              <td>17</td>
              <td>Non-dominated</td>
              <td>0.5817</td>
            </tr>
            <tr>
              <td>1e−4</td>
              <td>32</td>
              <td>23</td>
              <td>Non-dominated</td>
              <td>0.4036</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>12</td>
              <td>17</td>
              <td>Dominated</td>
              <td>0.4455</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>16</td>
              <td>18</td>
              <td>Non-dominated</td>
              <td>0.6467</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>24</td>
              <td>16</td>
              <td>Non-dominated</td>
              <td>0.7962</td>
            </tr>
            <tr>
              <td>3e−4</td>
              <td>28</td>
              <td>18</td>
              <td>Dominated</td>
              <td>0.0069</td>
            </tr>
            <tr>
              <td>
                <bold>3e−4</bold>
              </td>
              <td>
                <bold>32</bold>
              </td>
              <td>
                <bold>16</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.9202</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>12</td>
              <td>14</td>
              <td>Dominated</td>
              <td>0.2896</td>
            </tr>
            <tr>
              <td>
                <bold>5e−4</bold>
              </td>
              <td>
                <bold>16</bold>
              </td>
              <td>
                <bold>15</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.7569</bold>
              </td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>24</td>
              <td>23</td>
              <td>Dominated</td>
              <td>0.6163</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>28</td>
              <td>15</td>
              <td>Non-dominated</td>
              <td>0.3652</td>
            </tr>
            <tr>
              <td>5e−4</td>
              <td>32</td>
              <td>16</td>
              <td>Non-dominated</td>
              <td>0.7536</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>12</td>
              <td>16</td>
              <td>Non-dominated</td>
              <td>0.4842</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>16</td>
              <td>14</td>
              <td>Dominated</td>
              <td>0.2089</td>
            </tr>
            <tr>
              <td>
                <bold>1e−3</bold>
              </td>
              <td>
                <bold>24</bold>
              </td>
              <td>
                <bold>18</bold>
              </td>
              <td>
                <bold>Non-dominated</bold>
              </td>
              <td>
                <bold>0.8255</bold>
              </td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>28</td>
              <td>17</td>
              <td>Dominated</td>
              <td>0.2947</td>
            </tr>
            <tr>
              <td>1e−3</td>
              <td>32</td>
              <td>15</td>
              <td>Non-dominated</td>
              <td>0.7700</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Litjens, G., Kooi, T., Bejnordi, B.E., Setio, A.A.A., Ciompi, F., Ghafoorian, M., <italic>et al</italic>. (2017) A Survey on Deep Learning in Medical Image Analysis. <italic>Medical Image Analysis</italic>, 42, 60-88. https://doi.org/10.1016/j.media.2017.07.005 <pub-id pub-id-type="doi">10.1016/j.media.2017.07.005</pub-id><pub-id pub-id-type="pmid">28778026</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.media.2017.07.005">https://doi.org/10.1016/j.media.2017.07.005</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Litjens, G.</string-name>
              <string-name>Kooi, T.</string-name>
              <string-name>Bejnordi, B.E.</string-name>
              <string-name>Setio, A.A.A.</string-name>
              <string-name>Ciompi, F.</string-name>
              <string-name>Ghafoorian, M.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>A Survey on Deep Learning in Medical Image Analysis</article-title>
            <source>Medical Image Analysis</source>
            <volume>42</volume>
            <pub-id pub-id-type="doi">10.1016/j.media.2017.07.005</pub-id>
            <pub-id pub-id-type="pmid">28778026</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bessis, M. (1977) Blood Smears Reinterpreted. Translated by G. Brecher, Springer-Verlag.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bessis, M.</string-name>
              <string-name>Brecher, S</string-name>
            </person-group>
            <year>1977</year>
            <article-title>Blood Smears Reinterpreted</article-title>
            <source>Translated by G. Brecher</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Petrović, N., Moyà-Alcover, G., Jaume-i-Capó, A. and González-Hidalgo, M. (2020) Sickle-Cell Disease Diagnosis Support Selecting the Most Appropriate Machine Learning Method: Towards a General and Interpretable Approach for Cell Morphology Analysis from Microscopy Images. <italic>Computers in Biology and Medicine</italic>, 126, Article ID: 104027. https://doi.org/10.1016/j.compbiomed.2020.104027 <pub-id pub-id-type="doi">10.1016/j.compbiomed.2020.104027</pub-id><pub-id pub-id-type="pmid">33075715</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.compbiomed.2020.104027">https://doi.org/10.1016/j.compbiomed.2020.104027</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Alcover, G.</string-name>
              <string-name>Hidalgo, M.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Sickle-Cell Disease Diagnosis Support Selecting the Most Appropriate Machine Learning Method: Towards a General and Interpretable Approach for Cell Morphology Analysis from Microscopy Images</article-title>
            <source>Computers in Biology and Medicine</source>
            <volume>126</volume>
            <fpage>104027</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.compbiomed.2020.104027</pub-id>
            <pub-id pub-id-type="pmid">33075715</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Routt, A.H., Yang, N., Piety, N.Z., Lu, M. and Shevkoplyas, S.S. (2023) Deep Ensemble Learning Enables Highly Accurate Classification of Stored Red Blood Cell Morphology. <italic>Scientific Reports</italic>, 13, Article No. 3152. https://doi.org/10.1038/s41598-023-30214-w <pub-id pub-id-type="doi">10.1038/s41598-023-30214-w</pub-id><pub-id pub-id-type="pmid">36823298</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-023-30214-w">https://doi.org/10.1038/s41598-023-30214-w</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Routt, A.H.</string-name>
              <string-name>Yang, N.</string-name>
              <string-name>Piety, N.Z.</string-name>
              <string-name>Lu, M.</string-name>
              <string-name>Shevkoplyas, S.S.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Deep Ensemble Learning Enables Highly Accurate Classification of Stored Red Blood Cell Morphology</article-title>
            <source>Scientific Reports</source>
            <volume>13</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-023-30214-w</pub-id>
            <pub-id pub-id-type="pmid">36823298</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Otsu, N. (1979) A Threshold Selection Method from Gray-Level Histograms. <italic>IEEE Transactions on Systems</italic>, <italic>Man</italic>, <italic>and Cybernetics</italic>, 9, 62-66. https://doi.org/10.1109/tsmc.1979.4310076 <pub-id pub-id-type="doi">10.1109/tsmc.1979.4310076</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tsmc.1979.4310076">https://doi.org/10.1109/tsmc.1979.4310076</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Otsu, N.</string-name>
              <string-name>Systems, M</string-name>
            </person-group>
            <year>1979</year>
            <article-title>A Threshold Selection Method from Gray-Level Histograms</article-title>
            <source>IEEE Transactions on Systems</source>
            <volume>9</volume>
            <pub-id pub-id-type="doi">10.1109/tsmc.1979.4310076</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Niblack, W. (1986) An Introduction to Digital Image Processing. Prentice-Hall, 115-116.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Niblack, W.</string-name>
            </person-group>
            <year>1986</year>
            <article-title>An Introduction to Digital Image Processing</article-title>
            <source>Prentice-Hall</source>
            <volume>115</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Bernsen, J. (1986) Dynamic Thresholding of Grey-Level Images. <italic>Proceedings of the</italic>8 <italic>th International Conference on Pattern Recognition</italic> ( <italic>ICPR</italic>), Paris, 27-31 October 1986, 1251-1255.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Bernsen, J.</string-name>
            </person-group>
            <year>1986</year>
            <article-title>Dynamic Thresholding of Grey-Level Images</article-title>
            <source>Proceedings of the 8th International Conference on Pattern Recognition (ICPR)</source>
            <volume>27</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Sauvola, J. and Pietikäinen, M. (2000) Adaptive Document Image Binarization. <italic>Pattern Recognition</italic>, 33, 225-236. https://doi.org/10.1016/s0031-3203(99)00055-2 <pub-id pub-id-type="doi">10.1016/s0031-3203(99)00055-2</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/s0031-3203(99)00055-2">https://doi.org/10.1016/s0031-3203(99)00055-2</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Sauvola, J.</string-name>
            </person-group>
            <year>2000</year>
            <article-title>Adaptive Document Image Binarization</article-title>
            <source>Pattern Recognition</source>
            <volume>3203</volume>
            <issue>99</issue>
            <pub-id pub-id-type="doi">10.1016/s0031-3203(99)00055-2</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Vincent, L. and Soille, P. (1991) Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations. <italic>IEEE Transactions on Pattern Analysis and Machine Intelligence</italic>, 13, 583-598. https://doi.org/10.1109/34.87344 <pub-id pub-id-type="doi">10.1109/34.87344</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/34.87344">https://doi.org/10.1109/34.87344</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Vincent, L.</string-name>
              <string-name>Soille, P.</string-name>
            </person-group>
            <year>1991</year>
            <article-title>Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations</article-title>
            <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/34.87344</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Cortes, C. and Vapnik, V. (1995) Support-Vector Networks. <italic>Machine Learning</italic>, 20, 273-297. https://doi.org/10.1023/a:1022627411411 <pub-id pub-id-type="doi">10.1023/a:1022627411411</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1022627411411">https://doi.org/10.1023/a:1022627411411</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Cortes, C.</string-name>
              <string-name>Vapnik, V.</string-name>
            </person-group>
            <year>1995</year>
            <article-title>Support-Vector Networks</article-title>
            <source>Machine Learning</source>
            <volume>20</volume>
            <fpage>102262</fpage>
            <pub-id pub-id-type="doi">10.1023/a:1022627411411</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Breiman, L. (2001) Random Forests. <italic>Machine Learning</italic>, 45, 5-32. https://doi.org/10.1023/a:1010933404324 <pub-id pub-id-type="doi">10.1023/a:1010933404324</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/a:1010933404324">https://doi.org/10.1023/a:1010933404324</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Breiman, L.</string-name>
            </person-group>
            <year>2001</year>
            <article-title>Random Forests</article-title>
            <source>Machine Learning</source>
            <volume>45</volume>
            <fpage>101093</fpage>
            <pub-id pub-id-type="doi">10.1023/a:1010933404324</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Ronneberger, O., Fischer, P. and Brox, T. (2015) U-Net: Convolutional Networks for Biomedical Image Segmentation. In: Navab, N., Hornegger, J., Wells, W. and Frangi, A., Eds., <italic>Medical Image Computing and Computer</italic>- <italic>Assisted Intervention</italic> ( <italic>MICCAI</italic> 2015), Springer, 234-241. https://doi.org/10.1007/978-3-319-24574-4_28 <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-24574-4_28">https://doi.org/10.1007/978-3-319-24574-4_28</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Ronneberger, O.</string-name>
              <string-name>Fischer, P.</string-name>
              <string-name>Brox, T.</string-name>
              <string-name>Navab, N.</string-name>
              <string-name>Hornegger, J.</string-name>
              <string-name>Wells, W.</string-name>
              <string-name>Frangi, A.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>U-Net: Convolutional Networks for Biomedical Image Segmentation</article-title>
            <source>In: Navab</source>
            <volume>234</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-319-24574-4_28</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">He, K., Gkioxari, G., Dollar, P. and Girshick, R. (2017) Mask R-CNN. 2017 <italic>IEEE International Conference on Computer Vision</italic> ( <italic>ICCV</italic>), Venice, 22-29 October 2017, 2961-2969. https://doi.org/10.1109/iccv.2017.322 <pub-id pub-id-type="doi">10.1109/iccv.2017.322</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccv.2017.322">https://doi.org/10.1109/iccv.2017.322</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>He, K.</string-name>
              <string-name>Gkioxari, G.</string-name>
              <string-name>Dollar, P.</string-name>
              <string-name>Girshick, R.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Mask R-CNN</article-title>
            <source>2017 IEEE International Conference on Computer Vision (ICCV)</source>
            <volume>22</volume>
            <pub-id pub-id-type="doi">10.1109/iccv.2017.322</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Hörst, F., Rempe, M., Heine, L., Seibold, C., Keyl, J., Baldini, G., <italic>et al</italic>. (2024) Cellvit: Vision Transformers for Precise Cell Segmentation and Classification. <italic>Medical Image Analysis</italic>, 94, Article ID: 103143. https://doi.org/10.1016/j.media.2024.103143 <pub-id pub-id-type="doi">10.1016/j.media.2024.103143</pub-id><pub-id pub-id-type="pmid">38507894</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.media.2024.103143">https://doi.org/10.1016/j.media.2024.103143</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Rempe, M.</string-name>
              <string-name>Heine, L.</string-name>
              <string-name>Seibold, C.</string-name>
              <string-name>Keyl, J.</string-name>
              <string-name>Baldini, G.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Cellvit: Vision Transformers for Precise Cell Segmentation and Classification</article-title>
            <source>Medical Image Analysis</source>
            <volume>94</volume>
            <fpage>103143</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.media.2024.103143</pub-id>
            <pub-id pub-id-type="pmid">38507894</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Stringer, C., Wang, T., Michaelos, M. and Pachitariu, M. (2021) Cellpose: A Generalist Algorithm for Cellular Segmentation. <italic>Nature Methods</italic>, 18, 100-106. https://doi.org/10.1038/s41592-020-01018-x <pub-id pub-id-type="doi">10.1038/s41592-020-01018-x</pub-id><pub-id pub-id-type="pmid">33318659</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41592-020-01018-x">https://doi.org/10.1038/s41592-020-01018-x</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Stringer, C.</string-name>
              <string-name>Wang, T.</string-name>
              <string-name>Michaelos, M.</string-name>
              <string-name>Pachitariu, M.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Cellpose: A Generalist Algorithm for Cellular Segmentation</article-title>
            <source>Nature Methods</source>
            <volume>18</volume>
            <pub-id pub-id-type="doi">10.1038/s41592-020-01018-x</pub-id>
            <pub-id pub-id-type="pmid">33318659</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Schmidt, U., Weigert, M., Broaddus, C. and Myers, G. (2018) Cell Detection with Star-Convex Polygons. In: Frangi, A., Schnabel, J., Davatzikos, C., Alberola-López, C. and Fichtinger, G., Eds., <italic>Medical Image Computing and Computer</italic>- <italic>Assisted Intervention</italic> ( <italic>MICCAI</italic> 2018), Springer, 265-273. https://doi.org/10.1007/978-3-030-00934-2_30 <pub-id pub-id-type="doi">10.1007/978-3-030-00934-2_30</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-030-00934-2_30">https://doi.org/10.1007/978-3-030-00934-2_30</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Schmidt, U.</string-name>
              <string-name>Weigert, M.</string-name>
              <string-name>Broaddus, C.</string-name>
              <string-name>Myers, G.</string-name>
              <string-name>Frangi, A.</string-name>
              <string-name>Schnabel, J.</string-name>
              <string-name>Davatzikos, C.</string-name>
              <string-name>Fichtinger, G.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Cell Detection with Star-Convex Polygons</article-title>
            <source>In: Frangi</source>
            <volume>265</volume>
            <pub-id pub-id-type="doi">10.1007/978-3-030-00934-2_30</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">He, H. and Garcia, E.A. (2009) Learning from Imbalanced Data. <italic>IEEE Transactions on Knowledge and Data Engineering</italic>, 21, 1263-1284. https://doi.org/10.1109/tkde.2008.239 <pub-id pub-id-type="doi">10.1109/tkde.2008.239</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tkde.2008.239">https://doi.org/10.1109/tkde.2008.239</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>He, H.</string-name>
              <string-name>Garcia, E.A.</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Learning from Imbalanced Data</article-title>
            <source>IEEE Transactions on Knowledge and Data Engineering</source>
            <volume>21</volume>
            <pub-id pub-id-type="doi">10.1109/tkde.2008.239</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Shorten, C. and Khoshgoftaar, T.M. (2019) A Survey on Image Data Augmentation for Deep Learning. <italic>Journal of Big Data</italic>, 6, Article No. 60. https://doi.org/10.1186/s40537-019-0197-0 <pub-id pub-id-type="doi">10.1186/s40537-019-0197-0</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/s40537-019-0197-0">https://doi.org/10.1186/s40537-019-0197-0</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Shorten, C.</string-name>
              <string-name>Khoshgoftaar, T.M.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>A Survey on Image Data Augmentation for Deep Learning</article-title>
            <source>Journal of Big Data</source>
            <volume>6</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1186/s40537-019-0197-0</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">He, K., Zhang, X., Ren, S. and Sun, J. (2016) Deep Residual Learning for Image Recognition. 2016 <italic>IEEE Conference on Computer Vision and Pattern Recognition</italic> ( <italic>CVPR</italic>), Las Vegas, 27-30 June 2016, 770-778. https://doi.org/10.1109/cvpr.2016.90 <pub-id pub-id-type="doi">10.1109/cvpr.2016.90</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/cvpr.2016.90">https://doi.org/10.1109/cvpr.2016.90</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>He, K.</string-name>
              <string-name>Zhang, X.</string-name>
              <string-name>Ren, S.</string-name>
              <string-name>Sun, J.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Deep Residual Learning for Image Recognition</article-title>
            <source>2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1109/cvpr.2016.90</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Sandler, M., Howard, A., Zhu, M., Zhmoginov, A. and Chen, L. (2018) MobileNetV2: Inverted Residuals and Linear Bottlenecks. 2018 <italic>IEEE</italic>/ <italic>CVF Conference on Computer Vision and Pattern Recognition</italic>, Salt Lake City, 18-23 June 2018, 4510-4520. https://doi.org/10.1109/cvpr.2018.00474 <pub-id pub-id-type="doi">10.1109/cvpr.2018.00474</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/cvpr.2018.00474">https://doi.org/10.1109/cvpr.2018.00474</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Sandler, M.</string-name>
              <string-name>Howard, A.</string-name>
              <string-name>Zhu, M.</string-name>
              <string-name>Zhmoginov, A.</string-name>
              <string-name>Chen, L.</string-name>
              <string-name>Recognition, S</string-name>
            </person-group>
            <year>2018</year>
            <article-title>MobileNetV2: Inverted Residuals and Linear Bottlenecks</article-title>
            <source>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</source>
            <volume>18</volume>
            <pub-id pub-id-type="doi">10.1109/cvpr.2018.00474</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., <italic>et al</italic>. (2015) ImageNet Large Scale Visual Recognition Challenge. <italic>International Journal of Computer Vision</italic>, 115, 211-252. https://doi.org/10.1007/s11263-015-0816-y <pub-id pub-id-type="doi">10.1007/s11263-015-0816-y</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11263-015-0816-y">https://doi.org/10.1007/s11263-015-0816-y</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Russakovsky, O.</string-name>
              <string-name>Deng, J.</string-name>
              <string-name>Su, H.</string-name>
              <string-name>Krause, J.</string-name>
              <string-name>Satheesh, S.</string-name>
              <string-name>Ma, S.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>ImageNet Large Scale Visual Recognition Challenge</article-title>
            <source>International Journal of Computer Vision</source>
            <volume>115</volume>
            <pub-id pub-id-type="doi">10.1007/s11263-015-0816-y</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Huang, G., Liu, Z., Van Der Maaten, L. and Weinberger, K.Q. (2017). Densely Connected Convolutional Networks. 2017 <italic>IEEE Conference on Computer Vision and Pattern Recognition</italic> ( <italic>CVPR</italic>), Honolulu, 21-26 July 2017, 2261-2269. https://doi.org/10.1109/cvpr.2017.243 <pub-id pub-id-type="doi">10.1109/cvpr.2017.243</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/cvpr.2017.243">https://doi.org/10.1109/cvpr.2017.243</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Huang, G.</string-name>
              <string-name>Liu, Z.</string-name>
              <string-name>Maaten, L.</string-name>
              <string-name>Weinberger, K.Q.</string-name>
            </person-group>
            <year>2017</year>
            <pub-id pub-id-type="doi">10.1109/cvpr.2017.243</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Bergstra, J. and Bengio, Y. (2012) Random Search for Hyper-Parameter Optimization. <italic>Journal of Machine Learning Research</italic>, 13, 281-305.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Bergstra, J.</string-name>
              <string-name>Bengio, Y.</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Random Search for Hyper-Parameter Optimization</article-title>
            <source>Journal of Machine Learning Research</source>
            <volume>13</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Snoek, J., Larochelle, H. and Adams, R.P. (2012) Practical Bayesian Optimization of Machine Learning Algorithms. 26 <italic>th Annual Conference on Neural Information Processing Systems</italic>, Lake Tahoe, 3-6 December 2012, 2951-2959.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Snoek, J.</string-name>
              <string-name>Larochelle, H.</string-name>
              <string-name>Adams, R.P.</string-name>
              <string-name>Systems, L</string-name>
            </person-group>
            <year>2012</year>
            <article-title>Practical Bayesian Optimization of Machine Learning Algorithms</article-title>
            <source>26th Annual Conference on Neural Information Processing Systems</source>
            <volume>3</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Polyak, B.T. (1964) Some Methods of Speeding up the Convergence of Iteration Methods. <italic>USSR Computational Mathematics and Mathematical Physics</italic>, 4, 1-17. https://doi.org/10.1016/0041-5553(64)90137-5 <pub-id pub-id-type="doi">10.1016/0041-5553(64)90137-5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0041-5553(64)90137-5">https://doi.org/10.1016/0041-5553(64)90137-5</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Polyak, B.T.</string-name>
            </person-group>
            <year>1964</year>
            <article-title>Some Methods of Speeding up the Convergence of Iteration Methods</article-title>
            <source>USSR Computational Mathematics and Mathematical Physics</source>
            <volume>5553</volume>
            <issue>64</issue>
            <pub-id pub-id-type="doi">10.1016/0041-5553(64)90137-5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Kingma, D.P. and Ba, J. (2015) Adam: A Method for Stochastic Optimization. <italic>Proceedings of the</italic>3 <italic>rd International Conference on Learning Representations</italic> ( <italic>ICLR</italic>), San Diego, 7-9 May 2015.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Kingma, D.P.</string-name>
              <string-name>Ba, J.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Adam: A Method for Stochastic Optimization</article-title>
            <source>Proceedings of the 3rd International Conference on Learning Representations (ICLR)</source>
            <volume>7</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Ioffe, S. and Szegedy, C. (2015) Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift. <italic>Proceedings of the</italic>32 <italic>nd International Conference on Machine Learning</italic> ( <italic>ICML</italic>), Lille, 6-11 July 2015, 448-456.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Ioffe, S.</string-name>
              <string-name>Szegedy, C.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift</article-title>
            <source>Proceedings of the 32nd International Conference on Machine Learning (ICML)</source>
            <volume>6</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I. and Salakhutdinov, R. (2014) Dropout: A Simple Way to Prevent Neural Networks from Overfitting. <italic>Journal of Machine Learning Research</italic>, 15, 1929-1958.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Srivastava, N.</string-name>
              <string-name>Hinton, G.</string-name>
              <string-name>Krizhevsky, A.</string-name>
              <string-name>Sutskever, I.</string-name>
              <string-name>Salakhutdinov, R.</string-name>
            </person-group>
            <year>2014</year>
            <article-title>Dropout: A Simple Way to Prevent Neural Networks from Overfitting</article-title>
            <source>Journal of Machine Learning Research</source>
            <volume>15</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Alico, J.N., Ouattara, S. and Clement, A. (2020) A New Strategy for the Morphological and Colorimetric Recognition of Erythrocytes for the Diagnosis of Forms of Anemia Based on Microscopic Color Images of Blood Smears. <italic>International Journal of Advanced Computer Science and Applications</italic>, 11, 517-527. https://doi.org/10.14569/ijacsa.2020.0110762 <pub-id pub-id-type="doi">10.14569/ijacsa.2020.0110762</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.14569/ijacsa.2020.0110762">https://doi.org/10.14569/ijacsa.2020.0110762</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Alico, J.N.</string-name>
              <string-name>Ouattara, S.</string-name>
              <string-name>Clement, A.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>A New Strategy for the Morphological and Colorimetric Recognition of Erythrocytes for the Diagnosis of Forms of Anemia Based on Microscopic Color Images of Blood Smears</article-title>
            <source>International Journal of Advanced Computer Science and Applications</source>
            <volume>11</volume>
            <pub-id pub-id-type="doi">10.14569/ijacsa.2020.0110762</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Dhar, P., Kothandapani, S.D., Satti, S.K. and Padmanabhan, S. (2023) HPKNN: Hyper-Parameter Optimized KNN Classifier for Classification of Poikilocytosis. <italic>International Journal of Imaging Systems and Technology</italic>, 33, 928-950. https://doi.org/10.1002/ima.22841 <pub-id pub-id-type="doi">10.1002/ima.22841</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/ima.22841">https://doi.org/10.1002/ima.22841</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Dhar, P.</string-name>
              <string-name>Kothandapani, S.D.</string-name>
              <string-name>Satti, S.K.</string-name>
              <string-name>Padmanabhan, S.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>HPKNN: Hyper-Parameter Optimized KNN Classifier for Classification of Poikilocytosis</article-title>
            <source>International Journal of Imaging Systems and Technology</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1002/ima.22841</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dhar, P., Suganya Devi, K. and Srinivasan, P. (2023) CNN-RSVM: A Hybrid Approach for Classification of Poikilocytosis Using Convolutional Neural Network and Radial Kernel Basis Support Vector Machine. <italic>Computer Methods in Biomechanics and Biomedical Engineering</italic>: <italic>Imaging &amp; Visualization</italic>, 11, 2118-2129. https://doi.org/10.1080/21681163.2023.2219755 <pub-id pub-id-type="doi">10.1080/21681163.2023.2219755</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/21681163.2023.2219755">https://doi.org/10.1080/21681163.2023.2219755</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dhar, P.</string-name>
              <string-name>Devi, K.</string-name>
              <string-name>Srinivasan, P.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>CNN-RSVM: A Hybrid Approach for Classification of Poikilocytosis Using Convolutional Neural Network and Radial Kernel Basis Support Vector Machine</article-title>
            <source>Computer Methods in Biomechanics and Biomedical Engineering: Imaging &amp; Visualization</source>
            <volume>11</volume>
            <pub-id pub-id-type="doi">10.1080/21681163.2023.2219755</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>