Abstract

The problem of computer vision is to give a computer a representation of a picture of a scene and have it figure out what objects are in the scene and in what spatial relationships. This involves low-level vision (image processing), midlevel vision (feature extraction and measurement), and high-level vision (interpretation). One important part of high-level vision is relational matching, the process of matching two relational descriptions of objects, often for the purpose of object identification. In this paper, we describe several kinds of relational matching, give sequential algorithms for solving relational matching problems, and briefly discuss parallel algorithm possibilities.

© 1987 Optical Society of America

Associative network applications to low-level machine vision

J. Michael Oyster, Fernando Vicuna, and Walter Broadwell
Appl. Opt. 26(10) 1919-1926 (1987)

On the definition of age-related norms for visual function testing

Mary A. Johnson and David Choy
Appl. Opt. 26(8) 1449-1454 (1987)

Knowledge engineering in quantitative histopathology

Peter H. Bartels, A. Graham, W. Kuhn, S. Paplanus, and George L. Wied
Appl. Opt. 26(16) 3330-3337 (1987)

Early color vision changes in age-related maculopathy

Raymond A. Applegate, Anthony J. Adams, John C. Cavender, and Frank Zisman
Appl. Opt. 26(8) 1458-1462 (1987)

Associative learning of scene parameters from images

Daniel Kersten, Alice J. O'Toole, Margaret E. Sereno, David C. Knill, and James A. Anderson
Appl. Opt. 26(23) 4999-5006 (1987)