2012
DOI: 10.1016/j.ins.2012.02.014
|View full text |Cite
|
Sign up to set email alerts
|

On fast and accurate block-based motion estimation algorithms using particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
40
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(40 citation statements)
references
References 18 publications
0
40
0
Order By: Relevance
“…A large number of block matching algorithms have been proposed over the last decades, such as the traditional methods found in [2]- [5], [7], [11], [15]- [16] and [24]. Amongst the available block matching algorithms, full search leads to the best possible match of the block in the reference frame with a block in another frame by calculating the cost function at each possible location in the search window.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A large number of block matching algorithms have been proposed over the last decades, such as the traditional methods found in [2]- [5], [7], [11], [15]- [16] and [24]. Amongst the available block matching algorithms, full search leads to the best possible match of the block in the reference frame with a block in another frame by calculating the cost function at each possible location in the search window.…”
Section: Literature Reviewmentioning
confidence: 99%
“…These algorithms are called sub-optimal because although they are computationally more efficient than the Full Search, they do not result in a quality that is as good as that of the Full Search algorithm [3]. A more recent variant of fast search motion estimation approaches may be found in [7] [14]. The extensive variety of algorithms available for block-based motion estimation makes it difficult to choose between them.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Recently, there have been some attempts in the literature to apply Particle Swarm Optimization (PSO) to solve the problem of ME [29][30][31][32][33][34][35][36]. The PSO-based motion estimation methods introduced in [29][30][31][32][33] either have higher computational complexity [29] or have lower estimation accuracy [30][31][32]35] than several existing fast search methods, such as the Three-Step Search (TSS) and diamond search (DS) method.…”
Section: Introductionmentioning
confidence: 99%
“…PSO particles are initialized in a square or a diamond pattern around the center. In [36], the standard PSO algorithm was modified to meet the stringent constraint of low computational complexity while maintaining high motion estimation accuracy. This is done by employing several strategies to speed up the motion estimation process and gave high motion estimation accuracy as compared to 4SS, DS, and CDS.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation