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

An efficient block-matching algorithm for motion-compensated coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
44
0

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 150 publications
(46 citation statements)
references
References 5 publications
0
44
0
Order By: Relevance
“…In the first step, TSS algorith m uses a uniformly allocated checking point pattern. It is not efficient fo r s mall motion estimation others like 2D-logarith mic search (2DLOG) [8] and orthogonal search (OSA) [9] algorith ms which performed searching in either orthogonal or linear direction. 2D-logarith mic search (2DLOG) [8] emp loys a cross search pattern (+) in each step.…”
Section: IImentioning
confidence: 99%
See 1 more Smart Citation
“…In the first step, TSS algorith m uses a uniformly allocated checking point pattern. It is not efficient fo r s mall motion estimation others like 2D-logarith mic search (2DLOG) [8] and orthogonal search (OSA) [9] algorith ms which performed searching in either orthogonal or linear direction. 2D-logarith mic search (2DLOG) [8] emp loys a cross search pattern (+) in each step.…”
Section: IImentioning
confidence: 99%
“…Orthogonal search [9] is a co mb ination of the TSS and 2D -logarithmic search. It has both vertical stage and a horizontal stage for searching for the optimal block.…”
Section: IImentioning
confidence: 99%
“…Xuan Jing et al [94] proposed a modified version of three-step search algorithm for block matching motion estimation, which consists of unrestricted small diamond search pattern that is used to search the central area of defined search window and used in wide range of video applications like movies, sports etc. This algorithm initially defines a search window size and plots 13 points on that search window size.…”
Section: ) Efficient Three Step Searchmentioning
confidence: 99%
“…Orthogonal search algorithm (OSA) [15] starts with three horizontally arranged SPs: one at the centre and two in d/2 distance [ (Fig 2(c)]. Next, two vertically arranged SPs are checked around the minimum BDM point, the step size is halved and the procedure is repeated until the step size equals 1.…”
Section: Characterization Of Algorithmsmentioning
confidence: 99%