Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24681
Title: Adaptive multiple-candidate hierarchical search for block matching algorithm
Authors: Chan, YL 
Siu, WC 
Issue Date: 1995
Publisher: Institution of Engineering and Technology
Source: Electronics letters, 1995, v. 31, no. 19, p. 1637-1639 How to cite?
Journal: Electronics letters 
Abstract: A new adaptive multiple-candidate hierarchical search for the estimation of motion vectors is presented. This technique can eliminate the undesirable problem of local minima in coarse-to-fine hierarchial block matching algorithms. Computer simulations show that the algorithm is very efficient as compared with the traditional coarse-to-fine hierarchial search. Also, it is close to the performance of the exhaustive full search, with a significant reduction on computation.
URI: http://hdl.handle.net/10397/24681
ISSN: 0013-5194
EISSN: 1350-911X
DOI: 10.1049/el:19951116
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Dec 8, 2018

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Dec 15, 2018

Page view(s)

75
Last Week
0
Last month
Citations as of Dec 10, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.