2007
DOI: 10.1109/icdar.2007.4378735
|View full text |Cite
|
Sign up to set email alerts
|

Text/Non-text Ink Stroke Classification in Japanese Handwriting Based on Markov Random Fields

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(14 citation statements)
references
References 12 publications
(14 reference statements)
0
14
0
Order By: Relevance
“…For example, Jain et al [3] have proposed a classification system based on local features extracted from each stroke and a linear classifier. More recently, more sophisticated approaches have been proposed, taking into account the temporal context of the strokes [4], [5], [6], [7], the spatial context [8], or a combination of those [9]. In our recent work [10], we introduced a Conditional Random Field model that integrates multiple sources of context and yields a recognition rate of 97.23% on the IAM-OnDo documents [10].…”
Section: A Text/non-text Separationmentioning
confidence: 98%
“…For example, Jain et al [3] have proposed a classification system based on local features extracted from each stroke and a linear classifier. More recently, more sophisticated approaches have been proposed, taking into account the temporal context of the strokes [4], [5], [6], [7], the spatial context [8], or a combination of those [9]. In our recent work [10], we introduced a Conditional Random Field model that integrates multiple sources of context and yields a recognition rate of 97.23% on the IAM-OnDo documents [10].…”
Section: A Text/non-text Separationmentioning
confidence: 98%
“…MRFs can effectively integrate the information between neighboring pen-points such as binary features and triple features [3] and they have been successfully applied to offline handwritten character recognition [4] and on-line stroke classification [5]. However, MRFs have not been applied to on-line handwritten character recognition; current on-line handwritten character recognition tend to use HMM-based models (note that HMMs can be viewed as a specific case of MRFs).…”
Section: Introductionmentioning
confidence: 99%
“…The system matches feature points from the input pattern to each prototype of each character class based on the dynamic programming algorithm. It does not consider the distributions for each feature point and only uses the unary features to calculate the distances between matched pairs of feature points of the input pattern and each prototype, and then sum those distances to evaluate the similarity between the input pattern The MRF is described by an undirected graph in which a set of random variables have Markov property and, MRFs can effectively integrate the information among neighboring feature points such as binary features and trinary features [18] and they have been successfully applied to off-line handwritten character recognition [19] and on-line stroke classification [20]. Wolf, C. [21] has successfully employed MRF for document images binarization.…”
Section: Introductionmentioning
confidence: 99%