Logical Kernel of Morphological Associative Memory

• Main Authors: Wei-Chen, Cheng, 鄭為正
• Other Authors: Cheng-Yuan Liou
• Format: Others
• Language: en_US
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/15014129044735246325

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 94 === 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.