Keywords

1 Introduction

The segmentation of the touching character is more challenging task if the script is handwritten, unconstrained, stylish and cursive. The Brahmi base ancient cursive Modi script is derived from Nagari family. This script is originated during 17th century and used in Maharashtra as administrative script up to 1950. It was used to write Marathi language as well as other languages as Hindi, Guajarati, Persian and so on. Mainly, this script was used for the fast writing. The text is written using Boru (Wooden stick/bird feather) and link over the Shirorekha without lifting the pen. Shirorekha is drawn before to write a text. Modi script text is not separated in sentences and words. Similarly, no punctuation mark is used to indicate the end of words or sentences. Thus, number of challenges are exhibits all over the segmentation of the characters as touching characters; nonuniform Shirorekha and base line; skewed or curved text lines; nonuniform text size and so on. Figure 1 shows the sample images of archaic original Modi script documents [15,16,17,18,19].

Fig. 1.
figure 1

Samples of original archaic handwritten degraded Modi Script document images.

The number of segmentation challenges is under perception of the touching handwritten Modi character clusters as depicted in Fig. 2.

Fig. 2.
figure 2

Challenges in handwritten Modi touching character cluster segmentation. (a) Very dense touching character (b) Skewed Shirorekha (c) Entirely touching characters (d) Nonuniform base line (e) Nonuniform Shirorekha (f) Nonuniform size characters (g) Nonuniform touching characters (h) Looking like single character.

The accuracy of character recognition having one most important requisite aspect as the accuracy in character segmentation. However, the research work for touching Modi character cluster segmentation is not reported. Thus, there is essential to achieve the improvement in segmentation of touching handwritten Modi character cluster. The main objective of this research is to improve the accuracy of the freestyle, unconstrained, cursive and handwritten Modi touching character cluster segmentation. To improve the segmentation rate of the touching character cluster, a modified technique is proposed. The global and local zoning is employed with three types of analysis as: i) overlap ratio, ii) foreground pixel intensity and iii) vertical projection profile.

After giving the brief introduction, rest of the paper is clarified the proposed work as follows. Section 2 reviewed the related work. Section 3 discussed the framework of the handwritten Modi touching character cluster system. Details of the dataset which is used to check the performance of the proposed system is illustrated in Sect. 4. The experimental results are reported and discussed in Sect. 5. The conclusion is stated in the Sect. 6.

2 Literature Review

Generally, the character segmentation techniques are classified in two type explicit and implicit approach [2, 5, 6]. In the explicit approaches, segmentation point of the text part is finding out to separate the isolated characters. These approaches having the drawbacks given as follows [5].

  • Over-segmentation or under-segmentation.

  • Failed to segment the touching characters.

  • Failed to segment overlapping characters.

In implicit approaches, to estimate the segmentation point intelligent system has been used. These techniques having two drawbacks given as follows [5].

  • Failed to identify overlapping and touched text part.

  • Requires huge training data and time which generates extensive overheads.

Handwritten character segmentation approaches found may vary significantly for the handwritten script like English, Chinese, Devanagari, Bengali, Guajarati etc. [1,2,3,4,5,6,7,8,9]. In the study of the handwritten character segmentation literature, it is found that the approaches are script specific and the number of issues are considered for character segmentation. It uses the prior knowledge about script’s character structuring, writing style of script etc. [14]. The research presented in [13, 16, 18, 19, 21] proposes different types of strategies for the handwritten Devanagari script character segmentation. Graph distance theory-based approach for isolated, overlapping and touching Devanagari character segmentation is discussed in citech36ref10. This approach has two inefficiencies as: i) In locating accurate boundaries between characters through post-processing, and ii) Vertical cuts are gained for overlapped characters. The cursive handwritten touching English character segmentation techniques are presented in [10, 12] and [23].

The research work presented in [13, 16,17,18,19,20,21] proposes different types of strategies for the handwritten Devanagari script character segmentation. The work presented in [13, 18] and [21] is the text-based approach used the structural properties to segments the touching Devanagari characters. This approach is script specific, parametric and having over-segmentation problem. It fails to segment the characters with broken left modifier and the vertical left modifier is too small. It also does not tackle with broken characters, touching characters. Graph distance theory-based approach for isolated, overlapping and touching Devanagari character segmentation is discussed in [16]. This approach has two inefficiencies as: i) In locating accurate boundaries between characters through post-processing, and ii) Vertical cuts are gained for overlapped characters. Morphological operation with minutiae detection algorithm is presented in [19] for the segmentation of Devanagari compound characters. A constrained based Devanagari touching character segmentation system is presented in [20] using analysis of bounding box with vertical bars technique. This system is failed to segment the broken and overlapping characters.

Kapoor S., & Verma V. [20] reported three opinions in the area of the character segmentation approaches as: i) The vertical projection profile-based character segmentation approaches are not suitable for free style, handwritten cursive, unconstrained overlapping characters; ii) The character segmentation approaches using Hidden Markov Model does not works well with overlapping characters; and iii) The water reservoir-based techniques are constrained based and are not able to segment the overlapping characters [22].

3 System Framework

A modified framework for Modi touching character segmentation system is illustrated in Fig. 3. The cluster of touching Modi characters is the input of this system. The proposed handwritten Modi touching character cluster segmentation procedure includes four stages, which are described as below.

Fig. 3.
figure 3

Modified framework for the handwritten Modi touching character segmentation system.

Fig. 4.
figure 4

The illustration of initial stage I of Modi character touching cluster segmentation (a) Input touching characters cluster (b) Shirorekha and base line detection and text region formation.

3.1 Stage I

The initial stage of the character segmentation includes three processing sub steps. The input cluster images are in gray level. These images are converted into binary level by using Otsu’s thresholding method [23]. The binarization of the images is desirable for the estimation of the location of the Shirorekha and text region. For the formation of the text region (Treg) the location of Shirorekha (Hline) and base line (Bline) is detected by calculating maximum and minimum peak of the horizontal projection profile using Eq. 1 and Eq. 2 respectively [2]. These locations are used for the separation of the text region of the Modi touching character cluster image as demonstrated in Fig. 4.

$$\begin{aligned} Hline=max _ {(j=1:N)} \Bigg ( \sum _{i=1}^{M}C(i,j)\Bigg ) \end{aligned}$$
(1)
$$\begin{aligned} Bline=min _ {(j=1:N)} \Bigg ( \sum _{i=1}^{M}C(i,j)\Bigg ) \end{aligned}$$
(2)

Here, C is the Modi touching characters cluster image of size M X N.

3.2 Stage II

The next successive stage of the cluster segmentation includes local zoning of the text region (Treg). The text region is partitioned into two non-overlapping zones horizontally from the middle. The connected components (CC) from the lower region are intended as depicted in Fig. 5(b).

Fig. 5.
figure 5

Illustration of connected component and bounding box formation (a) Text region of the overlapping/touching characters cluster (b) Text region lower zone connected component and bounding box of the component.

For each connected component the two elements are determined as its bounding box and area. The bounding box is rectangular region specified by a vector gives [X Y Width Height] of each component as shown in Fig. 5(b). Similarly, area (Areafig) is the actual number of pixels in the component computed which is calculated using Eq. 3.

$$\begin{aligned} Areafig(k)= \sum _{i=1}^{Height_k} \sum _{j=1}^{Width_k} CC_k (i,j) \qquad where k=1..Number of connected component \end{aligned}$$
(3)

Further, the operative connected components (CCfig) are discriminated using the Eq. 4.

$$\begin{aligned} CCfig= {\left\{ \begin{array}{ll} Areafig_k &{} Areafig_k \ge \sqrt{\mu (Areafig) + \sigma (Areafig) }/2 \\ none &{}\text {otherwise} \end{array}\right. } \end{aligned}$$
(4)

Where function \(\mu \) and \(\sigma \) are mean and standard deviation of the area of the all connected components respectively. The overlap ratio between the bounding boxes of each operative connected component pair is computed using union ratio type as given in Eq. 5.

$$\begin{aligned} Oratio =\frac{CCfig_A \cap CCfig_B}{ CCfig_A \cup CCfig_B} \end{aligned}$$
(5)

Let CCfigA and CCfigB be the two connected components with BoxA and BoxB bounding box respectively. The overlap ratio (Oratio) between these two bounding boxes is an MoXNo matrix. Each element (r1, r2) of this matrix is corresponds to overlap ratio between row r1 in BoxA and row r2 in BoxB. The overlapratio is computed in the between 0 and 1 where 1 implies that a perfect overlap. This overlap ratio is exploited for the selection procedure of the touching cluster type. Clusters are classified in two classes as i) Partially touching clusters (Fig. 2 (b, d, e and g)) and iii) Entirely touching clustered (Fig. 2 (a, c and h)). The full process of this stage I and II is illustrated in Algorithm 1 from step1 to step8.

figure a

3.3 Stage III

The overlapping ratio (CntOratio) is counted for the all the connected components. And this overlapping ratio is applied for the selection of the criteria of the touching character cluster segmentation process using Eq. 6. This is depicted in Algorithm 1 from step 9 to step10.

$$\begin{aligned} Criteria = {\left\{ \begin{array}{ll} Function2 ( )&{} CntOratio =null \\ Function1 ( ) &{}\text {otherwise} \end{array}\right. } \end{aligned}$$
(6)

A] Function1(): The partial touching character clusters are segmented using Function1 method. A window of size 3 X Nt is scanned through the text region. Related to each window first occurrence of the foreground pixels are searched from the bottom side. The ligature location (LocX) is finalized by scrutinized the location vector (Loc) with height of the text region Mt using Eq. 7.

$$\begin{aligned} LocX(s) = {\left\{ \begin{array}{ll} Loc(i) &{} Loc(i) \le M_t \wedge Loc \ne 0\\ none &{}\text {otherwise} \end{array}\right. } \end{aligned}$$
(7)

Where i = 1...length(Loc). The ligature location vector is used to finalize the segmentation column. This character segmentation method is described in Algorithm 2.

figure b

B] Function2(): The entirely touching characters clusters are segmented using vertical projection profile-based method. The vertical projection profile (Vpp) of the text region (Mpartfig) is calculated using Eq. 8.

$$\begin{aligned} Vpp= \sum _{i=1}^{M_t} Mpartfig(i,j) \qquad where\,1 \le j \ge N_t \end{aligned}$$
(8)

The location vector (Loc) is formed by using the Eq. 9.

$$\begin{aligned} Loc(s)= {\left\{ \begin{array}{ll} i &{} Vpp(i) \ge \mu (Vpp) + \sigma (Vpp) \\ none &{}\text {otherwise} \end{array}\right. } \end{aligned}$$
(9)

Where i = 1..Nt.Further, the estimated location vector (Loc) is analysed in the formation of the Rational segmentation column (SegLoc). The illustration of entirely touching characters cluster segmentation procedure is described in Algorithm 3.

figure c

3.4 Stage IV

The handwritten Modi script document are highly degraded due to number of reasons like aging, writing material and so on. Consequently, there may be under segmentation problem is occurred during the estimation of the Rational segmentation column. To reduce this problem, the Finalize Segmentation Columns (FSCs) is decided by analysing the Rational segmentation column (SegLoc) vector using the postprocessing method described in [2].

4 Dataset

The archaic original handwritten Modi script documents collected from the various archaeological places as Rajwade Sanshodhan Mandir, Dhule, Shri Samartha Vagdevta Mandir, Dhule etc., are used to test and evaluate the performance of the proposed system. The dataset contains 2540 document images. These document images already preprocessed means de-noised and globally de-skewed using the approaches presented in [25] and [1] respectively. The preprocessed document images are segmented in the text lines using the approach presented in [24]. The Modi text lines are segmented into the isolated Modi characters and touching characters clusters using the approach presented in [2]. These Modi touching characters clusters are the input of the proposed system.

5 Results and Discussions

The performance of the proposed handwritten Modi touching character cluster segmentation method is evaluated using a similar evaluation strategy that was illustrated in [2, 28]. The evaluation method uses five evaluation factors as: Correct segmentation rate (CSR), Successful Segmentation Rate (SSR), precision, recall and F-measure illustrated in Eqs. 1014 respectively. These aspects are calculated by counting the number of matches between the resultant segmented characters by the algorithm and ground truth characters in text line segments [2, 28].

$$\begin{aligned} CSR =\frac{NC_R - ( NC_c +NC_B)}{ NC_G} \times 100 \end{aligned}$$
(10)
$$\begin{aligned} SSR =\frac{NC_I }{ NC_R} \times 100 \end{aligned}$$
(11)
$$\begin{aligned} Precision =\frac{NC_I + NC_C}{ NC_R} \end{aligned}$$
(12)
$$\begin{aligned} Recall =\frac{NC_I + NC_C}{ NC_G} \end{aligned}$$
(13)
$$\begin{aligned} Precision =2 \times \frac{Recall \times Precision}{ Recall + Precision} \end{aligned}$$
(14)

where,

NCG: Number of ground truth characters.

NCR: Number of resultant characters.

NCI: Number of correctly segmented isolated characters.

NCC: Number of overlapping or touching characters clusters.

NCB: Number of incorrectly segmented characters.

Ground truth values are not available for the testing the performance of the handwritten Modi touching character cluster segmentation system. Thus, the numbers of 2249 Modi touching character clusters in 1072 text lines of ninety-two Modi documents are manually calculated and ground truth values are evaluated. Table 1 gives the result of touching Modi character cluster segmentation.

Table 1. The Modi touching character cluster segmentation result.
Fig. 6.
figure 6

Example of Modi script character segmentation of a Modi touching characters cluster (a) Modi touching character clusters (b) Segmented Modi touching character clusters.

Fig. 7.
figure 7

Step wise example of Modi script character segmentation of a Modi document text line (a) Segmented text lines of a Modi Document (b) Segmented touching character clusters and isolated characters (c) Segmented characters of text lines.

The Successful Segmentation Rate (SSR) and Correct Segmentation Rate (CSR) are achieved using the proposed method for the Modi touching character cluster segmentation as 89.68% and 83.62% respectively. Partial touching Modi character clusters are segmented efficiently by proposed method. There are two issues are found about the bad segmentation. The first issue is with very tightly overlapping characters with touching characters exist in the same cluster. The second issue is the broken touching character as shown in Fig. 6(b). Still very tightly coupled character clusters and overlapping character clusters are not segmented properly. Figures 6, 7, 8 and 9 shows the examples of the segmented touching Modi character clusters.

Fig. 8.
figure 8

Example of Modi script character segmentation of a Modi document text line.

Fig. 9.
figure 9

Modi character segmentation (Broken characters and Shirorekha, non-uniform base line and Shirorekha) (a) Input Modi text lines (b) Segmented Modi characters.

6 Conclusions

The connected component overlapratio analysis effectively works on the different problems in touching character cluster segmentation. The proposed handwritten Modi touching character cluster segmentation approach is expertly dealing with the non-uniform Shirorekha and baseline. The results obtained proved that the presented character segmentation approach efficiently tackled with the character segmentation challenges like broken character, broken Shirorekha, variable size characters, variable distance between characters, skewed text lines and curved text lines. Highly degraded touching characters ligature is efficiently identified. The experimental results indicates that the proposed system is efficient to tackle the challenges in handwritten Modi touching character cluster segmentation. Hence, this system can be a part of the archaic handwritten freestyle and unconstrained Modi document segmentation system. Currently the work on the overlapping characters cluster segmentation is in progress.