Using Dynamic Multi-Swarm Particle Swarm Optimizer to Improve the Image Sparse Decomposition Based on Matching Pursuit

Chen Chen, Jing J. Liang, Bo-Yang Qu, Ben Niu

Abstract: In this paper, with projection value being considered as fitness value, the Dynamic Multi-Swarm Particle Swarm Optimizer (DMS-PSO) is applied to improve the best atom searching problem in the Sparse Decomposition of image based on the Matching Pursuit (MP) algorithm. Furthermore, Discrete Coefficient Mutation (DCM) strategy is introduced to enhance the local searching ability of DMS-PSO in the MP approach over the anisotropic atom dictionary. Experimental results indicate the superiority of DMS-PSO with DCM strategy in contrast with other popular versions of PSO.