A Motion Vector Search Algorithm Based on a Simple Search-Block Interpolation Scheme

Yankang WANG; Makoto ANDO; Tomohiro TANIKAWA; Kazuhiro YOSHIDA; Jun YAMASHITA; Hideaki KUZUOKA; Michitaka HIROSE

A Motion Vector Search Algorithm Based on a Simple Search-Block Interpolation Scheme

Yankang WANG, Makoto ANDO, Tomohiro TANIKAWA, Kazuhiro YOSHIDA, Jun YAMASHITA, Hideaki KUZUOKA, Michitaka HIROSE

Full Text Views

0

Share
Cite this

Summary :

This paper presents a block-based motion vector search algorithm for video coding based on an interpolation scheme of search blocks. The basic idea of motion vector estimation between frames is to select a block in the previous frame that best matches a block in the current frame by minimizing the difference between them. In most of the search algorithms, however, the best-match block can only be on a pre-defined grid pattern. Although using a pre-defined pattern increases the search efficiency, it may also reduce the search accuracy. To balance the two aspects and to fully utilize the block information, we propose a strategy, which, instead of selecting from pre-defined blocks, searches for a best match interpolated from the pre-defined blocks. Experiment results demonstrate a better accuracy and efficiency of this search method than some commonly-used methods for different kinds of motion.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.2 pp.384-389

Publication Date: 2004/02/01

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Multimedia Systems

Cite this

Copy

Yankang WANG, Makoto ANDO, Tomohiro TANIKAWA, Kazuhiro YOSHIDA, Jun YAMASHITA, Hideaki KUZUOKA, Michitaka HIROSE, "A Motion Vector Search Algorithm Based on a Simple Search-Block Interpolation Scheme" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 2, pp. 384-389, February 2004, doi: .
Abstract: This paper presents a block-based motion vector search algorithm for video coding based on an interpolation scheme of search blocks. The basic idea of motion vector estimation between frames is to select a block in the previous frame that best matches a block in the current frame by minimizing the difference between them. In most of the search algorithms, however, the best-match block can only be on a pre-defined grid pattern. Although using a pre-defined pattern increases the search efficiency, it may also reduce the search accuracy. To balance the two aspects and to fully utilize the block information, we propose a strategy, which, instead of selecting from pre-defined blocks, searches for a best match interpolated from the pre-defined blocks. Experiment results demonstrate a better accuracy and efficiency of this search method than some commonly-used methods for different kinds of motion.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_2_384/_p

Copy

@ARTICLE{e87-b_2_384,
author={Yankang WANG, Makoto ANDO, Tomohiro TANIKAWA, Kazuhiro YOSHIDA, Jun YAMASHITA, Hideaki KUZUOKA, Michitaka HIROSE, },
journal={IEICE TRANSACTIONS on Communications},
title={A Motion Vector Search Algorithm Based on a Simple Search-Block Interpolation Scheme},
year={2004},
volume={E87-B},
number={2},
pages={384-389},
abstract={This paper presents a block-based motion vector search algorithm for video coding based on an interpolation scheme of search blocks. The basic idea of motion vector estimation between frames is to select a block in the previous frame that best matches a block in the current frame by minimizing the difference between them. In most of the search algorithms, however, the best-match block can only be on a pre-defined grid pattern. Although using a pre-defined pattern increases the search efficiency, it may also reduce the search accuracy. To balance the two aspects and to fully utilize the block information, we propose a strategy, which, instead of selecting from pre-defined blocks, searches for a best match interpolated from the pre-defined blocks. Experiment results demonstrate a better accuracy and efficiency of this search method than some commonly-used methods for different kinds of motion.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - A Motion Vector Search Algorithm Based on a Simple Search-Block Interpolation Scheme
T2 - IEICE TRANSACTIONS on Communications
SP - 384
EP - 389
AU - Yankang WANG
AU - Makoto ANDO
AU - Tomohiro TANIKAWA
AU - Kazuhiro YOSHIDA
AU - Jun YAMASHITA
AU - Hideaki KUZUOKA
AU - Michitaka HIROSE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2004
AB - This paper presents a block-based motion vector search algorithm for video coding based on an interpolation scheme of search blocks. The basic idea of motion vector estimation between frames is to select a block in the previous frame that best matches a block in the current frame by minimizing the difference between them. In most of the search algorithms, however, the best-match block can only be on a pre-defined grid pattern. Although using a pre-defined pattern increases the search efficiency, it may also reduce the search accuracy. To balance the two aspects and to fully utilize the block information, we propose a strategy, which, instead of selecting from pre-defined blocks, searches for a best match interpolated from the pre-defined blocks. Experiment results demonstrate a better accuracy and efficiency of this search method than some commonly-used methods for different kinds of motion.
ER -