Model-based stroke extraction and matching for handwritten Chinese character recognition
TL;DR: This method is able to obtain reliable stroke correspondence and enable structural interpretation and some structural post-processing operations are applied to improve the stroke correspondence.
About: This article is published in Pattern Recognition.The article was published on 2001-12-01. It has received 107 citations till now. The article focuses on the topics: Intelligent word recognition.
Citations
More filters
TL;DR: This paper presents a segmentation-free strategy based on Hidden Markov Model (HMM) to handle off-line recognition of realistic Chinese handwriting, where character segmentation stage is avoided prior to recognition.
133 citations
Additional excerpts
...Handwritten textlines are first converted to observation sequence by sliding windows....
[...]
...Published by Elsevier Ltd....
[...]
TL;DR: A survey and an assessment of relevant papers appearing in recent publications of relevant conferences and journals are presented, identifying technical approaches that show promise in these areas as well as identifying the leading researchers for the applicable topics.
Abstract: Offline Chinese handwriting recognition (OCHR) is a typically difficult pattern recognition problem. Many authors have presented various approaches to recognizing its different aspects. We present a survey and an assessment of relevant papers appearing in recent publications of relevant conferences and journals, including those appearing in ICDAR, SDIUT, IWFHR, ICPR, PAMI, PR, PRL, SPIEDRR, and IJDAR. The methods are assessed in the sense that we document their technical approaches, strengths, and weaknesses, as well as the data sets on which they were reportedly tested and on which results were generated. We also identify a list of technology gaps with respect to Chinese handwriting recognition and identify technical approaches that show promise in these areas as well as identify the leading researchers for the applicable topics, discussing difficulties associated with any given approach.
67 citations
TL;DR: A new approach for online handwritten shape recognition that can deal with two-dimensional graphical shapes such as Latin and Asian characters, command gestures, symbols, small drawings, and geometric shapes is investigated.
Abstract: We investigate a new approach for online handwritten shape recognition. Interesting features of this approach include learning without manual tuning, learning from very few training samples, incremental learning of characters, and adaptation to the user-specific needs. The proposed system can deal with two-dimensional graphical shapes such as Latin and Asian characters, command gestures, symbols, small drawings, and geometric shapes. It can be used as a building block for a series of recognition tasks with many applications
67 citations
TL;DR: Applying a model-driven stroke extraction algorithm that cooperates with a selective matching algorithm, the proposed system is better than conventional structural recognition systems in analyzing degraded images and reduces the complexity significantly.
Abstract: This paper proposes a statistical character structure modeling method. It represents each stroke by the distribution of the feature points. The character structure is represented by the joint distribution of the component strokes. In the proposed model, the stroke relationship is effectively reflected by the statistical dependency. It can represent all kinds of stroke relationship effectively in a systematic way. Based on the character representation, a stroke neighbor selection method is also proposed. It measures the importance of a stroke relationship by the mutual information among the strokes. With such a measure, the important neighbor relationships are selected by the nth order probability approximation method. The neighbor selection algorithm reduces the complexity significantly because we can reflect only some important relationships instead of all existing relationships. The proposed character modeling method was applied to a handwritten Chinese character recognition system. Applying a model-driven stroke extraction algorithm that cooperates with a selective matching algorithm, the proposed system is better than conventional structural recognition systems in analyzing degraded images. The effectiveness of the proposed methods was visualized by the experiments. The proposed method successfully detected and reflected the stroke relationships that seemed intuitively important. The overall recognition rate was 98.45 percent, which confirms the effectiveness of the proposed methods.
61 citations
Cites background from "Model-based stroke extraction and m..."
...However, many of them were restored and matched....
[...]
03 Aug 2003
TL;DR: This paper summarizes the research activities of the past decade on the recognition of handwritten scripts used in China, Japan, and Korea and presents the recognition methods, features explored, databases used, and classification schemes investigated.
Abstract: This paper summarizes the research activities of the pastdecade on the recognition of handwritten scripts used inChina, Japan, and Korea. It presents the recognitionmethodologies, features explored, databases used, andclassification schemes investigated. In addition, it includes adescription of the performance of numerous recognitionsystems found in both academic and industrial researchlaboratories. Recent achievements and applications are alsopresented. A list of relevant references is attached togetherwith our remarks on this subject.
44 citations
References
More filters
Book•
01 Jan 1980TL;DR: This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Abstract: A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, "Principles of Artificial Intelligence" describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. "Principles of Artificial Intelligence"evolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
3,754 citations
TL;DR: An approximation algorithm is presented which uses an iterative method to produce polygons with a small—but not minimum—number of vertices that lie on the given curve that justifies the abandonment of the minimum-vertices criterion.
1,323 citations
"Model-based stroke extraction and m..." refers methods in this paper
...Each piece is again split by the polygonal approximation technique of Ramer [35] to generate more break points....
[...]
01 May 1983
TL;DR: A method to determine a distance measure between two nonhierarchical attributed relational graphs is presented and an application of this distance measure to the recognition of lower case handwritten English characters is presented.
Abstract: A method to determine a distance measure between two nonhierarchical attributed relational graphs is presented. In order to apply this distance measure, the graphs are characterised by descriptive graph grammars (DGG). The proposed distance measure is based on the computation of the minimum number of modifications required to transform an input graph into the reference one. Specifically, the distance measure is defined as the cost of recognition of nodes plus the number of transformations which include node insertion, node deletion, branch insertion, branch deletion, node label substitution and branch label substitution. The major difference between the proposed distance measure and the other ones is the consideration of the cost of recognition of nodes in the distance computation. In order to do this, the principal features of the nodes are described by one or several cost functions which are used to compute the similarity between the input nodes and the reference ones. Finally, an application of this distance measure to the recognition of lower case handwritten English characters is presented.
986 citations
"Model-based stroke extraction and m..." refers background in this paper
...A reference stroke may also correspond to a null input stroke, like the node deletion operation in graph matching [38]....
[...]
Book•
01 Apr 1984TL;DR: In this article, the authors present, characterizes and analyzes problem solving strategies that are guided by heuristic information, and characterise and analyze problem-solving strategies with heuristics.
Abstract: This book presents, characterizes and analyzes problem solving strategies that are guided by heuristic information
908 citations
TL;DR: The structural description of an object and the concepts of exact and inexact matching of two structural descriptions are formally defined and the formula for the expected number of nodes in the tree for backtracking alone and with a forward checking algorithm is developed.
Abstract: In this paper we formally define the structural description of an object and the concepts of exact and inexact matching of two structural descriptions We discuss the problems associated with a brute-force backtracking tree search for inexact matching and develop several different algorithms to make the tree search more efficient We develop the formula for the expected number of nodes in the tree for backtracking alone and with a forward checking algorithm Finally, we present experimental results showing that forward checking is the most efficient of the algorithms tested
622 citations