11 August 1987 Directed Graph Optical Processor
Author Affiliations +
Proceedings Volume 0752, Digital Optical Computing; (1987); doi: 10.1117/12.939910
Event: OE LASE'87 and EO Imaging Symposium, 1987, Los Angeles, CA, United States
Abstract
A directed graph processor and several optical realizations of its input symbolic feature vectors and the multi-processor operations required per node are given. This directed graph processor has advantages over tree and other hierarchical processors because of its large number of interconnections and its ability to adaptively add new nodes and restructure the graph. The use of the basic concepts of such a directed graph processor offer significant impact on: associative, symbolic, inference, feature space and correlation-based AI processors, as well as on knowledge base organization and procedural knowledge control of AI processors. Initial iconic alphanumeric data base results presented are most promising.
© (1987) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Edward J. Baranoski, David Casasent, "Directed Graph Optical Processor", Proc. SPIE 0752, Digital Optical Computing, (11 August 1987); doi: 10.1117/12.939910; https://doi.org/10.1117/12.939910
PROCEEDINGS
14 PAGES


SHARE
KEYWORDS
Spatial light modulators

Optical computing

Adaptive optics

Virtual colonoscopy

Matrices

Artificial intelligence

Classification systems

RELATED CONTENT


Back to Top