• 제목/요약/키워드: Bidirectional Associative Memory

검색결과 11건 처리시간 0.022초

Granular Bidirectional and Multidirectional Associative Memories: Towards a Collaborative Buildup of Granular Mappings

  • Pedrycz, Witold
    • Journal of Information Processing Systems
    • /
    • 제13권3호
    • /
    • pp.435-447
    • /
    • 2017
  • Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one-directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so-called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.

GBAM 모델을 위한 새로운 설계방법 (A New Design Method for the GBAM (General Bidirectional Associative Memory) Model)

  • 박주영;임채환;김혜연
    • 한국지능시스템학회논문지
    • /
    • 제11권4호
    • /
    • pp.340-346
    • /
    • 2001
  • 본 논문은 GBAM (general bidirectional associative memory) 모델을 위한 새로운 설계방법을 제시한다. GBAM 모델에 대한 이론적 고찰을 바탕으로, GBAM 기방 양방향 연상 메모리의 설계 문제가 GEVP (generalized eigenvalue problem)로 불리는 최적화 문제로 표현될 수 있음을 밝힌다. 설계 과정에서 등장하는 GEVP 문제들은 최근에 개발된 내부점 방법에 의하여 주어진 허용 오차 이내에서 효과적으로 풀릴 수 있으므로, 본 논문에서 확립된 설계 절차는 매우 실용적이다. 제안된 설계 절차에 대한 적용 가능성은 관련 연구에서 고려되었던 간단한 설계 예제를 통하여 예시된다.

  • PDF

성능이 향상된 수정된 다층구조 영방향연상기억메모리 (Modified Multi-layer Bidirectional Associative Memory with High Performance)

  • 정동규;이수영
    • 전자공학회논문지B
    • /
    • 제30B권6호
    • /
    • pp.93-99
    • /
    • 1993
  • In previous paper we proposed a multi-layer bidirectional associative memory (MBAM) which is an extended model of the bidirectional associative memory (BAM) into a multilayer architecture. And we showed that the MBAM has the possibility to have binary storage for easy implementation. In this paper we present a MOdified MBAM(MOMBAM) with high performance compared to MBAM and multi-layer perceptron. The contents will include the architecture, the learning method, the computer simulation results for MOMBAM with MBAM and multi-layer perceptron, and the convergence properties shown by computer simulation examples.. And we will show that the proposed model can be used as classifier with a little restriction.

  • PDF

바이어스항이 있는 GBAM 모델을 이용한 양방향 연상메모리 구현 (Implementation of Bidirectional Associative Memories Using the GBAM Model with Bias Terms)

  • 임채환;박주영
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2001년도 춘계학술대회 학술발표 논문집
    • /
    • pp.69-72
    • /
    • 2001
  • In this paper, we propose a new design method for bidirectional associative memories model with high error correction ratio. We extend the conventional GBAM model using bias terms and formulate a design procedure in the form of a constrained optimization problem. The constrained optimization problem is then transformed into a GEVP(generalized eigenvalue problem), which can be efficiently solved by recently developed interior point methods. The effectiveness of the proposed approach is illustrated by a example.

  • PDF

Generalized Asymmetrical Bidirectional Associative Memory for Human Skill Transfer

  • T.D. Eom;Lee, J. J.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.482-482
    • /
    • 2000
  • The essential requirements of neural network for human skill transfer are fast convergence, high storage capacity, and strong noise immunity. Bidirectional associative memory(BAM) suffering from low storage capacity and abundance of spurious memories is rarely used for skill transfer application though it has fast and wide association characteristics for visual data. This paper suggests generalization of classical BAM structure and new learning algorithm which uses supervised learning to guarantee perfect recall starting with correlation matrix. The generalization is validated to accelerate convergence speed, to increase storage capacity, to lessen spurious memories, to enhance noise immunity, and to enable multiple association using simulation work.

  • PDF

성능개선과 하드웨어구현을 위한 다층구조 양방향연상기억 신경회로망 모델 (A Multi-layer Bidirectional Associative Neural Network with Improved Robust Capability for Hardware Implementation)

  • 정동규;이수영
    • 전자공학회논문지B
    • /
    • 제31B권9호
    • /
    • pp.159-165
    • /
    • 1994
  • In this paper, we propose a multi-layer associative neural network structure suitable for hardware implementaion with the function of performance refinement and improved robutst capability. Unlike other methods which reduce network complexity by putting restrictions on synaptic weithts, we are imposing a requirement of hidden layer neurons for the function. The proposed network has synaptic weights obtainted by Hebbian rule between adjacent layer's memory patterns such as Kosko's BAM. This network can be extended to arbitary multi-layer network trainable with Genetic algorithm for getting hidden layer memory patterns starting with initial random binary patterns. Learning is done to minimize newly defined network error. The newly defined error is composed of the errors at input, hidden, and output layers. After learning, we have bidirectional recall process for performance improvement of the network with one-shot recall. Experimental results carried out on pattern recognition problems demonstrate its performace according to the parameter which represets relative significance of the hidden layer error over the sum of input and output layer errors, show that the proposed model has much better performance than that of Kosko's bidirectional associative memory (BAM), and show the performance increment due to the bidirectionality in recall process.

  • PDF

LCTV를 이용한 실시간 광 연상 메모리의 구현 (Implementation of Real Time Optical Associative Memory using LCTV)

  • 정승우
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 1990년도 제5회 파동 및 레이저 학술발표회 5th Conference on Waves and lasers 논문집 - 한국광학회
    • /
    • pp.102-111
    • /
    • 1990
  • In this thesis, an optical bidirectional inner-product associative memory model using liquid crystal television is proposed and analyzed theoretically and realized experimentally. The LCTV is used as a SLM(spatial light modulator), which is more practical than conventional SLMs, to produce image vector in terms of computer and CCD camera. Memory and input vectors are recorded into each LCTV through the video input connectors of it by using the image board. Two multi-focus hololenses are constructed in order to perform optical inner-product process. In forward process, the analog values of inner-products are measured by photodetectors and are converted to digital values which are enable to control the weighting values of the stored vectors by changing the gray levels of the pixels of the LCTV. In backward process, changed stored vectors are used to produce output image vector which is used again for input vector after thresholding. After some iterations, one of the stored vectors is retrieved which is most similar to input vector in other words, has the nearest hamming distance. The experimental results show that the proposed inner-product associative memory model can be realized optically and coincide well with the computer simulation.

  • PDF

최적화기법을 이용한 BAM의 설계 (Design of BAM using an Optimization approach)

  • 권철희
    • 한국지능시스템학회논문지
    • /
    • 제10권2호
    • /
    • pp.161-167
    • /
    • 2000
  • 본 논문에서는 양방향 연상 기능을 효과적으로 수행할 수 있는 BAM(bidirectional associative memory)의 설계방법론을 제안한다. 먼저 BAM의 성질에 관한 이론적 고찰을 바탕으로 하여 주어진 패턴 쌍을 안정하게 그리고 높은 오차수정율(error correction ratio)을 가지고 저장할 수 있는 BAM을 찾는 문제를 제약조건이 있는 최적화 문제로 공식화한다 다음과정에서 이 최적화 문제를 GEVP(generalized eigenvalue problem)로 변환함으로써 최근에 개발된 내부점 방법(interior point method)을 통하여 해가 구해질 수 있도록 한다. 제안된 설계 방법론의 적용가능성은 예제를 통해 확인된다.

  • PDF

NEW CONDITIONS ON EXISTENCE AND GLOBAL ASYMPTOTIC STABILITY OF PERIODIC SOLUTIONS FOR BAM NEURAL NETWORKS WITH TIME-VARYING DELAYS

  • Zhang, Zhengqiu;Zhou, Zheng
    • 대한수학회지
    • /
    • 제48권2호
    • /
    • pp.223-240
    • /
    • 2011
  • In this paper, the problem on periodic solutions of the bidirectional associative memory neural networks with both periodic coefficients and periodic time-varying delays is discussed. By using degree theory, inequality technique and Lyapunov functional, we establish the existence, uniqueness, and global asymptotic stability of a periodic solution. The obtained results of stability are less restrictive than previously known criteria, and the hypotheses for the boundedness and monotonicity on the activation functions are removed.

CBAM 모델에 관한 연구 (A Study on CBAM model)

  • 임용순;이근영
    • 전자공학회논문지B
    • /
    • 제31B권5호
    • /
    • pp.134-140
    • /
    • 1994
  • In this paper, an algorithm of CBAM(Combination Bidirectional Associative Memory) model proposes, analyzes and tests CBAM model `s performancess by simulating with recalls and recognitions of patterns. In learning-procedure each correlation matrix of training patterns is obtained. As each correlation matrix's some elements correspond to juxtaposition, all correlation matrices are merged into one matrix (Combination Correlation Matrix, CCM). In recall-procedure, CCM is decomposed into a number of correlation matrices by spiliting its elements into the number of elements corresponding to all training patterns. Recalled patterns are obtained by multiplying input pattern with all correlation matrices and selecting a pattern which has the smallest value of energy function. By using a CBAM model, we have some advantages. First, all pattern having less than 20% of noise can be recalled. Second, memory capacity of CBAM model, can be further increased to include English alphabets or patterns. Third, learning time of CBAM model can be reduced greatly because of operation to make CCM.

  • PDF