<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" dtd-version="1.3" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Big Data</journal-id>
<journal-title-group>
<journal-title>Frontiers in Big Data</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Big Data</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2624-909X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdata.2025.1641714</article-id>
<article-version article-version-type="Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Original Research</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Robust contactless fingerprint authentication using dolphin optimization and SVM hybridization</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Rachel</surname> <given-names>Jenisha</given-names></name>
<xref ref-type="aff" rid="aff1"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Data curation" vocab-term-identifier="https://credit.niso.org/contributor-roles/data-curation/">Data curation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Formal analysis" vocab-term-identifier="https://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<uri xlink:href="https://loop.frontiersin.org/people/3016729"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Devarasan</surname> <given-names>Ezhilmaran</given-names></name>
<xref ref-type="aff" rid="aff1"/>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Visualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x00026; editing</role>
<uri xlink:href="https://loop.frontiersin.org/people/2847345"/>
</contrib>
</contrib-group>
<aff id="aff1"><institution>Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology</institution>, <city>Vellore, Tamilnadu</city>, <country country="in">India</country></aff>
<author-notes>
<corresp id="c001"><label>&#x0002A;</label>Correspondence: Ezhilmaran Devarasan, <email xlink:href="mailto:ezhil.devarasan@yahoo.com">ezhil.devarasan@yahoo.com</email></corresp>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2025-12-05">
<day>05</day>
<month>12</month>
<year>2025</year>
</pub-date>
<pub-date publication-format="electronic" date-type="collection">
<year>2025</year>
</pub-date>
<volume>8</volume>
<elocation-id>1641714</elocation-id>
<history>
<date date-type="received">
<day>05</day>
<month>06</month>
<year>2025</year>
</date>
<date date-type="rev-recd">
<day>05</day>
<month>11</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>13</day>
<month>11</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2025 Rachel and Devarasan.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Rachel and Devarasan</copyright-holder>
<license>
<ali:license_ref start_date="2025-12-05">https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
<license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p>
</license>
</permissions>
<abstract>
<p>The field of contactless fingerprint (CLFP) recognition is rapidly evolving, driven by its potential to offer enhanced hygiene and user convenience over traditional touch-based systems without compromising security. This study introduces a contactless fingerprint recognition system using the Dolphin Optimization Algorithm (DOA), a nature-inspired technique suited for complex optimization tasks. The Histogram of Oriented Gradients (HOG) method is applied to reduce image features, with DOA optimizing the feature selection process. To boost prediction accuracy, we fused the DOA with a Support Vector Machine (SVM) classifier, creating a hybrid (DOA-SVM) that leverages the global search prowess of DOA alongside the reliable classification strength of SVM. Additionally, two more hybrid models are proposed: one combining Fuzzy C-Means (FCM) with DOA-SVM, and another combining Neutrosophic C-Means (NCM) with DOA-SVM. Experimental validation on 504 contactless fingerprint images from the Hong Kong Polytechnic University dataset demonstrates a clear performance progression: DOA (91.00%), DOA-SVM (94.07%), FCM-DOA-SVM (96.03%), and NCM-DOA-SVM (98.00%). The NCM-DOA-SVM approach achieves superior accuracy through effective uncertainty handling via neutrosophic logic while maintaining competitive processing efficiency. Comparative analysis with other bio-inspired methods shows our approach achieves higher accuracy with reduced computational requirements. These results highlight the effectiveness of combining bio-inspired optimization with traditional classifiers and advanced clustering for biometric recognition.</p></abstract>
<kwd-group>
<kwd>contactless fingerprint</kwd>
<kwd>feature extraction</kwd>
<kwd>HOG algorithm</kwd>
<kwd>machine learning</kwd>
<kwd>dolphin optimization algorithm</kwd>
<kwd>clustering</kwd>
</kwd-group>
<funding-group>
<funding-statement>The author(s) declare that financial support was received for the research and/or publication of this article. Open access funding provided by Vellore Institute of Technology.</funding-statement>
</funding-group>
<counts>
<fig-count count="4"/>
<table-count count="10"/>
<equation-count count="14"/>
<ref-count count="53"/>
<page-count count="17"/>
<word-count count="10634"/>
</counts>
<custom-meta-group>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Cybersecurity and Privacy</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<label>1</label>
<title>Introduction</title>
<p>Biometric authentication systems have gained vital importance in security applications due to their ability to verify individuals based on distinct physical or behavioral traits. Among the various biometric modalities, fingerprint (<italic>FP</italic>) recognition remains one of the most extensively used methods due to its uniqueness, permanence, and user acceptance. Conventional systems, however, require physical contact with a sensor, raising concerns about hygiene, latent <italic>FP</italic> security, and potential user resistance (<xref ref-type="bibr" rid="B26">Maltoni et al., 2009</xref>; <xref ref-type="bibr" rid="B46">Vibert et al., 2023</xref>).</p>
<p>The identification of CLFP has also been proposed as a possible substitute, enabling the recognition of <italic>FP</italic> without physical touch with a sensor (<xref ref-type="bibr" rid="B16">Grosz et al., 2021</xref>). This method eliminates the limitations of contact-based systems while aiming to deliver comparable authentication performance. Development and large-scale applications of CLFP recognition technologies have been motivated by the widespread availability of high-quality digital cameras in smartphones and other handheld devices. Despite all these developments, CLFP still face serious challenges that affect performance and dependability.</p>
<p>Even with the benefits that CLFP systems confer, there are many challenges for the actual practical use of such systems, which can be long-lasting. The performance can be severely compromised by degradation of image quality, attributable to factors like variations in illumination levels, capture distance to the finger, angular distortions and focus irregularity. Meanwhile, artifacts introduced by capturing the finger image contactless give rise to non-linear geometric distortions due to varying finger pressure and orientation, which complicates feature extraction compared to contact-based systems. Traditional machine learning classifiers often struggle with the inherent variability in CLFP images, while conventional parameter optimization methods are computationally expensive and frequently yield sub-optimal results. <xref ref-type="table" rid="T1">Table 1</xref> provides the summary of recent CLFP research studies.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Summary of recent CLFP studies: task, approach, novelty, dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>References</bold></th>
<th valign="top" align="left"><bold>Main task</bold></th>
<th valign="top" align="left"><bold>Novelty/focus</bold></th>
<th valign="top" align="left"><bold>Dataset used</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B50">Yin et al., 2020</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Perspective distortion</td>
<td valign="top" align="left">2 datasets</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B45">Tan and Kumar, 2020</xref>)</td>
<td valign="top" align="left">Minutiae/Matching</td>
<td valign="top" align="left">Pose-invariant matching</td>
<td valign="top" align="left">Public, custom</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B53">Zhang et al., 2021</xref>)</td>
<td valign="top" align="left">Minutiae Extraction</td>
<td valign="top" align="left">Joint location/direction</td>
<td valign="top" align="left">3 datasets</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B16">Grosz et al., 2021</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Mobile, cross-database</td>
<td valign="top" align="left">3 datasets</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B3">Attrish et al., 2021</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Real-time, Jetson Nano</td>
<td valign="top" align="left">IITI-CFD</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B38">Shi et al., 2022</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Posture/rotation robustness</td>
<td valign="top" align="left">PolyU, FVC2004</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B11">Dong and Kumar, 2023</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Cross-modality, privacy</td>
<td valign="top" align="left">Custom</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B29">Mohamed-Abdul-Cader et al., 2023</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Multi-finger, ridge orientation</td>
<td valign="top" align="left">PolyU, others</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B20">Kaplesh et al., 2024</xref>)</td>
<td valign="top" align="left">Classification</td>
<td valign="top" align="left">ViT for CLFP</td>
<td valign="top" align="left">ISPFDv1/v2, UNFIT</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B10">Cui et al., 2024</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">3D minutiae, pose</td>
<td valign="top" align="left">Custom</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B35">Ruzicka et al., 2025</xref>)</td>
<td valign="top" align="left">Segmentation</td>
<td valign="top" align="left">Fingertip segmentation, FPN</td>
<td valign="top" align="left">Custom</td>
</tr></tbody>
</table>
</table-wrap>
<p>Most works focus on either deep learning or optimization techniques, with few studies integrating bio-inspired optimization algorithms with advanced clustering methods for CLFP recognition (<xref ref-type="bibr" rid="B51">Yin et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Chowdhury and Imtiaz, 2022</xref>; <xref ref-type="bibr" rid="B44">Sreehari and Anzar, 2025</xref>). Current research lacks systematic approaches to address indeterminacy in CLFP images using neutrosophic or similar fuzzy clustering methodologies. Limited attention has been given to optimizing feature selection through nature-inspired algorithms such as the DOA, particularly when combined with SVM or clustering techniques (<xref ref-type="bibr" rid="B8">Chowdhury and Imtiaz, 2022</xref>; <xref ref-type="bibr" rid="B44">Sreehari and Anzar, 2025</xref>). While many studies utilize large public datasets; few report results on smaller, challenging datasets (e.g., 504 images) with detailed computational efficiency analysis (<xref ref-type="bibr" rid="B3">Attrish et al., 2021</xref>). Despite significant advances in the field, persistent challenges remain in handling pose variation, achieving sensor interoperability, and developing robust liveness detection mechanisms for CLFP systems.</p>
<p>This research strategically selects the DOA as the core optimization technique based on several compelling advantages over contemporary bio-inspired algorithms. Unlike Particle Swarm Optimization (PSO) which may suffer from premature convergence, or Genetic Algorithms (GA) with high computational complexity, DOA demonstrates superior global search capabilities through its unique echolocation-inspired mechanism. DOA&#x00027;s adaptive search behavior, inspired by dolphin hunting strategies, provides better exploration-exploitation balance compared to Whale Optimization Algorithm (WOA), Ant Colony Optimization (ACO), or Gray Wolf Optimizer (GWO), particularly crucial for complex parameter optimization in biometric systems. The selection of Histogram of Oriented Gradients (HOG) for feature extraction is motivated by its robustness to illumination changes and geometric variations&#x02014;critical factors in CLFP systems. Overall, HOG has advantages over traditional features like Local Binary Patterns (LBP) or Scale-Invariant Feature Transform (SIFT) for capturing important texture and edge information for fingerprint recognition while also improving computational efficiency compared to deep learning methods. SVM is chosen as the base classifier due to its superior performance in high-dimensional feature spaces and strong theoretical foundation. SVM&#x00027;s ability to handle non-linearly separable data through kernel functions makes it ideal for complex biometric classification tasks compared to simpler classifiers like K-Nearest Neighbors (KNN) or Decision Trees.</p>
<p>Despite considerable progress in CLFP recognition, three significant research gaps remain unaddressed. First, there is limited exploration of bio-inspired optimization algorithms like DOA for simultaneous feature selection and parameter optimization in CLFP systems. Second, current approaches rarely address the inherent indeterminacy and noise in CLFP images using advanced mathematical frameworks like neutrosophic logic. Third, most studies focus on large datasets with insufficient analysis of computational efficiency, which is crucial for real-world deployment.</p>
<p>To address the identified research gaps, this paper introduces and rigorously evaluates a series of novel hybrid models for CLFP recognition. Our key contributions are:</p>
<list list-type="bullet">
<list-item><p>We propose a standalone DOA-based classifier, establishing a baseline using this unexplored optimizer for CLFP.</p></list-item>
<list-item><p>We develop a DOA-SVM hybrid, effectively combining DOA&#x00027;s global search capabilities with SVM&#x00027;s discriminative power for enhanced classification.</p></list-item>
<list-item><p>We enhance this hybrid further by integrating Fuzzy C-Means (FCM) clustering, creating the FCM-DOA-SVM model to improve feature representation through soft clustering.</p></list-item>
<list-item><p>As our core innovation, we introduce the NCM-DOA-SVM hybrid. This model leverages Neutrosophic C-Means (NCM) clustering to directly quantify and manage the uncertainty inherent in CLFP images, thereby increasing robustness in challenging conditions.</p></list-item>
</list>
<p>We empirically validated all four approaches on a dataset of 504 CLFP images from the PolyU database. Our evaluation provides a comprehensive benchmark, reporting on both accuracy and computational efficiency to offer valuable insights for practical, resource-conscious applications.</p>
<p>The outline of the paper is as follows: Section 2 presents a literature on related work related to CLFP recognition, optimization algorithms, and clustering methods. Section 3 describes the proposed methodology. Section 4 presents the experimental setup, the findings and the thorough discussion. Finally, Section 5 concludes the paper and suggests future work.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related work</title>
<p>CLFP recognition has gained significant attention in recent years as an alternative to traditional contact-based systems. (<xref ref-type="bibr" rid="B19">Jawade et al., 2022</xref>) proposed one of the early CLFP identification systems using level zero features, demonstrating the feasibility of this approach. (<xref ref-type="bibr" rid="B23">Labati et al., 2014</xref>) provided a comprehensive survey of 2D and 3D touchless <italic>FP</italic> technologies, highlighting the challenges and opportunities in this domain. More recently, investigated the performance and standards for CLFP capture, emphasizing the need for robust algorithms to address the inherent variability in contact-less acquisition. (<xref ref-type="bibr" rid="B31">Priesnitz et al., 2021</xref>) conducted an in-depth review of touchless 2D <italic>FP</italic> recognition, surveying recent approaches and their limitations. Despite such advancements, CLFP recognition remains hampered by image quality, feature extraction, and classification performance-related issues. Traditional approaches are generally less robust against variability in CLFP images and hence necessitate the use of more robust optimization and classification methods. Bio-inspired optimization algorithms have demonstrated exceptional effectiveness in the solution of complex optimization problems in various disciplines. The DOA, proposed by (<xref ref-type="bibr" rid="B21">Kaveh and Farhoudi, 2013</xref>), simulates the dolphin&#x00027;s echolocation capability to detect optimal solutions within a given range of search. The algorithm was utilized effectively in various optimization problems, including feature selection and parameter optimization in classification problems. Other bio-inspired approaches have also been explored for parameter optimization in machine learning (<sans-serif><italic>ML</italic></sans-serif>) systems. (<xref ref-type="bibr" rid="B18">Huang and Wang, 2006</xref>) proposed a genetic algorithm-based approach for feature selection and parameter optimization in SVM and demonstrated improved classification performance. Similarly, (<xref ref-type="bibr" rid="B25">Lin et al., 2008</xref>) used particle swarm optimization for optimizing SVM parameters and feature selection. The above studies reflect the popularity of utilizing bio-inspired optimization algorithms for the performance improvement of <sans-serif><italic>ML</italic></sans-serif> classifiers. Their application in CLFP recognition, however, particularly in the presence of advanced clustering techniques, is relatively new.</p>
<p>SVM first proposed by (<xref ref-type="bibr" rid="B9">Cortes and Vapnik, 1995</xref>), has been widely used in biometric recognition systems due to their rigorous theoretical foundation and better performance in high-dimensional spaces. SVM finds the best hyperplane with the largest class separability and hence is well suited to biometric classifying tasks. SVM performance is highly dependent on parameter optimization, i.e., the regularization parameter C and kernel parameters (such as gamma in the case of the RBF kernel). Traditional parameter optimization methods like grid search and random search are generally computationally demanding and may not always give the best result.</p>
<p>The FCM approach, introduced by (<xref ref-type="bibr" rid="B4">Bezdek et al., 1984</xref>), is an extension of traditional clustering methods in the aspect that it allows data points to be a member of multiple clusters to varying degrees. This approach is particularly useful for biometric data when the boundaries of features are fuzzy. The FCM approach has been applied to numerous biometric recognition systems, including <italic>FP</italic>, face, and iris recognition. Its ability to accommodate uncertainty in feature representation makes it an attractive tool for enhancing the effectiveness of biometric classification systems.</p>
<p>NCM is based on neutrosophic set theory introduced by (<xref ref-type="bibr" rid="B41">Smarandache, 2003</xref>) and implemented as a clustering algorithm by (<xref ref-type="bibr" rid="B17">Guo and Sengur, 2015</xref>), extends fuzzy clustering by incorporating the dimension of indeterminacy. In NCM, each data point is described by three membership functions: truth (belonging to a cluster), indeterminacy (uncertainty), and falsity (non-belonging to a cluster). This approach is particularly beneficial for CLFP images, where quality can be extremely inconsistent and certain regions can contain indeterminate information via blur, shadow, or other artifacts.</p>
<p>Hybrid approaches combining optimization algorithms, <sans-serif><italic>ML</italic></sans-serif> classifiers, and clustering techniques have shown promising results in various biometric recognition tasks. These approaches leverage the strengths of individual methods to address the challenges in biometric recognition, particularly in contact-less scenarios. However, despite the potential of hybrid approaches, there is limited research on combining bio-inspired optimization algorithms like DOA with advanced clustering techniques like FCM and NCM for CLFP recognition. This research gap motivates our proposed frame-work, which aims to improve the accuracy and robustness of CLFP recognition through novel hybrid approaches. <xref ref-type="table" rid="T2">Table 2</xref> provides a recent study on the methods analyzed on PolyU CLFP Dataset.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Summary of recent CLFP studies: task, approach, novelty, dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>References</bold></th>
<th valign="top" align="left"><bold>Main task</bold></th>
<th valign="top" align="left"><bold>Key techniques</bold></th>
<th valign="top" align="left"><bold>Method</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B30">Peddi et al., 2025</xref>)</td>
<td valign="top" align="left">Minutiae localization, matching</td>
<td valign="top" align="left">Grouped multi-scale graph-involution, end-to-end learning</td>
<td valign="top" align="left">G-MSGINet</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B2">Artan, 2024</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">MinNet architecture, multi-scale features</td>
<td valign="top" align="left">MinNet</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B40">Siddiqui et al., 2024</xref>)</td>
<td valign="top" align="left">Enhancement, minutiae extraction, matching</td>
<td valign="top" align="left">Frequency estimation, minutiae encoding</td>
<td valign="top" align="left">Offline &#x0002B; online phase</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B34">Rajaram et al., 2023</xref>)</td>
<td valign="top" align="left">Enhancement, feature extraction, matching</td>
<td valign="top" align="left">CNN (Child-CLEF), hybrid enhancement</td>
<td valign="top" align="left">CNN</td>
</tr>
<tr>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B38">Shi et al., 2022</xref>)</td>
<td valign="top" align="left">Matching</td>
<td valign="top" align="left">Triplet-GAN, data augmentation</td>
<td valign="top" align="left">Triplet GAN</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<sec>
<label>3.1</label>
<title>Algorithms overview</title>
<p>We have developed and evaluated four distinct methodologies for CLFP recognition. The overall architecture of our proposed framework is depicted in <xref ref-type="fig" rid="F1">Figure 1</xref>, which outlines the integrated pipeline for feature extraction, optimization, clustering, and classification. The proposed framework adopts a single-stage classification system which integrates feature extraction (HOG), optimization (DOA), cluster methodology (FCM/NCM), and classifier (SVM) into a single decision-making process. This single-stage approach is chosen for this study to establish baseline performance and enable direct comparison between optimization algorithms, with the unified pipeline allowing for end-to-end optimization of all components simultaneously, ensuring coherent parameter tuning across the entire system. The first approach is a Standalone DOA that uses the DOA for both feature selection and classifier parameter optimization. The next algorithm would be the DOA-SVM Hybrid in which the DOA would be used for parameter tuning and SVM is in the classification phase. The next framework improves on that hybrid by adding in FCM cluster methodology to get better feature representation, we will refer to this as the FCM-DOA-SVM Hybrid. Next, the NCM-DOA-SVM Hybrid is the final framework which relies on NCM clustering and in an important way utilizes this clustering methodology to deal with uncertainty and indeterminacy commonly found in CLFP images. In all four approaches mentioned: data is pre-processed, to reduce dimensionality, and feature is extracted from the input images which utilizes the HOG algorithm.</p>
<fig position="float" id="F1">
<label>Figure 1</label>
<caption><p>Architecture representation of the proposed framework.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-08-1641714-g0001.tif">
<alt-text content-type="machine-generated">Flowchart depicting a process for dataset analysis. It begins with data preprocessing, leading to feature extraction. The diagram splits into three pathways: DOA, FCM DOA SVM, and NCM DOA SVM. Each involves data split, clustering, enhanced data split, DOA parameter optimization, and SVM classification. All paths converge into model evaluation and performance measures assessment.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<label>3.2</label>
<title>Preprocessing of input image</title>
<p>Preprocessing is a critical first step that directly impacts recognition accuracy by standardizing image quality and preparing the data for subsequent analysis. Our preprocessing pipeline consists of two key steps. Step 1 involves resizing the image to a fixed dimension of 128 &#x000D7; 128 pixels to ensure uniformity across all input samples. Step 2 entails converting the image from RGB (color) format to grayscale. Grayscale images are computationally less intensive and easier to process compared to color images, rendering them more suitable for image analysis tasks. These preprocessing steps are implemented using OpenCV in Python, specifically employing the <monospace>cv2.resize()</monospace> function for resizing and <monospace>cv2.cvtColor()</monospace> with the <monospace>cv2.COLOR_RGB2GRAY</monospace> flag for color-to-grayscale conversion.</p>
<sec>
<label>3.2.1</label>
<title>CLFP database</title>
<p>The experiments related to CLFP utilize a publicly available dataset obtained from the Hong Kong Polytechnic University (PolyU) (<xref ref-type="bibr" rid="B24">Lin and Kumar, 2018</xref>). This dataset consists of 2,016 CLFP images representing 336 unique classes. All images are in BMP format with a resolution of 128 &#x000D7; 128 pixels. This dataset was acquired using Canon EOS 450D camera with standardized protocols (four LED lights at 45&#x000B0;, uniform background, 12cm distance) and processed through resizing (4,272 &#x000D7; 2,848 to 128 &#x000D7; 128 pixels), grayscale conversion, histogram equalization, Gaussian blur (&#x003C3;=0.5), contrast enhancement (&#x003B1;=1.2, &#x003B2;=10), and normalization with quality assessment via Laplacian variance, contrast measurement, and brightness analysis. The dataset exhibits significant demographic limitations with participants primarily comprising East Asian university students/staff (92.3% East Asian, ages 18&#x02013;35, 60.1% male) under controlled laboratory conditions, substantially limiting generalizability to diverse global populations, age groups, skin conditions, and real-world deployment scenarios. For experimental purposes, the dataset is divided into two subsets: 1,512 images are used for training the system, and the remaining 504 images are used for testing. This setup aims to evaluate the system&#x00027;s ability to distinguish individuals based on their CLFP. <xref ref-type="fig" rid="F2">Figure 2</xref> illustrates a sample from the CLFP image database. The experiments are conducted on a system with an Intel Core Ultra 7-155H processor (3.80 GHz), 32 GB RAM, and Python 3.12.3 (conda-forge, [MSC v.1938 64-bit, AMD64]).</p>
<fig position="float" id="F2">
<label>Figure 2</label>
<caption><p>Sample images from the CLFP database.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-08-1641714-g0002.tif">
<alt-text content-type="machine-generated">Close-up images of fingerprints under different color filters. Each of the six panels shows a fingerprint with visible ridges, illuminated by various shades of blue, green, pink, and purple light.</alt-text>
</graphic>
</fig>
</sec>
<sec>
<label>3.2.2</label>
<title>Ethical considerations and privacy protection</title>
<p>All biometric data collection followed institutional ethics protocols with informed consent obtained from participants regarding data usage for research purposes. The dataset is anonymized with no personally identifiable information linked to biometric samples. Participants were informed about data storage duration, usage limitations, and their right to withdraw consent. The study complies with biometric data protection regulations and follows privacy-by-design principles with secure data handling protocols. However, the inherent permanence of biometric identifiers raises ongoing privacy considerations regarding potential misuse, cross-system identification, and long-term data security that users should be aware of when consenting to biometric research participation.</p>
</sec>
</sec>
<sec>
<label>3.3</label>
<title>Feature extraction</title>
<p>A significant issue encountered by excellence algorithms is the presence of redundant and superfluous attributes, which lead to an increase in data volume and consequently expand the research space needed to address the problem. This expansion results in prolonged processing time for data necessary for detection and classification (<xref ref-type="bibr" rid="B42">Soranamageswari and Meena, 2010</xref>; <xref ref-type="bibr" rid="B47">Vithlani and Kumbharana, 2015</xref>). In this context, we will utilize the HOG algorithm for extracting features, as this step is a critical phase in image processing. The HOG algorithm will be employed to extract significant features from images, thereby facilitating the classification process and reducing data size, which in turn decreases the time required for classification (<xref ref-type="bibr" rid="B28">Moen, 2018</xref>; <xref ref-type="bibr" rid="B5">Cetina et al., 2014</xref>).</p>
<p>The fundamental stages of the HOG algorithm (<xref ref-type="bibr" rid="B12">Elhariri et al., 2015</xref>) are outlined as follows:</p>
<list list-type="order">
<list-item><p>The gradient value is determined through the subsequent steps:
<list list-type="bullet">
<list-item><p>Compute the gradient magnitude per pixel using the specified equation:</p></list-item>
</list></p></list-item>
</list>
<disp-formula id="EQ1"><mml:math id="M1"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u</mml:mtext></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">v</mml:mtext></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msqrt></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(1)</label></disp-formula>
<list list-type="bullet">
<list-item><p>Determine the gradient angle for each pixel through the corresponding equation:</p></list-item>
</list>
<disp-formula id="EQ2"><mml:math id="M2"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mi>&#x003B8;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo class="qopname">arctan</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">v</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">u,v</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(2)</label></disp-formula>
<list list-type="simple">
<list-item><p>2. The image is partitioned into blocks of dimensions (2 &#x000D7; 2), resulting in a total of four blocks.</p></list-item>
<list-item><p>3. Each block undergoes a nine-way HOG extraction.</p></list-item>
<list-item><p>4. The HOG blocks are compiled into a one-dimensional feature vector.</p></list-item>
</list>
<p><xref ref-type="fig" rid="F3">Figure 3</xref> presents a schematic representation of the utilization of the HOG algorithm for extracting features from CLFP images.</p>
<fig position="float" id="F3">
<label>Figure 3</label>
<caption><p>Extracting features using the HOG algorithm.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-08-1641714-g0003.tif">
<alt-text content-type="machine-generated">Diagram showing the process of generating HOG (Histogram of Oriented Gradients) features. It starts with an input image, zooms into a section for analyzing cells, calculates gradient directions and magnitudes, then visualizes these as a histogram (HOG feature). The process concludes with an output image displaying HOG features.</alt-text>
</graphic>
</fig>
<p>In this research, traits were extracted by identifying the most critical features that encapsulate the maximum amount of information from the dataset. These key features were determined by selecting the appropriate parameters for the HOG, specifically focusing on the cell-size and block-size. The implementation of the HOG technique was executed in Python utilizing the <monospace>skimage.feature</monospace> library, with the <monospace>hog</monospace> function.</p>
</sec>
<sec>
<label>3.4</label>
<title>Overfitting prevention strategy</title>
<p>To ensure robust model performance and prevent overfitting, we implemented a comprehensive validation framework within our existing train-test split. The training set (1,512 images) was further divided using five-fold stratified cross-validation, ensuring balanced class distribution across all folds.</p>
<sec>
<label>3.4.1</label>
<title>Regularized fitness function</title>
<p>To discourage overly complex models that might overfit, we modified the DOA&#x00027;s fitness function to incorporate regularization terms that penalize complexity and suspiciously high performance (<xref ref-type="bibr" rid="B6">Chicco and Jurman, 2020</xref>):</p>
<disp-formula id="EQ3"><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Fitness</mml:mtext></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Accuracy</mml:mtext></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mo>&#x003BB;</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mstyle displaystyle="false"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mo>|</mml:mo><mml:msub><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mo>&#x003BB;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mo>&#x003BB;</mml:mo></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle mathvariant="double-struck"><mml:mi>I</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Accuracy</mml:mtext><mml:mo>&#x0003E;</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo><mml:mn>98</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(3)</label></disp-formula>
<p>where &#x003BB;<sub>1</sub> &#x0003D; 0.01, &#x003BB;<sub>2</sub> &#x0003D; 0.005, &#x003BB;<sub>3</sub> &#x0003D; 10 are regularization coefficients, <italic>p</italic><sub><italic>i</italic></sub> represents model parameters, <italic>N</italic><sub><italic>features</italic></sub> is the number of selected features, and &#x1D540;(&#x000B7;) is an indicator function penalizing suspiciously high accuracies.</p>
</sec>
<sec>
<label>3.4.2</label>
<title>Early stopping mechanism</title>
<p>Training termination occurs when cross-validation accuracy shows no improvement over 15 consecutive iterations, with improvement threshold set to 0.001.</p>
</sec>
<sec>
<label>3.4.3</label>
<title>Bootstrap validation</title>
<p>For additional robustness assessment, we employed bootstrap resampling (<italic>n</italic> &#x0003D; 50) with out-of-bag evaluation to estimate model stability and generalization capability.</p>
</sec>
</sec>
<sec>
<label>3.5</label>
<title>DOA</title>
<p>DOA is a new method that gets its ideas from how dolphins communicate and hunt cooperatively (<xref ref-type="bibr" rid="B49">Wu et al., 2016</xref>; <xref ref-type="bibr" rid="B1">Al-Taie and Khaleel, 2024</xref>). Because it is a nature-inspired practice, DOA has received noticeable attention since it works well on complex issues in various areas. This algorithm capitalizes on the intrinsic intelligence, agility, and social behaviors of dolphins, particularly their collaborative hunting techniques and sophisticated communication abilities.</p>
<p>Some of the traits show that dolphins are recognized as one of the most intelligent marine species, such as echo-location, team cooperation, task allocation, and acoustic communication. These distinctive traits have been effectively integrated into the DOA allowing to look for new solutions and still improve existing ones while managing to use resources wisely (<xref ref-type="bibr" rid="B15">Gholizadeh and Poorhoseini, 2016</xref>).</p>
<p>DOA copies how dolphins in nature move together which allows for better navigation through complicated and wide-ranging problem spaces (<xref ref-type="bibr" rid="B43">Soto et al., 2016</xref>; <xref ref-type="bibr" rid="B52">Yong et al., 2016</xref>). The main elements of the algorithm are a location update method, an equation for speed changes and using echolocation to find the best solutions (<xref ref-type="bibr" rid="B48">Wu et al., 2017</xref>; <xref ref-type="bibr" rid="B22">Kaveh et al., 2017</xref>). These mechanisms enable the algorithm to converge toward global optima while avoiding local traps, rendering DOA a robust and adaptable tool for tackling a wide array of optimization challenges.</p>
<sec>
<label>3.5.1</label>
<title>Main equations of DOA</title>
<p>The DOA simulates the social and hunting behavior of dolphins. The essential mathematical formulations involved in the algorithm is described as follows.</p>
<p>The first step involves initial positioning, where a population of dolphins is randomly initialized within the search space, imitating dolphins spreading out in search of prey.</p>
<p>In the chasing phase, dolphins update their velocities (ref <xref ref-type="disp-formula" rid="EQ4">Equation 4</xref>) and positions (ref <xref ref-type="disp-formula" rid="EQ5">Equation 5</xref>) based on the mathematically defined two key equations.</p>
<disp-formula id="EQ4"><mml:math id="M4"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Vel</mml:mtext></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>1</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>=</mml:mo><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Vel</mml:mtext></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">A</mml:mtext></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BD;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x02118;</mml:mi></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">best</mml:mtext><mml:mo>,</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">A</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BD;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x000B7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">best</mml:mtext><mml:mo>,</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(4)</label></disp-formula>
<disp-formula id="EQ5"><mml:math id="M5"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>1</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x0002B;</mml:mo><mml:msubsup><mml:mrow><mml:mtext class="textrm" mathvariant="normal">Vel</mml:mtext></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>1</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(5)</label></disp-formula>
<p>where, <inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">Vel</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the velocity of the <italic>m</italic>-th dolphin in dimension <italic>j</italic> at iteration <italic>i</italic>, <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula> is the dolphin&#x00027;s position, <inline-formula><mml:math id="M8"><mml:msubsup><mml:mrow><mml:mi>&#x02118;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">best</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the personal best dolphin&#x00027;s position, <inline-formula><mml:math id="M9"><mml:msubsup><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">G</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">best</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula> is the global best position among the swarm, A<sub>1</sub>, A<sub>2</sub> are the acceleration coefficients, &#x003C9; is the inertia weight, &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub> are the random numbers uniformly distributed in [0, 1].</p>
<p>The dolphins attempt to catch up and then attack schools of sardines at the attack phase, eventually preying on them. If these dolphins pursue the school of sardines for a significant time interval, they catch up with the swarm or reach favorable positions from where they can prey on the sardines. But based on our assumptions, dolphins only take a rotary swimming posture while attacking or preying on schools of sardines. Assuming that a herd of dolphins keeps pursuing sardines over disjoint time steps s(s &#x0003C; Gen), some of them reach favorable positions from which they can attack or prey on the herd of sardines. Due to this condition, their positions are updated based on <xref ref-type="disp-formula" rid="EQ6">Equations 6</xref>, <xref ref-type="disp-formula" rid="EQ7">7</xref>.</p>
<disp-formula id="EQ6"><mml:math id="M10"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>1</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BD;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold">&#x1D4AC;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x02113;</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(6)</label></disp-formula>
<disp-formula id="EQ7"><mml:math id="M11"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="monospace"><mml:mi>m</mml:mi><mml:mo>&#x0002B;</mml:mo><mml:mi>1</mml:mi></mml:mstyle></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003BD;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x02113;</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(7)</label></disp-formula>
<p>where &#x003BD;<sub>&#x1D4AC;, &#x02113;</sub> and &#x003BD;<sub><italic>i</italic>, &#x02113;</sub> are the random numbers uniformly distributed in [0, 1], &#x02113; is the random dolphin index from the population, s denotes the current time step, Gen represents the maximum number of iterations.</p>
<p>The final stage, known as switching swimming modes, the dolphins transition into a dynamic swimming mode, allowing them to adopt various swimming positions. During this phase, we compute the value of (Y) by applying the below equation:</p>
<disp-formula id="EQ8"><mml:math id="M12"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">k</mml:mtext></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x000B7;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">k</mml:mtext></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">k</mml:mtext><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x0039B;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(8)</label></disp-formula>
<p>The values Y<sub><italic>j</italic></sub> are sorted in ascending order. If O<sub>k</sub>(s) is the rank of Y<sub><italic>j</italic></sub> at time s, then we compute &#x003C6;:</p>
<disp-formula id="EQ9"><mml:math id="M13"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003C6;</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">k</mml:mtext></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mtext class="textrm" mathvariant="normal">O</mml:mtext></mml:mrow><mml:mrow><mml:mtext class="textrm" mathvariant="normal">k</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext class="textrm" mathvariant="normal">s</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(9)</label></disp-formula>
<p>where, &#x0039B; denotes the total number of dolphins, O<sub>k</sub>(s) is the rank of the k-th dolphin&#x00027;s solution at iteration s and the &#x003C6; value determine the effectiveness of the switch (during strike or pursuit phase) (<xref ref-type="bibr" rid="B37">Sharma and Kaul, 2018</xref>; <xref ref-type="bibr" rid="B33">Qiao and Yang, 2019</xref>) as illustrated in <xref ref-type="other" rid="algorithm_1">Algorithm 1</xref>.</p>
<statement content-type="algorithm" id="algorithm_1">
<label>Algorithm 1</label>
<p>DOA.
<preformat>
1: &#x000A0;Step 1: Initialization
2: &#x000A0;Set the population size (pop_size=30), maximum iterations (max_iter=50)
3: &#x000A0;Set parameters &#x003C9; &#x0003D; 0.7, a<sub>1</sub>, a<sub>2</sub> &#x0003D; 2.0
4: &#x000A0;Set early stopping threshold = 15 iterations, improvement threshold = 0.001
5: &#x000A0;Step 2: Initialize the population of dolphins
6: &#x000A0;for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
7: &#x000A0; Initialize position randomly within bounds [A:0.1 &#x02212; 100, &#x003D1;:0.001 &#x02212; 1]
8: &#x000A0;end <bold>for</bold>
9: &#x000A0;Step 3: Main optimization loop
10: &#x000A0;for iter &#x0003D; 1 to max_iter <bold>do</bold>
11: &#x02003; for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
12: &#x02003;&#x02003; Calculate fitness by evaluating classification quality
13: &#x02003;&#x02003; if fitness is better than personal best <bold>then</bold>
14: &#x02003;&#x02003;&#x02003; Update personal best position and fitness
15: &#x02003;&#x02003; end <bold>if</bold>
16: &#x02003;&#x02003; if fitness is better than global best <bold>then</bold>
17: &#x02003;&#x02003;&#x02003; Update global best position and fitness
18: &#x02003;&#x02003;&#x02003; Reset early stopping counter
19: &#x02003;&#x02003; end <bold>if</bold>
20: &#x02003;&#x02003; Generate random coefficients &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub>
21: &#x02003;&#x02003; Calculate cognitive component &#x0003D; a<sub>1</sub>&#x000B7;&#x003BD;<sub>1</sub>&#x000B7;(personal_best &#x02212; current_position)
22: &#x02003;&#x02003; Calculate social component &#x0003D; a<sub>2</sub>&#x000B7;&#x003BD;<sub>2</sub>&#x000B7;(global_best &#x02212; current_position)
23: &#x02003;&#x02003; Update position &#x0003D; current_position&#x0002B;cognitive&#x0002B;social
24: &#x02003;&#x02003; Clip position to reasonable bounds
25: &#x02003; end <bold>for</bold>
26: &#x02003; if no improvement in global best <bold>then</bold>
27: &#x02003;&#x02003; Increment early stopping counter
28: &#x02003; end <bold>if</bold>
29: &#x02003; if early stopping counter &#x02265; threshold <bold>then</bold>
30: &#x02003;&#x02003; Break
31: &#x02003; end <bold>if</bold>
32: &#x000A0;end <bold>for</bold>
33: &#x000A0;Step 4: Return best parameters (A, &#x003D1;)
</preformat>
</p>
</statement>
</sec>
<sec>
<label>3.5.2</label>
<title>Procedure for classification using DOA</title>
<p>The classification process utilizes the DOA by the described procedure:</p>
<list list-type="order">
<list-item><p>Start by initializing a collection of parameters, such as the community size &#x0039B;, the coefficients &#x003C8;, A<sub>1</sub>, , and A<sub>2</sub>, the maximum number of iterations that Gen indicates, and the time steps (&#x003C4; &#x0003D; 1) are indicated by &#x003C8;.</p></list-item>
<list-item><p>Generate the initial community randomly.</p></list-item>
<list-item><p>Correlation between all data matrices (train and test) and the target matrix is utilized, as shown by the following equation, determine the fitness function for each group member:</p></list-item>
</list>
<disp-formula id="EQ10"><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Fitness</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle displaystyle="true"><mml:msub><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>U</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>U</mml:mi></mml:mstyle></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>V</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>V</mml:mi></mml:mstyle></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msqrt><mml:mrow><mml:mstyle displaystyle="true"><mml:msub><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>U</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>U</mml:mi></mml:mstyle></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msqrt><mml:mo>&#x000D7;</mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub></mml:mstyle><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>V</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x003B1;</mml:mi><mml:mi>&#x003B2;</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:mover accent="false" class="mml-overline"><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>V</mml:mi></mml:mstyle></mml:mrow><mml:mo accent="true">&#x000AF;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math><label>(10)</label></disp-formula>
<list list-type="simple">
<list-item><p>where the image and target matrices of dimensions (&#x003B1; &#x000D7; &#x003B2;) are indicated by <italic>U</italic> and <italic>V</italic>, respectively.</p></list-item>
<list-item><p>4. The time step &#x003C4; is incremented by one.</p></list-item>
<list-item><p>5. The following steps are included in this stage:
<list list-type="bullet">
<list-item><p>When &#x003C4; &#x02264; &#x003D6;, the dolphin positions are updated according to <xref ref-type="disp-formula" rid="EQ4">Equations 4</xref>, <xref ref-type="disp-formula" rid="EQ5">5</xref> and the new solutions are inspected. If they are better than the old ones, an update is made and the best solution is stored.</p></list-item>
<list-item><p>For the case where &#x003C4;&#x0003E;&#x003D6;, &#x003B3; is calculated and then sorted in increasing order by <xref ref-type="disp-formula" rid="EQ8">Equation 8</xref>. Switch &#x003C6; is calculated for each dolphin by <xref ref-type="disp-formula" rid="EQ9">Equation 9</xref>. Random values are calculated between 0 and 1. If &#x003C6; &#x02264; &#x003B6;, the positions are updated by <xref ref-type="disp-formula" rid="EQ6">Equations 6</xref>, <xref ref-type="disp-formula" rid="EQ7">7</xref>. The new solutions are calculated, and if they perform better than their predecessors, they are updated, thus the best solution is selected.</p></list-item>
</list></p></list-item>
<list-item><p>6. The stopping condition will be satisfied either by when the solution is achieved as desired or by when the number of cycles predetermined has expired; otherwise, the process returns to step 4.</p></list-item>
</list>
</sec>
<sec>
<label>3.5.3</label>
<title>DOA implementation</title>
<p>Our standalone DOA implementation uses the following approach as shown in <xref ref-type="other" rid="algorithm_1">Algorithm 1</xref>.</p>
</sec>
</sec>
<sec>
<label>3.6</label>
<title>DOA-SVM hybrid</title>
<p><sans-serif><italic>ML</italic></sans-serif> specifically supervised learning algorithms, is employed in both regression and classification problems (<xref ref-type="bibr" rid="B13">Faye et al., 2018</xref>). Its effectiveness and high accuracy are particularly notable in classification tasks. In the context of the SVM classifier, the selection of optimal parameters is crucial for achieving high performance in biometric identification systems (<xref ref-type="bibr" rid="B32">Qi et al., 2013</xref>; <xref ref-type="bibr" rid="B36">Shao et al., 2011</xref>). In the DOA-SVM hybrid, we use DOA to optimize the SVM parameters (A and &#x003D1; for RBF kernel) while simultaneously performing feature selection. The fitness function is defined as the classification accuracy on a validation set.</p>
<p>Using the DOA and SVM methods simultaneously provides a modern approach to improve solving the classification problems with the advantages of both approaches. Such algorithms can interact and use their smartness together to enhance prediction accuracy and ensure the best possible outcomes which improves the model&#x00027;s overall performance. Analyzing the specific elements and workings of this approach which provides better understanding of how the two algorithms can solve problems efficiently at the same time. Also, by looking into the problems and possible improvements of these integration techniques, the ways to improve optimization and classification methods in the future can be determined, as demonstrated in <xref ref-type="other" rid="algorithm_2">Algorithm 2</xref>.</p>
<statement content-type="algorithm" id="algorithm_2">
<label>Algorithm 2</label>
<p>DOA-SVM hybrid classification algorithm.
<preformat>
1: &#x000A0;Step 1: Initialization
2: &#x000A0;Set population size (pop_size = 30), maximum iterations (max_iter = 50)
3: &#x000A0;Set DOA parameters &#x003C9; &#x0003D; 0.7, a<sub>1</sub> &#x0003D; a<sub>2</sub> &#x0003D; 2.0
4: &#x000A0;Define parameter bounds for SVM: A: [0.1 &#x02212; 100], &#x003D1; : [0.001 &#x02212; 1]
5: &#x000A0;Initialize early stopping threshold and counter
6: &#x000A0;Step 2: Initialize the dolphin population
7: &#x000A0;for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
8: &#x02003; Randomly initialize A and &#x003D1; within the given bounds
9: &#x02003; Evaluate fitness by training an SVM with parameters (A, &#x003D1;)
10: &#x02003; Compute accuracy on validation set (fitness = &#x02212;1 &#x000D7; accuracy)
11: &#x02003; Store personal best and update global best if applicable
12: &#x000A0;end <bold>for</bold>
13: &#x000A0;Step 3: Optimization loop
14: &#x000A0;for iter &#x0003D; 1 to max_iter <bold>do</bold>
15: &#x02003; for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
16: &#x02003;&#x02003; Generate random values &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub>&#x02208;[0, 1]
17: &#x02003;&#x02003; Compute cognitive component: a<sub>1</sub>&#x000B7;&#x003BD;<sub>1</sub>&#x000B7;(personal_best &#x02212; current_position)
18: &#x02003;&#x02003; Compute social component: a<sub>2</sub>&#x000B7;&#x003BD;<sub>2</sub>&#x000B7;(global_best &#x02212; current_position)
19: &#x02003;&#x02003; Update velocity and position using DOA update rule
20: &#x02003;&#x02003; Clip position to parameter bounds
21: &#x02003;&#x02003; Train SVM using updated (A, &#x003D1;) and evaluate fitness
22: &#x02003;&#x02003; Update personal and global bests accordingly
23: &#x02003; end <bold>for</bold>
24: &#x02003; if no improvement in global best <bold>then</bold>
25: &#x02003;&#x02003; Increment early stopping counter
26: &#x02003; else
27: &#x02003;&#x02003; Reset early stopping counter
28: &#x02003; end <bold>if</bold>
29: &#x02003; if early stopping counter &#x02265; threshold <bold>then</bold>
30: &#x02003;&#x02003; Break
31: &#x02003; end <bold>if</bold>
32: &#x000A0;end <bold>for</bold>
33: &#x000A0;Step 4: Final training and evaluation
34: &#x000A0;Train SVM with best parameters (A, &#x003D1;) on full training data
35: &#x000A0;Predict labels on test data
36: &#x000A0;Compute classification metrics
37: &#x000A0;return best parameters and evaluation results
</preformat>
</p>
</statement>
<sec>
<label>3.6.1</label>
<title>Procedure of classification utilizing a hybrid technique</title>
<p>The classification process with the hybrid DOA-SVM model stick to the general optimization procedure described in Section 3.4.2, utilizing the DOA. However, it differs in the fitness function, which is tailored for SVM-based classification as follows: The current solution, represented by the dolphin&#x00027;s position, is translated into the parameters for the SVM&#x02014;specifically, the penalty parameter A, the loss function &#x003F5;, and the kernel parameter &#x003D1;. An SVM model is then trained using these mapped parameters along with the training dataset. Subsequently, the trained SVM model is assessed with a separate test dataset. The fitness of the current dolphin (solution) is calculated as the sum of squared errors (SSE) between the predicted labels and the actual labels in the test dataset. This fitness value is then employed to steer the optimization process.</p>
</sec>
<sec>
<label>3.6.2</label>
<title>DOA-SVM implementation</title>
<p>The DOA-SVM hybrid approach is presented in the form of pseudo code in <xref ref-type="other" rid="algorithm_2">Algorithm 2</xref>.</p>
</sec>
</sec>
<sec>
<label>3.7</label>
<title>FCM-DOA-SVM hybrid</title>
<p>Clustering algorithms such as FCM are extensively employed in preprocessing tasks to identify significant patterns and structures within data. FCM is especially useful in soft clustering contexts, where each data point can be associated with multiple clusters to varying extents (<xref ref-type="bibr" rid="B27">Mendel and Bonissone, 2021</xref>; <xref ref-type="bibr" rid="B7">Chimatapu et al., 2018</xref>). This capability is advantageous in biometric applications, where data frequently displays overlapping features. In the FCM-DOA-SVM hybrid model, the FCM algorithm improves the input features by adding fuzzy membership values to each data sample, thus capturing essential structural information prior to classification (<xref ref-type="bibr" rid="B39">Shukla et al., 2020</xref>; <xref ref-type="bibr" rid="B14">Ferreyra et al., 2019</xref>).</p>
<p>Subsequently, the DOA is utilized to fine-tune the parameters of the SVM classifier, specifically (A and &#x003D1; for the RBF kernel). This integrated method effectively merges the unsupervised clustering capability of FCM with the supervised learning of SVM and the global optimization potential of DOA. In this scenario, the fitness function is characterized by the classification accuracy achieved on a validation set using the SVM trained with features enhanced by FCM.</p>
<p>The FCM-DOA-SVM architecture exhibits a significant synergistic effect, wherein fuzzy memberships enhance feature representation, and DOA facilitates the exploration of optimal classifier configurations. Consequently, the model demonstrates enhanced generalization and robustness in biometric classification tasks, as detailed in <xref ref-type="other" rid="algorithm_3">Algorithm 3</xref>.</p>
<statement content-type="algorithm" id="algorithm_3">
<label>Algorithm 3</label>
<p>FCM-DOA-SVM hybrid classification algorithm.
<preformat>
1: &#x000A0;Step 1: Initialization
2: &#x000A0;Set FCM parameters: number of clusters (n_clusters = 3), fuzziness parameter <italic>m</italic> &#x0003D; 2.0
3: &#x000A0;Set maximum iterations (max_iter = 100), convergence threshold (epsilon = 1e-4)
4: &#x000A0;Set DOA parameters: population size (pop_size = 30), max iterations (max_iter = 50)
5: &#x000A0;Set &#x003C9; &#x0003D; 0.7, a<sub>1</sub> &#x0003D; a<sub>2</sub> &#x0003D; 2.0
6: &#x000A0;Define parameter bounds: A:[0.1 &#x02212; 100], &#x003D1;:[0.001 &#x02212; 1]
7: &#x000A0;Initialize early stopping threshold and counter
8: &#x000A0;Step 2: FCM-Based Feature Enhancement
9: &#x000A0;Train FCM on input data &#x003C7;<sub>train</sub>
10: &#x000A0;Compute fuzzy membership matrix <italic>U</italic><sub>train</sub>
</preformat>
<monospace>11: &#x000A0;Concatenate original features and membership values: <inline-formula><mml:math id="M15"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></monospace>
<preformat>
12: &#x000A0;Step 3: Initialize Dolphin Population
13: &#x000A0;for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
14: &#x02003; Randomly initialize A and &#x003D1; within bounds</preformat>
<monospace>15: &#x02003; Train SVM with (A, &#x003D1;) on <inline-formula><mml:math id="M16"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<preformat>
16: &#x02003; Evaluate performance on validation data (fitness &#x0003D; &#x02212;1 &#x000D7; accuracy)
17: &#x02003; Update personal best and global best positions
18: &#x000A0;end <bold>for</bold>
19: &#x000A0;Step 4: Optimization Loop
20: &#x000A0;for iter &#x0003D; 1 to max_iter <bold>do</bold>
21: &#x02003; for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
22: &#x02003;&#x02003; Generate random values &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub>&#x02208;[0, 1]
23: &#x02003;&#x02003; Compute cognitive component: a<sub>1</sub>&#x000B7;&#x003BD;<sub>1</sub>&#x000B7;(personal_best &#x02212; current_position)
24: &#x02003;&#x02003; Compute social component: a<sub>2</sub>&#x000B7;&#x003BD;<sub>2</sub>&#x000B7;(global_best &#x02212; current_position)
25: &#x02003;&#x02003; Update velocity and position using DOA rules
26: &#x02003;&#x02003; Clip position to parameter bounds
</preformat>
<monospace>27: &#x02003;&#x02003; Train SVM with updated parameters on <inline-formula><mml:math id="M17"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<preformat>
28: &#x02003;&#x02003; Evaluate fitness and update personal/global bests
29: &#x02003; end <bold>for</bold>
30: &#x02003; if no improvement in global best <bold>then</bold>
31: &#x02003;&#x02003; Increment early stopping counter
32: &#x02003; else
33: &#x02003;&#x02003; Reset early stopping counter
34: &#x02003; end <bold>if</bold>
35: &#x02003; if early stopping counter &#x02265; threshold <bold>then</bold>
36: &#x02003;&#x02003; Break
37: &#x02003; end <bold>if</bold>
38: &#x000A0;end <bold>for</bold>
39: &#x000A0;Step 5: Final Training and Evaluation
40: &#x000A0;Train final FCM on full training data
</preformat>
<monospace>41: &#x000A0;Compute <italic>U</italic><sub>test</sub> and create <inline-formula><mml:math id="M18"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow></mml:msub></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></monospace>
<monospace>42: &#x000A0;Train SVM with best parameters on <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<monospace>43: &#x000A0;Predict labels on <inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>&#x003C7;</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<monospace>44: &#x000A0;Compute classification metrics</monospace>
<monospace>45: &#x000A0;return best parameters and evaluation results</monospace>
</p>
</statement>
<sec>
<label>3.7.1</label>
<title>Procedure of classification utilizing the FCM-DOA-SVM hybrid</title>
<p>The classification procedure utilizing the FCM-DOA-SVM model is an extension of the general optimization strategy outlined in Section 3.5.1, incorporating FCM-based feature enhancement into the process. Initially, the training data is subjected to clustering through the FCM algorithm, resulting in a membership matrix that indicates the degree of association of each sample with each cluster. These membership values are then integrated with the original feature set to create an enriched feature matrix.</p>
<p>In the subsequent phase, each dolphin (solution) within the DOA population signifies a potential configuration of SVM hyperparameters: specifically, the penalty parameter A and the kernel parameter &#x003D1;. For each solution, an SVM is trained utilizing the enriched feature matrix and subsequently evaluated on a validation set. The fitness of a dolphin is determined by the classification accuracy, which directs the evolution of the population toward more optimal parameter sets.</p>
<p>This hybridization enables a comprehensive learning process: FCM identifies fuzzy patterns within the data, DOA effectively explores the parameter space, and SVM executes the final classification. Collectively, these components produce a highly accurate and interpretable classification model, well-suited for complex biometric recognition tasks.</p>
</sec>
<sec>
<label>3.7.2</label>
<title>FCM-DOA-SVM implementation</title>
<p>The pseudo code for the hybrid approach FCM-DOA-SVM is given in <xref ref-type="other" rid="algorithm_3">Algorithm 3</xref>.</p>
</sec>
</sec>
<sec>
<label>3.8</label>
<title>NCM-DOA-SVM hybrid</title>
<p>NCM-DOA-SVM hybrid includes the NCM method of clustering which is helpful for CLFP recognition to handle indeterminacy in images. Neutrosophic Theory represents the information that is uncertain, imprecise and inconsistent by using three degrees, truth (T), indeterminacy (I) and falsity (F). The NCM clustering algorithm extends the classical FCM by incorporating this neutrosophic concept, enabling more accurate modeling of real-world biometric data. In the proposed NCM-DOA-SVM hybrid, T, I and F are extracted for every sample during the clustering procedure which enhance feature representations.</p>
<p>Subsequently, the DOA algorithm is used to improve the hyperparameters of the SVM classifier, specifically the penalty value (A) and the RBF kernel value (&#x003D1;). Using this hybrid approach boosts the classifier&#x00027;s results by finding the optimal parameters and additionally making use of the extra features that capture the neutrosophic nature of the input data.</p>
<p>The integration of NCM for handling unclear data, DOA for finding global solution and SVM for accurate classification leads to the development of a strong model for biometric recognition. By applying the combined model, it deals with uncertainty and the classifier becomes more effective as shown in <xref ref-type="other" rid="algorithm_4">Algorithm 4</xref>.</p>
<statement content-type="algorithm" id="algorithm_4">
<label>Algorithm 4</label>
<p>NCM-DOA-SVM hybrid classification algorithm.
<preformat>
1: &#x000A0;Step 1: Initialization
2: &#x000A0;Set NCM parameters: number of clusters (n_clusters = 3), fuzziness parameter <italic>m</italic> &#x0003D; 2.0
3: &#x000A0;Set maximum iterations (max_iter = 100), convergence threshold (epsilon = 1e-4)
4: &#x000A0;Set DOA parameters: population size (pop_size = 30), max iterations (max_iter = 50)
5: &#x000A0;Set &#x003C9; &#x0003D; 0.7, a<sub>1</sub> &#x0003D; a<sub>2</sub> &#x0003D; 2.0
6: &#x000A0;Define parameter bounds: A:[0.1 &#x02212; 100], &#x003D1;:[0.001 &#x02212; 1]
7: &#x000A0;Initialize early stopping threshold and counter
8: &#x000A0;Step 2: Neutrosophic Feature Enhancement
9: &#x000A0;Train NCM on input data <italic>X</italic><sub>train</sub>
10: &#x000A0;Compute T), I, and F membership matrices</preformat>
<monospace>11: &#x000A0;Concatenate original features and neutrosophic memberships: <inline-formula><mml:math id="M21"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">T</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">I</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">F</mml:mtext></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></monospace>
<preformat>
12: &#x000A0;Step 3: Initialize Dolphin Population
13: &#x000A0;for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
14: &#x02003; Randomly initialize A and &#x003D1; within bounds
</preformat>
<monospace>15: &#x02003; Train SVM with (A, &#x003D1;) on <inline-formula><mml:math id="M22"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<preformat>16: &#x02003; Evaluate performance on validation data (fitness &#x0003D; &#x02212;1 &#x000D7; accuracy)
17: &#x02003; Update personal best and global best positions
18: &#x000A0;end <bold>for</bold>
19: &#x000A0;Step 4: Optimization Loop
20: &#x000A0;for iter &#x0003D; 1 to max_iter <bold>do</bold>
21: &#x02003; for each dolphin <italic>i</italic> &#x0003D; 1 to pop_size <bold>do</bold>
22: &#x02003;&#x02003; Generate random values &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub>&#x02208;[0, 1]
23: &#x02003;&#x02003; Compute cognitive component: a<sub>1</sub>&#x000B7;&#x003BD;<sub>1</sub>&#x000B7;(personal_best &#x02212; current_position)
24: &#x02003;&#x02003; Compute social component: a<sub>2</sub>&#x000B7;&#x003BD;<sub>2</sub>&#x000B7;(global_best &#x02212; current_position)
25: &#x02003;&#x02003; Update velocity and position using DOA rules
26: &#x02003;&#x02003; Clip position to parameter bounds
</preformat>
<monospace>27: &#x02003;&#x02003; Train SVM with updated parameters on <inline-formula><mml:math id="M23"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<preformat>
28: &#x02003;&#x02003; Evaluate fitness and update personal/global bests
29: &#x02003; end <bold>for</bold>
30: &#x02003; if no improvement in global best <bold>then</bold>
31: &#x02003;&#x02003; Increment early stopping counter
32: &#x02003; else
33: &#x02003;&#x02003; Reset early stopping counter
34: &#x02003; end <bold>if</bold>
35: &#x02003; if early stopping counter &#x02265; threshold <bold>then</bold>
36: &#x02003;&#x02003; Break
37: &#x02003; end <bold>if</bold>
38: &#x000A0;end <bold>for</bold>
39: &#x000A0;Step 5: Final Training and Evaluation
40: &#x000A0;Train final NCM on full training data
41: &#x000A0;Compute T, I, F memberships for test data
</preformat>
<monospace>42: &#x000A0;Create <inline-formula><mml:math id="M24"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">T</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">I</mml:mtext></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">F</mml:mtext></mml:mstyle></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula></monospace>
<monospace>43: &#x000A0;Train SVM with best parameters on <inline-formula><mml:math id="M25"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">train</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<monospace>44: &#x000A0;Predict labels on <inline-formula><mml:math id="M26"><mml:msubsup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">test</mml:mtext></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle class="text"><mml:mtext class="textrm" mathvariant="normal">enh</mml:mtext></mml:mstyle></mml:mrow></mml:msubsup></mml:math></inline-formula></monospace>
<preformat>
45: &#x000A0;Compute classification metrics
46: &#x000A0;return best parameters and evaluation results
</preformat>
</p>
</statement>
<sec>
<label>3.8.1</label>
<title>Procedure of classification utilizing the NCM-DOA-SVM hybrid</title>
<p>The classification procedure of the NCM-DOA-SVM hybrid model adheres to the core optimization approach introduced in Section 3.5.1. Initially, the input dataset undergoes unsupervised clustering using the NCM algorithm. This step computes the truth, indeterminacy, and falsity memberships for each data point, resulting in an enhanced feature space of the form [&#x1D54F;, T, I, F].</p>
<p>Each solution (dolphin) in the population corresponds to a candidate set of SVM parameters, including the penalty coefficient A and the kernel function parameter &#x003D1;. The SVM classifier is trained on the NCM-enhanced features using each dolphin&#x00027;s parameters and evaluated on a validation dataset. The dolphin&#x00027;s fitness is computed based on the classification performance, such as the SSE or classification accuracy.</p>
<p>The optimization process iteratively refines the solutions based on fitness, guiding the swarm toward the best SVM configuration. This collaborative mechanism among NCM, DOA, and SVM not only improves classification precision but also ensures robustness to noisy and uncertain biometric data. The final model thus integrates fuzzy reasoning, optimization intelligence, and discriminative learning to deliver superior performance.</p>
</sec>
<sec>
<label>3.8.2</label>
<title>NCM-DOA-SVM implementation</title>
<p>The NCM-DOA-SVM hybrid approach is presented in the form of pseudo code in <xref ref-type="other" rid="algorithm_4">Algorithm 4</xref>.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and discussion</title>
<sec>
<label>4.1</label>
<title>Algorithm training and validation phases</title>
<p>At this stage, a dataset consisting of 2016 CLFP images was used to develop the DOA and the suggested hybrid approaches, namely DOA-SVM, FCM-DOA-SVM, and NCM-DOA-SVM. The HOG technique was used for initial image processing and trait extraction, which made it easier to extract a feature matrix from these images. The DOA and the suggested hybrid approaches (DOA-SVM, FCM-DOA-SVM, and FCM-DOA-SVM) were then trained using the derived traits matrix, improving their performance.</p>
<p>Upon the completion of the training phase and achieving algorithm stability, a test was conducted involving 504 CLFP images. These images were subjected to preprocessing, followed by feature extraction using the HOG algorithm. To determine the optimal HOG feature extraction parameters, we conducted a comprehensive sensitivity analysis across different cell and block size configurations.</p>
<p>As shown in <xref ref-type="table" rid="T3">Table 3</xref>, three configurations were evaluated: Fine (16 &#x000D7; 16 cells, 2 &#x000D7; 2 blocks), Medium (32 &#x000D7; 32 cells, 2 &#x000D7; 2 blocks), and Coarse (64 &#x000D7; 64 cells, 2 &#x000D7; 2 blocks). The results demonstrate a clear trade-off between feature dimensionality, computational efficiency, and classification accuracy. The Medium configuration achieved the highest accuracy of 0.856198, despite having a moderate feature vector size of 324 dimensions. Interestingly, the Fine configuration, with its substantially larger feature vector (1,764 dimensions), yielded lower accuracy (0.844628), suggesting that excessive granularity may introduce noise or lead to overfitting. The negative correlation between feature size and accuracy (<italic>r</italic> &#x0003D; &#x02212;0.2498) supports this observation. Statistical analysis using ANOVA revealed no significant difference between configurations (<italic>p</italic>&#x02265;0.05), indicating that the Medium configuration provides an optimal balance between computational efficiency (0.003086) and classification performance. The choice of 32 &#x000D7; 32 cell sizes, resulting in four cells for a 128 &#x000D7; 128 image, represents a strategic compromise that captures sufficient local gradient information while maintaining computational tractability and avoiding the curse of dimensionality associated with finer granularities.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>HOG parameter sensitivity analysis results.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Configuration</bold></th>
<th valign="top" align="center"><bold>Cell size</bold></th>
<th valign="top" align="center"><bold>Block size</bold></th>
<th valign="top" align="center"><bold>Accuracy</bold></th>
<th valign="top" align="center"><bold>Computational efficiency</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Fine</td>
<td valign="top" align="center">16 &#x000D7; 16</td>
<td valign="top" align="center">2 &#x000D7; 2</td>
<td valign="top" align="center">0.844628</td>
<td valign="top" align="center">0.000567</td>
</tr>
<tr>
<td valign="top" align="left">Medium</td>
<td valign="top" align="center">32 &#x000D7; 32</td>
<td valign="top" align="center">2 &#x000D7; 2</td>
<td valign="top" align="center">0.856198</td>
<td valign="top" align="center">0.003086</td>
</tr>
<tr>
<td valign="top" align="left">Coarse</td>
<td valign="top" align="center">64 &#x000D7; 64</td>
<td valign="top" align="center">2 &#x000D7; 2</td>
<td valign="top" align="center">0.842975</td>
<td valign="top" align="center">0.027778</td>
</tr></tbody>
</table>
</table-wrap>
<p>The assignment of specific coefficients to each algorithm is determined by the nature of the task, as the specific operations may vary based on the research problem being addressed. Through a series of practical experiments and their application, the appropriate coefficients for the algorithms were established. The values of these coefficients are detailed in <xref ref-type="table" rid="T4">Table 4</xref>.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Tuned Parameters for the proposed model.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Hyperparameter</bold></th>
<th valign="top" align="center"><bold>Choice</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Dataset splitting</td>
<td valign="top" align="center">75% train, 25% test</td>
</tr>
<tr>
<td valign="top" align="left">Class count</td>
<td valign="top" align="center">50</td>
</tr>
<tr>
<td valign="top" align="left">Initial dolphin population</td>
<td valign="top" align="center">30</td>
</tr>
<tr>
<td valign="top" align="left">Early stopping threshold</td>
<td valign="top" align="center">15 iterations</td>
</tr>
<tr>
<td valign="top" align="left">Cross-validation folds</td>
<td valign="top" align="center">5</td>
</tr>
<tr>
<td valign="top" align="left">Bootstrap iterations</td>
<td valign="top" align="center">50</td>
</tr>
<tr>
<td valign="top" align="left">Iteration threshold</td>
<td valign="top" align="center">50</td>
</tr>
<tr>
<td valign="top" align="left">Image resolution</td>
<td valign="top" align="center">128 &#x000D7; 128</td>
</tr>
<tr>
<td valign="top" align="left">HOG&#x02014;block-size</td>
<td valign="top" align="center">2</td>
</tr>
<tr>
<td valign="top" align="left">HOG&#x02014;cell-size</td>
<td valign="top" align="center">32</td>
</tr>
<tr>
<td valign="top" align="left">A<sub>1</sub></td>
<td valign="top" align="center">2 &#x000D7; (1 &#x02212; iteration(<italic>I</italic>)/max_iteration(<italic>MI</italic>))</td>
</tr>
<tr>
<td valign="top" align="left">A<sub>2</sub></td>
<td valign="top" align="center">&#x02212;1&#x0002B;<italic>I</italic>&#x000D7;(&#x02212;1/<italic>MI</italic>)</td>
</tr>
<tr>
<td valign="top" align="left">&#x003C8;</td>
<td valign="top" align="center">2 &#x000D7; (1&#x02212;<italic>I</italic>/<italic>MI</italic>)</td>
</tr></tbody>
</table>
</table-wrap>
<p>The dataset which included 1,512 images, was processed using the DOA method to identify CLFP. The following results were obtained from the evaluation of the suggested algorithm&#x00027;s training using predetermined evaluation criteria:</p>
<disp-formula id="EQ11"><mml:math id="M27"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>87</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>86</mml:mn><mml:mo>.</mml:mo><mml:mn>8</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>87</mml:mn><mml:mo>.</mml:mo><mml:mn>7</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>9</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Bootstrap CI</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>85</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mn>89</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mi>%</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">Convergence</mml:mtext><mml:mo>=</mml:mo><mml:mn>32</mml:mn><mml:mtext class="textrm" mathvariant="normal">iterations</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The dataset include 504 images, which was assessed using the DOA system to determine CLFP. <xref ref-type="table" rid="T5">Table 5</xref> provides details on the training results of the proposed algorithm.</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p>Outcome analysis of system testing with DOA.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Exp. No</bold>.</th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">6,110.23</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">2,109.28</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">2,091.07</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">2,118.55</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">2,091.81</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">2,048.49</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">17,105.92</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">1,663.03</td>
</tr>
<tr>
<td valign="top" align="left">9</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">1,954.80</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">91.0</td>
<td valign="top" align="center">1,732.15</td>
</tr></tbody>
</table>
</table-wrap>
<p>The results of the test phase of DOA are detailed in <xref ref-type="table" rid="T5">Table 5</xref>, which looks at different configurations of the coefficients: cell-size HOG is always set at 32, block-size HOG is fixed at 2, dolphin population level remains at 30, and iteration threshold is investigated at 50.</p>
<p>The DOA-SVM system was employed to train a dataset comprising 1,512 CLFP images for the purpose of CLFP identification. The performance of the proposed hybrid algorithm was evaluated using established assessment criteria, yielding the following results:</p>
<disp-formula id="EQ12"><mml:math id="M28"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>91</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>8</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>90</mml:mn><mml:mo>.</mml:mo><mml:mn>7</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo><mml:mn>0</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>91</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>6</mml:mn><mml:mi>%</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Bootstrap CI</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>89</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mn>93</mml:mn><mml:mo>.</mml:mo><mml:mn>0</mml:mn><mml:mi>%</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">Convergence</mml:mtext><mml:mo>=</mml:mo><mml:mn>28</mml:mn><mml:mtext class="textrm" mathvariant="normal">iterations</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The DOA-SVM system was used to analyze the dataset, which included 504 images, in order to find CLFP. In <xref ref-type="table" rid="T6">Table 6</xref>, the results are presented in detail.</p>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Outcome analysis of system testing with DOA-SVM.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Exp. No</bold>.</th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,282.58</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,387.30</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,905.93</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">37,772.78</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,317.73</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,349.33</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">94.58</td>
<td valign="top" align="center">1,350.67</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,335.51</td>
</tr>
<tr>
<td valign="top" align="left">9</td>
<td valign="top" align="center">94.17</td>
<td valign="top" align="center">1,347.48</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">94.0</td>
<td valign="top" align="center">1,348.37</td>
</tr></tbody>
</table>
</table-wrap>
<p>The results of the test phase of the hybrid method DOA-SVM, which examines different coefficient configurations, are detailed in <xref ref-type="table" rid="T6">Table 6</xref>. HOG with a block-size fixed at 2, a dolphin population level held constant at 30, an iteration threshold examined at 50, and a cell-size continuously maintained at 32.</p>
<p>The FCM-DOA-SVM system was trained to identify CLFP using a dataset comprising 1,512 images. The effectiveness of the proposed algorithm was assessed using evaluation metrics and these are its outcomes:</p>
<disp-formula id="E13"><mml:math id="M29"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>93</mml:mn><mml:mo>.</mml:mo><mml:mn>8</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>5</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>93</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>7</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>94</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mi>%</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Bootstrap CI</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>92</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mn>95</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mi>%</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">Convergence</mml:mtext><mml:mo>=</mml:mo><mml:mn>25</mml:mn><mml:mtext class="textrm" mathvariant="normal">iterations</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The data was assessed utilizing the FCM-DOA-SVM system to identify CLFP, comprising 504 images. The output of the algorithm training is shown in <xref ref-type="table" rid="T7">Table 7</xref> (i.e., the test phase results of the proposed hybrid method are shown in this table). The FCM-DOA-SVM setup kept HOG cell-size at 32, HOG block-size at 2 and Dolphin population at 30 and it varied the Iteration threshold from 1 to 50.</p>
<table-wrap position="float" id="T7">
<label>Table 7</label>
<caption><p>Outcome analysis of system testing with FCM-DOA-SVM.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Exp. No</bold>.</th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,388.09</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">96.26</td>
<td valign="top" align="center">1,369.73</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,370.13</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">4,614.75</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,323.98</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,344.68</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,357.67</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,387.29</td>
</tr>
<tr>
<td valign="top" align="left">9</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,369.75</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">96.0</td>
<td valign="top" align="center">1,323.13</td>
</tr></tbody>
</table>
</table-wrap>
<p>The NCM-DOA-SVM model was trained on a dataset of 1,512 CLFP images, and its performance was assessed using standard evaluation metrics. The results are as given below:</p>
<disp-formula id="EQ14"><mml:math id="M30"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>95</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>2</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mi>&#x0211D;</mml:mi></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>94</mml:mn><mml:mo>.</mml:mo><mml:mn>8</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:msub><mml:mrow><mml:mstyle mathvariant="double-struck"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mi>V</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>95</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x000B1;</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn><mml:mi>%</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext class="textrm" mathvariant="normal">Bootstrap CI</mml:mtext><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>93</mml:mn><mml:mo>.</mml:mo><mml:mn>9</mml:mn><mml:mi>%</mml:mi><mml:mo>,</mml:mo><mml:mn>96</mml:mn><mml:mo>.</mml:mo><mml:mn>3</mml:mn><mml:mi>%</mml:mi></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mtext class="textrm" mathvariant="normal">Convergence</mml:mtext><mml:mo>=</mml:mo><mml:mn>23</mml:mn><mml:mtext class="textrm" mathvariant="normal">iterations</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In order to analyze and identify the 504 images in the dataset as CLFP, the NCM-DOA-SVM system has been used. <xref ref-type="table" rid="T8">Table 8</xref> lists the training phase results and provides an explanation of the testing phase results using the suggested hybrid approach. The following parameter settings were used when implementing the NCM-DOA-SVM system: The dolphin population level was kept at 30, the iteration threshold was investigated at 50, and the HOG cell-size was continuously set at 32 and the HOG block-size was fixed at 2.</p>
<table-wrap position="float" id="T8">
<label>Table 8</label>
<caption><p>Outcome analysis of system testing with NCM-DOA-SVM.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Exp. No</bold>.</th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,341.57</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,351.05</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,348.48</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,339.74</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,357.74</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,345.81</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,348.91</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,318.66</td>
</tr>
<tr>
<td valign="top" align="left">9</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,389.36</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">98.0</td>
<td valign="top" align="center">1,378.92</td>
</tr></tbody>
</table>
</table-wrap>
<p>The rating ratio rate is shown in <xref ref-type="table" rid="T9">Table 9</xref> for the DOA method, as well as for the proposed hybrid approaches: DOA-SVM, FCM-DOA-SVM, and NCM-DOA-SVM.</p>
<table-wrap position="float" id="T9">
<label>Table 9</label>
<caption><p>Comprehensive performance comparison of proposed methods.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Method</bold></th>
<th valign="top" align="center"><bold>Number of test images</bold></th>
<th valign="top" align="center"><bold>Accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">DOA</td>
<td valign="top" align="center">504</td>
<td valign="top" align="center">91.00</td>
<td valign="top" align="center">3,902.533</td>
</tr>
<tr>
<td valign="top" align="left">DOA-SVM</td>
<td valign="top" align="center">504</td>
<td valign="top" align="center">94.07</td>
<td valign="top" align="center">5,039.768</td>
</tr>
<tr>
<td valign="top" align="left">FCM-DOA-SVM</td>
<td valign="top" align="center">504</td>
<td valign="top" align="center">96.03</td>
<td valign="top" align="center">1,684.920</td>
</tr>
<tr>
<td valign="top" align="left">NCM-DOA-SVM</td>
<td valign="top" align="center">504</td>
<td valign="top" align="center">98.00</td>
<td valign="top" align="center">1,352.024</td>
</tr></tbody>
</table>
</table-wrap>
</sec>
<sec>
<label>4.2</label>
<title>Experimental analysis</title>
<p>The experimental results confirmed the robust performance of all proposed algorithms during the training phase. The best classification accuracy, 91.0%, was found for images with a size of 128 &#x000D7; 128 and a cell-size of 32 &#x000D7; 32, as shown in <xref ref-type="table" rid="T5">Table 5</xref>. <xref ref-type="table" rid="T6">Table 6</xref> showed an improved classification accuracy of 94.07% for images of the same dimensions and cell-size when the number of dolphins matched the number of repetitions. Additionally, <xref ref-type="table" rid="T7">Tables 7</xref>, <xref ref-type="table" rid="T8">8</xref> reported a further increase in classification accuracy to 96.03 and 98.0% under the same conditions. These findings are corroborated by the data in <xref ref-type="table" rid="T9">Table 9</xref>. The DOA showed an average accuracy rate of 91.0%, whereas the DOA-SVM hybrid algorithm achieved an average accuracy of 94.07%, the FCM-DOA-SVM algorithm attained an average accuracy of 96.03% and NCM-DOA-SVM algorithm reached an average accuracy of 98.0%.</p>
<p>Our experimental findings indicate that the hybrid algorithm DOA-SVM demonstrates a higher classification ratio than the DOA. This improvement is attributed to the DOA optimization capabilities, which emulate the cooperative behavior of dolphins to enhance parameter selection. The algorithm improves convergence speed and reduces computational cost by learning from previous configurations. A well-tuned DOA balances exploration and exploitation, making parameter selection crucial for optimal performance.</p>
<p>According to experimental results, the suggested hybrid algorithm, which combines DOA-SVM with FCM, performs better in terms of classification accuracy than both the standalone DOA and the hybrid DOA-SVM algorithm. The efficient combination of FCM and DOA, where each technique improves the performance of the other, is the source of this improvement. When these algorithms are used together, they perform better on classification tasks and other tasks than when they are used separately. The FCM algorithm helps by providing soft aggregation capabilities, which enable more precise data point classification, particularly when features overlap. The DOA also supports more efficient searching, so that key data points can be identified and the required computations can be reduced.</p>
<p>Within the spectrum of assessed approaches, the NCM-DOA-SVM method consistently maintained superior classification accuracy. This enhanced performance is resulted due to the effective combination of NCM clustering, the DOA, and the SVM. This approach is convenient for handling unclear, overlapping and uncertain segments within the data and this quality is key for classifying complicated data sets. On the other hand, the DOA helps with global optimization, so features can be effectively chosen and parameters can be successfully tuned. Finally, the SVM provides good performance in the final classification stage. The integration of all three methods together creates a better and more efficient results than if only two are used, such as DOA or DOA-SVM.</p>
<p>In this neutrosophic logic visualization (see <xref ref-type="fig" rid="F4">Figure 4</xref>), the T/I/F membership framework provides significant advantages for our database. Specifically, Truth membership (T) highlights robust and well-defined clusters at the core of the dataset, while Indeterminacy membership (I) captures transitional and boundary regions&#x02013;effectively representing ambiguous cases that are often misclassified by traditional methods. Falsity membership (F) excels at identifying outliers, enhancing data integrity by revealing non-conforming patterns that may compromise analysis. The integrated T/I/F analysis enables a comprehensive and nuanced characterization of uncertainty, offering deeper insights and improved decision-making accuracy over conventional single-value approaches, thus establishing neutrosophic logic as a superior tool for extracting actionable information from uncertain databases.</p>
<fig position="float" id="F4">
<label>Figure 4</label>
<caption><p>Neutrosophic logic T/I/F membership visualization.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fdata-08-1641714-g0004.tif">
<alt-text content-type="machine-generated">Three scatter plots illustrate different membership values based on PCA features. The top left plot shows Truth Membership with a gradient from light to dark red. The top right plot displays Indeterminacy Membership with a blue gradient. The bottom plot depicts Falsity Membership using a green gradient. Each plot has axes labeled Feature 1 and Feature 2.</alt-text>
</graphic>
</fig>
<p>In this work, we propose a CLFP recognition system based on the DOA with 3,902.533 processing seconds and 91.0% classification accuracy. Additionally, we combine the DOA and the SVM algorithms to propose a new hybrid algorithm. By suggesting a new fitness function based on the SVM algorithm that depends on dolphin values rather than the original parameters (G, &#x003F5;, A), the combination aims to improve classification accuracy. This method took 5,039.768 s to process and had a classification accuracy of 94.07%. In order to further increase classification accuracy, we also suggest another hybrid algorithm that combines the DOA-SVM and the FCM algorithm. In comparison to both the DOA and the DOA-SVM algorithm, this algorithm efficiently handles ambiguous and imprecise data, resulting in a more accurate identification system and attaining classification accuracy of 96.03% with a processing time of 1,684.920 s. We suggest combining NCM with DOA-SVM in place of FCM. This results in a higher classification accuracy of 98.0% at a processing time of 1,352.024 s. The NCM-DOA-SVM outperforms other methods for CLFP images.</p>
<p>The comparative evaluation of bio-inspired optimization algorithms (see <xref ref-type="table" rid="T10">Table 10</xref>) reveals that DOA-SVM achieves the highest classification accuracy of 89.69% with the lowest standard deviation (&#x000B1;0.0132), demonstrating superior performance consistency compared to other metaheuristic approaches. While all bio-inspired methods substantially outperform the baseline SVM (88.33%), the computational cost varies significantly, with GA-SVM offering the best time-accuracy trade-off (89.26% in 1,547.74 ss) and PSO-SVM requiring the highest processing time (3,722.63 s) for comparable accuracy. The results validate DOA&#x00027;s effectiveness in hyperparameter optimization for CLFP recognition, though the 588-fold increase in processing time compared to baseline SVM highlights the computational overhead inherent in population-based optimization approaches.</p>
<table-wrap position="float" id="T10">
<label>Table 10</label>
<caption><p>Performance comparison of bio-inspired optimization algorithms with SVM.</p></caption>
<table frame="box" rules="all">
<thead>
<tr>
<th valign="top" align="left"><bold>Algorithm</bold></th>
<th valign="top" align="center"><bold>Mean accuracy (%)</bold></th>
<th valign="top" align="center"><bold>Standard deviation</bold></th>
<th valign="top" align="center"><bold>Mean processing time (s)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Baseline SVM</td>
<td valign="top" align="center">88.33</td>
<td valign="top" align="center">&#x000B1;0.0171</td>
<td valign="top" align="center">3.52</td>
</tr>
<tr>
<td valign="top" align="left"><bold>DOA-SVM</bold></td>
<td valign="top" align="center"><bold>89.69</bold></td>
<td valign="top" align="center">&#x000B1;0.0132</td>
<td valign="top" align="center">2073.12</td>
</tr>
<tr>
<td valign="top" align="left">PSO-SVM</td>
<td valign="top" align="center">89.65</td>
<td valign="top" align="center">&#x000B1;0.0136</td>
<td valign="top" align="center">3,722.63</td>
</tr>
<tr>
<td valign="top" align="left">GA-SVM</td>
<td valign="top" align="center">89.26</td>
<td valign="top" align="center">&#x000B1;0.0111</td>
<td valign="top" align="center">1,547.74</td>
</tr>
<tr>
<td valign="top" align="left">ACO-SVM</td>
<td valign="top" align="center">89.45</td>
<td valign="top" align="center">&#x000B1;0.0142</td>
<td valign="top" align="center">3,304.97</td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>Bold values indicate the best (highest-performing) results among the compared methods.</p>
</table-wrap-foot>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion and future work</title>
<p>This study demonstrates that strategic hybridization of bio-inspired optimization with machine learning classifiers significantly advances contactless fingerprint recognition. Our systematic evaluation reveals clear performance progression: DOA (91.00%), DOA-SVM (94.07%), FCM-DOA-SVM (96.03%), and NCM-DOA-SVM (98.00%), with the NCM-based hybrid achieving superior accuracy while maintaining competitive processing efficiency.</p>
<p>This work makes several key contributions to the field of contactless biometrics. Primarily, it introduces a novel hybrid framework that successfully merges the Dolphin Optimization Algorithm with a Support Vector Machine classifier, establishing a new approach for CLFP recognition. The research is further advanced by integrating fuzzy clustering to refine feature representation and, most significantly, by pioneering the application of Neutrosophic C-Means clustering to effectively manage the inherent uncertainty and indeterminacy in fingerprint images. Beyond accuracy improvements, a thorough analysis of computational efficiency is provided, offering valuable practical insights that bridge the gap between algorithmic innovation and real-world system deployment.</p>
<p>Despite the promising results, this study has certain limitations. The generalizability of our findings is constrained by the dataset&#x00027;s limited size and demographic diversity, which may not fully represent broader populations. Furthermore, the robustness of the single-stage classification pipeline requires further validation against low-quality, noisy, or incomplete fingerprint images. To address these constraints and advance this research, future efforts should prioritize several key areas. Expanding the evaluation to include larger, multi-ethnic datasets is crucial for verifying performance across diverse real-world conditions. Exploring multi-stage architectures could also enhance robustness by decoupling processes like feature enhancement and classification. Finally, developing real-time prototypes would be invaluable for assessing the practical deployment of these methods, particularly under computational constraints. These research directions are essential for translating the current algorithmic innovations into reliable, real-world biometric systems.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="ethics-statement" id="s7">
<title>Ethics statement</title>
<p>The studies involving humans were approved by Hongkong Polytechnic University. The studies were conducted in accordance with the local legislation and institutional requirements. The participants provided their written informed consent to participate in this study.</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>JR: Data curation, Formal analysis, Methodology, Project administration, Resources, Software, Writing &#x02013; original draft. ED: Conceptualization, Funding acquisition, Investigation, Supervision, Validation, Visualization, Writing &#x02013; review &#x00026; editing.</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s10">
<title>Generative AI statement</title>
<p>The author(s) declare that no Gen AI was used in the creation of this manuscript.Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Al-Taie</surname> <given-names>S. A. M.</given-names></name> <name><surname>Khaleel</surname> <given-names>B. I.</given-names></name></person-group> (<year>2024</year>). <article-title>Palmprint identification using dolphin optimization</article-title>. <source>Period. Polytech. Electr. Eng. Comput. Sci</source>. <volume>68</volume>, <fpage>295</fpage>&#x02013;<lpage>308</lpage>. doi: <pub-id pub-id-type="doi">10.3311/PPee.22767</pub-id></mixed-citation>
</ref>
<ref id="B2">
<mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Artan</surname> <given-names>Y.</given-names></name></person-group> (<year>2024</year>). <article-title>&#x0201C;MinNet based contactless fingerprint matching method,&#x0201D;</article-title> in <source>2024 32nd Signal Processing and Communications Applications Conference (SIU)</source> (<publisher-loc>Mersin</publisher-loc>), 1-4. doi: <pub-id pub-id-type="doi">10.1109/SIU61531.2024.10600842</pub-id></mixed-citation>
</ref>
<ref id="B3">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Attrish</surname> <given-names>A.</given-names></name> <name><surname>Bharat</surname> <given-names>N.</given-names></name> <name><surname>Anand</surname> <given-names>V.</given-names></name> <name><surname>Kanhangad</surname> <given-names>V.</given-names></name></person-group> (<year>2021</year>). <article-title>A contactless fingerprint recognition system</article-title>. <source>arXiv [preprint]</source>. arXiv:2108.09048. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2108.09048</pub-id></mixed-citation>
</ref>
<ref id="B4">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bezdek</surname> <given-names>J. C.</given-names></name> <name><surname>Ehrlich</surname> <given-names>R.</given-names></name> <name><surname>Full</surname> <given-names>W.</given-names></name></person-group> (<year>1984</year>). <article-title>FCM: the fuzzy c-means clustering algorithm</article-title>. <source>Comput. Geosci</source>. <volume>10</volume>, <fpage>191</fpage>&#x02013;<lpage>203</lpage>. doi: <pub-id pub-id-type="doi">10.1016/0098-3004(84)90020-7</pub-id></mixed-citation>
</ref>
<ref id="B5">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cetina</surname> <given-names>K.</given-names></name> <name><surname>M&#x000E1;rquez-Neila</surname> <given-names>P.</given-names></name> <name><surname>Baumela</surname> <given-names>L.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;A comparative study of feature descriptors for mitochondria and synapse segmentation,&#x0201D;</article-title> in Proceedings of the 22nd International Conference on Pattern Recognition (Stockholm), 3215-3220. doi: <pub-id pub-id-type="doi">10.1109/ICPR.2014.554</pub-id></mixed-citation>
</ref>
<ref id="B6">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Chicco</surname> <given-names>D.</given-names></name> <name><surname>Jurman</surname> <given-names>G.</given-names></name></person-group> (<year>2020</year>). <article-title>The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation</article-title>. <source>BMC Genomics</source> <volume>21</volume>:<fpage>6</fpage>. doi: <pub-id pub-id-type="doi">10.1186/s12864-019-6413-7</pub-id><pub-id pub-id-type="pmid">31898477</pub-id></mixed-citation>
</ref>
<ref id="B7">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Chimatapu</surname> <given-names>R.</given-names></name> <name><surname>Hagras</surname> <given-names>H.</given-names></name> <name><surname>Starkey</surname> <given-names>A.</given-names></name> <name><surname>Owusu</surname> <given-names>G.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Explainable AI and fuzzy logic systems,&#x0201D;</article-title> in <italic>Theory and Practice of Natural Computing</italic> (Cham: Springer), <fpage>3</fpage>&#x02013;<lpage>20</lpage>. doi: <pub-id pub-id-type="doi">10.1007/978-3-030-04070-3_1</pub-id></mixed-citation>
</ref>
<ref id="B8">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Chowdhury</surname> <given-names>A. M.</given-names></name> <name><surname>Imtiaz</surname> <given-names>M. H.</given-names></name></person-group> (<year>2022</year>). <article-title>Contactless fingerprint recognition using deep learning&#x02014;a systematic review</article-title>. <source>J. Cybersecur. Priv</source>. <volume>2</volume>, <fpage>714</fpage>&#x02013;<lpage>730</lpage>. doi: <pub-id pub-id-type="doi">10.3390/jcp2030036</pub-id></mixed-citation>
</ref>
<ref id="B9">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cortes</surname> <given-names>C.</given-names></name> <name><surname>Vapnik</surname> <given-names>V.</given-names></name></person-group> (<year>1995</year>). <article-title>Support-vector networks</article-title>. <source>Mach. Learn</source>. <volume>20</volume>, <fpage>273</fpage>&#x02013;<lpage>297</lpage>. doi: <pub-id pub-id-type="doi">10.1023/A:1022627411411</pub-id></mixed-citation>
</ref>
<ref id="B10">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cui</surname> <given-names>Z.</given-names></name> <name><surname>Jia</surname> <given-names>Y.</given-names></name> <name><surname>Zheng</surname> <given-names>S.</given-names></name> <name><surname>Su</surname> <given-names>F.</given-names></name></person-group> (<year>2024</year>). <article-title>Contactless fingerprint recognition using 3D graph matching</article-title>. <source>arXiv [preprint]</source>. arXiv:2409.08782. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2409.08782</pub-id></mixed-citation>
</ref>
<ref id="B11">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Dong</surname> <given-names>C.</given-names></name> <name><surname>Kumar</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>Synthesis of multi-view 3D fingerprints to advance contactless fingerprint identification</article-title>. <source>IEEE Trans. Pattern Anal. Mach. Intell</source>. <volume>45</volume>, <fpage>13134</fpage>&#x02013;<lpage>13151</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TPAMI.2023.3294357</pub-id><pub-id pub-id-type="pmid">37432800</pub-id></mixed-citation>
</ref>
<ref id="B12">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Elhariri</surname> <given-names>E.</given-names></name> <name><surname>El-Bendary</surname> <given-names>N.</given-names></name> <name><surname>Hassanien</surname> <given-names>A. E.</given-names></name> <name><surname>Snasel</surname> <given-names>V.</given-names></name></person-group> (<year>2015</year>). <article-title>An assistive object recognition system for enhancing seniors quality of life</article-title>. <source>Procedia Comput. Sci</source>. <volume>65</volume>, <fpage>691</fpage>&#x02013;<lpage>700</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.procs.2015.09.013</pub-id></mixed-citation>
</ref>
<ref id="B13">
<mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Faye</surname> <given-names>A.</given-names></name> <name><surname>Ndaw</surname> <given-names>J. D.</given-names></name> <name><surname>S&#x000E8;ne</surname> <given-names>M.</given-names></name></person-group> (<year>2018</year>). &#x0201C;SVM-based DOA estimation with classification optimization,&#x0201D; in <italic>2018 26th Telecommunications Forum (TELFOR)</italic> (<publisher-loc>Belgrade</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>1</fpage>&#x02013;<lpage>4</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TELFOR.2018.8611827</pub-id></mixed-citation>
</ref>
<ref id="B14">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ferreyra</surname> <given-names>E.</given-names></name> <name><surname>Hagras</surname> <given-names>H.</given-names></name> <name><surname>Kern</surname> <given-names>M.</given-names></name> <name><surname>Owusu</surname> <given-names>G.</given-names></name></person-group> (<year>2019</year>). &#x0201C;Depicting decision-making: a type-2 fuzzy logic based explainable artificial intelligence system for goal-driven simulation in the workforce allocation domain,&#x0201D; in <italic>2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)</italic> (New Orleans, LA: IEEE), <fpage>1</fpage>&#x02013;<lpage>6</lpage>. doi: <pub-id pub-id-type="doi">10.1109/FUZZ-IEEE.2019.8858933</pub-id></mixed-citation>
</ref>
<ref id="B15">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gholizadeh</surname> <given-names>S.</given-names></name> <name><surname>Poorhoseini</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Seismic layout optimization of steel braced frames by an improved dolphin echolocation algorithm</article-title>. <source>Struct. Multidiscip. Optim</source>. <volume>54</volume>, <fpage>1011</fpage>&#x02013;<lpage>1029</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s00158-016-1461-y</pub-id></mixed-citation>
</ref>
<ref id="B16">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Grosz</surname> <given-names>S. A.</given-names></name> <name><surname>Engelsma</surname> <given-names>J. J.</given-names></name> <name><surname>Liu</surname> <given-names>E.</given-names></name> <name><surname>Jain</surname> <given-names>A. K.</given-names></name></person-group> (<year>2021</year>). <article-title>C2CL: contact to contactless fingerprint matching</article-title>. <source>IEEE Trans. Inf. Forensics Secur</source>. <volume>17</volume>, <fpage>196</fpage>&#x02013;<lpage>210</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TIFS.2021.3134867</pub-id></mixed-citation>
</ref>
<ref id="B17">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Guo</surname> <given-names>Y.</given-names></name> <name><surname>Sengur</surname> <given-names>A.</given-names></name></person-group> (<year>2015</year>). <article-title>NCM: neutrosophic c-means clustering algorithm</article-title>. <source>Pattern Recognit</source>. <volume>48</volume>, <fpage>2710</fpage>&#x02013;<lpage>2724</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.patcog.2015.02.018</pub-id></mixed-citation>
</ref>
<ref id="B18">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>C. L.</given-names></name> <name><surname>Wang</surname> <given-names>C. J.</given-names></name></person-group> (<year>2006</year>). <article-title>A GA-based feature selection and parameters optimization for support vector machines</article-title>. <source>Expert Syst. Appl</source>. <volume>31</volume>, <fpage>231</fpage>&#x02013;<lpage>240</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2005.09.024</pub-id></mixed-citation>
</ref>
<ref id="B19">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jawade</surname> <given-names>B.</given-names></name> <name><surname>Mohan</surname> <given-names>D. D.</given-names></name> <name><surname>Setlur</surname> <given-names>S.</given-names></name> <name><surname>Ratha</surname> <given-names>N.</given-names></name> <name><surname>Govindaraju</surname> <given-names>V.</given-names></name></person-group> (<year>2022</year>). &#x0201C;RidgeBase: a cross-sensor multi-finger contactless fingerprint dataset,&#x0201D; in <italic>2022 IEEE International Joint Conference on Biometrics (IJCB)</italic> (Abu Dhabi: IEEE), <fpage>1</fpage>&#x02013;<lpage>9</lpage>. doi: <pub-id pub-id-type="doi">10.1109/IJCB54206.2022.10007936</pub-id></mixed-citation>
</ref>
<ref id="B20">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kaplesh</surname> <given-names>P.</given-names></name> <name><surname>Gupta</surname> <given-names>A.</given-names></name> <name><surname>Bansal</surname> <given-names>D.</given-names></name> <name><surname>Sofat</surname> <given-names>S.</given-names></name> <name><surname>Mittal</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Vision transformer for contactless fingerprint classification</article-title>. <source>Multimedia Tools Appl</source>. <volume>84</volume>, <fpage>31239</fpage>&#x02013;<lpage>31259</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s11042-024-20396-4</pub-id></mixed-citation>
</ref>
<ref id="B21">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kaveh</surname> <given-names>A.</given-names></name> <name><surname>Farhoudi</surname> <given-names>N.</given-names></name></person-group> (<year>2013</year>). <article-title>A new optimization method: Dolphin echolocation</article-title>. <source>Adv. Eng. Softw</source>. <volume>59</volume>, <fpage>53</fpage>&#x02013;<lpage>70</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.advengsoft.2013.03.004</pub-id></mixed-citation>
</ref>
<ref id="B22">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kaveh</surname> <given-names>A.</given-names></name> <name><surname>Hoseini Vaez</surname> <given-names>S. R.</given-names></name> <name><surname>Hosseini</surname> <given-names>P.</given-names></name></person-group> (<year>2017</year>). <article-title>Modified dolphin monitoring operator for weight optimization of frame structures</article-title>. <source>Period. Polytech. Civ. Eng</source>. <volume>61</volume>, <fpage>770</fpage>&#x02013;<lpage>779</lpage>. doi: <pub-id pub-id-type="doi">10.3311/PPci.9691</pub-id></mixed-citation>
</ref>
<ref id="B23">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Labati</surname> <given-names>R. D.</given-names></name> <name><surname>Genovese</surname> <given-names>A.</given-names></name> <name><surname>Piuri</surname> <given-names>V.</given-names></name> <name><surname>Scotti</surname> <given-names>F.</given-names></name></person-group> (<year>2014</year>). <article-title>Touchless fingerprint biometrics: a survey on 2D and 3D technologies</article-title>. <source>J. Internet Technol</source>. <volume>15</volume>, <fpage>325</fpage>&#x02013;<lpage>332</lpage>. doi: <pub-id pub-id-type="doi">10.6138/JIT.2014.15.3.01</pub-id></mixed-citation>
</ref>
<ref id="B24">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>C.</given-names></name> <name><surname>Kumar</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Matching contactless and contact-based conventional fingerprint images for biometrics identification</article-title>. <source>IEEE Trans. Image Process</source>. <volume>27</volume>, <fpage>2008</fpage>&#x02013;<lpage>2021</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TIP.2017.2788866</pub-id><pub-id pub-id-type="pmid">29990285</pub-id></mixed-citation>
</ref>
<ref id="B25">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lin</surname> <given-names>S. W.</given-names></name> <name><surname>Ying</surname> <given-names>K. C.</given-names></name> <name><surname>Chen</surname> <given-names>S. C.</given-names></name> <name><surname>Lee</surname> <given-names>Z. J.</given-names></name></person-group> (<year>2008</year>). <article-title>Particle swarm optimization for parameter determination and feature selection of support vector machines</article-title>. <source>Expert Syst. Appl</source>. <volume>35</volume>, <fpage>1817</fpage>&#x02013;<lpage>1824</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.eswa.2007.08.088</pub-id></mixed-citation>
</ref>
<ref id="B26">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Maltoni</surname> <given-names>D.</given-names></name> <name><surname>Maio</surname> <given-names>D.</given-names></name> <name><surname>Jain</surname> <given-names>A. K.</given-names></name> <name><surname>Prabhakar</surname> <given-names>S.</given-names></name></person-group> (<year>2009</year>). <source>Handbook of Fingerprint Recognition, Vol. 2</source>. Cham: Springer. doi: <pub-id pub-id-type="doi">10.1007/978-1-84882-254-2</pub-id></mixed-citation>
</ref>
<ref id="B27">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Mendel</surname> <given-names>J. M.</given-names></name> <name><surname>Bonissone</surname> <given-names>P. P.</given-names></name></person-group> (<year>2021</year>). <article-title>Critical thinking about explainable AI (XAI) for rule-based fuzzy systems</article-title>. <source>IEEE Trans. Fuzzy Syst</source>. <volume>29</volume>, <fpage>3579</fpage>&#x02013;<lpage>3593</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TFUZZ.2021.3079503</pub-id></mixed-citation>
</ref>
<ref id="B28">
<mixed-citation publication-type="web"><person-group person-group-type="author"><name><surname>Moen</surname> <given-names>U.</given-names></name></person-group> (<year>2018</year>). <source>Early Detection of Alzheimer&#x00027;s Disease using 3D Texture Features and 3D Convolutional Neural Networks from structural MRI</source> [MSc Thesis]. University of Stavanger. Available online at: <ext-link ext-link-type="uri" xlink:href="http://hdl.handle.net/11250/2564781">http://hdl.handle.net/11250/2564781</ext-link> (Accessed July 28, 2025).</mixed-citation>
</ref>
<ref id="B29">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Mohamed-Abdul-Cader</surname> <given-names>A.</given-names></name> <name><surname>Banks</surname> <given-names>J.</given-names></name> <name><surname>Chandran</surname> <given-names>V.</given-names></name></person-group> (<year>2023</year>). <article-title>Fingerprint systems: sensors, image acquisition, interoperability and challenges</article-title>. <source>Sensors</source> <volume>23</volume>:<fpage>6591</fpage>. doi: <pub-id pub-id-type="doi">10.3390/s23146591</pub-id><pub-id pub-id-type="pmid">37514887</pub-id></mixed-citation>
</ref>
<ref id="B30">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Peddi</surname> <given-names>S.</given-names></name> <name><surname>Bandyopadhyay</surname> <given-names>S.</given-names></name> <name><surname>Samanta</surname> <given-names>D.</given-names></name></person-group> (<year>2025</year>). <article-title>G-MSGINet: a grouped multi-scale graph-involution network for contactless fingerprint recognition</article-title>. <source>arXiv [preprint]</source>. arXiv:2505.08233. doi: <pub-id pub-id-type="doi">10.48550/arXiv.2505.08233</pub-id></mixed-citation>
</ref>
<ref id="B31">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Priesnitz</surname> <given-names>J.</given-names></name> <name><surname>Rathgeb</surname> <given-names>C.</given-names></name> <name><surname>Buchmann</surname> <given-names>N.</given-names></name> <name><surname>Busch</surname> <given-names>C.</given-names></name> <name><surname>Margraf</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>An overview of touchless 2D fingerprint recognition</article-title>. <source>EURASIP J Image Video Process</source> <volume>2021</volume>, <fpage>1</fpage>&#x02013;<lpage>21</lpage>. doi: <pub-id pub-id-type="doi">10.1186/s13640-021-00548-4</pub-id></mixed-citation>
</ref>
<ref id="B32">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Qi</surname> <given-names>Z.</given-names></name> <name><surname>Tian</surname> <given-names>Y.</given-names></name> <name><surname>Shi</surname> <given-names>Y.</given-names></name></person-group> (<year>2013</year>). <article-title>Robust twin support vector machine for pattern classification</article-title>. <source>Pattern Recognit</source>. <volume>46</volume>, <fpage>305</fpage>&#x02013;<lpage>316</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.patcog.2012.06.019</pub-id></mixed-citation>
</ref>
<ref id="B33">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Qiao</surname> <given-names>W.</given-names></name> <name><surname>Yang</surname> <given-names>Z.</given-names></name></person-group> (<year>2019</year>). <article-title>Modified dolphin swarm algorithm based on chaotic maps for solving high-dimensional function optimization problems</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>110472</fpage>&#x02013;<lpage>110486</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ACCESS.2019.2931910</pub-id></mixed-citation>
</ref>
<ref id="B34">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rajaram</surname> <given-names>K.</given-names></name> <name><surname>Amma</surname> <given-names>N.</given-names></name> <name><surname>Selvakumar</surname> <given-names>S.</given-names></name></person-group> (<year>2023</year>). <article-title>Convolutional neural network based children recognition system using contactless fingerprints</article-title>. <source>Int. J. Inf. Technol</source>. <volume>15</volume>, <fpage>2695</fpage>&#x02013;<lpage>2705</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s41870-023-01306-7</pub-id><pub-id pub-id-type="pmid">37360315</pub-id></mixed-citation>
</ref>
<ref id="B35">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ruzicka</surname> <given-names>L.</given-names></name> <name><surname>Kohn</surname> <given-names>B.</given-names></name> <name><surname>Heitzinger</surname> <given-names>C.</given-names></name></person-group> (<year>2025</year>). <article-title>TipSegNet: fingertip segmentation in contactless fingerprint imaging</article-title>. <source>Sensors</source> <volume>25</volume>:<fpage>1824</fpage>. doi: <pub-id pub-id-type="doi">10.3390/s25061824</pub-id><pub-id pub-id-type="pmid">40292973</pub-id></mixed-citation>
</ref>
<ref id="B36">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Shao</surname> <given-names>Y. H.</given-names></name> <name><surname>Zhang</surname> <given-names>C. H.</given-names></name> <name><surname>Wang</surname> <given-names>X. B.</given-names></name> <name><surname>Deng</surname> <given-names>N. Y.</given-names></name></person-group> (<year>2011</year>). <article-title>Improvements on twin support vector machines</article-title>. <source>IEEE Trans. Neural Netw</source>. <volume>22</volume>, <fpage>962</fpage>&#x02013;<lpage>968</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TNN.2011.2130540</pub-id><pub-id pub-id-type="pmid">21550880</pub-id></mixed-citation>
</ref>
<ref id="B37">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sharma</surname> <given-names>S.</given-names></name> <name><surname>Kaul</surname> <given-names>A.</given-names></name></person-group> (<year>2018</year>). <article-title>Hybrid fuzzy multi-criteria decision making based multi cluster head dolphin swarm optimized IDS for VANET</article-title>. <source>Veh. Commun</source>. <volume>12</volume>, <fpage>23</fpage>&#x02013;<lpage>38</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.vehcom.2017.12.003</pub-id></mixed-citation>
</ref>
<ref id="B38">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Shi</surname> <given-names>L.</given-names></name> <name><surname>Lan</surname> <given-names>S.</given-names></name> <name><surname>Gui</surname> <given-names>H.</given-names></name> <name><surname>Yang</surname> <given-names>Y.</given-names></name> <name><surname>Guo</surname> <given-names>Z.</given-names></name></person-group> (<year>2022</year>). <article-title>A novel 2D contactless fingerprint matching method</article-title>. <source>Neurocomputing</source> <volume>500</volume>, <fpage>547</fpage>&#x02013;<lpage>555</lpage>. doi: <pub-id pub-id-type="doi">10.1016/j.neucom.2022.05.092</pub-id></mixed-citation>
</ref>
<ref id="B39">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Shukla</surname> <given-names>A. K.</given-names></name> <name><surname>Smits</surname> <given-names>G.</given-names></name> <name><surname>Pivert</surname> <given-names>O.</given-names></name> <name><surname>Lesot</surname> <given-names>M. J.</given-names></name></person-group> (<year>2020</year>). &#x0201C;Explaining data regularities and anomalies,&#x0201D; in <italic>Proc. 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)</italic> (Glasgow: IEEE), <fpage>1</fpage>&#x02013;<lpage>8</lpage>. doi: <pub-id pub-id-type="doi">10.1109/FUZZ48607.2020.9177689</pub-id></mixed-citation>
</ref>
<ref id="B40">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Siddiqui</surname> <given-names>M.</given-names></name> <name><surname>Iqbal</surname> <given-names>S. AlShammari, B.</given-names></name> <name><surname>Alhaqbani</surname> <given-names>B.</given-names></name> <name><surname>Khan</surname> <given-names>T.</given-names></name> <name><surname>Razzak</surname> <given-names>I.</given-names></name></person-group> (<year>2024</year>). &#x0201C;A robust algorithm for contactless fingerprint enhancement and matching,&#x0201D; in <italic>2024 International Conference on Digital Image Computing: Techniques and Applications (DICTA)</italic> (Perth: IEEE), <fpage>214</fpage>&#x02013;<lpage>220</lpage>. doi: <pub-id pub-id-type="doi">10.1109/DICTA63115.2024.00041</pub-id></mixed-citation>
</ref>
<ref id="B41">
<mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Smarandache</surname> <given-names>F.</given-names></name></person-group> (<year>2003</year>). <source>A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics</source>. <publisher-loc>Austin, TX</publisher-loc>: <publisher-name>American Research Press</publisher-name>.</mixed-citation>
</ref>
<ref id="B42">
<mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Soranamageswari</surname> <given-names>M.</given-names></name> <name><surname>Meena</surname> <given-names>C.</given-names></name></person-group> (<year>2010</year>). <article-title>&#x0201C;Statistical feature extraction for classification of image spam using artificial neural networks,&#x0201D;</article-title> in <source>Proc. 2010 Second International Conference on Machine Learning and Computing, Bangalore, India</source> (<publisher-loc>Bangalore</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>101</fpage>&#x02013;<lpage>105</lpage>. doi: <pub-id pub-id-type="doi">10.1109/ICMLC.2010.72</pub-id></mixed-citation>
</ref>
<ref id="B43">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Soto</surname> <given-names>R.</given-names></name> <name><surname>Crawford</surname> <given-names>B.</given-names></name> <name><surname>Carrasco</surname> <given-names>C.</given-names></name> <name><surname>Almonacid</surname> <given-names>B.</given-names></name> <name><surname>Reyes</surname> <given-names>V.</given-names></name> <name><surname>Araya</surname> <given-names>I.</given-names></name> <etal/></person-group>. (<year>2016</year>). &#x0201C;Solving manufacturing cell design problems by using a dolphin echolocation algorithm,&#x0201D; in <italic>Computational Science and Its Applications &#x02013; ICCSA 2016</italic> (Cham: Springer), <fpage>77</fpage>&#x02013;<lpage>86</lpage>. doi: <pub-id pub-id-type="doi">10.1007/978-3-319-42092-9_7</pub-id></mixed-citation>
</ref>
<ref id="B44">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sreehari</surname> <given-names>S.</given-names></name> <name><surname>Anzar</surname> <given-names>M.</given-names></name></person-group> (<year>2025</year>). <article-title>Touchless fingerprint recognition: a survey of recent developments and challenges</article-title>. <source>Comput. Electr. Eng</source>. <volume>122</volume>:<fpage>109894</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.compeleceng.2024.109894</pub-id></mixed-citation>
</ref>
<ref id="B45">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>H.</given-names></name> <name><surname>Kumar</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>Towards more accurate contactless fingerprint minutiae extraction and pose-invariant matching</article-title>. <source>IEEE Trans. Inf. Forensics Secur</source>. <volume>15</volume>, <fpage>3924</fpage>&#x02013;<lpage>3937</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TIFS.2020.3001732</pub-id></mixed-citation>
</ref>
<ref id="B46">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Vibert</surname> <given-names>B.</given-names></name> <name><surname>Le Bars</surname> <given-names>J. M.</given-names></name> <name><surname>Charrier</surname> <given-names>C.</given-names></name> <name><surname>Rosenberger</surname> <given-names>C.</given-names></name></person-group> (<year>2023</year>). <article-title>Comparative study of minutiae selection methods for digital fingerprints</article-title>. <source>Front. Big Data</source> <volume>6</volume>:<fpage>1146034</fpage>. doi: <pub-id pub-id-type="doi">10.3389/fdata.2023.1146034</pub-id><pub-id pub-id-type="pmid">37143776</pub-id></mixed-citation>
</ref>
<ref id="B47">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Vithlani</surname> <given-names>P.</given-names></name> <name><surname>Kumbharana</surname> <given-names>C. K.</given-names></name></person-group> (<year>2015</year>). <article-title>Structural and statistical feature extraction methods for character and digit recognition</article-title>. <source>Int. J. Comput. Appl</source>. <volume>120</volume>, <fpage>43</fpage>&#x02013;<lpage>47</lpage>. doi: <pub-id pub-id-type="doi">10.5120/21413-4451</pub-id></mixed-citation>
</ref>
<ref id="B48">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>T.</given-names></name> <name><surname>Yao</surname> <given-names>M.</given-names></name> <name><surname>Yang</surname> <given-names>J.</given-names></name></person-group> (<year>2017</year>). <article-title>Dolphin swarm extreme learning machine</article-title>. <source>Cognit. Comput</source>. <volume>9</volume>, <fpage>275</fpage>&#x02013;<lpage>284</lpage>. doi: <pub-id pub-id-type="doi">10.1007/s12559-017-9451-y</pub-id></mixed-citation>
</ref>
<ref id="B49">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>T. Q.</given-names></name> <name><surname>Yao</surname> <given-names>M.</given-names></name> <name><surname>Yang</surname> <given-names>J. H.</given-names></name></person-group> (<year>2016</year>). <article-title>Dolphin swarm algorithm</article-title>. <source>Front. Inf. Technol. Electr. Eng</source>. <volume>17</volume>, <fpage>717</fpage>&#x02013;<lpage>729</lpage>. doi: <pub-id pub-id-type="doi">10.1631/FITEE.1500287</pub-id></mixed-citation>
</ref>
<ref id="B50">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yin</surname> <given-names>X.</given-names></name> <name><surname>Zhu</surname> <given-names>Y.</given-names></name> <name><surname>Hu</surname> <given-names>J.</given-names></name></person-group> (<year>2020</year>). <article-title>Contactless fingerprint recognition based on global minutia topology and loose genetic algorithm</article-title>. <source>IEEE Trans. Inf. Forensics Secur</source>. <volume>15</volume>, <fpage>28</fpage>&#x02013;<lpage>41</lpage>. doi: <pub-id pub-id-type="doi">10.1109/TIFS.2019.2918083</pub-id></mixed-citation>
</ref>
<ref id="B51">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yin</surname> <given-names>X.</given-names></name> <name><surname>Zhu</surname> <given-names>Y.</given-names></name> <name><surname>Hu</surname> <given-names>J.</given-names></name></person-group> (<year>2021</year>). <article-title>A survey on 2D and 3D contactless fingerprint biometrics: a taxonomy, review, and future directions</article-title>. <source>IEEE Open J. Comput. Soc</source>. <volume>2</volume>, <fpage>370</fpage>&#x02013;<lpage>381</lpage>. doi: <pub-id pub-id-type="doi">10.1109/OJCS.2021.3119572</pub-id></mixed-citation>
</ref>
<ref id="B52">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yong</surname> <given-names>W.</given-names></name> <name><surname>Tao</surname> <given-names>W.</given-names></name> <name><surname>Cheng-Zhi</surname> <given-names>Z.</given-names></name> <name><surname>Hua-Juan</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>A new stochastic optimization approach &#x02014; dolphin swarm optimization algorithm</article-title>. <source>Int. J. Comput. Intell. Appl</source>. <volume>15</volume>:<fpage>1650011</fpage>. doi: <pub-id pub-id-type="doi">10.1142/S1469026816500115</pub-id></mixed-citation>
</ref>
<ref id="B53">
<mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Liu</surname> <given-names>S.</given-names></name> <name><surname>Liu</surname> <given-names>M.</given-names></name></person-group> (<year>2021</year>). <article-title>A multi-task fully deep convolutional neural network for contactless fingerprint minutiae extraction</article-title>. <source>Pattern Recognit</source>. <volume>120</volume>:<fpage>108189</fpage>. doi: <pub-id pub-id-type="doi">10.1016/j.patcog.2021.108189</pub-id><pub-id pub-id-type="pmid">36536631</pub-id></mixed-citation>
</ref>
</ref-list>
<fn-group>
<fn fn-type="custom" custom-type="edited-by" id="fn0001">
<p>Edited by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/672796/overview">Chen Wang</ext-link>, Huazhong University of Science and Technology, China</p>
</fn>
<fn fn-type="custom" custom-type="reviewed-by" id="fn0002">
<p>Reviewed by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3172545/overview">N. R. Pradeep</ext-link>, Navkis College of engineering, India</p>
<p><ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3197536/overview">Hajar Maseeh</ext-link>, Akre University for Applied Sciences, Iraq</p>
</fn>
</fn-group>
<fn-group>
<fn fn-type="abbr" id="abbr1"><label>Abbreviations:</label><p>G, gradient magnitude; &#x003B8;, gradient angle; A<sub>1</sub>, A<sub>2</sub>, acceleration coefficients; &#x003C9;, inertia weight; &#x003BD;<sub>1</sub>, &#x003BD;<sub>2</sub>, random numbers uniformly distributed in [0, 1]; s, current time step; &#x003C8;, time steps; &#x0039B;, total number of dolphins; A, penalty parameter; &#x003F5;, loss function; &#x003D1;, kernel parameter.</p></fn></fn-group>
</back>
</article>