<?xml version="1.0" encoding="UTF-8"?>
    <!DOCTYPE article PUBLIC "-//NLM/DTD JATS (Z39.96) Journal Publishing DTD v1.2 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
    <!--<?xml-stylesheet type="text/xsl" href="article.xsl">-->
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:ns0="http://www.w3.org/1999/xlink" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.2" xml:lang="en">
	<front>
		<journal-meta>
			<journal-id journal-id-type="issn">2303-9868</journal-id>
			<journal-id journal-id-type="eissn">2227-6017</journal-id>
			<journal-title-group>
				<journal-title>International Research Journal</journal-title>
			</journal-title-group>
			<issn pub-type="epub">2303-9868</issn>
			<publisher>
				<publisher-name>Cifra LLC</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="doi">10.60797/IRJ.2026.172.87</article-id>
			<article-categories>
				<subj-group>
					<subject>Brief communication</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>Signature forgery detection using deep learning</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="author" corresp="yes">
					<contrib-id contrib-id-type="orcid">https://orcid.org/0009-0008-9568-4527</contrib-id>
					<name>
						<surname>Paramonova</surname>
						<given-names>Anna Dmitrievna</given-names>
					</name>
					<email>paramonovaanna2005@gmail.com</email>
					<xref ref-type="aff" rid="aff-1">1</xref>
				</contrib>
			</contrib-group>
			<aff id="aff-1">
				<institution-wrap>
					<institution-id institution-id-type="ROR">https://ror.org/055f7t516</institution-id>
					<institution content-type="education">National Research University Higher School of Economics</institution>
				</institution-wrap>
			</aff>
			<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-10-16">
				<day>16</day>
				<month>10</month>
				<year>2026</year>
			</pub-date>
			<pub-date pub-type="collection">
				<year>2026</year>
			</pub-date>
			<volume>7</volume>
			<issue>172</issue>
			<fpage>1</fpage>
			<lpage>7</lpage>
			<history>
				<date date-type="received" iso-8601-date="2026-07-13">
					<day>13</day>
					<month>07</month>
					<year>2026</year>
				</date>
				<date date-type="accepted" iso-8601-date="2026-09-29">
					<day>29</day>
					<month>09</month>
					<year>2026</year>
				</date>
			</history>
			<permissions>
				<copyright-statement>Copyright: &amp;#x00A9; 2022 The Author(s)</copyright-statement>
				<copyright-year>2022</copyright-year>
				<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
					<license-p>
						This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC-BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. See 
						<uri xlink:href="http://creativecommons.org/licenses/by/4.0/">http://creativecommons.org/licenses/by/4.0/</uri>
					</license-p>
					.
				</license>
			</permissions>
			<self-uri xlink:href="https://research-journal.org/archive/10-172-2026-october/10.60797/IRJ.2026.172.87"/>
			<abstract>
				<p>Handwritten signature is one of the most frequently used methods to identify a person. The field of offline signature verification (OSV) has been extensively studied in the past, with researchers mainly employing CNN- or Transformer-based novel architectures. There are only a few cases of using transfer learning in OSV and most of them are based on models from 2019 and earlier. Therefore, we propose to use pretrained hybrid models ConvNeXt (2022) and CoAtNet (2021), which combine the strengths of self-attention and convolution for transfer learning. Their architectural details and results of testing against models in image classification present great potential in the offline signature verification field. We employ several training schemes and verification methods to fully assess the capabilities of the proposed models in this forensic field. The experimental results have shown that, although the models do not produce sufficient results on Western language datasets, they compete favorably on UTSig, a Persian dataset, achieving 82.3% accuracy.</p>
			</abstract>
			<kwd-group>
				<kwd>offline signature verification</kwd>
				<kwd> writer-independent verification</kwd>
				<kwd> deep learning</kwd>
				<kwd> transfer learning</kwd>
				<kwd> ConvNeXt</kwd>
				<kwd> CoAtNet</kwd>
			</kwd-group>
		</article-meta>
	</front>
	<body>
		<sec>
			<title>HTML-content</title>
			<p>1. Introduction</p>
			<p>Biometrics use physiological or behavioral attributes to verify an individual’s identity. Unlike passwords or keys, biometric traits are unique and cannot be lost, making them a reliable means of authentication. Among behavioral attributes, handwritten signatures remain one of the most widely used means of authentication in financial institutions, insurance, monetary transactions, etc. Therefore, signature verification, i.e., determining whether a signature is genuine, remains a critical task. However, manual verification is tedious and time-consuming, which has led to the development of automated signature verification systems based on machine learning [1].</p>
			<p>Signature verification systems are generally divided into online and offline approaches. Online systems capture dynamic features such as pen pressure, which makes forgery detection easier but requires special input devices and is therefore less common in practice. This study focuses on offline signature verification (OSV), where signatures are represented as images obtained from scanners, making it more difficult to detect a fake. Among the three main types of offline forgeries — random, simple, and skilled  this research focuses on skilled forgeries as the most challenging ones [2]. A Writer Independent (WI) approach is adopted: the model captures global characteristics of genuine and forged signatures, avoiding retraining when new users are enrolled.</p>
			<p>OSV remains challenging due to high intra-personal and the resulting low inter-personal signature variations. Existing OSV methods commonly rely on convolutional neural networks (CNNs), which effectively extract multi-level local features through convolutional and pooling layers [2][3][4]. With the emergence of Transformers, recent studies have incorporated self-attention mechanisms to capture global image context [5]. Hybrid CNN-Transformer models combine the strengths of both approaches by extracting local signature details while preserving broader spatial dependencies. Several researchers have used such architectures to achieve competitive results compared to SigNet [3], TransOSV [5], ViT [6], and other advanced systems [7]. Simultaneously, transfer learning remains relatively underexplored in OSV, despite its ability to address the problem of limited signature datasets, improve generalization, and accelerate training. Although existing transfer learning approaches have shown promising results [8][9], many of the models used in this setting are comparatively outdated and do not reflect recent progress in hybrid computer vision architectures.</p>
			<p>Thus, the objective of this study is to develop and evaluate a transfer learning-based approach for the WI OSV task using modern hybrid computer vision architectures, aimed at improving the detection of skilled forgeries under limited-data conditions.</p>
			<p>The novel contributions of this work are as follows:</p>
			<p>1. Hybrid ConvNeXt [10] and CoAtNet [11] models are employed for OSV using a transfer learning approach. To the best of our knowledge, these models have not been previously used in the field.</p>
			<p>2. The proposed architectures are evaluated under two training schemes: standalone classification and Siamese networks to assess their applicability to OSV from both direct classification and similarity-learning perspectives. Several verification strategies are compared, including Euclidean distance-based verification and cosine similarity-based verification.</p>
			<p>2. Research methods and principles</p>
			<p>Generally, OSV methods consist of three stages: data pre-processing, feature extraction, and signature verification.</p>
			<p>2.1. Data preprocessing</p>
			<p>Building OSV systems has proven to be a challenge since data acquisition is done under different conditions. To address variability in background artifacts and remove irrelevant patterns, several preprocessing steps are performed. In the initial phase, the Otsu threshold algorithm [12] is used for background elimination. Background pixels are converted to white, while grayscale values are retained for the foreground. The image is centered on an 840 × 1360 canvas by calculating the center of mass after binarization. Signatures are resized to 256 × 256, then randomly cropped to 224 × 224 for training and center-cropped for evaluation. Original and preprocessed images are shown in Figure 1. </p>
			<fig id="F1">
				<label>Figure 1</label>
				<caption>
					<p>Sample signature:a) before preprocessing; b) after preprocessing</p>
				</caption>
				<alt-text>Sample signature:a) before preprocessing; b) after preprocessing</alt-text>
				<graphic ns0:href="/media/images/2026-07-13/eee225d8-223c-4b28-81d1-22304ac039ae.png"/>
			</fig>
			<p>2.2. Feature extraction</p>
			<p>For feature extraction, ConvNeXt and CoAtNet are pretrained on ImageNet-21K [13] – a large public dataset containing 14 million images. </p>
			<p>2.2.1. ConvNeXt</p>
			<p>ConvNeXt is a model made up of CNN modules that incorporates various Transformer-inspired techniques [10].Its publicly available configurations are summarized in Table 1:</p>
			<table-wrap id="T1">
				<label>Table 1</label>
				<caption>
					<p>ConvNeXt configurations</p>
				</caption>
				<table>
					<tr>
						<td>​Size </td>
						<td>​# Params, millions</td>
						<td># Flops, billions</td>
					</tr>
					<tr>
						<td>​Tiny</td>
						<td>​29</td>
						<td>​4.5</td>
					</tr>
					<tr>
						<td>​Small</td>
						<td>​50</td>
						<td>​8.7</td>
					</tr>
					<tr>
						<td>​Base</td>
						<td>​89</td>
						<td>​15.4</td>
					</tr>
					<tr>
						<td>​Large</td>
						<td>​198</td>
						<td>​34.4</td>
					</tr>
				</table>
			</table-wrap>
			<p>The model outperforms preserving the simplicity of CNNs. Since ViT has already shown promising results in OSV, ConvNeXt may also be effective for this task. Its successful adaptation to related visual recognition problems, such as emotion recognition [14], further supports its investigation in offline signature verification.</p>
			<p>2.2.2. CoAtNet</p>
			<p>CoAtNet is based on integrating convolution and self-attention within computational blocks and stacking them into a unified network [11]. The available model configurations are summarized in Table 2:</p>
			<table-wrap id="T2">
				<label>Table 2</label>
				<caption>
					<p>CoAtNet configurations</p>
				</caption>
				<table>
					<tr>
						<td>​Size </td>
						<td>​# Params, millions</td>
						<td># Flops, billions</td>
					</tr>
					<tr>
						<td>Base </td>
						<td>​75</td>
						<td>​15.7</td>
					</tr>
					<tr>
						<td>​Large</td>
						<td>​168</td>
						<td>​34.7</td>
					</tr>
				</table>
			</table-wrap>
			<p>CoAtNet outperforms ViT, Swin, and EfficientNet on ImageNet-1K, ImageNet-21K, and JFT-300M, demonstrating better scaling efficiency than pure CNNs and Transformers. These results motivate its application to OSV.</p>
			<p>During this stage, the query signature is compared with the reference in the embedding space. In forensic tasks, it is reasonable to look at the spatial relationships between the query and the original embeddings when identifying the likeness of the former to the latter. Thus, after training, the classifier head is removed, and each model is used solely for embedding extraction. Two distance metrics are evaluated to measure signature similarity.</p>
			<p>2.3.1. Euclidean distance</p>
			<p>One of the most frequent techniques of verification [7] in OSV tasks is based on Euclidean distance.</p>
			<p>Accepting a pair of embeddings (reference, query), Euclidean distance is calculated between two signatures, following the method described in [7]. If it is greater than a predefined threshold, the query is said to be forged. The threshold is calculated as follows:</p>
			<p>At first, m random genuine signatures from each user are selected. The distances between them and the reference signatures are calculated. The results are aggregated into one array of numbers with maximum and minimum defined as:</p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:msub>
						<mml:mi>d</mml:mi>
						<mml:mrow>
							<mml:mo>max</mml:mo>
						</mml:mrow>
					</mml:msub>
					<mml:mo>=</mml:mo>
					<mml:mo>max</mml:mo>
					<mml:mrow>
						<mml:mo stretchy="true" fence="true" form="prefix">(</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mn>1</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mn>2</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo>,</mml:mo>
						<mml:mi>…</mml:mi>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mi>n</mml:mi>
								<mml:mo>−</mml:mo>
								<mml:mn>1</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo stretchy="true" fence="true" form="postfix">)</mml:mo>
					</mml:mrow>
					<mml:mo>,</mml:mo>
					<mml:mspace width="1em"/>
					<mml:msub>
						<mml:mi>d</mml:mi>
						<mml:mrow>
							<mml:mo>min</mml:mo>
						</mml:mrow>
					</mml:msub>
					<mml:mo>=</mml:mo>
					<mml:mo>min</mml:mo>
					<mml:mrow>
						<mml:mo stretchy="true" fence="true" form="prefix">(</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mn>1</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mn>2</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo>,</mml:mo>
						<mml:mi>…</mml:mi>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mi>n</mml:mi>
								<mml:mo>−</mml:mo>
								<mml:mn>1</mml:mn>
							</mml:mrow>
						</mml:msub>
						<mml:mo stretchy="true" fence="true" form="postfix">)</mml:mo>
					</mml:mrow>
					<mml:mo>,</mml:mo>
				</mml:mrow>
			</mml:math>
			<p>where n is m × (# signatures used per person). A set of candidate thresholds is then generated with a fixed step:</p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mi>D</mml:mi>
					<mml:mo>=</mml:mo>
					<mml:mrow>
						<mml:mo stretchy="true" fence="true" form="prefix">(</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mo>min</mml:mo>
							</mml:mrow>
						</mml:msub>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mo>min</mml:mo>
							</mml:mrow>
						</mml:msub>
						<mml:mo>+</mml:mo>
						<mml:mo>step</mml:mo>
						<mml:mo>,</mml:mo>
						<mml:mi>…</mml:mi>
						<mml:mo>,</mml:mo>
						<mml:msub>
							<mml:mi>d</mml:mi>
							<mml:mrow>
								<mml:mo>max</mml:mo>
							</mml:mrow>
						</mml:msub>
						<mml:mo stretchy="true" fence="true" form="postfix">)</mml:mo>
					</mml:mrow>
				</mml:mrow>
			</mml:math>
			<p>The optimal threshold d from D </p>
			<p>2.3.2. Cosine similarity</p>
			<p>Cosine similarity measures the angle between the embeddings vector. Therefore, it is less sensitive to pen pressure, resolution, and brightness, focusing instead on shape-related differences between embeddings. During experiments, </p>
			<p>m</p>
			<p>3. Experimental setup</p>
			<p>Experiments are conducted over 3 OSV benchmark datasets: GPDS Synthetic [15], CEDAR [16], and UTSig [17]. Datasets cover multiple languages, their statistics and examples are shown in Table 3 and Figure 2:</p>
			<table-wrap id="T3">
				<label>Table 3</label>
				<caption>
					<p>Data statistics</p>
				</caption>
				<table>
					<tr>
						<td>​Dataset</td>
						<td>​Language</td>
						<td>​No. of signers</td>
						<td>​Genuine per person</td>
						<td>​Forged per person</td>
					</tr>
					<tr>
						<td>​GPDS Synthetic</td>
						<td>​Western</td>
						<td>first 1000 used)</td>
						<td>​24</td>
						<td>​30</td>
					</tr>
					<tr>
						<td>​CEDAR</td>
						<td>​Western</td>
						<td>​55</td>
						<td>​24</td>
						<td>​24</td>
					</tr>
					<tr>
						<td>​UTSig</td>
						<td>​Persian</td>
						<td>​115</td>
						<td>​27</td>
						<td>​6</td>
					</tr>
				</table>
			</table-wrap>
			<fig id="F2">
				<label>Figure 2</label>
				<caption>
					<p> Example of signature samples from different datasets:a) UTSig; b) CEDAR; c) GPDS Synthetic</p>
				</caption>
				<alt-text> Example of signature samples from different datasets:a) UTSig; b) CEDAR; c) GPDS Synthetic</alt-text>
				<graphic ns0:href="/media/images/2026-07-13/18fa608f-4f26-458c-a5f9-9e35de9faa94.png"/>
			</fig>
			<p>Models are trained only on GPDS Synthetic, while CEDAR and UTSig are used for external evaluation. Data is split strictly by users to prevent overfitting to user-specific features. GPDS users No.301–1000 are split into 90% training and 10% validation sets, while users No.1–300 form the test set. All CEDAR and UTSig users are used for evaluation.</p>
			<p>Two training approaches are evaluated. First, standalone models are trained with Cross-Entropy Loss to classify individual signatures and assess their ability to extract discriminative and relevant features from individual images.</p>
			<p>Since real-world verification usually involves a reference signature, in the second approach the discussed models are used as Siamese backbones. This improves generalization by focusing on relative feature relationships rather than class labels. Reference and query signatures are processed with shared weights and trained using Triplet Loss. For each user, triplets consist of an anchor, a randomly selected genuine positive, and a forged negative. Each genuine signature is used once as an anchor, producing 15,120 training triplets.</p>
			<p>All models are trained on an NVIDIA Tesla V100 using Adam optimizer and a batch size of 32 over 50 epochs with a constant learning rate of 1e-5.</p>
			<p>The following metrics are considered in evaluating the performance of verification systems.</p>
			<p>1. Accuracy denotes the ratio of correctly identified signatures to all the available test data.</p>
			<p>2. EER displays the error rate at which FAR (False acceptance rate) equals FRR (False rejection rate).</p>
			<p>Both of these metrics are said to be the most informative in the signature verification field [18].</p>
			<p>4. Results and Discussion</p>
			<p>Results are shown only for best-performing model sizes based on accuracy. </p>
			<p>Compared with state-of-the-art models, CoAtNet and ConvNeXt generally achieve lower performance on CEDAR and GPDS Synthetic datasets (Table 4, Table 5 respectively).</p>
			<table-wrap id="T4">
				<label>Table 4</label>
				<caption>
					<p>Results on CEDAR</p>
				</caption>
				<table>
					<tr>
						<td>Method</td>
						<td>Model</td>
						<td>Accuracy, %</td>
						<td>EER, %</td>
					</tr>
					<tr>
						<td>Euclidean distance</td>
						<td>[3]</td>
						<td>100</td>
						<td>0</td>
					</tr>
					<tr>
						<td>[19]</td>
						<td> –</td>
						<td>3.62</td>
					</tr>
					<tr>
						<td>[20]</td>
						<td>100</td>
						<td>0</td>
					</tr>
					<tr>
						<td>[24]</td>
						<td>100</td>
						<td>0</td>
					</tr>
					<tr>
						<td>[7]</td>
						<td>100</td>
						<td>0</td>
					</tr>
					<tr>
						<td>ConvNeXt-L</td>
						<td>82.9</td>
						<td>16.7</td>
					</tr>
					<tr>
						<td>CoAtNet-L</td>
						<td>82.8</td>
						<td>16.8</td>
					</tr>
					<tr>
						<td>Siamese ConvNeXt-B</td>
						<td>83.1</td>
						<td>15.8</td>
					</tr>
					<tr>
						<td>Siamese CoAtNet-B</td>
						<td>83.4</td>
						<td>15.3</td>
					</tr>
					<tr>
						<td>Cosine similarity</td>
						<td>ConvNeXt-L</td>
						<td>83.1</td>
						<td>16.5</td>
					</tr>
					<tr>
						<td>CoAtNet-L</td>
						<td>83.0</td>
						<td>16.6</td>
					</tr>
					<tr>
						<td>Siamese ConvNeXt-B</td>
						<td>86.1</td>
						<td>13.7</td>
					</tr>
					<tr>
						<td>Siamese CoAtNet-B</td>
						<td>85.0</td>
						<td>14.7</td>
					</tr>
				</table>
			</table-wrap>
			<p> </p>
			<table-wrap id="T5">
				<label>Table 5</label>
				<caption>
					<p>Results on GPDS Synthetic </p>
				</caption>
				<table>
					<tr>
						<td>Method</td>
						<td>Model</td>
						<td>Accuracy, %</td>
						<td>EER, %</td>
					</tr>
					<tr>
						<td>Euclidean distance</td>
						<td>[3]</td>
						<td>77.76</td>
						<td>–</td>
					</tr>
					<tr>
						<td>[24]</td>
						<td>–</td>
						<td>7.34</td>
					</tr>
					<tr>
						<td>[21]</td>
						<td>–</td>
						<td>8.24</td>
					</tr>
					<tr>
						<td>[5]</td>
						<td>–</td>
						<td>10.6</td>
					</tr>
					<tr>
						<td>[7]</td>
						<td>95.7</td>
						<td>4.6</td>
					</tr>
					<tr>
						<td>ConvNeXt-B</td>
						<td>69.0</td>
						<td>30.9</td>
					</tr>
					<tr>
						<td>ConvNeXt-L</td>
						<td>75.68</td>
						<td>22.7</td>
					</tr>
					<tr>
						<td>CoAtNet-B</td>
						<td>68.0</td>
						<td>31.5</td>
					</tr>
					<tr>
						<td>CoAtNet-L</td>
						<td>72.0</td>
						<td>32.5</td>
					</tr>
					<tr>
						<td>Siamese ConvNeXt-B</td>
						<td>79.2</td>
						<td>20.6</td>
					</tr>
					<tr>
						<td>Siamese CoAtNet-B</td>
						<td>79.5</td>
						<td>20.2</td>
					</tr>
					<tr>
						<td>Cosine similarity</td>
						<td>ConvNeXt-B</td>
						<td>70.7</td>
						<td>29.0</td>
					</tr>
					<tr>
						<td>ConvNeXt-L</td>
						<td>70.4</td>
						<td>29.1</td>
					</tr>
					<tr>
						<td>CoAtNet-B</td>
						<td>69.4</td>
						<td>29.6</td>
					</tr>
					<tr>
						<td>CoAtNet-L</td>
						<td>71.4</td>
						<td>28.3</td>
					</tr>
					<tr>
						<td>Siamese ConvNeXt-B</td>
						<td>80.0</td>
						<td>19.9</td>
					</tr>
					<tr>
						<td>Siamese CoAtNet-B</td>
						<td>78.9</td>
						<td>20.9</td>
					</tr>
				</table>
			</table-wrap>
			<p>However, the Siamese ConvNeXt-B and CoAtNet-B models reach accuracies of 80.0% and 78.9%, respectively, outperforming SigNet on GPDS Synthetic.Despite its rare use in OSV, cosine similarity yields better results for most models than the more frequently used Euclidean distance on GPDS Synthetic. The reason for this may lie in the specifics of the database. Contrary to the others used in this work, GPDS Synthetic dataset contains images with high variations in pen pressure as demonstrated in Figure 2. Therefore, as cosine similarity is less sensitive to such features, it produces greater performance for the discussed models.</p>
			<p>However, when tested on UTSig dataset (Table 6), models outperform other architectures with Siamese ConvNeXt-B achieving the best accuracy of 82.3% and EER of 16.6. </p>
			<table-wrap id="T6">
				<label>Table 6</label>
				<caption>
					<p>Results on UTSig</p>
				</caption>
				<table>
					<tr>
						<td>Method</td>
						<td>Model</td>
						<td>Accuracy, %</td>
						<td>EER, %</td>
					</tr>
					<tr>
						<td>Euclidean distance</td>
						<td>[3]</td>
						<td>67.0</td>
						<td>32.3</td>
					</tr>
					<tr>
						<td>[22]</td>
						<td>72.7</td>
						<td>29.7</td>
					</tr>
					<tr>
						<td>[22]</td>
						<td>64.2</td>
						<td>34.5</td>
					</tr>
					<tr>
						<td>[7]</td>
						<td>66.19</td>
						<td>8.15</td>
					</tr>
					<tr>
						<td>[23]</td>
						<td>81.9</td>
						<td>– </td>
					</tr>
					<tr>
						<td>ConvNeXt-L</td>
						<td>80.25</td>
						<td>19.5</td>
					</tr>
					<tr>
						<td>CoAtNet-L</td>
						<td>80.36</td>
						<td>19.4</td>
					</tr>
					<tr>
						<td>Cosine similarity</td>
						<td>Siamese ConvNeXt-B</td>
						<td>82.3</td>
						<td>16.6</td>
					</tr>
					<tr>
						<td>Siamese CoAtNet-B</td>
						<td>81.76</td>
						<td>17.7</td>
					</tr>
				</table>
			</table-wrap>
			<p>A possible explanation lies in the specifics of the datasets. As shown in Figure 2, in general UTSig dataset contains signatures with more complex elements than the smooth and sometimes fragmented curves of GPDS Synthetic due to the characteristics of the Persian script. Therefore, due to architectural details (self-attention in CoAtNet and hierarchical feature extraction in ConvNeXt) the proposed models adapt more easily to diverse Persian glyphs, whereas on simpler instances of Western languages they are prone to overfit to irrelevant details. The reason for underperformance on the CEDAR dataset might be the low resolution of images in this dataset, to which the models are not adapted yet, although further experiments are needed to confirm this.</p>
			<p>It is noticeable that Siamese networks perform the best on all of the used datasets. Both ConvNeXt and CoAtNet have been designed for image classification, which does not require attention to such intricate details as signature verification does. Since standalone model training is based on models being capable of extracting only features relevant to the task, the chosen models underperform, overfitting to superficial patterns. However, using Siamese networks and Triplet loss, one can refocus these models for a similarity learning task instead of classification</p>
			<p>5. Conclusion</p>
			<p>This work presents a transfer learning-based approach to Writer Independent offline signature verification using the modern ConvNeXt and CoAtNet architectures. Their performance is observed under standalone classification and Siamese training schemes. Euclidean distance and cosine similarity are used for embedding-based verification.</p>
			<p>The main findings are as follows:</p>
			<p>1. ConvNeXt and CoAtNet models achieve their best results on UTSig with 82.3% and 81.76% accuracy with Siamese training, but mainly underperform the other state-of-the-art models on the remaining datasets with the exception of SigNet.</p>
			<p>2. The applicability of the proposed models depends on signature complexity and image quality: they perform better on structurally complex Persian signatures but may overfit simpler Western-style or low-resolution samples.</p>
			<p>3. The choice of verification metric for such models should reflect the variability of the data. Cosine similarity achieves better results on GPDS Synthetic since it is generally more robust than Euclidean distance to variations in pressure, brightness, resolution, and scanning conditions.</p>
			<p>The scientific significance of this work lies in defining the applicability and limitations of ConvNeXt and CoAtNet in OSV and examining how their performance depends on the training scheme, verification metric, and dataset properties.</p>
			<p>Future research may focus on simplifying these architectures to avoid overfitting on signatures with lesser details. </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
			<p> </p>
		</sec>
		<sec sec-type="supplementary-material">
			<title>Additional File</title>
			<p>The additional file for this article can be found as follows:</p>
			<supplementary-material xmlns:xlink="http://www.w3.org/1999/xlink" id="S1" xlink:href="https://doi.org/10.5334/cpsy.78.s1">
				<!--[<inline-supplementary-material xlink:title="local_file" xlink:href="https://research-journal.org/media/articles/26592.docx">26592.docx</inline-supplementary-material>]-->
				<!--[<inline-supplementary-material xlink:title="local_file" xlink:href="https://research-journal.org/media/articles/26592.pdf">26592.pdf</inline-supplementary-material>]-->
				<label>Online Supplementary Material</label>
				<caption>
					<p>
						Further description of analytic pipeline and patient demographic information. DOI:
						<italic>
							<uri>https://doi.org/10.60797/IRJ.2026.172.87</uri>
						</italic>
					</p>
				</caption>
			</supplementary-material>
		</sec>
	</body>
	<back>
		<ack>
			<title>Acknowledgements</title>
			<p>This research was supported in part through computational resources of HPC facilities at HSE University.</p>
		</ack>
		<sec>
			<title>Competing Interests</title>
			<p/>
		</sec>
		<ref-list>
			<ref id="B1">
				<label>1</label>
				<mixed-citation publication-type="confproc">Bhavani S.D. A multi-dimensional review on handwritten signature verification: strengths and gaps / S.D. Bhavani, R.K. Bharathi — 2023. — 83. — p. 2853–2894.</mixed-citation>
			</ref>
			<ref id="B2">
				<label>2</label>
				<mixed-citation publication-type="confproc">Singla A. Exploring offline signature verification techniques: a survey based on methods and future directions / A. Singla , A. Mittal — 2024. — 84. — p. 2835–2875.</mixed-citation>
			</ref>
			<ref id="B3">
				<label>3</label>
				<mixed-citation publication-type="confproc">Dey S. SigNet: convolutional siamese network for writer independent offline signature verification / S. Dey, A. Dutta, Jl Toledo // arXiv preprint. — 2017. — URL: https://arxiv.org/abs/1707.02131 (accessed: 10.04.25)</mixed-citation>
			</ref>
			<ref id="B4">
				<label>4</label>
				<mixed-citation publication-type="confproc">Zheng Y. Learning the micro deformations by max-pooling for offline signature verification / Y. Zheng, B.K. Iwana, M.I. Malik, A. Sheraz — 2021. — 118.</mixed-citation>
			</ref>
			<ref id="B5">
				<label>5</label>
				<mixed-citation publication-type="confproc">Li H. TransOSV: Offline Signature Verification with Transformers / H. Li, P. Wei, Z. Ma, N. Zheng — 2024. — 145.</mixed-citation>
			</ref>
			<ref id="B6">
				<label>6</label>
				<mixed-citation publication-type="confproc">Dosovitskiy A. An Image Is Worth 16×16 Words: Transformers for Image Recognition at Scale / L. Beyer, A. Kolesnikov, D. Weissenborn et al. // International Conference on Learning Representations (ICLR). — 2021. — 10.</mixed-citation>
			</ref>
			<ref id="B7">
				<label>7</label>
				<mixed-citation publication-type="confproc">Zheng L. HTCSigNet: A Hybrid Transformer and Convolution Signature Network for offline signature verification / L. Zheng, Da Wu, Y. Zheng, S. Xu — 2025. — 159.</mixed-citation>
			</ref>
			<ref id="B8">
				<label>8</label>
				<mixed-citation publication-type="confproc">Rathi Upadhyay R. Handwritten signature verification system using hybrid transfer learning approach / R. Rathi Upadhyay, K. K. Singh — 2024. — 15. — p. 2313–2322.</mixed-citation>
			</ref>
			<ref id="B9">
				<label>9</label>
				<mixed-citation publication-type="confproc">Salama W. M. Signature Verification Based on Deep Learning / W. M. Salama — 2023. — 1. — p. 55–63.</mixed-citation>
			</ref>
			<ref id="B10">
				<label>10</label>
				<mixed-citation publication-type="confproc">Liu Z. A ConvNet for the 2020s / Z. Liu, H. Mao, C.Y. Wu [et al.] // Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). — New Orleans, LA, USA : IEEE Computer Society, 2022. — P. 11966–11976. — DOI: 10.1109/CVPR52688.2022.01167.</mixed-citation>
			</ref>
			<ref id="B11">
				<label>11</label>
				<mixed-citation publication-type="confproc">Dai Z. CoAtNet: Marrying Convolution and Attention for All Data Sizes / Z. Dai, H. Liu, Q.V. Le et al. // Advances in Neural Information Processing Systems. — Red Hook : Curran Associates, Inc., 2021. — P. 3965–3977.</mixed-citation>
			</ref>
			<ref id="B12">
				<label>12</label>
				<mixed-citation publication-type="confproc">Otsu N. A Threshold Selection Method from Gray-Level Histograms / N. Otsu — 1979. — 9. — p. 62–66.</mixed-citation>
			</ref>
			<ref id="B13">
				<label>13</label>
				<mixed-citation publication-type="confproc">Deng J. ImageNet: A largescale hierarchical image database / J. Deng, W. Dong, R. Socher et al. // IEEE Conference on Computer Vision and Pattern Recognition. — Los Alamitos : IEEE Computer Society, 2009.</mixed-citation>
			</ref>
			<ref id="B14">
				<label>14</label>
				<mixed-citation publication-type="confproc">El Boudouri Y. EmoNeXt: an Adapted ConvNeXt for Facial Emotion Recognition / Y. El Boudouri, A. Bohi // IEEE 25th International Workshop on Multimedia Signal Processing (MMSP). — Piscataway : IEEE, 2023.</mixed-citation>
			</ref>
			<ref id="B15">
				<label>15</label>
				<mixed-citation publication-type="confproc">Ferrer M.A. Synthetic off-line signature image generation / M.A. Ferrer, M. Diaz-Cabrera, A. Morales // International Conference on Biometrics (ICB). — Piscataway : IEEE, 2013. — P. 1–7.</mixed-citation>
			</ref>
			<ref id="B16">
				<label>16</label>
				<mixed-citation publication-type="confproc">Srinivasan H. Machine Learning for Signature Verification / H. Srinivasan, S.N. Srihari, M.J. Beal // Computer Vision, Graphics and Image Processing. — Berlin, Heidelberg : Springer, 2006.</mixed-citation>
			</ref>
			<ref id="B17">
				<label>17</label>
				<mixed-citation publication-type="confproc">Soleimani A. UTSig: A Persian Offline Signature Dataset / A. Soleimani, K. Fouladi, B. N. Araabi — 2017. — 6. — p. 1–8.</mixed-citation>
			</ref>
			<ref id="B18">
				<label>18</label>
				<mixed-citation publication-type="confproc">Sharma N. A Comprehensive Study on Offline Signature Verification / N. Sharma, S. Gupta, P. Mehta — 2021. — 1969.</mixed-citation>
			</ref>
			<ref id="B19">
				<label>19</label>
				<mixed-citation publication-type="confproc">Wei P. Inverse discriminative networks for handwritten signature verification / P. Wei, H. Li, P. Hu // 25th International Conference on Pattern Recognition. — Los Alamitos : IEEE Computer Society, 2021. — P. 3853–3859.</mixed-citation>
			</ref>
			<ref id="B20">
				<label>20</label>
				<mixed-citation publication-type="confproc">Ren J.-X. 2C2S: A two-channel and two-stream transformer based framework for offline signature verification / J.-X. Ren, Y.-J. Xiong, H. Zhan, B. Huang — 2023. — 118.</mixed-citation>
			</ref>
			<ref id="B21">
				<label>21</label>
				<mixed-citation publication-type="confproc">Liu L. Offline signature verification using a region based deep metric learning network / L. Liu, L. Huang, Y. Chen — 2021. — 118.</mixed-citation>
			</ref>
			<ref id="B22">
				<label>22</label>
				<mixed-citation publication-type="confproc">Ji X. Paired contrastive feature for highly reliable offline signature verification / X. Ji, D. Suehiro, S. Uchida — 2023. — 144.</mixed-citation>
			</ref>
			<ref id="B23">
				<label>23</label>
				<mixed-citation publication-type="confproc">Xiong Y.-J. Attention-based multiple siamese networks with primary representation guiding for offline signature verification / Y.-J. Xiong, S.-Y. Cheng, J.-X. Ren — 2024. — 27.</mixed-citation>
			</ref>
			<ref id="B24">
				<label>24</label>
				<mixed-citation publication-type="confproc">Wan Q. Learning Metric Features for Writer-Independent Signature Verification using Dual Triplet Loss / Q. Wan, Q. Zou // 25th International Conference on Pattern Recognition. — Los Alamitos : IEEE Computer Society, 2003.</mixed-citation>
			</ref>
		</ref-list>
	</back>
	<fundings/>
</article>