Startseite Mathematik A new method for writer identification based on historical documents
Artikel Open Access

A new method for writer identification based on historical documents

  • Abdeljalil Gattal EMAIL logo , Chawki Djeddi , Faycel Abbas , Imran Siddiqi und Brahim Bouderah
Veröffentlicht/Copyright: 24. Februar 2023
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

Identifying the writer of a handwritten document has remained an interesting pattern classification problem for document examiners, forensic experts, and paleographers. While mature identification systems have been developed for handwriting in contemporary documents, the problem remains challenging from the viewpoint of historical manuscripts. Design and development of expert systems that can identify the writer of a questioned manuscript or retrieve samples belonging to a given writer can greatly help the paleographers in their practices. In this context, the current study exploits the textural information in handwriting to characterize writer from historical documents. More specifically, we employ oBIF(oriented Basic Image Features) and hinge features and introduce a novel moment-based matching method to compare the feature vectors extracted from writing samples. Classification is based on minimization of a similarity criterion using the proposed moment distance. A comprehensive series of experiments using the International Conference on Document Analysis and Recognition 2017 historical writer identification dataset reported promising results and validated the ideas put forward in this study.

1 Introduction

Identifying the writer of a handwritten document is an established task in forensic analysis, document examination, paleography, and information retrieval problems. Along with physical biometric identifiers such as fingerprints, face, and deoxyribonucleic acid, handwriting in human identification is considered a special case of behavioral biometrics [1]. With the recent advancements in pattern classification and machine learning, automatic writer identification systems have matured substantially in recent years [28]. These systems aim to capture the visual differences in the handwriting of different individuals. These differences typically include the variations in allographs, the slope of lines, the slant of characters, line spacing, inter and intra-word spacings, legibility, cursiveness, and so on. These writer-specific attributes are extracted through computational structural or statistical features at paragraph, line, word, or sub-word levels. In recent years, data-driven feature learning using convolutional neural networks has also emerged as a popular choice of researchers in characterizing the writer from handwriting [911].

Among various features capturing the writing style, textural measures have remained an attractive as well as an effective choice for many researchers. Commonly employed textural features include different variants of local binary patterns [12,13], the hinge features [14], curvature-free cloud of line distribution (COLD) features [15,16], histogram of oriented gradients [17], gray-level co-occurrence matrices [18], and the run-length features [16]. Writer identification using a codebook of graphemes [19,20], small writing strokes [21], and small windows around keypoints in handwriting [22] has also been investigated. Learning features from writing samples using ConvNets has also gained popularity in recent years [23,24].

Contrary to the contemporary documents, the complexity of identifying the hand that produced a manuscript becomes much more challenging in the case of historical documents [25]. Historical manuscripts often degrade over time and commonly suffer from noise, holes, ripping, tearing, and stains. In most cases, such documents are photographed using high-resolution cameras and are made available for research and development of computational methods. Identifying the scribe of historical documents can also be exploited to estimate the date and/or geographical information of the origin of the manuscript [26]. Furthermore, information on scribes can also be employed to match different fragments of the same manuscript and combine them together into a complete document [27].

A number of writer identification competitions have been organized in conjunction with the International Conference on Frontiers in Handwriting Recognition [2830] and the International Conference on Document Analysis and Recognition (ICDAR) [3133]. In addition to these competitions targeting writer identification on modern datasets, dedicated competitions on the identification of scribes from historical documents have also been organized in conjunction with ICDAR 2017 [34] and ICDAR 2019 [35]. The winning system [25] of the ICDAR 2017 competition employed oriented Basic Image Features (oBIFs) [36] to characterize the writer. For the 2109 competition, the system based on pathlet and scale-invariant feature transform (SIFT) features outperformed the other submitted systems.

This article targets the problem of writer identification from historical manuscripts extending our previous findings on this problem [13,25]. While most of the studies on such problems focus on the feature extraction part and employ standard matching techniques, we introduce a new moment-based distance to compare two writing samples. A combination of oBIF column histograms [25] and hinge features [14] is employed to map writing samples to feature vectors, which are subsequently compared using the proposed distance measure. An experimental study on the publicly available ICDAR 2017 dataset and a comparison with the existing techniques validate the effectiveness of the proposed method. The key highlights of this study are outlined as follows:

  1. Writer characterizing from challenging historical manuscripts using oBIFs and hinge features.

  2. Introduction of a novel moment-based measure to compute the distance between two feature vectors.

  3. A comprehensive experimental study on publicly available historical documents.

  4. Promising performance in terms of writer identification rates outperforming the existing methods.

It is pertinent to mention that data-driven feature extraction using deep learning methods has emerged as a popular method for this problem in recent years [911]. These methods jointly train the feature extractor and the classifier typically using different variants of ConvNets. We, on the other hand, employ the standard pattern classification pipeline of feature extraction followed by matching the query document with those in the reference base. A major motivation for this choice is the fact that although for experimental datasets, the amount of handwriting available per writer (class) is sufficient to learn writer-specific features using deep learning methods, for most practical applications, the amount of text per writer is fairly limited. In some cases, it could be a single line or a few words only. Standard visual features with conventional processing pipelines are more effective in such situation and also drive the current research.

The content of this article is organized as follows. In Section 2, we discuss the recent advancements in writer identification with a prime focus on historical manuscripts. Section 3 introduces the textural features employed to characterize the writer along with the proposed moment distance. Experimental study, quantitative performance, and a detailed analysis of the reported results are presented in Section 4. Section 5 concludes the article with a discussion on key findings and insights into open research problems on this subject.

2 Related works

The problem of writer identification has been thoroughly investigated by the handwriting recognition community. A major contributing factor to this research’s attention was the public availability of large handwriting datasets like IAM [37], RIMES [38], CVL [39], KHATT [40], and QUWI [41]. Despite these advancements, identifying the scribe from historical manuscripts remains an open problem as discussed in Section 1. In recent years, however, several joint projects [4244] between paleographers and researchers in pattern classification have resulted in increased acceptability of computerized solutions by domain experts [45].

A major challenge in the automatic characterizing of writers is to identify the set of computational features that are able to capture writer-specific information from the samples under study. These can be a set of pre-defined hand-crafted features or can be learned through data using convolutional neural networks. With respect to historical documents, a number of studies investigate the features primarily employed for modern documents on historical manuscripts [46]. Gattal et al. [25], for instance, captured the textural information in handwriting by combining the oBIFs computed at multiple scales from binarized historical documents. Identification is carried out in the nearest-neighbor framework using a number of distance metrics, and an experimental study on the ICDAR 2017 Historical WI dataset reported an accuracy of 77.39%. Likewise, Lai et al. [47] proposed pathlet and SIFT features for writer identification in historical documents. Pathlet and unidirectional SIFT features are extracted to capture rich shape (slant and curvature) and structural information (corners and junctions) in the handwriting. The extracted features are then encoded using a newly proposed bagged-vector of locally aggregated descriptors (VLAD) scheme. The methods reported state-of-the-art performance on ICDAR 2017 Historical-WI dataset and achieved the top performance in the ICDAR 2019 historical document reading challenges-image retrieval (HDRC-IR) competition.

Among other methods, Chammas et al. [48] used a deep convolutional neural network using small patches of handwriting extracted through SIFT keypoints. Features learned by the convolutional neural network (CNN) are encoded through multi-VLAD and are normalized using the L2 norm. Classification with an exemplar support vector machine reported an accuracy of 97% on the ICDAR2019 HDRC-IR dataset. In another study, Christlein et al. [49] used a deep residual CNN to learn effective feature representations using surrogate classes. These classes are obtained by applying clustering on the samples in the training set. Features learned by the CNN are subsequently employed for classification. In an extension of this study, Jordan et al. [50] employed the same features and introduced a re-ranking method to improve the retrieval performance. The re-ranking relies on k-reciprocal nearest neighbor relationships and was shown to significantly improve the performance on the ICDAR 2107 dataset.

In other notable works on historical documents, transfer learning on pretrained CNNs is employed in ref. [51] to identify writer from the images of the twelfth century Bible. An extension of this study was the evaluation of pretrained CNNs on medieval documents [52]. Similarly, a number of pretrained CNNs are evaluated for multiple tasks, including dating and identification of writing styles from historical manuscripts. In another series of related studies, a detailed analysis of writer identification in historical documents was carried out in ref. [53], and the study was extended to handwriting on papyrus in ref. [54]. To handle the problem of data scarcity, Nasir et al. [55] proposed a two-step fine-tuning by first tuning the weights of pretrained CNN on modern handwriting images in the IAM dataset and subsequently tuning it on the limited samples of handwriting on papyrus. While the work in ref. [55] extracts features from rectangular windows of handwriting obtained with dense sampling, patches around keypoints in handwriting are considered in ref. [56], resulting in enhanced performance. An overall writer identification rate of 64% is reported in ref. [56], as opposed to 54% in [55] on a challenging set of 50 writing samples from ten different scribes.

A summary of notable studies on writer identification from historical manuscripts, primarily targeting the ICDAR datasets, is presented in Table 1. It can be observed that among hand-crafted features, textural features represent an attractive choice to capture the information on writing style and, hence, identify the writers [25,34]. Among machine-learned features, a common recent trend is to identify keypoints in handwriting (e.g., using SIFT), extract small patches using these keypoints, and employ these patches for feature learning through a CNN. It is also common to encode the extracted features where different variants of VLAD encoding have been investigated [4749]. In our study, since the primary focus is on proposing an effective distance measure, we employ textural measures to extract features and employ a number of distance metrics to validate the superiority of the proposed metric. These details are presented in the next section.

Table 1

An overview of notable writer identification studies evaluated on the ICDAR historical documents datasets

Study Features Dataset Top-1 mAP
Winning system of ICDAR 2017 competition [34] oBIFs columns ICDAR 2017 76.40 55.60
Christlein et al. (2017) [49] VLAD-encoded CNN features ICDAR 2017 88.9 76.2
CLaMM16 84.1
Gattal et al. (2018) [25] oBIFs columns ICDAR 2017 77.39 56.82
Jordan et al. (2020) [50] VLAD-encoded CNN features with re-ranking ICDAR 2017 89.43 78.20
CzByChron 98.04 80.10
MusicDocs 98.62 78.64
Chammas et al. (2020) [48] CNN features with multi-VLAD encoding ICDAR 2019 97.0 91.2
Lai et al. (2020) [47] SIFT and pathlet features with bagged-VLAD ICDAR 2017 90.1 77.2
ICDAR 2019 97.4 92.5

3 Methods

This section introduces the proposed writer identification technique that relies upon extracting a set of features from the writing samples in the reference base and comparing those with the questioned document. An overview of the system is presented in Figure 1 while the feature extraction and the proposed moment-based matching method are discussed further.

Figure 1 
               An overview of the proposed writer identification system.
Figure 1

An overview of the proposed writer identification system.

3.1 Feature extraction

Feature extraction is an important step in any image classification task. It allows for the mapping of given images to points in the feature space, so that images of the same class (writer in our case) cluster together in the feature space. In our study, we have chosen to capture the curvature, contour, and texture information in the handwriting to characterize the writer. The corresponding computational features include oBIFs column histograms, and hinge features, detailed in the following.

3.1.1 oBIFs column histograms

In one of our recent studies [25], we investigated the effectiveness of oBIFs in identifying writers from historical documents and obtained promising results. We, therefore, employ oBIFs as one of the features to evaluate the performance of the newly proposed matching scheme. oBIFs are an extension of the Basic Image Features (BIFs) introduced in ref. [57]. oBIFs include the application of a bank of derivative-of-Gaussian filters at multiples scales (controlled by scale parameter σ ). Each location in the image is attributed to one of the seven predefined symmetry classes. These classes include dark line on light, light line on dark, dark rotational, light rotational, slop, saddle-like, or flat. BIFs were later extended to include local orientation information where meaningful. The representation can be further enriched by combining the oBIFs at two different scales producing the oBIFs column features. In our study, we investigate two combinations of scale parameters σ = { 2 , 4 } and σ = { 2 , 8 } , yielding a feature vector of dimension 484. Furthermore, the parameter ε , which determines if a location is to be labeled as flat, is set to a small value of ε = 0.01 . Computational details of oBIFs columns can be found in our previous work [25].

3.1.2 Hinge features

Among the various contour-based features reported in the literature, hinge [20] and delta-n hinge [14] features, designed to capture the ink-trace curvature, are known to be highly discriminative for different writers. The hinge feature [20] computes the joint probability distribution of orientations of the two arms of a hinge, considering each pixel on the writing contour as the reference point. Parameters involved in the calculation of hinge feature include the length of the arm r and the number of (angle) bins in the histogram p . The hinge feature was later extended to the delta-n hinge feature [14] to achieve rotation invariance. It simultaneously considers successive pixels for a fixed Manhattan distance and computes the probability of angle derivative in both directions. This introduces two additional parameters, the Manhattan distance Δ l , and the number of derivative n . In our study, we set p = 40 as suggested in ref. [58], n = 2 , and the Manhattan distance Δ l = 7 . The generated feature vector is standardized to have zero mean and unit variance and is subsequently mapped to the interval [ 0 , 1 ] using the following function:

(1) V ( x ) = 1 1 + e π 2 ( x ) ,

where V ( x ) represents the normalized version of the feature vector x .

Decision on the identity of the writer of a query document is made separately using oBIFs column histogram and hinge features and the individual decisions are subsequently combined to arrive at the final output. Details of classification using the newly proposed moment matching are presented in the following sections.

3.2 Moment-based distance

Distance metric plays an important role in comparing the feature vectors and eventually performing classification. A number of distance measures have been proposed in the literature to compute the dis-similarity between feature vectors [59]. Commonly employed metrics include Euclidean distance, city block distance, correlation, cosine distance, and spearman distance. In the current study, in addition to the investigation of standard metrics, we also propose a novel matching method and the moment distance, which is elaborated further below.

Moments have been widely employed in image analysis, pattern classification, object recognition, and image coding [60]. If a feature vector is considered as a discrete function f ( x ) with x = 0 , 1 , , N , then the moment of order k is defined as follows:

(2) μ k = E [ x k ] = x k f ( x ) d x .

The first moment is the expected value of a random variable, and the second central moment is its variance. Likewise, the third moment is the skewness, and the fourth moment is the kurtosis. The moments about mean are the mean of deviations from the mean after raising them to integer powers. The k th population moment about mean μ k is given as follows:

(3) μ k = i = 1 N ( y i y ¯ ) k N .

If k = 1 , the first moment is zero:

(4) μ 1 = i = 1 N ( y i y ¯ ) 1 N = 0 .

If k = 2 , the second moment is variance:

(5) μ 2 = i = 1 N ( y i y ¯ ) 2 N .

In a similar fashion, k = 3 and k = 4 define the skewness and kurtosis of a distribution, respectively.

(6) μ 3 = i = 1 N ( y i y ¯ ) 3 N ,

(7) μ 4 = i = 1 N ( y i y ¯ ) 4 N .

For matching, we extract the feature vector f Q from the questioned document and compare it with all the vectors f R i in the references base R . Matching is carried out using the proposed moment-based matching method. The k th moment about arbitrary origin “a” denoted by m k is

(8) m k = i = 1 N ( y i a y ¯ ) k N ,

where y i = f Q f R i and y ¯ is the mean; hence,

(9) a = y i .

Using equations (8) and (9), the k th moment can be defined as:

(10) m k = i = 1 N ( y i y ¯ y i ) k N .

In our study, we have (empirically) chosen the values of k = 2 , 4 , 6 resulting in m 2 , m 4 , and m 6 and the final distance between two vectors is computed as follows:

(11) D = m 2 + m 4 + m 6 .

The distance between the query feature vector and all those in the reference base is computed using equation (11), and the writer of the query document is identified as the writer of the document in the reference collection, which reports the minimum distance (nearest neighbor framework). Moment distances are computed separately for the two sets of features (oBIF column histograms and hinge features) and the final decision is made by combining the individual decisions. Decisions can be combined using the product (Prod), sum (Sum), average (Avr), or minimum (Min) rules, and based on the findings of our previous study [25], in the present work, we combine the individual decisions using the Min rule.

4 Experiments and results

The experimental study of our system is carried out on the ICDAR 2017 Historical Writer Identification dataset [34]. The test set of this competition contains a total of 3,600 historical manuscripts with 720 unique writers, i.e., each writer contributed five pages. For consistency, we employ the same experimental protocol as that of the competition and quantify the performance using Top-1, Top-5, and Top-10 identification rates along with the mean average precision (mAP). Top-k refers to retrieving the best k solutions (writers in our case) against a query document and verifying if there is at least one correct answer in the retrieved hit-list [34].

In the first experiment, we aim to evaluate the performance of well-known handcrafted features on the challenging set of historical manuscripts. Using the competition experimental protocol, we implemented a number of well-known features applied to the writer identification problem on modern manuscripts to select the best subset of features. The investigated features include the oBIFs column histogram, Delta Hinge features, local binary patterns (LBP), LBP column histogram, complete local binary patterns (CLBP), local binary pattern variance (LBPV), run length features, edge direction and edge hinge features, and COLD features. The results of these experiments are summarized in Table 2.

Table 2

Performance of well-known hand-crafted features using correlation distance

Features Parameters Dim. Average identification rates (%)
Top 1 Top 5 Top 10 Map
f 1 :oBIF column histogram [25] oBIF at σ = { 2 , 4 } , ε = 0.1 484 74.56 83.33 86.36 53.26
f 2 :oBIF column histogram [25] oBIF at σ = { 2 , 8 } , ε = 0.1 484 72.69 80.92 84.14 52.34
f 3 :oBIF column histogram [25] oBIF at σ = { 2 , 4 } , ε = 0.1 968 76.17 84.25 86.94 55.27
oBIF at σ = { 2 , 8 } , ε = 0.1
f 4 :Delta-hinge feature [14] r = 5 , p = 40 5184 71.14 79.69 83.33 50.50
LBP [13] P = 12 , R = 4 529 49.31 55.72 58.14 29.40
LBP column histogram [13] LBP at P = 16 , R = 2 14,337 37.81 43.22 45.83 21.67
LBP at P = 8 , R = 2
CLBP [12] P = 12 , R = 4 270 54.00 60.61 63.42 33.43
LBPV [12] P = 12 , R = 4 529 56.06 63.75 65.89 34.00
Run-length distribution on white pixels [61] 200 39.92 47.56 51.17 25.18
Run-length distribution on black pixels [61] 400 27.14 32.67 35.03 15.96
Run-length distribution on white and black pixels [61] 600 42.11 49.36 52.39 26.08
Edge-direction distribution with 16 angles [61] 16 29.03 35.53 39.08 17.72
Edge-hinge with fragment of length of 7 pixels [61] 2,304 61.11 68.64 72.03 40.40
COLD features [15] k = { 3 , 4 , 5 , 6 , 7 } 84 5 63.44 72.36 75.42 41.67

It can be observed in Table 2 that among the investigated features, the oBIF column histograms at σ = { 2 , 4 } and σ = { 2 , 8 } while ε = 0.1 outperform other features on the ICDAR 2017 dataset. Likewise, among other features, delta hinge features (with parameters r = 10 and p = 40 ) report a Top-1 identification rate of 71%. The performance of other textural measures like LBP, CLBP, and run-length feature is relatively lower reporting mAP values < 0.5 . Although these features are known to perform well on modern handwriting, lower performance on historical manuscripts reveals that for such challenging scenarios, more robust representations must be employed.

Once the top-performing features are identified, we evaluate the performance of these features using different distance metrics, including the proposed moment-based distance. The corresponding results are summarized in Table 3. It can be seen that by using the proposed moment-based distance, Top-1 identification rates of as high as 77.36% and 75% are reported with the oBIF column histogram ( f 3 ) and delta hinge feature ( f 4 ), respectively. A similar trend can be observed for all the employed metrics, i.e., Top-5 and Top-10 identification rates and mAP. Another interesting observation is that across all the four investigated features, the moment distance, in general, outperforms other metrics validating that the matching is generalized and is not tuned to a specific set of features.

Table 3

Performance of oBIF column histograms and delta-hinge features with different distance metrics

Features Distance metrics Average identification rates (%)
Top1 Top5 Top10 mAP
f 1 :oBIF column histogram [25] NMD New moment distance 74.61 82.83 86.08 53.44
Eu Euclidean distance 73.53 81.81 85.14 52.33
CB City-Block distance 74.33 82.33 85.00 52.46
Corr Correlation distance 74.56 83.33 86.36 53.26
Cos Cosine distance 74.17 82.78 85.42 53.18
Sp Spearman distance 73.89 82.72 86.19 52.87
f 2 :oBIF column histogram [25] NMD New moment distance 74.17 83.56 86.58 53.20
Eu Euclidean distance 72.83 81.42 84.36 51.30
CB City-Block distance 72.64 82.03 84.72 51.08
Corr Correlation distance 72.69 80.92 84.14 52.34
Cos Cosine distance 73.22 82.67 86.03 52.67
Sp Spearman distance 72.19 80.25 83.17 51.68
f 3 :oBIF column histogram [25] NMD New moment distance 77.36 86.42 89.39 55.88
Eu Euclidean distance 76.03 84.17 87.11 54.39
CB City-Block distance 75.72 84.53 86.97 54.32
Corr Correlation distance 76.17 84.25 86.94 55.27
Cos Cosine distance 75.97 84.39 87.28 55.14
Sp Spearman distance 75.42 83.33 86.08 54.72
f 4 :Delta-hinge feature [14] NMD New moment distance 75.00 84.00 86.47 54.06
Eu Euclidean distance 72.11 80.72 83.69 50.51
CB City-Block distance 72.94 82.19 85.11 51.30
Corr Correlation distance 71.14 79.69 83.33 50.50
Cos Cosine distance 72.25 80.33 83.47 51.08
Sp Spearman distance 69.94 78.19 81.22 50.49

Bold text indicates a significant performance compared to other performances.

In addition to studying the performance of the features with respect to different distance metrics, we also investigated the combination of decisions of individual features to study how the proposed metric behaves when decisions are combined. Decisions are combined using a minimum of the sum distances from features (Sum-Min), minimum of the product (Prod-Min), minimum of the average (Avg-Min), and minimum of the minimum (Min-Min) distances. Performance with the combination of decisions is summarized in Table 4, where it can be observed that, in general, classification performance of the combination scheme based on the minimum of the product (Prod-Min) is relatively better than other combination methods. A Top-1 identification rate of 78.75% and mAp of 58.62% is reported. Among the investigated combinations, combination of the oBIF column histogram ( f 3 ) and delta hinge features ( f 4 ) reports the highest identification rates. It should, however, be noted that the objective is not only to find the best combination but also to study the evolution of performance with the newly proposed metric. In general, a consistency in performance is observed in different combinations, where no single combination significantly surpasses others validating the generalization of the moment distance.

Table 4

Writer identification performance by combining the decisions from different features (moment-based distance)

Combination decision Average identification rates (%)
Top1 Top5 Top10 mAP
Sum-Min(f1,f2) 77.25 86.08 88.39 56.07
Sum-Min(f3,f4) 78.72 88.33 91.00 58.45
Sum-Min(f1,f2, f4) 78.69 87.06 89.89 58.37
Sum-Min(f1, f2, f3,f4) 78.42 86.75 89.67 57.99
Prod-Min(f1,f2) 77.22 86.58 89.28 56.11
Prod-Min(f3,f4) 78.75 88.31 91.08 58.62
Prod-Min(f1,f2, f4) 78.64 86.86 89.92 58.48
Prod-Min(f1, f2, f3,f4) 78.53 86.97 90.08 58.03

Bold text indicates a significant performance compared to other performances.

In the end, we also provide a performance comparison with methods (hand-crafted features) evaluated on the same dataset and using the same experimental protocol as that of our study. Although higher identification rates are reported in studies employing machine-learned features (using ConvNets), it is important to recall that the objective of this study is not to introduce novel features but to enhance the matching step. Consequently, to show the effectiveness of the proposed moment-based distance, we investigated two well-known hand-crafted features and studied the performance evolution as a function of the distance metric. Consequently, the comparison is also made with techniques employing hand-crafted features. Table 5 shows that using the proposed moment-based matching, we achieve better performance as compared to those reported in ref. [25] as well as the winning system of the ICDAR 2017 competition [34]. Given the complexity of the problem, the reported identification rates are indeed very promising validating the effectiveness of the employed features and the proposed moment-matching method.

Table 5

Performance comparison with methods using hand-crafted features and evaluated on ICDAR 2017 dataset

SNo. Method Top-1 mAP
1 Proposed method 78.75 58.62
2 Gattal et al. (2018) [25] 77.39 56.82
3 Winning method in ICDAR 2017 competition [34] 76.40 55.60

Bold text indicates a significant performance compared to other performances.

5 Conclusion

We presented an effective technique for characterizing writer from historical manuscripts. The technique relies on extracting oBIF column histograms and delta-hinge features from writing samples, and these features are matched using the newly proposed moment-based distance. A number of existing hand-crafted features are evaluated on the ICDAR 2017 Historical Document Writer Identification (Historical-WI) dataset, and the best-performing features are selected. A comprehensive study with different distance metrics and different decision combination schemes is also carried out. The reported results validated the effectiveness of the moment-based matching method in identifying writers from historical manuscripts. In our further study on this subject, we plan to investigate other categories of features and employ a formal feature selection strategy to identify the most discriminate subset of features for this problem. Furthermore, we also plan to extend this study to an unsupervised framework where manuscripts do not have writer labels and need to be grouped into clusters as a function of similarity in the writing style.

  1. Funding information: The authors state no funding involved.

  2. Conflict of interest: The authors declare no conflict of interest.

References

[1] Bensefia A, Tamimi H. Validity of handwriting in biometric systems. PRAI 2018. New York, NY, USA: Association for Computing Machinery; 2018. p. 5–10. 10.1145/3243250.3243261. Suche in Google Scholar

[2] Srihari SN, Cha SH, Arora H, Lee S. Individuality of handwriting. J Forensic Sci. 2002;47(4):856–72. 10.1037/e515312006-001Suche in Google Scholar

[3] Saunders CP, Davis LJ, Buscaglia J. Using automated comparisons to quantify handwriting individuality. J Forensic Sci. 2011;56(3):683–9. 10.1111/j.1556-4029.2011.01713.xSuche in Google Scholar PubMed

[4] Kumar P, Sharma A. DCWI: distribution descriptive curve and cellular automata based writer identification. Expert Syst Appl. 2019;128:187–200. 10.1016/j.eswa.2019.03.037Suche in Google Scholar

[5] Chahi A, Ruichek Y, Touahni R. An effective and conceptually simple feature representation for off-line text-independent writer identification. Expert Syst Appl. 2019;123:357–76. 10.1016/j.eswa.2019.01.045Suche in Google Scholar

[6] Tan GJ, Sulong G, Rahim MSM. Writer identification: a comparative study across three world major languages. Forensic Sci Int. 2017;279:41–52. 10.1016/j.forsciint.2017.07.034Suche in Google Scholar PubMed

[7] Rehman A, Naz S, Razzak MI. Writer identification using machine learning approaches: a comprehensive review. Multimedia Tools Appl. 2019;78(8):10889–931. 10.1007/s11042-018-6577-1Suche in Google Scholar

[8] Rasoulzadeh S, Baba Ali B. Writer identification and writer retrieval based on NetVLAD with re-ranking. IET Biometrics. 2022;11(1):10–22. 10.1049/bme2.12039Suche in Google Scholar

[9] Chammas M, Makhoul A, Demerjian J, Dannaoui E. A deep learning based system for writer identification in handwritten Arabic historical manuscripts. Multimedia Tools Appl. 2022;81:30769–84. 10.1007/s11042-022-12673-xSuche in Google Scholar

[10] He S, Schomaker L. GR-RNN: Global-context residual recurrent neural networks for writer identification. Pattern Recognition 2021;117:107975. 10.1016/j.patcog.2021.107975Suche in Google Scholar

[11] Semma A, Hannad Y, Siddiqi I, Djeddi C, El Kettani MEY. Writer identification using deep learning with FAST keypoints and Harris corner detector. Expert Syst Appl. 2021;184:115473. 10.1016/j.eswa.2021.115473Suche in Google Scholar

[12] Abbas F, Gattal A, Djeddi C, Bensefia A, Jamil A, Saoudi K. Offline writer identification based on CLBP and VLBP. In: Mediterranean Conference on Pattern Recognition and Artificial Intelligence. Switzerland: Springer; 2020. p. 188–99. 10.1007/978-3-030-71804-6_14Suche in Google Scholar

[13] Abbas F, Gattal A, Djeddi C, Siddiqi I, Bensefia A, Saoudi K. Texture feature column scheme for single-and multi-script writer identification. IET Biometrics. 2021;10(2):179–93. 10.1049/bme2.12010Suche in Google Scholar

[14] He S, Schomaker L. Delta-n hinge: rotation-invariant features for writer identification. In: 2014 22nd International Conference on Pattern Recognition. USA: IEEE; 2014. p. 2023–8. 10.1109/ICPR.2014.353Suche in Google Scholar

[15] He S, Schomaker L. Writer identification using curvature-free features. Pattern Recognition. 2017;63:451–64. 10.1016/j.patcog.2016.09.044Suche in Google Scholar

[16] Gattal A, Djeddi C, Bensefia A, Ennaji A. Handwriting based gender classification using COLD and hinge features. In: International Conference on Image and Signal Processing. Switzerland: Springer; 2020. p. 233–42. 10.1007/978-3-030-51935-3_25Suche in Google Scholar

[17] Hannad Y, Siddiqi I, Djeddi C, El-Kettani MEY. Improving Arabic writer identification using score-level fusion of textural descriptors. IET Biometrics. 2019;8(3):221–9. 10.1049/iet-bmt.2018.5009Suche in Google Scholar

[18] Chawki D, Labiba SM. A texture based approach for Arabic writer identification and verification. In: 2010 International Conference on Machine and Web Intelligence. USA: IEEE; 2010. p. 115–20. 10.1109/ICMWI.2010.5648130Suche in Google Scholar

[19] Bensefia A, Paquet T, Heutte L. A writer identification and verification system. Pattern Recognition Lett. 2005;26(13):2080–92. 10.1016/j.patrec.2005.03.024Suche in Google Scholar

[20] Bulacu M, Schomaker L. Text-independent writer identification and verification using textural and allographic features. IEEE Trans Pattern Anal Machine Intell. 2007;29(4):701–17. 10.1109/TPAMI.2007.1009Suche in Google Scholar PubMed

[21] Siddiqi I, Vincent N. Text independent writer recognition using redundant writing patterns with contour-based orientation and curvature features. Pattern Recognition. 2010;43(11):3853–65. 10.1016/j.patcog.2010.05.019Suche in Google Scholar

[22] Bennour A, Djeddi C, Gattal A, Siddiqi I, Mekhaznia T. Handwriting based writer recognition using implicit shape codebook. Forensic Sci Int. 2019;301:91–100. 10.1016/j.forsciint.2019.05.014Suche in Google Scholar PubMed

[23] Nguyen HT, Nguyen CT, Ino T, Indurkhya B, Nakagawa M. Text-independent writer identification using convolutional neural network. Pattern Recognition Lett. 2019;121:104–12. 10.1016/j.patrec.2018.07.022Suche in Google Scholar

[24] He S, Schomaker L. FragNet: Writer identification using deep fragment networks. IEEE Trans Inform Forensics Security. 2020;15:3013–22. 10.1109/TIFS.2020.2981236Suche in Google Scholar

[25] Gattal A, Djeddi C, Siddiqi I, Al-Maadeed S. Writer identification on historical documents using oriented basic image features. In: 2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR). USA: IEEE; 2018. p. 369–73. 10.1109/ICFHR-2018.2018.00071Suche in Google Scholar

[26] He S, Samara P, Burgers J, Schomaker L. Image-based historical manuscript dating using contour and stroke fragments. Pattern Recognition. 2016;58:159–71. 10.1016/j.patcog.2016.03.032Suche in Google Scholar

[27] Pirrone A, Aimar MB, Journet N. Papy-S-Net: a Siamese network to match papyrus fragments. In: Proceedings of the 5th International Workshop on Historical Document Imaging and Processing; 2019. p. 78–83. 10.1145/3352631.3352646Suche in Google Scholar

[28] Slimane F, Awaida S, Mezghani A, Parvez MT, Kanoun S, Mahmoud SA, et al. ICFHR2014 competition on Arabic writer identification using AHTID/MW and KHATT databases. In: 2014 14th International Conference on Frontiers in Handwriting Recognition. IEEE; 2014. p. 797–802. 10.1109/ICFHR.2014.139Suche in Google Scholar

[29] Djeddi C, Al-Maadeed S, Gattal A, Siddiqi I, Ennaji A, El Abed H. ICFHR2016 Competition on multi-script writer demographics classification using QUWI database. In: 2016 15th International Conference on Frontiers in Handwriting Recognition (ICFHR). IEEE; 2016. p. 602–6. 10.1109/ICFHR.2016.0115Suche in Google Scholar

[30] Djeddi C, Al-Maadeed S, Siddiqi I, Abdeljalil G, He S, Akbari Y. ICFHR 2018 competition on multi-script writer identification. In: 2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR). IEEE; 2018. p. 506–10. 10.1109/ICFHR-2018.2018.00094Suche in Google Scholar

[31] Louloudis G, Gatos B, Stamatopoulos N, Papandreou A. Icdar 2013 competition on writer identification. In: 2013 12th International Conference on Document Analysis and Recognition. USA: IEEE; 2013. p. 1397–401. 10.1109/ICDAR.2013.282Suche in Google Scholar

[32] Djeddi C, Al-Maadeed S, Gattal A, Siddiqi I, Souici-Meslati L, ElAbed H. ICDAR 2015 competition on multi-script writer identification and gender classification using QUWI database. In: 2015 13th International Conference on Document Analysis and Recognition (ICDAR). USA: IEEE; 2015. p. 1191–5. 10.1109/ICDAR.2015.7333949Suche in Google Scholar

[33] Malik MI, Ahmed S, Marcelli A, Pal U, Blumenstein M, Alewijns L, et al. ICDAR 2015 competition on signature verification and writer identification for on-and off-line skilled forgeries (SigWIcomp2015). In: 2015 13th International Conference on Document Analysis and Recognition (ICDAR). USA: IEEE; 2015. p. 1186–90. 10.1109/ICDAR.2015.7333948Suche in Google Scholar

[34] Fiel S, Kleber F, Diem M, Christlein V, Louloudis G, Nikos S, et al. ICDAR2017 Competition on Historical Document Writer Identification (Historical-WI). In: 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR). vol. 1. USA: IEEE; 2017. p. 1377–82. 10.1109/ICDAR.2017.225Suche in Google Scholar

[35] Christlein V, Nicolaou A, Seuret M, Stutzmann D, Maier A. ICDAR 2019 Competition on Image Retrieval for Historical Handwritten Documents. In: 2019 International Conference on Document Analysis and Recognition (ICDAR). USA: IEEE; 2019. p. 1505–9. 10.1109/ICDAR.2019.00242Suche in Google Scholar

[36] Gattal A, Djeddi C, Siddiqi I, Chibani Y. Gender classification from offline multi-script handwriting images using oriented Basic Image Features (oBIFs). Expert Syst Appl. 2018;99:155–67. 10.1016/j.eswa.2018.01.038Suche in Google Scholar

[37] Marti UV, Bunke H. The IAM-database: an English sentence database for offline handwriting recognition. Int J Document Anal Recognition. 2002;5(1):39–46. 10.1007/s100320200071Suche in Google Scholar

[38] Grosicki E, Carré M, Brodin JM, Geoffrois E. Results of the RIMES evaluation campaign for handwritten mail processing. In: 2009 10th International Conference on Document Analysis and Recognition. USA: IEEE; 2019. p. 941–5. 10.1109/ICDAR.2009.224Suche in Google Scholar

[39] Kleber F, Fiel S, Diem M, Sablatnig R. Cvl-database: An off-line database for writer retrieval, writer identification and word spotting. In: 2013 12th International Conference on Document Analysis and Recognition. USA: IEEE; 2013. p. 560–4. 10.1109/ICDAR.2013.117Suche in Google Scholar

[40] Mahmoud SA, Ahmad I, Al-Khatib WG, Alshayeb M, Parvez MT, Märgner V, et al. KHATT: An open Arabic offline handwritten text database. Pattern Recognition. 2014;47(3):1096–112. 10.1016/j.patcog.2013.08.009Suche in Google Scholar

[41] AlMaadeed S, Ayouby W, Hassaine A, Aljaam JM. QUWI: an Arabic and English handwriting dataset for offline writer identification. In: 2012 International Conference on Frontiers in Handwriting Recognition. USA: IEEE; 2012. p. 746–51. 10.1109/ICFHR.2012.256Suche in Google Scholar

[42] Sankar KP, Ambati V, Pratha L, Jawahar C. Digitizing a million books: Challenges for document analysis. In: International Workshop on Document Analysis Systems. Berlin, Heidelberg, Germany: Springer; 2006. p. 425–36. 10.1007/11669487_38Suche in Google Scholar

[43] Klemme A. International Dunhuang Project: The Silk Road Online. Reference Reviews. 2014. Suche in Google Scholar

[44] Jouili S, Coustaty M, Tabbone S, Ogier JM. NAVIDOMASS: structural-based approaches towards handling historical documents. In: 2010 20th International Conference on Pattern Recognition. USA: IEEE; 2010. p. 946–9. 10.1109/ICPR.2010.237Suche in Google Scholar

[45] Hamid A, Bibi M, Siddiqi I, Moetesum M. Historical manuscript dating using textural measures. In: 2018 International Conference on Frontiers of Information Technology (FIT). USA: IEEE; 2018. p. 235–40. 10.1109/FIT.2018.00048Suche in Google Scholar

[46] Schomaker L, Franke K, Bulacu M. Using codebooks of fragmented connected-component contours in forensic and historic writer identification. Pattern Recognition Lett. 2007;28(6):719–27. 10.1016/j.patrec.2006.08.005Suche in Google Scholar

[47] Lai S, Zhu Y, Jin L. Encoding pathlet and SIFT features with bagged VLAD for historical writer identification. IEEE Trans Inform Forensics Security. 2020;15:3553–66. 10.1109/TIFS.2020.2991880Suche in Google Scholar

[48] Chammas M, Makhoul A, Demerjian J. Writer identification for historical handwritten documents using a single feature extraction method. In: 19th International Conference on Machine Learning and Applications (ICMLA 2020). USA: IEEE; 2020. 10.1109/ICMLA51294.2020.00010Suche in Google Scholar

[49] Christlein V, Gropp M, Fiel S, Maier A. Unsupervised feature learning for writer identification and writer retrieval. In: 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR). vol. 1. USA: IEEE; 2017. p. 991–7. 10.1109/ICDAR.2017.165Suche in Google Scholar

[50] Jordan S, Seuret M, Král P, Lenc L, Martínek J, Wiermann B, et al. Re-ranking for writer identification and writer retrieval. In: International Workshop on Document Analysis Systems. Switzerland: Springer; 2020. p. 572–86. 10.1007/978-3-030-57058-3_40Suche in Google Scholar

[51] Cilia ND, De Stefano C, Fontanella F, Marrocco C, Molinara M, DiFreca AS. A two-step system based on deep transfer learning for writer identification in medieval books. In: International Conference on Computer Analysis of Images and Patterns. Springer; 2019. p. 305–16. 10.1007/978-3-030-29891-3_27Suche in Google Scholar

[52] Cilia N, De Stefano C, Fontanella F, Marrocco C, Molinara M, DiFreca AS. An end-to-end deep learning system for medieval writer identification. Pattern Recognition Lett. 2020;129:137–43. 10.1016/j.patrec.2019.11.025Suche in Google Scholar

[53] Mohammed H, Märgner V, Stiehl HS. Writer identification for historical manuscripts: analysis and optimisation of a classifier as an easy-to-use tool for scholars from the humanities. In: 2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR). IEEE; 2018. p. 534–9. 10.1109/ICFHR-2018.2018.00099Suche in Google Scholar

[54] Mohammed H, Marthot-Santaniello I, Märgner V. GRK-Papyri: a dataset of Greek handwriting on Papyri for the task of writer identification. In: 2019 International Conference on Document Analysis and Recognition (ICDAR). IEEE; 2019. p. 726–31. 10.1109/ICDAR.2019.00121Suche in Google Scholar

[55] Nasir S, Siddiqi I. Learning features for writer identification from handwriting on Papyri. In: 4th Mediterranean Conference on Pattern Recognition and Artificial Intelligence. Switzerland: Springer; 2020. 10.1007/978-3-030-71804-6_17Suche in Google Scholar

[56] Nasir S, Siddiqi I, Moetesum M. Writer characterization from handwriting on Papyri using multi-step feature learning. In: International Conference on Document Analysis and Recognition. Switzerland: Springer; 2021. p. 451–65. 10.1007/978-3-030-86198-8_32Suche in Google Scholar

[57] Griffin LD, Lillholm M. Symmetry sensitivities of derivative-of-gaussian filters. IEEE Trans Pattern Anal Machine Intell. 2009;32(6):1072–83. 10.1109/TPAMI.2009.91Suche in Google Scholar PubMed

[58] Brink AA, Smit J, Bulacu M, Schomaker L. Writer identification using directional ink-trace width measurements. Pattern Recognition. 2012;45(1):162–71. 10.1016/j.patcog.2011.07.005Suche in Google Scholar

[59] Hafner J, Sawhney HS, Equitz W, Flickner M, Niblack W. Efficient color histogram indexing for quadratic form distance functions. IEEE Trans Pattern Anal Machine Intell. 1995;17(7):729–36. 10.1109/34.391417Suche in Google Scholar

[60] Mukundan R, Ramakrishnan K. Moment functions in image analysis: theory and applications. Singapore: World Scientific; 1998. 10.1142/3838Suche in Google Scholar

[61] Djeddi C, Siddiqi I, Souici-Meslati L, Ennaji A. Multi-script writer identification optimized with retrieval mechanism. In: 2012 International Conference on Frontiers in Handwriting Recognition. USA: IEEE; 2012. p. 509–14. 10.1109/ICFHR.2012.239Suche in Google Scholar

Received: 2022-10-18
Revised: 2022-12-12
Accepted: 2022-12-20
Published Online: 2023-02-24

© 2023 the author(s), published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Artikel in diesem Heft

  1. Research Articles
  2. Salp swarm and gray wolf optimizer for improving the efficiency of power supply network in radial distribution systems
  3. Deep learning in distributed denial-of-service attacks detection method for Internet of Things networks
  4. On numerical characterizations of the topological reduction of incomplete information systems based on evidence theory
  5. A novel deep learning-based brain tumor detection using the Bagging ensemble with K-nearest neighbor
  6. Detecting biased user-product ratings for online products using opinion mining
  7. Evaluation and analysis of teaching quality of university teachers using machine learning algorithms
  8. Efficient mutual authentication using Kerberos for resource constraint smart meter in advanced metering infrastructure
  9. Recognition of English speech – using a deep learning algorithm
  10. A new method for writer identification based on historical documents
  11. Intelligent gloves: An IT intervention for deaf-mute people
  12. Reinforcement learning with Gaussian process regression using variational free energy
  13. Anti-leakage method of network sensitive information data based on homomorphic encryption
  14. An intelligent algorithm for fast machine translation of long English sentences
  15. A lattice-transformer-graph deep learning model for Chinese named entity recognition
  16. Robot indoor navigation point cloud map generation algorithm based on visual sensing
  17. Towards a better similarity algorithm for host-based intrusion detection system
  18. A multiorder feature tracking and explanation strategy for explainable deep learning
  19. Application study of ant colony algorithm for network data transmission path scheduling optimization
  20. Data analysis with performance and privacy enhanced classification
  21. Motion vector steganography algorithm of sports training video integrating with artificial bee colony algorithm and human-centered AI for web applications
  22. Multi-sensor remote sensing image alignment based on fast algorithms
  23. Replay attack detection based on deformable convolutional neural network and temporal-frequency attention model
  24. Validation of machine learning ridge regression models using Monte Carlo, bootstrap, and variations in cross-validation
  25. Computer technology of multisensor data fusion based on FWA–BP network
  26. Application of adaptive improved DE algorithm based on multi-angle search rotation crossover strategy in multi-circuit testing optimization
  27. HWCD: A hybrid approach for image compression using wavelet, encryption using confusion, and decryption using diffusion scheme
  28. Environmental landscape design and planning system based on computer vision and deep learning
  29. Wireless sensor node localization algorithm combined with PSO-DFP
  30. Development of a digital employee rating evaluation system (DERES) based on machine learning algorithms and 360-degree method
  31. A BiLSTM-attention-based point-of-interest recommendation algorithm
  32. Development and research of deep neural network fusion computer vision technology
  33. Face recognition of remote monitoring under the Ipv6 protocol technology of Internet of Things architecture
  34. Research on the center extraction algorithm of structured light fringe based on an improved gray gravity center method
  35. Anomaly detection for maritime navigation based on probability density function of error of reconstruction
  36. A novel hybrid CNN-LSTM approach for assessing StackOverflow post quality
  37. Integrating k-means clustering algorithm for the symbiotic relationship of aesthetic community spatial science
  38. Improved kernel density peaks clustering for plant image segmentation applications
  39. Biomedical event extraction using pre-trained SciBERT
  40. Sentiment analysis method of consumer comment text based on BERT and hierarchical attention in e-commerce big data environment
  41. An intelligent decision methodology for triangular Pythagorean fuzzy MADM and applications to college English teaching quality evaluation
  42. Ensemble of explainable artificial intelligence predictions through discriminate regions: A model to identify COVID-19 from chest X-ray images
  43. Image feature extraction algorithm based on visual information
  44. Optimizing genetic prediction: Define-by-run DL approach in DNA sequencing
  45. Study on recognition and classification of English accents using deep learning algorithms
  46. Review Articles
  47. Dimensions of artificial intelligence techniques, blockchain, and cyber security in the Internet of medical things: Opportunities, challenges, and future directions
  48. A systematic literature review of undiscovered vulnerabilities and tools in smart contract technology
  49. Special Issue: Trustworthy Artificial Intelligence for Big Data-Driven Research Applications based on Internet of Everythings
  50. Deep learning for content-based image retrieval in FHE algorithms
  51. Improving binary crow search algorithm for feature selection
  52. Enhancement of K-means clustering in big data based on equilibrium optimizer algorithm
  53. A study on predicting crime rates through machine learning and data mining using text
  54. Deep learning models for multilabel ECG abnormalities classification: A comparative study using TPE optimization
  55. Predicting medicine demand using deep learning techniques: A review
  56. A novel distance vector hop localization method for wireless sensor networks
  57. Development of an intelligent controller for sports training system based on FPGA
  58. Analyzing SQL payloads using logistic regression in a big data environment
  59. Classifying cuneiform symbols using machine learning algorithms with unigram features on a balanced dataset
  60. Waste material classification using performance evaluation of deep learning models
  61. A deep neural network model for paternity testing based on 15-loci STR for Iraqi families
  62. AttentionPose: Attention-driven end-to-end model for precise 6D pose estimation
  63. The impact of innovation and digitalization on the quality of higher education: A study of selected universities in Uzbekistan
  64. A transfer learning approach for the classification of liver cancer
  65. Review of iris segmentation and recognition using deep learning to improve biometric application
  66. Special Issue: Intelligent Robotics for Smart Cities
  67. Accurate and real-time object detection in crowded indoor spaces based on the fusion of DBSCAN algorithm and improved YOLOv4-tiny network
  68. CMOR motion planning and accuracy control for heavy-duty robots
  69. Smart robots’ virus defense using data mining technology
  70. Broadcast speech recognition and control system based on Internet of Things sensors for smart cities
  71. Special Issue on International Conference on Computing Communication & Informatics 2022
  72. Intelligent control system for industrial robots based on multi-source data fusion
  73. Construction pit deformation measurement technology based on neural network algorithm
  74. Intelligent financial decision support system based on big data
  75. Design model-free adaptive PID controller based on lazy learning algorithm
  76. Intelligent medical IoT health monitoring system based on VR and wearable devices
  77. Feature extraction algorithm of anti-jamming cyclic frequency of electronic communication signal
  78. Intelligent auditing techniques for enterprise finance
  79. Improvement of predictive control algorithm based on fuzzy fractional order PID
  80. Multilevel thresholding image segmentation algorithm based on Mumford–Shah model
  81. Special Issue: Current IoT Trends, Issues, and Future Potential Using AI & Machine Learning Techniques
  82. Automatic adaptive weighted fusion of features-based approach for plant disease identification
  83. A multi-crop disease identification approach based on residual attention learning
  84. Aspect-based sentiment analysis on multi-domain reviews through word embedding
  85. RES-KELM fusion model based on non-iterative deterministic learning classifier for classification of Covid19 chest X-ray images
  86. A review of small object and movement detection based loss function and optimized technique
Heruntergeladen am 16.12.2025 von https://www.degruyterbrill.com/document/doi/10.1515/jisys-2022-0244/html?lang=de
Button zum nach oben scrollen