TLS Grammars : Inference, Parsing, and Some Results

Jacques Blanc-Talon; Bertrand Zavidovique

doi:10.1117/12.970094

1 November 1989 TLS Grammars : Inference, Parsing, and Some Results

Jacques Blanc-Talon, Bertrand Zavidovique

Proceedings Volume 1199, Visual Communications and Image Processing IV; (1989) https://doi.org/10.1117/12.970094
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

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.

Citation Download Citation

Jacques Blanc-Talon and Bertrand Zavidovique "TLS Grammars : Inference, Parsing, and Some Results", Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); https://doi.org/10.1117/12.970094

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available