In this letter, a new scheme of designing multilevel BTC coding is proposed. The optimal quantization can obtain by selecting the quantization threshold with an exhaustive search. However, it requires an enormous amount of computation and is thus impractical while we take an exhaustive search for the multilevel BTC. A two-steps searching method is applied to reduce the computational complexity. Comparisons of results with various methods have verified that the proposed method approach to the optimal quantization with little computation complexity.
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.
Copy
Wen-Jan CHEN, "Multilevel Block Truncation Coding of Two Steps Searching" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 8, pp. 1977-1980, August 2001, doi: .
Abstract: In this letter, a new scheme of designing multilevel BTC coding is proposed. The optimal quantization can obtain by selecting the quantization threshold with an exhaustive search. However, it requires an enormous amount of computation and is thus impractical while we take an exhaustive search for the multilevel BTC. A two-steps searching method is applied to reduce the computational complexity. Comparisons of results with various methods have verified that the proposed method approach to the optimal quantization with little computation complexity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_8_1977/_p
Copy
@ARTICLE{e84-a_8_1977,
author={Wen-Jan CHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multilevel Block Truncation Coding of Two Steps Searching},
year={2001},
volume={E84-A},
number={8},
pages={1977-1980},
abstract={In this letter, a new scheme of designing multilevel BTC coding is proposed. The optimal quantization can obtain by selecting the quantization threshold with an exhaustive search. However, it requires an enormous amount of computation and is thus impractical while we take an exhaustive search for the multilevel BTC. A two-steps searching method is applied to reduce the computational complexity. Comparisons of results with various methods have verified that the proposed method approach to the optimal quantization with little computation complexity.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Multilevel Block Truncation Coding of Two Steps Searching
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1977
EP - 1980
AU - Wen-Jan CHEN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2001
AB - In this letter, a new scheme of designing multilevel BTC coding is proposed. The optimal quantization can obtain by selecting the quantization threshold with an exhaustive search. However, it requires an enormous amount of computation and is thus impractical while we take an exhaustive search for the multilevel BTC. A two-steps searching method is applied to reduce the computational complexity. Comparisons of results with various methods have verified that the proposed method approach to the optimal quantization with little computation complexity.
ER -