A New Data Base for Syntax-Directed Pattern Analysis and Recognition

Authors:
Y. T. Chien;R. Ribak
Affiliations:
Department of Electrical Engineering, University of Connecticut;-
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 5
Cited 0

N-dimensional grammar for pattern recognition

N-dimensional grammar for pattern recognition
Linguistic methods in picture processing: a survey

AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Web grammars

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
A formal description for two-dimensional patterns

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Machine perception and description of pictorial data

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence

Quantified Score

Hi-index	14.98

Visualization

Abstract

The problem of developing an appropriate data base for syntax-directed pattern analysis and recognition is considered. A new data base is introduced by generalizing the notion of concatenation in representing patterns with a relationship matrix. The characteristics of relationship matrix are demonstrated in teh context of formal language theory. It is shown that this data base will allow us to remove many of the present restrictions placed on the types of patterns that can be handled by syntax-directed systems. Problems in pattern analysis (description and generation) as well as in pattern recognition are discussed and examples are given to illustrate the potential application of this data base in both of these areas.