Logical Kernel of Morphological Associative Memory
Date Issued
2006
Date
2006
Author(s)
Cheng, Wei-Chen
DOI
en-US
Abstract
Morphological associative memory was proposed around seventeen years. The defect is that W only can address erosive noisy patterns and M can only address dilative noisy
patterns. The kernel of morphological associative memory shows a clue for real mankind associative memory. G. X. Ritter proposed using two step associative memory to address
the defect of error tolerance of lattice based associative. They use trail and error to find the kernel Z and try to work out a way to find kernel in mathematics. Japanese M. Hattori find out a solution. The solution is that find the smallest overlap bit as initial kernel patterns, than adjust Z to satisify perfect recall condition, and try to check each bit in Z to see whether it can be removed or not without affecting the recall result. We propose that when calculating kernel, only those bits satisfying certain condition need to be checked. We consider binary case only. This finding can benefit the application of large scale data
processing with morphological assocaitive memory.
Subjects
類神經網路
關聯式記憶
Lattice Theory
neural network
associative memory
morphological associative memories
morphological kernel
morphological neural networks
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922108-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):49ae1c4870d8b40888ebd90e05383c27