一种新的形态学联想记忆网络模型研究

针对即使在输入模式无噪声,形态学联想记忆在用于异联想时仍不能保证完全回忆的问题,从扩大记忆矩阵的存储空间的角度入手,提出一种新的形态学联想记忆模型——三维存储矩阵的形态学联想记忆来刻画MAM(Morphological Associative Memories)的记忆性能。该模型能够弥补传统形态学联想记忆的记忆矩阵的不足,解决MAM在异联想时不能保证对模式对集实现完全回忆的问题。详细阐述了构建三维存储矩阵的原理与步骤,并通过实例验证三维存储矩阵的形态学联想记忆的记忆性能远远优于传统的形态学联想记忆。     

基于概率的MAM记忆性能模型

针对即使输入模式无噪声,形态学联想记忆在用于异联想时仍不能保证完全回忆的问题,借助概率学知识,提出一个概率模型来刻画形态学联想记忆网络的记忆性能。该概率模型能从整体上正确地反映网络的输入端维数、输出端维数以及模式对的数目对形态学联想记忆的记忆性能的影响趋势,对进一步研究与改进形态学联想记忆,有一定的指导意义。     

形态学联想记忆网络的研究进展

形态学联想记忆网络具有无限存储能力、一步回忆记忆、良好地抵抗腐蚀噪声或者膨胀噪声的噪声容限等许多优点.从形态学联想记忆的概念、基本原理、发展脉络、研究新成果,发展趋势和研究方向等多个方面综述了形态学联想记忆网络的研究进展.对形态学联想记忆方面的研究带来了一定的参考价值.     

双向模糊形态联想记忆网络及其抗随机噪声的研究

在文献[1]提出的模糊形态联想记忆网络FMAM的基础上,提出了一种新型的模糊形态学双向联想记忆网络FMBAM,证明了FMBAM的双向联想中能够保证记忆在一步之内完成,因此不存在收敛问题,也表明了FMBAM具有优越的抗腐蚀或膨胀噪声的能力.但是,通常的噪声是随机的,为此,本文提出了动态核的方法,从而较好地提高了FMBAM对随机噪声的抗噪能力.仿真实验验证了利用动态核的双向联想记忆网络FMBAM,在加入较大的随机噪声的情况下,仍能保证完全记忆在一步之内完成.     

推广的多值指数双向联想记忆模型及其应用

推广了Wang的多值指数双向联想记忆(multi-valued exponential bi-directional associative memory,简称MV-eBAM)模型,使其成为所提出的推广的多值指数双向联想记忆 (extended MV-eBAM,简称EMV-eBAM) 模型的一个特例.EMV-eBAM具有比前者更高的存储容量和纠错性能,因此利用这种性能,设计了一种基于联想记忆的新型图像压缩算法.该算法在无噪声情况下具有与矢量量化(vector quantization,简称VQ)算法相近的性能,而在双重(信道和图像)噪声环境下则具有显著的抑制效果.对比实验结果显示,在添加5%椒盐噪声下,该算法几乎能完全排除噪声干扰,而VQ则反而放大了噪声.该算法的另一个优点是,当在差错信道中传送时,可以获得比采用循环纠错码更强的纠错性能.因而,该算法具有较强的鲁棒性.     

模糊形态双向联想记忆网络的研究

提出了一种新型的模糊形态双向联想记忆网络FMBAM,证明了FMBAM在双向联想中能够保证记忆在一步之内完成,因此不存在收敛问题,并实现完全双向正确联想,且可模糊性解释,同时表明了FMBAM具有优越的抗腐蚀或膨胀噪声的能力,仿真实验验证了双向联想FMBAM具有良好的性能。     

一种新型双向联想记忆神经网络

提出了一种新型双向联想记忆神经网络,此网络将两个相互关联的模式以模式对的形式存储在由N个连接构成的模式环中,记忆容量为22N数量级,完全消除了假模式对、能够全部或部分地回忆出与输入模式对具有最小Hamming距的被记忆的模式对,同时具有较高的记忆效率和可靠性。连接由“连接状态”和“禁止路径”组成,前者直接存储二进制模式对向量的分量,后者用于消除假模式;此神经网络具有正向联想、逆向联想和自联想方式,使得网络能更灵活有效地满足不同的回忆要求。     

基于αβ运算的多层联想记忆模型的研究

介绍了αβ运算符的定义和αβ联想记忆矩阵的四种操作。通过四种矩阵操作来实现模式对的培训和回忆。αβ多层联想记忆模型相比形态学联想记忆模型数值计算相对容易。最后,通过αβ多层联想记忆的数字模拟实例验证了αβ多层联想记忆具有良好的回忆性能。     

尺度空间的联想记忆网络在灰度图中的应用

形态联想记忆网络具有十分优越的抗膨胀噪声或者腐蚀噪声的能力,但抗混合噪声的能力很弱,而在实际中,随机噪声往往是混合型的,既有膨胀噪声又有腐蚀噪声.将形态学尺度空间和形态联想记忆网络相结合,得到了一种新的联想记忆网络,它也具有优越的抗膨胀噪声或者腐蚀噪声的能力,同时它对随机噪声有一定的鲁棒性.通过对含有随机噪声的灰度图像进行自联想记忆和识别处理实验,取得了较为理想的结果,验证了其具有良好的性能.     

最小平方形态联想记忆模型的研究与实现

Ritter等人借助形态学理论提出了形态联想记忆模型（MAM Morphological Associatvie Memory)，其中所构建模型的两个权值矩阵和可分别用以回忆腐蚀和膨胀噪声模式，但不能回忆混合噪声模式，故本文提出了一个最小平方形态联想记忆模式（LSMAM least squares MAM)来克服MAM的不足，以达到既可分别识别腐蚀和膨胀噪声模式，也可以识别混合型噪声模式的目的，因此更适用于实际情形，实验结果表明了该方法的可行性。     

Behavioural study of median associative memory under true-colour image patterns

Median associative memories (MED-AMs) are a special type of associative memory that substitutes the maximum and minimum operators of a morphological associative memory with the median operator. This associative model has been applied to restore grey scale images and provided a better performance than morphological associative memories when the patterns are altered with mixed noise. Despite their power, MED-AMs have not been adopted in problems related with true-colour patterns. In this paper, we describe how MED-AMs can be applied to problems involving true-colour patterns. Furthermore, a complete study of the behaviour of this associative model in the restoration of true-colour images is performed using a benchmark of 16,000 images altered by different noise types.     

A Bidirectional Hetero-Associative Memory for True-Color Patterns

Classical bidirectional associative memories (BAM) have poor memory storage capacity, are sensitive to noise, are subject to spurious steady states during recall, and can only recall bipolar patterns. In this paper, we introduce a new bidirectional hetero-associative memory model for true-color patterns that uses the associative model with dynamical synapses recently introduced in Vazquez and Sossa (Neural Process Lett, Submitted, 2008). Synapses of the associative memory could be adjusted even after the training phase as a response to an input stimulus. Propositions that guarantee perfect and robust recall of the fundamental set of associations are provided. In addition, we describe the behavior of the proposed associative model under noisy versions of the patterns. At last, we present some experiments aimed to show the accuracy of the proposed model with a benchmark of true-color patterns.     

A New Associative Model with Dynamical Synapses

The brain is not a huge fixed neural network, but a dynamic, changing neural network that continuously adapts to meet the demands of communication and computational needs. In classical neural networks approaches, particularly associative memory models, synapses are only adjusted during the training phase. After this phase, synapses are no longer adjusted. In this paper we describe a new dynamical model where synapses of the associative memory could be adjusted even after the training phase as a response to an input stimulus. We provide some propositions that guarantee perfect and robust recall of the fundamental set of associations. In addition, we describe the behavior of the proposed associative model under noisy versions of the patterns. At last, we present some experiments aimed to show the accuracy of the proposed model.     

基于广义逆的指数型联想存储器模型

基于Ｋｏｈｏｎｅｎ的广义逆联想存储模型ＧＩＡＭ（ｇｅｎｅｒａｌｉｚｅｄｉｎｖｅｒｓｅａｓｏｃｉａｔｉｖｅｍｅｍｏｒｙ）和Ｍｕｒａｋａｍｉ的最小平方联想存储ＬＳＡＭ（ｌｅａｓｔｓｑｕａｒｅｓａｓｓｏｃｉａｔｉｖｅｍｅｍｏｒｙ）原理，本文提出了一个指数型联想存储器．该模型的存储性能经计算机模拟证实，远远优于ＧＩＡＭ和ＬＳＡＭ，通过适当地调节参数，几乎可达到完全的联想．对输入噪声方差，无需先验假设，同时还实现了一定程度的非线性映射特性.     

形态学联想记忆的记忆性能研究

形态学联想记忆在异联想时,在对多个模式对进行记忆之后,逐一对每一个模式对的输入模式进行联想,存在得不到正确的输出模式的情形。对形态学联想记忆在异联想时存在的问题进行研究显得非常的必要,否则,对形态学联想记忆的改进工作就会变得盲目。分析形态学联想记忆的记忆性能,得到几个有意义的结论,通过字符图像的仿真实验,对这些结论进行了验证。     

The Kosko Subsethood Fuzzy Associative Memory (KS-FAM): Mathematical Background and Applications in Computer Vision

Many well-known fuzzy associative memory (FAM) models can be viewed as (fuzzy) morphological neural networks (MNNs) because they perform an operation of (fuzzy) mathematical morphology at every node, possibly followed by the application of an activation function. The vast majority of these FAMs represent distributive models given by single-layer matrix memories. Although the Kosko subsethood FAM (KS-FAM) can also be classified as a fuzzy morphological associative memory (FMAM), the KS-FAM constitutes a two-layer non-distributive model. In this paper, we prove several theorems concerning the conditions of perfect recall, the absolute storage capacity, and the output patterns produced by the KS-FAM. In addition, we propose a normalization strategy for the training and recall phases of the KS-FAM. We employ this strategy to compare the error correction capabilities of the KS-FAM and other fuzzy and gray-scale associative memories in terms of some experimental results concerning gray-scale image reconstruction. Finally, we apply the KS-FAM to the task of vision-based self-localization in robotics.     

利用动态核的形态联想记忆网络的研究

在文献[1]的基础上,提出了一个基于动态核的形态联想记忆网络方法,特点是同一幅图像,如果其所含的噪声情况不同,则其核也将不同,从而较好地解决了图像含有随机噪声时的联想记忆问题。实验证明,此方法具有良好的性能,双向联想记忆的准确率优于文献[1]中介绍的方法。     

Associative Gray Level Pattern Processing using Binary Decomposition and α β Memories

In this note we show how a binary memory can be used to recall gray-level patterns. We take as example the α β associative memories recently proposed in Yáñez, Associative Memories based on order Relations and Binary Operators(In Spanish), PhD Thesis, Center for computing Research, February of 2002, only useful in the binary case. Basically, the idea consists on that given a set of gray-level patterns to be first memorized: (1) Decompose them into their corresponding binary patterns, and (2) Build the corresponding binary associative memory (one memory for each binary layer) with each training pattern set (by layers). A given pattern or a distorted version of it, it is recalled in three steps: (1) Decomposition of the pattern by layers into its binary patterns, (2) Recalling of each one of its binary components, layer by layer also, and (3) Reconstruction of the pattern from the binary patterns already recalled in step 2. The proposed methodology operates at two phases: training and recalling. Conditions for perfect recall of a pattern either from the fundamental set or from a distorted version of one them are also given. Experiments where the efficiency of the proposal is tested are also given.