Deformable template matching within a Bayesian framework for hand-written graphic symbol recognition

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a method for hand-drawn symbol recognition based on deformable template matching able to handle uncertainty and imprecision inherent to hand-drawing. Symbols are represented as a set of straight lines and their deformations as geometric transformations of these lines. Matching, however, is done over the original binary image to avoid loss of information during line detection. It is defined as an energy minimization problem, using a Bayesian framework which allows to combine fidelity to ideal shape of the symbol and flexibility to modify the symbol in order to get the best fit to the binary input image. Prior to matching, we find the best global transformation of the symbol to start the recognition process, based on the distance between symbol lines and image lines. We have applied this method to the recognition of dimensions and symbols in architectural floor plans and we show its flexibility to recognize distorted symbols. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Valveny, E., & Martí, E. (2000). Deformable template matching within a Bayesian framework for hand-written graphic symbol recognition. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1941, 193–208. https://doi.org/10.1007/3-540-40953-x_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free