한국지능시스템학회:학술대회논문집 (Proceedings of the Korean Institute of Intelligent Systems Conference)
- 한국퍼지및지능시스템학회 2003년도 ISIS 2003
- /
- Pages.640-643
- /
- 2003
A Walsh-Based Distributed Associative Memory with Genetic Algorithm Maximization of Storage Capacity for Face Recognition
- Kim, Kyung-A (Dept. of Electrical Eng., Pohang University of Science and Technology) ;
- Oh, Se-Young (Dept. of Electrical Eng., Pohang University of Science and Technology)
- 발행 : 2003.09.01
초록
A Walsh function based associative memory is capable of storing m patterns in a single pattern storage space with Walsh encoding of each pattern. Furthermore, each stored pattern can be matched against the stored patterns extremely fast using algorithmic parallel processing. As such, this special type of memory is ideal for real-time processing of large scale information. However this incredible efficiency generates large amount of crosstalk between stored patterns that incurs mis-recognition. This crosstalk is a function of the set of different sequencies [number of zero crossings] of the Walsh function associated with each pattern to be stored. This sequency set is thus optimized in this paper to minimize mis-recognition, as well as to maximize memory saying. In this paper, this Walsh memory has been applied to the problem of face recognition, where PCA is applied to dimensionality reduction. The maximum Walsh spectral component and genetic algorithm (GA) are applied to determine the optimal Walsh function set to be associated with the data to be stored. The experimental results indicate that the proposed methods provide a novel and robust technology to achieve an error-free, real-time, and memory-saving recognition of large scale patterns.
키워드