2021
DOI: 10.1007/978-981-33-6104-1_2
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Non-rigid Demons Registration Using Flower Pollination Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 56 publications
0
3
0
Order By: Relevance
“…From Table 4, it is clearly realized that after the 20th iteration, the convergence was achieved and the best fitness value obtained was of 0.9184. As previously noted, the best fitness was the correlation value [36] between the reference and resultant images. The original, reference and registered images are shown in Fig.…”
Section: Discussionmentioning
confidence: 85%
See 2 more Smart Citations
“…From Table 4, it is clearly realized that after the 20th iteration, the convergence was achieved and the best fitness value obtained was of 0.9184. As previously noted, the best fitness was the correlation value [36] between the reference and resultant images. The original, reference and registered images are shown in Fig.…”
Section: Discussionmentioning
confidence: 85%
“…It can be observed in Table 4, k 1 , k 2 , and k 3 values for the flower pollination algorithm [36] based affine multimodal registration framework. The iterations were varied from 5 to 30 while keeping the generation set always at 15.…”
Section: Discussionmentioning
confidence: 98%
See 1 more Smart Citation