Abstract

Associative memories are a significant topic in pattern recognition, and therefore, throughout history, numerous memory models have been designed due to their usefulness. One such model is the associative memory minmax, which is highly efficient at learning and recalling patterns as well as being tolerant of high levels of additive and subtractive noise. However, it is not efficient when it comes to mixed noise. To solve this issue in the associative memory minmax, we present the generic model of heteroassociative memory max robust to acquisition noise (mixed noise). This solution is based on understanding the behavior of acquisition noise and mapping the location of noise in binary images and gray-scale through a distance transform. By controlling the location of the noise, the associative memories minmax become highly efficient. Furthermore, our proposed model allows patterns to contain mixed noise while still being able to recall the learned patterns completely. Our results show that the proposed model outperforms a model that has already solved this type of problem and has proven to overcome existing methods that show some solution to mixed noise. Additionally, we demonstrate that our model is applicable to all associative minmax memories with excellent results.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.