A new algorithm and architecture to eliminate redundant operations in block-matching (BM) motion estimation is proposed. The key step of this work is to use binary-matching to define image regions with the static background content and then exclude these regions from the actual motion estimation. According to experiments, the approach maintains the highest PSNR, while making as half as less computations in comparison to the adaptive BM or 1/8 of the computations required by the full-search BM. An implementation scheme is outlined.
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.
Copy
Vasily G. MOSHNYAGA, Koichi MASUNAGA, "Reduction of Background Computations in Block-Matching Motion Estimation" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 3, pp. 539-546, March 2004, doi: .
Abstract: A new algorithm and architecture to eliminate redundant operations in block-matching (BM) motion estimation is proposed. The key step of this work is to use binary-matching to define image regions with the static background content and then exclude these regions from the actual motion estimation. According to experiments, the approach maintains the highest PSNR, while making as half as less computations in comparison to the adaptive BM or 1/8 of the computations required by the full-search BM. An implementation scheme is outlined.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_3_539/_p
Copy
@ARTICLE{e87-a_3_539,
author={Vasily G. MOSHNYAGA, Koichi MASUNAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Reduction of Background Computations in Block-Matching Motion Estimation},
year={2004},
volume={E87-A},
number={3},
pages={539-546},
abstract={A new algorithm and architecture to eliminate redundant operations in block-matching (BM) motion estimation is proposed. The key step of this work is to use binary-matching to define image regions with the static background content and then exclude these regions from the actual motion estimation. According to experiments, the approach maintains the highest PSNR, while making as half as less computations in comparison to the adaptive BM or 1/8 of the computations required by the full-search BM. An implementation scheme is outlined.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Reduction of Background Computations in Block-Matching Motion Estimation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 539
EP - 546
AU - Vasily G. MOSHNYAGA
AU - Koichi MASUNAGA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2004
AB - A new algorithm and architecture to eliminate redundant operations in block-matching (BM) motion estimation is proposed. The key step of this work is to use binary-matching to define image regions with the static background content and then exclude these regions from the actual motion estimation. According to experiments, the approach maintains the highest PSNR, while making as half as less computations in comparison to the adaptive BM or 1/8 of the computations required by the full-search BM. An implementation scheme is outlined.
ER -