1993
DOI: 10.1109/76.180692
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic search-window adjustment and interlaced search for block-matching algorithm

Abstract: In interframe video coding, the three-step search (TSS) method is often used for motion estimation, largely due to its simplicity. However, the TSS method sometimes may produce ambiguous search directions and terminate the search at a local minimum. In this paper, techniques to improve the performance of the TSS method are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
1
0

Year Published

1997
1997
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 100 publications
(2 citation statements)
references
References 3 publications
0
1
0
Order By: Relevance
“…By using this method and rotating hexagonal search pattern, the complexity of the encoder is decreased. Rui Fan 31 , improvements in TSS [32][33][34] , logarithmic search 35 , One dimension full search 36 , etc., to speed up the motion estimation process. These algorithms may reduce complexity by reducing the number of search points.…”
Section: Introductionmentioning
confidence: 99%
“…By using this method and rotating hexagonal search pattern, the complexity of the encoder is decreased. Rui Fan 31 , improvements in TSS [32][33][34] , logarithmic search 35 , One dimension full search 36 , etc., to speed up the motion estimation process. These algorithms may reduce complexity by reducing the number of search points.…”
Section: Introductionmentioning
confidence: 99%
“…In order to reduce the processing time of motion estimation, many motion estimation algorithms [1,2] have been developed to decrease the massive computations of block-matching distortion. Diamond search (DS) [3] and Hexagon search (HS) algorithms [4] are the most typical methods.…”
Section: Introductionmentioning
confidence: 99%