On-Line Chinese Character Recognition Via a Representation of Spatial Relationships Between Strokes

1997 ◽  
Vol 11 (03) ◽  
pp. 329-357 ◽  
Author(s):  
Ju-Wei Chen ◽  
Suh-Yin Lee
Keyword(s):  
Character Recognition ◽  
Chinese Character ◽  
Spatial Relationship ◽  
Spatial Relations ◽  
Chinese Characters ◽  
Spatial Relationships ◽  
Matching Problem ◽  
Structural Rules ◽  
Chinese Character Recognition ◽  
On Line

Chinese characters are constructed by basic strokes based on structural rules. In handwritten characters, the shapes of the strokes may vary to some extent, but the spatial relations and geometric configurations of the strokes are usually maintained. Therefore these spatial relations and configurations could be regarded as invariant features and could be used in the recognition of handwritten Chinese characters. In this paper, we investigate the structural knowledge in Chinese characters and propose the stroke spatial relationship representation (SSRR) to describe Chinese characters. An On-Line Chinese Character Recognition (OLCCR) method using the SSRR is also presented. With SSRR, each character is processed and is represented by an attribute graph. The process of character recognition is thereby transformed into a graph matching problem. After careful analysis, the basic spatial relationship between strokes can be characterized into five classes. A bitwise representation is adopted in the design of the data structure to reduce storage requirements and to speed up character matching. The strategy of hierarchical search in the preclassification improves the recognition speed. Basically, the attribute graph model is a generalized character representation that provides a useful and convenient representation for newly added characters in an OLCCR system with automatic learning capability. The significance of the structural approach of character recognition using spatial relationships is analyzed and is proved by experiments. Realistic testing is provided to show the effectiveness of the proposed method.

On-Line Handwritten Chinese Character Recognition Directed by Components with Dynamic Templates

1998 ◽  
Vol 12 (01) ◽  
pp. 143-157 ◽  
Author(s):  
Xuhong Xiao ◽  
Ruwei Dai
Keyword(s):  
Computational Complexity ◽  
Character Recognition ◽  
Chinese Character ◽  
Chinese Characters ◽  
Partial Matching ◽  
Chinese Character Recognition ◽  
Handwritten Chinese Character Recognition ◽  
On Line ◽  
Segment Matching ◽  
Multiple Templates

Structural matching has been recognized as a promising approach for on-line Chinese character recognition. In order to reduce its great computational complexity and improve its performance, people have been seeking for ways to direct the matching of a whole character by the result of partial matching. In this paper, the authors proposed 45 basic components for 3,755 categories of daily-used Chinese characters to direct the stroke segment matching of whole characters. Since they are always located at either the beginning or the end of the stroke segment string of characters, these components are easy to be extracted and separated from other parts of a character. Besides, in our approach, the reference templates of these components are extracted dynamically from the corresponding segment string of characters when a specific matching is carried out. This strategy avoids building multiple templates for the components of the same kind but at different places of characters. The experiments show that the segment matching computation has been reduced greatly without reducing the correctness of matching.

RADICAL EXTRACTION USING AFFINE SPARSE MATRIX FACTORIZATION FOR PRINTED CHINESE CHARACTERS RECOGNITION

2012 ◽  
Vol 26 (03) ◽  
pp. 1250005 ◽  
Author(s):  
JUN TAN ◽  
XIAOHUA XIE ◽  
WEI-SHI ZHENG ◽  
JIAN-HUANG LAI
Keyword(s):  
Matrix Factorization ◽  
Affine Transformation ◽  
Character Recognition ◽  
Chinese Character ◽  
Sparse Matrix ◽  
Spatial Relationship ◽  
Recognition System ◽  
Chinese Characters ◽  
Chinese Character Recognition ◽  
Sparse Matrix Factorization

Each Chinese character is comprised of radicals, where a single character (compound character) contains one (or more than one) radicals. For human cognitive perspective, a Chinese character can be recognized by identifying its radicals and their spatial relationship. This human cognitive law may be followed in computer recognition. However, extracting Chinese character radicals automatically by computer is still an unsolved problem. In this paper, we propose using an improved sparse matrix factorization which integrates affine transformation, namely affine sparse matrix factorization (ASMF), for automatically extracting radicals from Chinese characters. Here the affine transformation is vitally important because it can address the poor-alignment problem of characters that may be caused by internal diversity of radicals and image segmentation. Consequently we develop a radical-based Chinese character recognition model. Because the number of radicals is much less than the number of Chinese characters, the radical-based recognition performs a far smaller category classification than the whole character-based recognition, resulting in a more robust recognition system. The experiments on standard Chinese character datasets show that the proposed method gets higher recognition rates than related Chinese character recognition methods.

A research on an intelligent recognition tool for bronze inscriptions of the Shang and Zhou dynasties

2020 ◽  
Vol 4 (4) ◽  
pp. 271-279
Author(s):  
Rui Guo
Keyword(s):  
Computer Technology ◽  
Character Recognition ◽  
Chinese Character ◽  
Research Process ◽  
Chinese Characters ◽  
Chinese Character Recognition ◽  
The World ◽  
Bronze Inscriptions ◽  
Intelligent Recognition ◽  
Functional Components

The intelligent recognition tool for bronze inscriptions of the Shang and Zhou dynasties—the “Shang Zhou Bronze Inscriptions Intelligent Mirror”—was successfully invented in Shanghai. This mirror, based on the computer technology of artificial intelligence (AI) image recognition and image retrieval, succeeds in automagical recognition of bronze inscriptions, both single letters and full texts. This research leads the trend of the AI recognition of Ancient Chinese characters and accumulates valuable experience for the development of inter-disciplinary research on Chinese character recognition. This essay emphasizes the importance of the bronze inscriptions of the Shang and Zhou dynasty database in the AI recognition of bronze inscriptions, introduces the functional components of this tool, and shares the whole research process in order to offer experience for the related research on AI recognition of other types of Ancient Chinese characters as well as ideographs in the world scope. “Shang Zhou Bronze Inscriptions Intelligent Mirror” as a tool for bronze inscription recognition also has room for improvement and support, and guidance from experts in similar areas is greatly welcomed.

scholarly journals Double-Sided Occluded Chinese Character Recognition Accuracy and Response Time for Design and Nondesign Educational Background

SAGE Open ◽  
2018 ◽  
Vol 8 (4) ◽  
pp. 215824401881006
Author(s):  
Ching-Chih Liao
Keyword(s):  
Response Time ◽  
Character Recognition ◽  
Visual Recognition ◽  
Chinese Character ◽  
Recognition Accuracy ◽  
Educational Status ◽  
Educational Background ◽  
Chinese Characters ◽  
Chinese Character Recognition ◽  
Educational Groups

This article investigates the influence of the position of occlusion, structural composition, and design educational status on Chinese character recognition accuracy and response time. Tsao and Liao conducted an experiment using 18 of the 4,000 most commonly used Chinese characters and suggested that the primary and secondary recognition features of a “single-sided” occluded Chinese character are the key radical (or initial strokes) and the key component (i.e., combination of strokes), respectively. The study concluded that right-side occluded characters require a shorter response time and yield more accurate recognition and that educational background does not significantly affect recognition accuracy and response time. The present study considered the same 18 Chinese characters and extended the work of Tsao and Liao by exploring accuracy rate and response time in design and nondesign educational groups for the recognition of “double-sided” occluded Chinese characters. The experimental results indicated that right-side occlusion (including both bottom-right and top-right occlusion) requires a shorter response time and yields more accurate recognition than left-side occlusion. These results agree with those of Tsao and Liao, who found that the key radical of a Chinese character is its key visual recognition feature. Even double-sided occlusion of Chinese characters does not affect the recognition outcome if the position of occlusion does not blur the key radical. Moreover, the participants majoring in design recognized the occluded Chinese characters more slowly than those with no educational background in design.

HANDPRINTED CHINESE CHARACTER RECOGNITION USING THE PROBABILITY DISTRIBUTION FEATURE

1994 ◽  
Vol 08 (05) ◽  
pp. 1241-1258 ◽  
Author(s):  
TZE FEN LI ◽  
SHIAW-SHIAN YU
Keyword(s):  
Probability Distribution ◽  
Character Recognition ◽  
Chinese Character ◽  
Recognition Rate ◽  
Bayes Rule ◽  
Chinese Characters ◽  
Two Dimensional ◽  
Shape Variation ◽  
Recognition Method ◽  
Chinese Character Recognition

A simplified Bayes rule is used to classify 5401 categories of handwritten Chinese characters. The main feature for the Bayes rule deals with the probability distribution of black pixels of a thinned character. Our idea is that each Chinese character indicated by the black pixels represents a probability distribution in a two-dimensional plane. Therefore, an unknown pattern is classified into one of 5401 different distributions by the Bayes rule. Since the handwritten character has an irregular shape variation, the whole character is normalized and then thinned. Finally, a transformation is used to spread the black pixels uniformly over the whole square plane, but it still keeps the relative positions of the original black pixels. The main feature gives an 88.65% recognition rate. In order to raise the recognition rate, 4 more subsidiary features are elaborately selected such that they are not affected much by the irregularly shaped variation. The 4 features raise the recognition rate to 93.43%. A 99.30% recognition rate is achieved if the top 10 categories of HCC are selected by our recognition method and 99.61% if the top 20 are selected.

A Preclassification Method for Handwritten Chinese Character Recognition Via Fuzzy Rules and Seart Neural Net

1998 ◽  
Vol 12 (06) ◽  
pp. 743-761 ◽  
Author(s):  
Hahn-Ming Lee ◽  
Chin-Chou Lin ◽  
Jyh-Ming Chen
Keyword(s):  
Character Recognition ◽  
Chinese Character ◽  
Fuzzy Rules ◽  
Stage I ◽  
Chinese Characters ◽  
Neural Net ◽  
Chinese Character Recognition ◽  
Handwritten Chinese Character Recognition ◽  
Two Stages ◽  
Testing Set

In this paper, a method of character preclassification for handwritten Chinese character recognition is proposed. Since the number of Chinese characters is very large (at least 5401s for daily use), we employ two stages to reduce the candidates of an input character. In stage I, we extract the first set of primitive features from handwritten Chinese characters and use fuzzy rules to create four preclassification groups. The purpose in stage I is to reduce the candidates roughly. In stage II, we extract the second set of primitive features from handwritten Chinese characters and then use the Supervised Extended ART (SEART) as the classifier to generate preclassification classes for each preclassification group created in stage I. Since the number of characters in each preclassification class is smaller than that in the whole character set, the problem becomes simpler. In order to evaluate the proposed preclassification system, we use 605 Chinese character categories in the textbooks of elementary school as our training and testing data. The database used is HCCRBASE (provided by CCL, ITRI, Taiwan). In samples 1–100, we select the even samples as the training set, and the odd samples as the testing set. The characters of the testing set can be distributed into correct preclassification classes at a rate of 98.11%.

Sign in / Sign up

Export Citation Format

Share Document