Abstract
This paper presents a particle swarm optimization algorithm (PSO) to solve error-bounded polygonal approximation of digital curves. Different from the existing PSO-based methods for polygonal approximation problem, the mutation operators borrowed from genetic algorithms, are incorporated into the PSO, so we call it MPSO. This scheme can increase the diversity of the population and help the particles effectively escape from the local optimum. Experiments were performed on three commonly used benchmark curves to test the effectiveness of the proposed MPSO. The results manifest that the proposed MPSO has the higher performance than the existing GA-based methods and PSO methods.
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.
