CURSIVE SCRIPT RECOGNITION BY ELASTIC MATCHING

DYNAMIC PROGRAMMING HAS BEEN FOUND USEFUL FOR PERFORMING NONLINEAR TIME WARPING FOR MATCHING PATTERNS IN AUTOMATIC SPEECH RECOGNITION. HERE, THIS TECHNIQUE IS APPLIED TO THE PROBLEM OF RECOGNIZING CURSIVE SCRIPT. THE PARAMETERS USED IN THEMATCHING ARE DERIVED FROM TIME SEQUENCES OF X-Y COORDINATE DATA OF WORDS HANDWRITTEN ON AN ELECTRONIC TABLET. CHOSEN FOR THEIR PROPERTIES OF INVARIANCE WITH RESPECT TO SIZE AND TRANSLATION OF THE WRITING, THESE PARAMETERS ARE FOUND PARTICULARLY SUITABLE FOR THE ELASTIC MATCHING TECHNIQUE. A SALIENTFEATURE OF THE RECOGNITION SYSTEM IS THE ESTABLISHMENT, IN A TRAINING PROCEDURE, OF PROTOTYPES BY EACH WRITER USING THESYSTEM. IN THIS MANNER, THE SYSTEM IS TAILORED TO THE USER.PROCESSING IS PERFORMED ON A WORD-BY-WORD BASIS AFTER THE WRITING IS SEPARATED INTO WORDS.