2018
DOI: 10.1007/s10489-018-1312-1
|View full text |Cite
|
Sign up to set email alerts
|

A new block matching algorithm based on stochastic fractal search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…The SFS algorithm starts the search, as in all the other meta-heuristics, using Equation (9) to randomly generate candidate solutions in the search space [23]:…”
Section: Sfs Methodsmentioning
confidence: 99%
“…The SFS algorithm starts the search, as in all the other meta-heuristics, using Equation (9) to randomly generate candidate solutions in the search space [23]:…”
Section: Sfs Methodsmentioning
confidence: 99%
“…The lowest calculated SAD fitness candidate is selected for the best matches. Due to the fact that all of the search candidates are assessed in full search, based on full search, Motion Estimation yields the optimal solution [6]. Even though a full search provides explicit results, it needs a large amount of computation [7].…”
Section: Normal Full Search Algorithm (Nfs)mentioning
confidence: 99%
“…Application examples of SFS in control systems are presented in (Çelik 2018;Çelik and Gör 2019;Bhatt et al 2019). Motion estimation based on SFS was presented in (Betka et al 2019). In medical field, the SFS was used for image thresholding problem on breast histology imagery (Hinojosa et al 2018).…”
Section: Applications Of Sfs Algorithmmentioning
confidence: 99%