scispace - formally typeset
Search or ask a question
Topic

Intelligent word recognition

About: Intelligent word recognition is a research topic. Over the lifetime, 2480 publications have been published within this topic receiving 45813 citations.


Papers
More filters
Proceedings ArticleDOI
A. Kawamura1, K. Yura1, T. Hayama1, Y. Hidai1, T. Minamikawa1, A. Tanaka, S. Masuda 
30 Aug 1992
TL;DR: The authors propose an online handwritten Japanese character recognition method permitting both stroke number and stroke order variations, based on the pattern matching technique, which has achieved a good recognition rate, 91%, for 2965 freely written Japanese kanji characters.
Abstract: The authors propose an online handwritten Japanese character recognition method permitting both stroke number and stroke order variations. The method is based on the pattern matching technique. Matching is done by the multiple similarity method using directional feature densities, which are independent of both stroke number and stroke order. This method has achieved a good recognition rate, 91%, for 2965 freely written Japanese kanji characters. >

65 citations

Journal ArticleDOI
01 Feb 1999
TL;DR: Four new techniques are developed: a new thinning algorithm based on Euclidean distance transformation and gradient oriented tracing, a new line approximation method based on curvature segmentation, artifact removal strategies based on geometrical analysis, and 4) stroke segmentation rules based on splitting, merging and directional analysis.
Abstract: Most handwritten Chinese character recognition systems suffer from the variations in geometrical features for different writing styles. The stroke structures of different styles have proved to be more consistent than geometrical features. In an on-line recognition system, the stroke structure can be obtained according to the sequences of writing via a pen-based input device such as a tablet. But in an off-line recognition system, the input characters are scanned optically and saved as raster images, so the stroke structure information is not available. In this paper, we propose a method to extract strokes from an off-line handwritten Chinese character. We have developed four new techniques: 1) a new thinning algorithm based on Euclidean distance transformation and gradient oriented tracing, 2) a new line approximation method based on curvature segmentation, 3) artifact removal strategies based on geometrical analysis, and 4) stroke segmentation rules based on splitting, merging and directional analysis. Using these techniques, we can extract and trace the strokes in an off-line handwritten Chinese character accurately and efficiently.

65 citations

Journal ArticleDOI
TL;DR: A hidden Markov model (HMM) based word recognition algorithm for the recognition of legal amounts from French bank checks is presented and has been shown to outperform a holistic word Recognizer and another HMM-type word recognizer from the A2iA INTERCHEQUE recognition system.

65 citations

Proceedings ArticleDOI
11 Aug 2002
TL;DR: A complete system able to classify Arabic handwritten words of one hundred different writers is proposed and discussed, and successful recognition results are reported.
Abstract: Hidden Markov models (HMM) have been used with some success in recognizing printed Arabic words. In this paper, a complete scheme for totally unconstrained Arabic handwritten word recognition based on a model discriminant HMM is presented. A complete system able to classify Arabic handwritten words of one hundred different writers is proposed and discussed. The system first attempts to remove some of variation in the images that do not affect the identity of the handwritten word. Next, the system codes the skeleton and edge of the word so that feature information about the lines in the skeleton is extracted. Then a classification process based on the HMM approach is used. The output is a word in the dictionary. A detailed experiment is carried out and successful recognition results are reported.

64 citations

Proceedings Article
01 Nov 2012
TL;DR: This paper proposes a recognition scheme for the Indian script of Devanagari using a Recurrent Neural Network known as Bidirectional LongShort Term Memory (BLSTM) and reports a reduction of more than 20% in word error rate and over 9% reduction in character error rate while comparing with the best available OCR system.
Abstract: In this paper, we propose a recognition scheme for the Indian script of Devanagari. Recognition accuracy of Devanagari script is not yet comparable to its Roman counterparts. This is mainly due to the complexity of the script, writing style etc. Our solution uses a Recurrent Neural Network known as Bidirectional LongShort Term Memory (BLSTM). Our approach does not require word to character segmentation, which is one of the most common reason for high word error rate. We report a reduction of more than 20% in word error rate and over 9% reduction in character error rate while comparing with the best available OCR system.

64 citations


Network Information
Related Topics (5)
Feature extraction
111.8K papers, 2.1M citations
86% related
Feature (computer vision)
128.2K papers, 1.7M citations
85% related
Image segmentation
79.6K papers, 1.8M citations
84% related
Convolutional neural network
74.7K papers, 2M citations
84% related
Object detection
46.1K papers, 1.3M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202241
20201
20192
20189
201751