Directed Graph Optical Processor

Edward J. Baranoski; David Casasent

doi:10.1117/12.939910

11 August 1987 Directed Graph Optical Processor

Edward J. Baranoski, David Casasent

Proceedings Volume 0752, Digital Optical Computing; (1987) https://doi.org/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.

Citation Download Citation

Edward J. Baranoski and David Casasent "Directed Graph Optical Processor", Proc. SPIE 0752, Digital Optical Computing, (11 August 1987); https://doi.org/10.1117/12.939910

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available