2021
DOI: 10.1007/s40747-021-00380-3
|View full text |Cite
|
Sign up to set email alerts
|

Differential evolution algorithm with population knowledge fusion strategy for image registration

Abstract: Image registration is a challenging NP-hard problem within the computer vision field. The differential evolutionary algorithm is a simple and efficient method to find the best among all the possible common parts of images. To improve the efficiency and accuracy of the registration, a knowledge-fusion-based differential evolution algorithm is proposed, which combines segmentation, gradient descent method, and hybrid selection strategy to enhance the exploration ability in the early stage and the exploitation ab… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 43 publications
0
3
0
Order By: Relevance
“…Sun et al, 2018: In [ 89 ], the authors propose an algorithm derived from DE, called SGD-DE, designed to achieve better registration of remote sensing images. The proposed algorithm divides the population in niches (clusters) and allows different evolution strategies to be applied on each niche.…”
Section: Articlesmentioning
confidence: 99%
“…Sun et al, 2018: In [ 89 ], the authors propose an algorithm derived from DE, called SGD-DE, designed to achieve better registration of remote sensing images. The proposed algorithm divides the population in niches (clusters) and allows different evolution strategies to be applied on each niche.…”
Section: Articlesmentioning
confidence: 99%
“…Michal et al, utilizing GA, submitted a fast-robotic pencil drawing application [29]. Sun, Yu, et al, [30] propounded an image registration technique with the DE algorithm. Liu et al, recommended a collaborative dragonfly algorithm with a novel communication strategy, for the segmentation of multi-thresholding color images [31].…”
Section: Related Workmentioning
confidence: 99%
“…Large-scale global optimization (LSGO) problems involve a large number of variables [1], and the dimensions of the problem are usually greater than 1000. Compared with general optimization problems, the size of the search space increases exponentially as the number of dimensions increases, which is called the "curse of dimensionality" [2]. Traditional optimization algorithms make it difficult to obtain the global optimal solution of the problem [3].…”
Section: Introductionmentioning
confidence: 99%