2013
DOI: 10.1007/978-3-642-39482-9_68
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 14 publications
(16 reference statements)
0
5
0
Order By: Relevance
“… Peak Signal to Noise Ratio (PSNR): The Peak Signal to Noise Ratio (PSNR) is used to measure the performance and it is defined as (Chen et al, 2013):…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“… Peak Signal to Noise Ratio (PSNR): The Peak Signal to Noise Ratio (PSNR) is used to measure the performance and it is defined as (Chen et al, 2013):…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In the DMS-PSO, the population is divided into several small groups. In Chen et al (2013), the DMS-PSO-MP was developed by Discrete Coefficient Mutation (DCM) strategy to improve the local searching ability of DMS-PSO in the MP approach over the anisotropic atom dictionary.…”
Section: Introductionmentioning
confidence: 99%
“…These atoms can be found in each iteration. For an arbitrary image of size × , let {d γ } γ∈Γ are the atoms of the dictionary , where is the set of all indexes and ||d γ || = 1 [21]. The approximation of by projecting it on a vector 0 ∈ is the first step of the MP.…”
Section: Matching Pursuit (Mp)mentioning
confidence: 99%
“…Where the projection of into the atom 0 is < , 0 > 0 , and the residual of the original image is , where the is orthogonal to 0 [21]: 2 (2)…”
Section: Matching Pursuit (Mp)mentioning
confidence: 99%
“…27,28 MSO is recommended for multimodal optimization problems and it is applied successfully to solve image processing problems. 29,30 CSA is also applied in image processing problems. [31][32][33][34][35] Other image and intelligent processing methods proposed in the literature, which are or can be successfully applied in the medical domain, are: echocardiograms analysis using the Fuzzy Gravitational Search algorithm to find the optimal architecture of the modular neural networks 36,37 ; electrocardiogram signals classification using competitive neural networks with the Learning Vector Quantization algorithm 38 ; cardiac arrhythmia classification with Fuzzy K-Nearest Neighbors and neural networks 39 ; and criterion for efficient estimation of areas in noisy digital images based on the usage of the Lin's concordance correlation coefficient.…”
Section: A Comparison Of Nature-inspired Optimization Algorithmsmentioning
confidence: 99%