Interior-defined regions, flood-fill algorithms, and a simple 4-connected region filling algorithm are presented together with their properties. An algorithm for region filling using two-dimensional grammars is also presented together with illustrative examples. The results obtained in this article
โฆ LIBER โฆ
Drawings recognition using two-dimensional graph grammars
โ Scribed by V. V. Matsello
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 446 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
โฆ Synopsis
A new formal model for description and recognition of strictly defined sets of line drawing images is proposed. The fast image-parsing algorithm associated with this model is described and its effectiveness is discussed. The algorithm allows one to obtain a structural description of a drawing picture. Using such a description it is possible to perform both the usual classification and a deep structural analysis of the picture.
๐ SIMILAR VOLUMES
An algorithm for region filling using tw
โ
E. T. Lee; Y. J. Pan; P. Chu
๐
Article
๐
1987
๐
John Wiley and Sons
๐
English
โ 286 KB