Advertisement

Diagram Understanding using Graphics Constraint Grammars

  • Robert P. Futrelle
  • Ioannis A. Kakadiaris
Chapter
Part of the Microprocessor-Based and Intelligent Systems Engineering book series (ISCA, volume 9)

Abstract

In scientific and technical literature, diagrams play a crucial role. We introduce the Graphics Constraint Grammar (GCG) for the analysis of diagrams. Using the grammar, low-level elements of the diagrams are aggregated into higher-order structures. GCG allows the integration of syntax and semantics in order to locate diagram components and discover their information content. Geometrical relations of components of the diagrams are defined by the constraint relations that they must satisfy. Properties of higher-level objects are derived by propagation of attributes from their lower-level constituents. GCG can also be used as the basis for diagram generation systems.

Keywords

Constraint Satisfaction Problem Image Processing System Terminal Symbol Tick Mark Phrase Structure Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Freuder, E. C. Completable Representations Of Constraint Satisfaction problems. In Proc. of 2 nd Intl. Conf. Princ. of Knowledge Rep. & Reasoning. 1991. pp. 186–195.Google Scholar
  2. [2]
    Futrelle, R. P. Strategies for Diagram Understanding Object/Spatial Data Structures,Animate Vision, and Generalized Equivalence. In 10th ICPR. 1990. IEEE: pp. 403–408.Google Scholar
  3. [3]
    Futrelle, R. P. An Introduction to the Biological Knowledge Laboratory. Tech. Rept., 1989, College of Computer Science, Northeastern University: NU-CCS-89–15.Google Scholar
  4. [4]
    Gazdar, G., et al. Generalized Phrase Structure Grammar. 1985, Cambridge, MA: Harvard U. Press.Google Scholar
  5. [5]
    Gusgen, H. W. CONSAT: A system for Constraint Satisfaction. 1989, San Mateo, CA: Morgan Kaufmann Publishers.Google Scholar
  6. [6]
    Korf, R. E., Optimal Path-Finding Algorithms. In Search in Artificial Intelligence, Kanal, L. and Kumar, V., Editors. 1988, Springer-Verlag: New York. pp. 223–267.CrossRefGoogle Scholar
  7. [7]
    Pollard, C. and Sag, I. A., Information-based Syntax and Semantics. Vol. 1. 1987, Stanford, CA: Center for the Study of Language and Information.Google Scholar
  8. [8]
    Wittenburg, K. and Weitzman, L. Visual Grammars and Incremental Parsing. In 1990 IEEE Workshop on Visual Languages. 1990. Skokie, Illinois. pp. 235–243.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1991

Authors and Affiliations

  • Robert P. Futrelle
    • 1
  • Ioannis A. Kakadiaris
    • 1
  1. 1.Biological Knowledge LaboratoryCollege of Computer Science 161CN,Northeastern UniversityBostonUSA

Personalised recommendations