2013 IEEE International Conference on Acoustics, Speech and Signal Processing 2013
DOI: 10.1109/icassp.2013.6638057
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-Random Search algorithm for fast motion estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…The most important advantage of this proposed technique is that it can obtain the optimal MV and maintain the best matching quality. In addition to template search algorithm, prediction search approach and elimination search algorithm, there are many other fast ME algorithms [20–23] are proposed to reduce the computational burden of ME, especially for the high‐complexity H.265/HEVC standard and multiview video coding.…”
Section: Introductionmentioning
confidence: 99%
“…The most important advantage of this proposed technique is that it can obtain the optimal MV and maintain the best matching quality. In addition to template search algorithm, prediction search approach and elimination search algorithm, there are many other fast ME algorithms [20–23] are proposed to reduce the computational burden of ME, especially for the high‐complexity H.265/HEVC standard and multiview video coding.…”
Section: Introductionmentioning
confidence: 99%