Share Email Print

Proceedings Paper

TLS Grammars : Inference, Parsing, and Some Results
Author(s): Jacques Blanc-Talon; Bertrand Zavidovique
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper describes a grammatical 2D-pattern recognition process. In order to build the inference process on stable features of the object being studied, we set up a new type of grammars, so-called TLS-grammars. Attributes and related operators on chains, which are defined in this 2D-application as particular links between confirmed segments, are introduced inside the grammar productions and processed within the parsing step. The grammar rules are weighted with probabilities; they are dynamically modified during the parsing step. Finally, experimental results from real patterns are discussed.

Paper Details

Date Published: 1 November 1989
PDF: 11 pages
Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); doi: 10.1117/12.970094
Show Author Affiliations
Jacques Blanc-Talon, ETCA/CREA/SP (France)
Bertrand Zavidovique, Universite de Paris-Sud (France)

Published in SPIE Proceedings Vol. 1199:
Visual Communications and Image Processing IV
William A. Pearlman, Editor(s)

© SPIE. Terms of Use
Back to Top