Paper
15 November 2002 Uni-complex and bi-complex representation for associative memory with superior retrieval
Author Affiliations +
Abstract
A novel uni-complex valued trinary associative model, which is implementable in the optical domain, is proposed. Retrieval of the stored pattern is accomplished using an threshold formula in the inner product domain. An algorithm to determine adaptive threshold formula for this trinary associative memory model is presented. The optimal threshold is chosen to yield the best performance. Different threshold parameters have been investigated to obtain the range of optimal threshold parameters. In order to validate our performance model, character recognition problem with noisy and noise-free data are investigated. Moreover, a bi-complex representation model for associative memory retrieval is presented and compared to previous methods.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Abdul Ahad Sami Awwal, Haiying Tang, Karl Solvi Gudmundsson, and Javed I. Khan "Uni-complex and bi-complex representation for associative memory with superior retrieval", Proc. SPIE 4788, Photonic Devices and Algorithms for Computing IV, (15 November 2002); https://doi.org/10.1117/12.453728
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Content addressable memory

Performance modeling

Binary data

Data modeling

Detection and tracking algorithms

Optical character recognition

Adaptive optics

Back to Top