Abstract
In this paper, we propose a method that combines the analytic method and a genetic algorithm (GA) for the design of robust templates for cellular neural networks (CNNs). The relationship of the template coefficients derived from the analytic method can serve as possible bounds for the solution space. A genetic algorithm then follows to search for robust templates in the reduced solution space. Due to the bound set by the analytic method, the number of the useless searches in the genetic algorithm can be dramatically reduced from more than 90% to about 30%. Two popular image processing methods: hole-filling and shadowing processes are presented to demonstrate the capability of the proposed method. The robust templates can be readily found in only a few, typically 2 to 5, generations.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
