Adaptive multiple-candidate hierarchical search for block matching algorithm

Yui Lam Chan; W. C. Siu

doi:10.1049/el:19951116

Adaptive multiple-candidate hierarchical search for block matching algorithm

Yui Lam Chan, W. C. Siu

The Hong Kong Polytechnic University

Research output: Journal article publication › Journal article › Academic research › peer-review

11 Citations (Scopus)

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 hierarchical block matching algorithms. Computer simulations show that the algorithm is very efficient as compared with the traditional coarse-to-fine hierarchical search. Also, it is close to the performance of the exhaustive full search, with a significant reduction on computation.

Original language	English
Pages (from-to)	1637-1639
Number of pages	3
Journal	Electronics Letters
Volume	31
Issue number	19
DOIs	https://doi.org/10.1049/el:19951116
Publication status	Published - 14 Sept 1995

Keywords

Motion estimation
Video coding

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1049/el:19951116

Cite this

@article{38b0769db8854345b1c1020aca2b525f,

title = "Adaptive multiple-candidate hierarchical search for block matching algorithm",

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 hierarchical block matching algorithms. Computer simulations show that the algorithm is very efficient as compared with the traditional coarse-to-fine hierarchical search. Also, it is close to the performance of the exhaustive full search, with a significant reduction on computation.",

keywords = "Motion estimation, Video coding",

author = "Chan, {Yui Lam} and Siu, {W. C.}",

year = "1995",

month = sep,

day = "14",

doi = "10.1049/el:19951116",

language = "English",

volume = "31",

pages = "1637--1639",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "19",

}

TY - JOUR

T1 - Adaptive multiple-candidate hierarchical search for block matching algorithm

AU - Chan, Yui Lam

AU - Siu, W. C.

PY - 1995/9/14

Y1 - 1995/9/14

N2 - 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 hierarchical block matching algorithms. Computer simulations show that the algorithm is very efficient as compared with the traditional coarse-to-fine hierarchical search. Also, it is close to the performance of the exhaustive full search, with a significant reduction on computation.

AB - 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 hierarchical block matching algorithms. Computer simulations show that the algorithm is very efficient as compared with the traditional coarse-to-fine hierarchical search. Also, it is close to the performance of the exhaustive full search, with a significant reduction on computation.

KW - Motion estimation

KW - Video coding

UR - http://www.scopus.com/inward/record.url?scp=0029378083&partnerID=8YFLogxK

U2 - 10.1049/el:19951116

DO - 10.1049/el:19951116

M3 - Journal article

SN - 0013-5194

VL - 31

SP - 1637

EP - 1639

JO - Electronics Letters

JF - Electronics Letters

IS - 19

ER -

Adaptive multiple-candidate hierarchical search for block matching algorithm

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this