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
pandangan teks lengkap
112
Mereka bentuk pengkuantiti optimum boleh dianggap sebagai masalah pengoptimuman mencari indeks pengkuantitian yang meminimumkan ralat pengkuantitian. Satu penyelesaian kepada masalah pengoptimuman, kuantisasi DP, adalah berdasarkan pengaturcaraan dinamik. Sesetengah aplikasi, seperti codec berskala bit-depth dan pemetaan nada, memerlukan pembinaan berbilang pengkuantiti dengan tahap pengkuantitian yang berbeza, contohnya, daripada 12bit/saluran kepada 10bit/saluran dan 8bit/saluran. Malangnya, pengkuantitian DP yang disebutkan di atas mengoptimumkan pengkuantiti untuk hanya satu tahap pengkuantitian. Iaitu, ia tidak dapat mengoptimumkan berbilang pengkuantiti secara serentak. Oleh itu, apabila pengkuantitian DP digunakan untuk mereka bentuk pengkuantiti berbilang, terdapat banyak pengiraan berlebihan dalam proses pengoptimuman. Kertas ini mencadangkan pengkuantitian DP lanjutan dengan algoritma pengurangan kerumitan untuk reka bentuk optimum berbilang pengkuantiti. Eksperimen menunjukkan bahawa algoritma yang dicadangkan mengurangkan kerumitan sebanyak 20.8%, secara purata, berbanding pengkuantitian DP konvensional.
Yukihiro BANDOH
NTT Corporation
Seishi TAKAMURA
NTT Corporation
Hideaki KIMATA
NTT Corporation
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.
Salinan
Yukihiro BANDOH, Seishi TAKAMURA, Hideaki KIMATA, "Multi-Layered DP Quantization Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 12, pp. 1552-1561, December 2020, doi: 10.1587/transfun.2020SMP0028.
Abstract: Designing an optimum quantizer can be treated as the optimization problem of finding the quantization indices that minimize the quantization error. One solution to the optimization problem, DP quantization, is based on dynamic programming. Some applications, such as bit-depth scalable codec and tone mapping, require the construction of multiple quantizers with different quantization levels, for example, from 12bit/channel to 10bit/channel and 8bit/channel. Unfortunately, the above mentioned DP quantization optimizes the quantizer for just one quantization level. That is, it is unable to simultaneously optimize multiple quantizers. Therefore, when DP quantization is used to design multiple quantizers, there are many redundant computations in the optimization process. This paper proposes an extended DP quantization with a complexity reduction algorithm for the optimal design of multiple quantizers. Experiments show that the proposed algorithm reduces complexity by 20.8%, on average, compared to conventional DP quantization.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020SMP0028/_p
Salinan
@ARTICLE{e103-a_12_1552,
author={Yukihiro BANDOH, Seishi TAKAMURA, Hideaki KIMATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multi-Layered DP Quantization Algorithm},
year={2020},
volume={E103-A},
number={12},
pages={1552-1561},
abstract={Designing an optimum quantizer can be treated as the optimization problem of finding the quantization indices that minimize the quantization error. One solution to the optimization problem, DP quantization, is based on dynamic programming. Some applications, such as bit-depth scalable codec and tone mapping, require the construction of multiple quantizers with different quantization levels, for example, from 12bit/channel to 10bit/channel and 8bit/channel. Unfortunately, the above mentioned DP quantization optimizes the quantizer for just one quantization level. That is, it is unable to simultaneously optimize multiple quantizers. Therefore, when DP quantization is used to design multiple quantizers, there are many redundant computations in the optimization process. This paper proposes an extended DP quantization with a complexity reduction algorithm for the optimal design of multiple quantizers. Experiments show that the proposed algorithm reduces complexity by 20.8%, on average, compared to conventional DP quantization.},
keywords={},
doi={10.1587/transfun.2020SMP0028},
ISSN={1745-1337},
month={December},}
Salinan
TY - JOUR
TI - Multi-Layered DP Quantization Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1552
EP - 1561
AU - Yukihiro BANDOH
AU - Seishi TAKAMURA
AU - Hideaki KIMATA
PY - 2020
DO - 10.1587/transfun.2020SMP0028
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2020
AB - Designing an optimum quantizer can be treated as the optimization problem of finding the quantization indices that minimize the quantization error. One solution to the optimization problem, DP quantization, is based on dynamic programming. Some applications, such as bit-depth scalable codec and tone mapping, require the construction of multiple quantizers with different quantization levels, for example, from 12bit/channel to 10bit/channel and 8bit/channel. Unfortunately, the above mentioned DP quantization optimizes the quantizer for just one quantization level. That is, it is unable to simultaneously optimize multiple quantizers. Therefore, when DP quantization is used to design multiple quantizers, there are many redundant computations in the optimization process. This paper proposes an extended DP quantization with a complexity reduction algorithm for the optimal design of multiple quantizers. Experiments show that the proposed algorithm reduces complexity by 20.8%, on average, compared to conventional DP quantization.
ER -