The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Image Sparse Decomposition Algorithm Based on Multi-population Discrete Differential Evolution
Author(s): 
Pages: 900-906
Year: Issue:  10
Journal: Pattern Recognition and Artificial Intelligence

Keyword:  Sparse RepresentationMulti-populationDifferential Evolution(DE)Matching Pursuit(MP);
Abstract: To obtain the sparsest representation of an image using a redundant dictionary is NP-hard,and the existing sub-optimal algorithms for solving this problem such as matching pursuit( MP) are highly complex. An image sparse decomposition algorithm based on multi-population discrete differential evolution for multi-component Gabor dictionaries is proposed. Three sub-populations are adopted to search the best matching atoms in different sub-dictionaries,and the correlation coefficient is used to solve overlap-matching in updating process of residual image. To maintain the population diversity,several mutation operators are employed to generate the offspring population in the proposed algorithm.Experimental results show that the sparse approximation performances of the proposed algorithm are comparable with fast matching pursuit( FMP) algorithm. Meanwhile, the computation speed is improved. The proposed algorithm obtains competitive performance compared with other sparse representation methods based on evolution algorithm. Finally,the rationality of the parameters setting in the proposed algorithm is verified by result analysis.
Related Articles
No related articles found