动态核的形态分解联想算法及抗随机噪声研究

在灰度图像分解算法和动态核形态联想记忆网络的基础上,提出了一种新的联想记忆算法--动态核的形态分解联想算法.该方法显著地提高了联想记忆抗随机噪声的能力,较好地解决了灰度图像在含噪时的联想记忆和识别的问题,从而给出了一种恢复含噪灰度图像的途径,并把该方法推广到了彩色图像的处理.通过实验,验证了该方法的良好性能,取得了理想的结果.     

动态核的αβ联想记忆网络及抗随机噪声研究

应用αβ联想记忆网络,加入动态核的方法,得到了一种新的联想记忆网络,它不仅解决了灰度图、彩图寻找动态核难的问题,而且也使得αβ联想记忆网络能够很好地处理含随机噪声的图像,包括二值图、灰度图和彩色图像.并成功地解决了图像在含有随机噪声时的联想记忆问题,从而给出了一种较好地处理含噪图像的途径.通过实验,验证了该方法的良好性能,取得了较理想的结果.     

模糊形态联想记忆网络及其在细胞图像联想识别中的应用

研究了模糊形态双向联想记忆网络（FMBAM）在灰度图像处理中的方法,并利用核的形式来解决灰度图像含随机噪声的正确联想记忆及识别问题,提出了构造灰度图像的核需要满足的条件,给出了寻找核的方法和途径,并应用于细胞图像的联想和识别,通过仿真实验,验证了该方法的有效性和良好性能.     

动态核的形态联想记忆网络在灰度图中的应用

介绍了应用于灰度图像的联想记忆和识别的动态核方法,给出了动态核选择的原则和途径。利用动态核可以解决灰度图像在含有随机噪声时的自联想记忆和识别问题,从而给出了一种较好地处理含噪灰度图像恢复的途径。通过实验,验证了该方法的良好性能,取得了较理想的结果。     

动态核的形态联想记忆网络在灰度图中的应用

介绍了应用于灰度图像的联想记忆和识别的动态核方法,给出了动态核选择的原则和途径.利用动态核可以解决灰度图像在含有随机噪声时的自联想记忆和识别问题,从而给出了一种较好地处理含噪灰度图像恢复的途径.通过实验,验证了该方法的良好性能,取得了较理想的结果.     

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

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

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

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

具有抗随机噪声能力的联想记忆网络

形态联想记忆网络具有良好的联想记忆功能和较强的抗膨胀或腐蚀噪声能力,但抗混合噪声的能力很弱.而在实际中,随机噪声往往是混合型的,既有膨胀又有腐蚀噪声,将尺度空间和形态联想记忆网络相结合,得到了一种新的联想记忆网络,它提高了形态自联想记忆网络的抗随机噪声能力.通过仿真实验验证了该方法具有良好的性能.     

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

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

基于模糊神经网络结构的多值联想记忆

文章基于模糊神经网络结构,即通过模糊化,推理,去模糊三个过程,把Kosko提出的模糊联想记忆(FAM)网络模型应用到容错性需要较强的多值联想记忆中,解决了这种网络模型不能对随机噪声模式正确联想的问题,新的网络模型设计简单,大量实验表明文中的联想记忆网络大大提高了FAM网络的容错性能。     

Gray-scale morphological associative memories

Neural models of associative memories are usually concerned with the storage and the retrieval of binary or bipolar patterns. Thus far, the emphasis in research on morphological associative memory systems has been on binary models, although a number of notable features of autoassociative morphological memories (AMMs) such as optimal absolute storage capacity and one-step convergence have been shown to hold in the general, gray-scale setting. In this paper, we make extensive use of minimax algebra to analyze gray-scale autoassociative morphological memories. Specifically, we provide a complete characterization of the fixed points and basins of attractions which allows us to describe the storage and recall mechanisms of gray-scale AMMs. Computer simulations using gray-scale images illustrate our rigorous mathematical results on the storage capacity and the noise tolerance of gray-scale morphological associative memories (MAMs). Finally, we introduce a modified gray-scale AMM model that yields a fixed point which is closest to the input pattern with respect to the Chebyshev distance and show how gray-scale AMMs can be used as classifiers.     

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.     

Color image associative memory on a class of Cohen-Grossberg networks

In this paper, neural associative memories for storing gray-scale and true color images are presented based on a class of reduced Cohen-Grossberg neural networks. Some fundamental conditions for endowing the networks with retrieval properties are proposed. Moreover, a system designing procedure is developed by using matrix decomposition. Numerical simulations show that the constructed networks can act as reliable noise-reducing systems for storing and retrieving color images.     

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.     

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

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

Implicative Fuzzy Associative Memories

Associative neural memories are models of biological phenomena that allow for the storage of pattern associations and the retrieval of the desired output pattern upon presentation of a possibly noisy or incomplete version of an input pattern. In this paper, we introduce implicative fuzzy associative memories (IFAMs), a class of associative neural memories based on fuzzy set theory. An IFAM consists of a network of completely interconnected Pedrycz logic neurons with threshold whose connection weights are determined by the minimum of implications of presynaptic and postsynaptic activations. We present a series of results for autoassociative models including one pass convergence, unlimited storage capacity and tolerance with respect to eroded patterns. Finally, we present some results on fixed points and discuss the relationship between implicative fuzzy associative memories and morphological associative memories