Iijcs 2014 07 21 25

IPASJ International Journal of Computer Science(IIJCS)
Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

A Publisher for Research Motivation ........ Email: editoriijcs@ipasj.org
Volume 2, Issue 7, July 2014 ISSN 2321-5992

Volume 2 Issue 7 July 2014 Page 29

ABSTRACT
Recognizing Chinese handwriting is a challenging topic in the area of character recognition. This paper proposed a new offline
system to recognize Chinese handwritten characters. In order to avoid the difficulties in over-segmentation, this paper focuses
on the recognition of text lines, which are assumed to have been segmented externally. This paper presents a valuable approach
for the offline recognition of unhindered handwritten Chinese texts by using integrated segmentation and recognition
framework with character over-segmentation. It also explores three important issues: candidate path evaluation, path search
and parameter estimation. For path evaluation we used Bayesian decision view and for better search efficiency, beam search
algorithm is used for path search. We evaluated the recognition performance on a Chinese handwriting database CASIA-
HWDB of unconstrained Chinese handwritten characters and texts, and demonstrated superior performance by the proposed
methods. The proposed method is to implement high recognition rate and speed of handwritten Chinese and handwritten
characters. Experiment result shows that our proposed approach efficiently and effectively improved recognition speed.
Keywords: Handwritten Chinese characters, segmentation, offline recognition, beam search, Bayesian decision view.
1.INTRODUCTION
Computer information processing technology is a very important symbol of todays world. The development of
computer makes human society changing a lot. Chinese language is the most used language in the world. In terms of
methods to recognize different languages an scripts, although there exist many commonalities in image processing and
document pre-processing. e.g., noise removal, zoning, line segment etc., recognition methods [12],[14],[19],
necessarily diverage on the particular script. The large set of Chinese characters (tens of thousands of classes) brings
difficulties to efficient and effective recognition. The divergence of writing styles among different writers and in
different geographic areas aggravates [3],[20],the confusion between different classes. Handwritten text recognition is
particularly difficult because the characters cannot be reliably segmented prior to character recognition. The difficulties
of character segmentation originate from the variability of character size and position, character touching and
overlapping. A text line of Chinese handwriting must be recognized as a whole [1],[17],[15],[9], because it cannot be
trivially segmented into words (there is no more extra space between words than between characters).

Figure 1: Sample handwritten Chinese text
Handwritten text recognition is more difficult than bank check recognition and mail address reading because the lexical
constraint is very weak: Under grammatical and semantic constraints, the number of sentence classes is infinite. Due to
the large number of character classes and the infinite sentence classes of Chinese texts, HCTR [2],[6],[11],[18],[13]can
only be solved by segmentation-based approaches using character models preferably by explicit segmentation, also
called over segmentation, which can take advantage of the character shape and overlapping and touching
characteristics to better separate the characters at their boundaries. The result of over segmentation is a sequence of
primitive segments, each corresponding to a character or a part of a character, such that candidate characters can be
generated by concatenating consecutive segments. The candidate character sequences can be represented in a network
A New technique for Detection of Chinese
Handwritten Typescripts using Included
Segmentation and Recognition
R. Tamilkodi
1
K. Valli Madhavi
2
K. Jaya Sudha
3

1
Department of MCA, GIET, Rajahmundry
2
Department of MCA, GIET, Rajahmundry
3
Department of EXTC, SFIT, Mumbai


called a candidate lattice and each candidate segmentation path in the lattice can be split into many segmentation
recognition paths by assigning character classes to the candidate characters. However, none has investigated these
techniques comprehensively and integrated them in a high-performance system for Chinese/Japanese handwritten text
recognition. In this study, investigation of three key issues of integrated segmentation-and-recognition for HCTR:
candidate path evaluation, path search, and parameter estimation. By elaborating the techniques [7],[10] for these
issues, this paper achieved significant improvements on unconstrained handwritten Chinese texts. In path evaluation, it
integrates character recognition scores, geometric context, and linguistic context from the Bayesian decision view, and
converts the classifier outputs to posterior probabilities via confidence transformation (CT). In path search, a refined
beam search algorithm [16] is used to improve the search efficiency and, meanwhile, a candidate character
augmentation (CCA) strategy is applied to benefit the recognition accuracy[4],[5],[8]. To balance the multiple contexts
in path evaluation function, it can be optimizes the combining weights on a data set of training text lines using a
Maximum Character Accuracy (MCA) criterion. This paper is evaluated on the recognition performance on a large
database CASIA-HWDB of unconstrained Chinese handwritten characters and texts, and demonstrated superior
performance by the proposed methods. The rest of the paper is organized as follows: In section 2, a brief review of the
segmentation and character recognition is presented. The proposed method is given in Section 3, Section 4 & 5
describes the path search and performance evaluation of the proposed method. Section 6 shows experimental results.
Finally, conclusion is presented in section 7.
2. CLASSIFICATION OUTLINE
1. Each text line is extracted from the input.
2. The line image is over-segmented into a sequence of primitive segments and a character may comprise one
segment or multiple segments (Fig. 2).
3. Several consecutive segments are combined to generate candidate character patterns, wherein some are valid
character patterns, while some are invalid (also called noncharacter) (Fig. 3).
4. Each candidate pattern is classied into several candidate character classes, forming a character candidate lattice
(Fig. 4).
5. Each sequence of candidate characters is matched with a lexicon to segment into candidate words, forming a word
candidate lattice (Fig. 5).
6. Each word sequence C paired with candidate pattern sequence X (the pair is called a candidate segmentation
recognition path) is evaluated by multiple contexts and the optimal path is searched to output the segmentation and
recognition result;
7. All text lines results are concatenated to give the result

Figure.2: Over Segmentation

Figure. 3: Segmentation Candidate Lattice

Figure. 4: Character Candidate Lattice



Figure. 5: Word Candidate Lattice

2.1 .Segmentation Candidate Lattice Construction
Segmentation candidate lattice construction Strokes in a string are grouped into blocks (primitive segments) in
accordance with the features such as off-stroke (pen lift between two adjacent strokes) distance and overlap of bounding
boxes of adjacent strokes. Each primitive segment is assumed to be a character or a part of a character. An off-stroke
between adjacent blocks is called a candidate segmentation point, which can be a true segmentation point (SP) or a
non-segmentation point (NSP). One or more consecutive primitive segments form a candidate character pattern. The
combination of all candidate patterns is represented by segmentation Candidate lattice

Figure 6: Block diagram for handwritten Chinese character recognition
3. PROJECTED TECHNIQUE
We formulate the problem of handwritten Chinese text recognition from Bayesian decision view. According to
Bayesian decision under the 0/1 loss, maximizing a posterior probability of character sequence (string class) D =<d
1
...
d
n
>given a text line image X is the optimal criterion for recognition. This posterior probability is formulated by
(a)

(b)



where m is the number of segmented candidate patterns (i.e., character number) of the segmentation path, A j =1means
that the ith candidate pattern is a valid character, and A j=1 means that the gap between the (j- 1)th and jth candidate
patterns is a valid between-character gap, the terms qj and q I are the class-independent geometric features extracted
from the jth candidate pattern and from the pair of the (j- 1)th and jth candidate patterns, respectively. The two
probabilistic terms in (b) correspond to the unary and binary class-independent geometric model respectively. To avoid
summing over a huge number of segmentation paths in (a), the optimal string class can be decided approximately by

(c)
This is to search for the optimal segmentation and string class simultaneously in the lattice.
4. PATH EVALUATION AND SEARCH
Based on candidate character segmentation, character classes assignment and candidate word segmentation, the task of
string recognition is to find the optimal path (combination) of segmentation-recognition. A path corresponds to a
sequence of candidate character patterns X=x
1
,x
2
x
n
"paired with character classes C=c
1
, c
2
c
n
". The path is
evaluated
by a likelihood score:
(d)
and the path of maximum score over all combinations (X,C) gives the segmentation-recognition result. The function in
Eq. (1) is modified from log P(C ) P( X |C,) but to overcome the bias of P(X|C) to small number of segmented
characters, we weight the likelihood of each character pattern with its number kiof constituent segments [9] (similar to
the variable length HMM of [11]). The empirical weights1,2 are used to balance the effects of language model and
character recognition score. The character recognition score is given by a character classifier (MQDF), which inputs
character shape features and output scores proportional to the log-likelihood log P(xi|ci). The summation nature of path
score in Eq. (1) guarantees that the optimal path can be found by dynamic programming (DP) search. The search
proceeds in frame-synchronous fashion: at each primitive segment st, examine all the candidate patterns xi ending at
stand the candidate classes ci assigned to xi, and for each class ci, examine the words wj ending at ci. Denote the
preceding candidate pattern of xi as xi-1 st-k and assigned classes ci-1, and the preceding word of wj as wj-1ending at
character ci-l. If using bi-gram language model, for each triplet (st,ci,wj), an optimal partial path (with maximum
partial score over k, ci-1and wj-1) is retained. If using tri-gram language model, the partial path should be maximized
over k, c i-1, wj-1, as well as the further preceding characters/words ci-2and wj-2. Consider that at each t, the
cardinality of combinations (ci,wj) is very large, to accelerate search, we only retain a limited number NR of partial
paths with maximum scores over (ciwj) at each t. We call this beam search method as pruned DP.
5. PARAMETER ESTIMATION
We evaluate the recognition performance using three character-level metrics: recall (rcl), precision (prs) and F-rate
(frt), which are dened as



6. EXPERIMENTAL RESULTS
Our experiments were implemented on a personal computer (Intel Core2 CPU 1.86 GHz). We evaluated the
performance on CASIA-HWDB database. On a candidate character pattern, the classifier outputs a number of
candidate classes with high scores. To achieve a good tradeoff between the number of candidate classes and the
accumulated accuracy of multiple paths, we select dynamic number of classes for each candidate pattern: order the
classes in descending order of scores and prune the classes when the difference of their scores from the top rank class
exceeds a threshold. The threshold was empirically to achieve a high performance of character recognition.

Figure 7: Example inputs and results

7. CONCLUSION
We presented an integrated segmentation-recognition system for offline handwritten Chinese text.This paper concludes
that, this is an approach for handwritten Chinese text recognition under the character over-segmentation and candidate
path search framework. The performance of this paper is evaluated by Bayesian decision view by combining multiple
contexts, including the character-classification scores, geometric and linguistic contexts. The combining weights of
path evaluation function are optimized by a string recognition objective, namely, the Maximum Character Accuracy
criterion. In path search, the refined beam search algorithm is used to improve the accuracy and efficiency. In
experiments on the unconstrained Chinese handwriting database CASIA-HWDB, the proposed approach achieved the
character-level accurate rate of 92.01 percent and correct rate of 92.69 percent. The experimental results justify the
benefits of confidence transformation of classifier outputs, geometric context models, and language models.



REFERENCES
[1] W. Niblack. An Introduction to Digital Image Process-ing. Prentice- Hall, Englewood- Cliffs, NJ, 1986.
[2] J. Park, V. Govindaraju, and S. N. Srihari. Efcient word segmentation driven by unconstrained handwritten
phrase recognition. In Proc. ICDAR, pages 605608,1999.
[3] S.Sarawagi and W. W. Cohen. Semi-Markov condi tional random elds for information extraction. In NIPS,
pages 11851192.
[4] Speer R, Havasi C. Representing general relational knowledge in ConceptNet 5. In: International conference on
language resources and evaluation (LREC); 2012. p. 367986.
[5] Cambria E, Havasi C, Hussain A. SenticNet 2: a semantic and affective resource for opinion mining and
sentiment analysis. In: Florida articial intelligence research society conference (FLAIRS); 2012. p. 2027.
[6] Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J. Freebase: A collaboratively created graph database for
structuring human knowledge. In: SIGMOD Conference; 2008. pp. 124750.
[7] Liu CL,Yin F, Wang DH, Wang QF. CASIA online and ofine Chinese handwriting databases. In: International
conference on document analysis and recognition (ICDAR); 2011. p. 3741.
[8] Wang QF, Yin F, Liu CL. Integrating language model in hand-written Chinese text recognition. In: International
conference on document analysis and recognition (ICDAR); 2009. p. 103640.
[9] Wang QF, Yin F, Liu CL. Improving handwritten Chinese text recognition by unsupervised language model
adaptation. In: International workshop on document analysis systems (DAS); 2012. p. 1104.
[10] Siu M, Mari O. Variable n-grams and extensions for conversational speech language modeling. IEEE Trans
Speech Audio Process (2000); 8:6375.
[11] Handwritten Japanese Text Recognition Free from Line Direction and Writing Format Constraints, IEICE
Trans. Information and Systems, vol. 88, no. 8, pp. 1815-1822, Aug. 2005.
[12] Chinese Character Recognition: History, Status and Prospects, R.-W. Dai, C.-L. Liu, and B.-H. Xiao, Frontiers of
Computer Science in China, vol. 1, 2007.
[13] Forty Years of Research in Character and Document RecognitionAn Industrial Perspective, Pattern
Recognition, H. Fujisawa, vol. 41, 2008.
[14] A Novel Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings, Q. Fu, X.
Q. Ding, T. Liu, Y. Jiang, and Z. Ren, 2006.
[15] OffLine Recognition of Realistic Chinese Handwriting Using Segmentation- Free Strategy, T.-H. Su, T.-W.
Zhang, D.-J. Guan, and H.-J. Huang, Pattern Recognition, vol. 42,2009.
[16] Integrating Language Model in Handwritten Chinese Text Recognition, Q.-F. Wang, F. Yin, and C.-L. Liu,
2009.
[17] A Bayesian-Based Probabilistic Model for Unconstrained Handwritten Offline Chinese Text Line Recognition,
N.-X. Li and L.-W. Jin, 2010.
[18] Context Driven Chinese String Segmentation and Recognition, Y. Jiang, X. Ding, Q. Fu, and Z. Ren, Proc.
Structural, Syntactic, and Statistical Pattern Recognition: 2006.
[19] Segmentation-Driven Offline Handwritten Chinese and Arabic Script Recognition, X. Ding and H. Liu, Proc.
Conf. Arabic and Chinese Handwriting, pp. 61-73, 2006.
[20] AMaximum-Likelihood Approach to Segmentation-Based Recognition of Unconstrained Handwriting Text, S.
Senda and K. Yamada, Proc. Sixth Intl Conf. Document Analysis and Recognition,pp. 184-188, Sept. 2001.
[21] k.Dileep kumar Patel, Tanmoy Som, Sushil Kumar Yadav, Manoj Kumar Singh, "Handwritten Character
Recognition Using Multiresolution Technique and Euclidean Distance Metric", Journal of Signal and Information
Processing, vol 3, pp. 208-214, May 2012.
[22] A.Subashini, N. D. Kodikara, Bag-of-keypoints Approach for Tamil Handwritten Character Recognition using
SVMs, International Conference on Advances in ICT for Emerging Regions, pp. 102-107,Colombo, 2009.
[23] Christopher Kermorvant, Anne-Laure Bianne, Patrick Marty, Fars Menasri, "From isolated handwritten
characters to fields recognition : Theres many a slip twixt cup and lip ", IEEE 10th International Conference on
Document Analysis and Recognition, pp. 1031-1035, Barcelona, Spain, 2009.
[24] Dr. P. S. Deshpande, Mrs. Latesh Malik, Mrs. Sandhya Arora, "Character Recognition with Histogram Band
Analysis of Encoded String and Neural Network", Proceedings of the 4th World Scientific and Engineering
Academy and Society International Conference on Information Security, Communications and Computers,
Tenerife, Spain, pp. 354-359, December 2005.


[25] Pranob K Charles, V.Harish, M.Swathi, CH. Deepthi, "A Review on the Various Techniques used for Optical
Character Recognition", International Journal of Engineering Research and Applications, vol. 2, Issue 1, pp.659-
662, Jan-Feb 2012.

Iijcs 2014 07 21 25

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Iijcs 2014 07 21 25

Hochgeladen von

Copyright:

Verfügbare Formate

IPASJ International Journal of Computer Science(IIJCS)

Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm

Das könnte Ihnen auch gefallen