Non-commutative Logic for Hand-Written Character Modeling

Authors:
Jacqueline Castaing
Affiliations:
-
Venue:
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Year:
2002

Citing 10
Cited 0

Linear logic

Theoretical Computer Science
Letter Recognition Using Holland-Style Adaptive Classifiers

Machine Learning
HMM Based On-Line Handwriting Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Allograph Selection and Multiple Expert Classification for Totally Unconstrained Handwritten Character Recognition

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Online handwriting recognition using multiple pattern class models

Online handwriting recognition using multiple pattern class models
Non-commutative logic II: sequent calculus and phase semantics

Mathematical Structures in Computer Science
Elastic Structural Matching for On-Line Handwritten Alphanumeric Character Recognition

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
A New Hybrid Approach to Large Vocabulary Cursive Handwriting Recognition

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Computation sequence sets

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have proposed a structural approach for on-line handwritten character recognition. Models of characters are writer-dependent. They are codified with the help of graphic primitives and represented in a data base. The originality of our approach comes from the ability for the system, to explain and justify its own choice, and to deal with all different writing systems, such as the Latin alphabet, or the Chinese or Japanese scrip for example, providing that an appropriate data base has been built up. For this reason, our recognizer can be very helpful for learners of "exotic" scripts. In this paper, we propose to analyse the recognition process in an appropriate logical framework, given by non-commutative Logic. We first point out the class of sequents which allows us to describe accurately the recognition process in terms of proofs, then, we will give some results about the complexity of the recognition problem depending on the expressive power of the representation language.