Abstract
Evolutionary programming(EP) has been applied with success to many numerical and combinatorial optimization problems in recent years. EP has rather slow convergence rates, however, on some function optimization problems. In this paper the Bi-Group evolutionary programming is proposed to overcome the premature convergence. There are two groups in the Bi-Group evolutionary programming. The global group is responsible for searching the whole space. The local group is responsible for searching the local part in detail. The cooperation and specialization between different groups are considered during the algorithm design. The experimental results show the Bi-Group evolutionary programming is efficient in image processing.
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.
