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
Dans cet article, un algorithme de quantification à coupe médiane (MCQ) est proposé. Le MCQ est la technique qui réduit les échantillons à valeurs multiples en échantillons à valeurs binaires en prenant de manière adaptative la valeur médiane comme seuil. Dans ce travail, le processus de recherche de la valeur médiane est dérivé de l'algorithme de tri rapide. L'algorithme proposé recherche la valeur médiane petit à petit et les échantillons sont quantifiés pendant le processus de recherche. Tout d'abord, la procédure bit-série est présentée, puis elle est modifiée en procédure bit-parallèle. L'extension à la quantification multi-niveaux est également discutée. Puisque l’algorithme proposé est basé sur des opérations sur bits, il convient à une implémentation matérielle. Ainsi, son architecture matérielle est également proposée. Pour vérifier la signification, pour l'application à l'estimation de mouvement, la performance est estimée à partir du résultat de synthèse du modèle VHDL.
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
Shogo MURAMATSU, Hitoshi KIYA, Akihiko YAMADA, "A Bit-Operation Algorithm of the Median-Cut Quantization and Its Hardware Architecture" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 2, pp. 320-328, February 2000, doi: .
Abstract: In this paper, an algorithm of the median-cut quantization (MCQ) is proposed. MCQ is the technique that reduces multi-valued samples to binary-valued ones by adaptively taking the median value as the threshold. In this work, the search process of the median value is derived from the quick-sort algorithm. The proposed algorithm searches the median value bit by bit, and samples are quantized during the search process. Firstly, the bit-serial procedure is shown, and then it is modified to the bit-parallel procedure. The extension to the multi-level quantization is also discussed. Since the proposed algorithm is based on bit operations, it is suitable for hardware implementation. Thus, its hardware architecture is also proposed. To verify the significance, for the application to the motion estimation, the performance is estimated from the synthesis result of the VHDL model.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_2_320/_p
Copier
@ARTICLE{e83-a_2_320,
author={Shogo MURAMATSU, Hitoshi KIYA, Akihiko YAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Bit-Operation Algorithm of the Median-Cut Quantization and Its Hardware Architecture},
year={2000},
volume={E83-A},
number={2},
pages={320-328},
abstract={In this paper, an algorithm of the median-cut quantization (MCQ) is proposed. MCQ is the technique that reduces multi-valued samples to binary-valued ones by adaptively taking the median value as the threshold. In this work, the search process of the median value is derived from the quick-sort algorithm. The proposed algorithm searches the median value bit by bit, and samples are quantized during the search process. Firstly, the bit-serial procedure is shown, and then it is modified to the bit-parallel procedure. The extension to the multi-level quantization is also discussed. Since the proposed algorithm is based on bit operations, it is suitable for hardware implementation. Thus, its hardware architecture is also proposed. To verify the significance, for the application to the motion estimation, the performance is estimated from the synthesis result of the VHDL model.},
keywords={},
doi={},
ISSN={},
month={February},}
Copier
TY - JOUR
TI - A Bit-Operation Algorithm of the Median-Cut Quantization and Its Hardware Architecture
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 320
EP - 328
AU - Shogo MURAMATSU
AU - Hitoshi KIYA
AU - Akihiko YAMADA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2000
AB - In this paper, an algorithm of the median-cut quantization (MCQ) is proposed. MCQ is the technique that reduces multi-valued samples to binary-valued ones by adaptively taking the median value as the threshold. In this work, the search process of the median value is derived from the quick-sort algorithm. The proposed algorithm searches the median value bit by bit, and samples are quantized during the search process. Firstly, the bit-serial procedure is shown, and then it is modified to the bit-parallel procedure. The extension to the multi-level quantization is also discussed. Since the proposed algorithm is based on bit operations, it is suitable for hardware implementation. Thus, its hardware architecture is also proposed. To verify the significance, for the application to the motion estimation, the performance is estimated from the synthesis result of the VHDL model.
ER -