Chaotic neural network for learnable associative memory recall

Charles Chia-chuen Hsu, Harold H Szu · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2003

We show that the Fuzzy Membership Function (FMF) is learnable with underlying chaotic neural networks for the open set probability. A sigmoid N-shaped function is used to generate chaotic signals. We postulate that such a chaotic set of innumerable realization forms a FMF exemplified by fuzzy feature maps of eyes, nose, etc., for the invariant face classification. The CNN with FMF plays an important role for fast pattern recognition capability in examples of both habituation and novelty detections. In order to reduce the computation complexity, the nearest-neighborhood weight connection is proposed. In addition, a novel timing-sequence weight-learning algorithm is introduced to increase the capacity and recall of the associative memory. For simplicity, a piece-wise-linear (PWL) N-shaped function was designed and implemented and fabricated in a CMOS chip.

Read the paper · More papers on PaperTik