首页> 外文会议>Conference on Photonic Devices and Algorithms for Computing IV, Jul 8-9, 2002, Seattle, Washington, USA >A uni-complex and bi-complex representation for associative memory with superior retrieval
【24h】

A uni-complex and bi-complex representation for associative memory with superior retrieval

机译:具有高级检索功能的关联内存的单复数和双复数表示

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

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.
机译:提出了一种可在光域实现的新型单复值三元关联模型。使用内积域中的阈值公式可以完成对存储模式的检索。提出了一种确定该三级联想记忆模型的自适应阈值公式的算法。选择最佳阈值以产生最佳性能。已经研究了不同的阈值参数以获得最佳阈值参数的范围。为了验证我们的性能模型,研究了带有噪声和无噪声数据的字符识别问题。此外,提出了一种用于关联存储器检索的双复杂表示模型,并将其与先前的方法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号