A Bit-Operation Algorithm of the Median-Cut Quantization and Its Hardware Architecture

Shogo MURAMATSU; Hitoshi KIYA; Akihiko YAMADA

A Bit-Operation Algorithm of the Median-Cut Quantization and Its Hardware Architecture

Shogo MURAMATSU, Hitoshi KIYA, Akihiko YAMADA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.2 pp.320-328

Publication Date: 2000/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Intelligent Signal and Image Processing)

Category

Cite this

Copy

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

Copy

@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},}

Copy

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 -