The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La technique d'estimation de mouvement basée sur des blocs est adoptée par diverses normes de codage vidéo pour réduire la redondance temporelle dans les séquences vidéo. Le cœur de cette technique est l’algorithme de recherche mis en œuvre pour trouver l’emplacement du bloc le mieux adapté. En effet, l’algorithme de recherche complète est l’algorithme de recherche le plus simple et optimal, mais exigeant en termes de calcul. Par conséquent, de nombreux algorithmes de recherche rapides et sous-optimaux ont été proposés. La réduction du nombre d'emplacements recherchés est l'approche utilisée pour réduire la charge de calcul d'une recherche complète. Dans cet article, une hybridation entre un algorithme de recherche adaptative et l’algorithme de recherche complet est proposée. L'algorithme de recherche adaptative bénéficie de la corrélation au sein des blocs adjacents spatiaux et temporels. En même temps, des critères de correspondance basés sur un domaine de caractéristiques sont utilisés pour réduire la complexité résultant de l'application des critères conventionnels basés sur des pixels. Il est démontré que l'algorithme proposé produit des performances de bonne qualité et nécessite moins de temps de calcul par rapport aux algorithmes d'appariement de blocs populaires.
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.
Copier
Mohamed GHONEIM, Norimichi TSUMURA, Toshiya NAKAGUCHI, Takashi YAHAGI, Yoichi MIYAKE, "A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 310-318, February 2009, doi: 10.1587/transinf.E92.D.310.
Abstract: The block based motion estimation technique is adopted by various video coding standards to reduce the temporal redundancy in video sequences. The core of that technique is the search algorithm implemented to find the location of the best matched block. Indeed, the full search algorithm is the most straightforward and optimal but computationally demanding search algorithm. Consequently, many fast and suboptimal search algorithms have been proposed. Reduction of the number of location being searched is the approach used to decrease the computational load of full search. In this paper, hybridization between an adaptive search algorithm and the full search algorithm is proposed. The adaptive search algorithm benefits from the correlation within spatial and temporal adjacent blocks. At the same time, a feature domain based matching criteria is used to reduce the complexity resulting from applying the pixel based conventional criteria. It is shown that the proposed algorithm produces good quality performance and requires less computational time compared with popular block matching algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.310/_p
Copier
@ARTICLE{e92-d_2_310,
author={Mohamed GHONEIM, Norimichi TSUMURA, Toshiya NAKAGUCHI, Takashi YAHAGI, Yoichi MIYAKE, },
journal={IEICE TRANSACTIONS on Information},
title={A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections},
year={2009},
volume={E92-D},
number={2},
pages={310-318},
abstract={The block based motion estimation technique is adopted by various video coding standards to reduce the temporal redundancy in video sequences. The core of that technique is the search algorithm implemented to find the location of the best matched block. Indeed, the full search algorithm is the most straightforward and optimal but computationally demanding search algorithm. Consequently, many fast and suboptimal search algorithms have been proposed. Reduction of the number of location being searched is the approach used to decrease the computational load of full search. In this paper, hybridization between an adaptive search algorithm and the full search algorithm is proposed. The adaptive search algorithm benefits from the correlation within spatial and temporal adjacent blocks. At the same time, a feature domain based matching criteria is used to reduce the complexity resulting from applying the pixel based conventional criteria. It is shown that the proposed algorithm produces good quality performance and requires less computational time compared with popular block matching algorithms.},
keywords={},
doi={10.1587/transinf.E92.D.310},
ISSN={1745-1361},
month={February},}
Copier
TY - JOUR
TI - A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections
T2 - IEICE TRANSACTIONS on Information
SP - 310
EP - 318
AU - Mohamed GHONEIM
AU - Norimichi TSUMURA
AU - Toshiya NAKAGUCHI
AU - Takashi YAHAGI
AU - Yoichi MIYAKE
PY - 2009
DO - 10.1587/transinf.E92.D.310
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2009
AB - The block based motion estimation technique is adopted by various video coding standards to reduce the temporal redundancy in video sequences. The core of that technique is the search algorithm implemented to find the location of the best matched block. Indeed, the full search algorithm is the most straightforward and optimal but computationally demanding search algorithm. Consequently, many fast and suboptimal search algorithms have been proposed. Reduction of the number of location being searched is the approach used to decrease the computational load of full search. In this paper, hybridization between an adaptive search algorithm and the full search algorithm is proposed. The adaptive search algorithm benefits from the correlation within spatial and temporal adjacent blocks. At the same time, a feature domain based matching criteria is used to reduce the complexity resulting from applying the pixel based conventional criteria. It is shown that the proposed algorithm produces good quality performance and requires less computational time compared with popular block matching algorithms.
ER -