1992
DOI: 10.1016/0923-5965(92)90035-e
|View full text |Cite
|
Sign up to set email alerts
|

A new block-based motion estimation algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

1993
1993
1999
1999

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…The initial search area could be reduced by exploiting corrections of motion vectors between spatial and temporal adjacent blocks [12], [29].…”
Section: A Fast Block-matching Motion Estimation Algorithmsmentioning
confidence: 99%
“…The initial search area could be reduced by exploiting corrections of motion vectors between spatial and temporal adjacent blocks [12], [29].…”
Section: A Fast Block-matching Motion Estimation Algorithmsmentioning
confidence: 99%
“…Each of two methods has its own strong points and weak points. In our previous paper [5], based on the investigation of the different motion estimation algorithms, a new type block-based motion estimation algorithm was proposed and was successfully applied in motion-compensated predictive coding. The motion estimation algorithm is a hybrid version of the block-recursive method and the block-matching method, and it has advantages of high estimation accuracy and fast convergence speed.…”
Section: Motion Estimation Algorithmmentioning
confidence: 99%
“…The motion estimation algorithm is a hybrid version of the block-recursive method and the block-matching method, and it has advantages of high estimation accuracy and fast convergence speed. For the details of the algorithm and its performance, interested readers can refer to the articles [5,6].…”
Section: Motion Estimation Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach was described in [1], 121 and is extended here to zoom motion. The proposed neural network method produces PSNRs 4 to 11 dB higher than the full search method and 3 to 6 dB higher than some very recent algorithms [3], with concomitant higher compression ratios.…”
Section: Introductionmentioning
confidence: 92%