IEICE TRANSACTIONS on Communications
A Novel Adaptive Pixel Decimation for Block Motion Vector Estimation
Summary :
This paper presents a novel approach to pixel decimation for motion estimation in video coding. Early techniques of pixel decimation use regular pixel patterns to evaluate matching criterion. Recent techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques require an initial division of a block into a set of uniform regions and therefore are only locally-adaptive in essence. In this paper, we present a globally-adaptive scheme for pixel decimation, in which no regions are fixed at the beginning and pixels are selected only if they have features important to the determination of a match. The experiment results show that when no more than 40 pixels are selected out of a 16
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.1 pp.188-191
- Publication Date
- 1999/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Source Encoding
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yankang WANG, Yanqun WANG, Hideo KURODA, "A Novel Adaptive Pixel Decimation for Block Motion Vector Estimation" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 1, pp. 188-191, January 1999, doi: .
Abstract: This paper presents a novel approach to pixel decimation for motion estimation in video coding. Early techniques of pixel decimation use regular pixel patterns to evaluate matching criterion. Recent techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques require an initial division of a block into a set of uniform regions and therefore are only locally-adaptive in essence. In this paper, we present a globally-adaptive scheme for pixel decimation, in which no regions are fixed at the beginning and pixels are selected only if they have features important to the determination of a match. The experiment results show that when no more than 40 pixels are selected out of a 16
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_1_188/_p
Copy
@ARTICLE{e82-b_1_188,
author={Yankang WANG, Yanqun WANG, Hideo KURODA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Novel Adaptive Pixel Decimation for Block Motion Vector Estimation},
year={1999},
volume={E82-B},
number={1},
pages={188-191},
abstract={This paper presents a novel approach to pixel decimation for motion estimation in video coding. Early techniques of pixel decimation use regular pixel patterns to evaluate matching criterion. Recent techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques require an initial division of a block into a set of uniform regions and therefore are only locally-adaptive in essence. In this paper, we present a globally-adaptive scheme for pixel decimation, in which no regions are fixed at the beginning and pixels are selected only if they have features important to the determination of a match. The experiment results show that when no more than 40 pixels are selected out of a 16
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - A Novel Adaptive Pixel Decimation for Block Motion Vector Estimation
T2 - IEICE TRANSACTIONS on Communications
SP - 188
EP - 191
AU - Yankang WANG
AU - Yanqun WANG
AU - Hideo KURODA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 1999
AB - This paper presents a novel approach to pixel decimation for motion estimation in video coding. Early techniques of pixel decimation use regular pixel patterns to evaluate matching criterion. Recent techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques require an initial division of a block into a set of uniform regions and therefore are only locally-adaptive in essence. In this paper, we present a globally-adaptive scheme for pixel decimation, in which no regions are fixed at the beginning and pixels are selected only if they have features important to the determination of a match. The experiment results show that when no more than 40 pixels are selected out of a 16
ER -
English
