A High-Speed Closest Codeword Search Algorithm for Vector Quantization Using the Pyramid Structure of Codewords
-
- SWILEM Ahmed
- Graduate School of Natural Science Technology, Kanazawa University
-
- IMAMURA Kousuke
- Department of Information and Systems Engineering, Kanazawa University
-
- HASHIMOTO Hideo
- Department of Information and Systems Engineering, Kanazawa University
書誌事項
- タイトル別名
-
- High Speed Closest Codeword Search Algorithm for Vector Quantization Using the Pyramid Structure of Codewords
この論文をさがす
抄録
Vector quantization (VQ) for image compression requires expensive time to find the closest codeword in both encoding and codebook design. In this paper, we propose a high-speed closest codeword search algorithm applicable to both encoding and codebook design for VQ including entropy-constrained vector quantization (ECVQ). By using a lighter modified distortion measure, we propose an appropriate topological structure of training vectors and codewords to eliminate unnecessary matching operations from the search procedure. This algorithm allows significant acceleration in the codebook design process. Experimental results are presented on image block data. These results confirm the effectiveness of our proposed algorithm.
収録刊行物
-
- 画像電子学会誌
-
画像電子学会誌 34 (5), 653-662, 2005
一般社団法人 画像電子学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204612057216
-
- NII論文ID
- 130004870300
-
- NII書誌ID
- AN00041650
-
- ISSN
- 13480316
- 02859831
-
- NDL書誌ID
- 7691474
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可