A Fast Codebook Design Algorithm for ECVQ Based on Angular Constraint and Hyperplane Decision Rule
Summary :
In this paper, we propose two fast codebook generation algorithms for entropy-constrained vector quantization. The first algorithm uses the angular constraint to reduce the search area and to accelerate the search process in the codebook design. It employs the projection angles of the vectors to a reference line. The second algorithm has feature of using a suitable hyperplane to partition the codebook and image data. These algorithms allow significant acceleration in codebook design process. Experimental results are presented on image block data. These results show that our new algorithms perform better than the previously known methods.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.3 pp.732-739
- Publication Date
- 2004/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Image
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
Ahmed SWILEM, Kousuke IMAMURA, Hideo HASHIMOTO, "A Fast Codebook Design Algorithm for ECVQ Based on Angular Constraint and Hyperplane Decision Rule" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 3, pp. 732-739, March 2004, doi: .
Abstract: In this paper, we propose two fast codebook generation algorithms for entropy-constrained vector quantization. The first algorithm uses the angular constraint to reduce the search area and to accelerate the search process in the codebook design. It employs the projection angles of the vectors to a reference line. The second algorithm has feature of using a suitable hyperplane to partition the codebook and image data. These algorithms allow significant acceleration in codebook design process. Experimental results are presented on image block data. These results show that our new algorithms perform better than the previously known methods.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_3_732/_p
Copy
@ARTICLE{e87-a_3_732,
author={Ahmed SWILEM, Kousuke IMAMURA, Hideo HASHIMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Fast Codebook Design Algorithm for ECVQ Based on Angular Constraint and Hyperplane Decision Rule},
year={2004},
volume={E87-A},
number={3},
pages={732-739},
abstract={In this paper, we propose two fast codebook generation algorithms for entropy-constrained vector quantization. The first algorithm uses the angular constraint to reduce the search area and to accelerate the search process in the codebook design. It employs the projection angles of the vectors to a reference line. The second algorithm has feature of using a suitable hyperplane to partition the codebook and image data. These algorithms allow significant acceleration in codebook design process. Experimental results are presented on image block data. These results show that our new algorithms perform better than the previously known methods.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Fast Codebook Design Algorithm for ECVQ Based on Angular Constraint and Hyperplane Decision Rule
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 732
EP - 739
AU - Ahmed SWILEM
AU - Kousuke IMAMURA
AU - Hideo HASHIMOTO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2004
AB - In this paper, we propose two fast codebook generation algorithms for entropy-constrained vector quantization. The first algorithm uses the angular constraint to reduce the search area and to accelerate the search process in the codebook design. It employs the projection angles of the vectors to a reference line. The second algorithm has feature of using a suitable hyperplane to partition the codebook and image data. These algorithms allow significant acceleration in codebook design process. Experimental results are presented on image block data. These results show that our new algorithms perform better than the previously known methods.
ER -
English
