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
웨이블릿 계수의 유연한 제로트리 코딩을 사용하는 확장된 EZW 코더를 소개합니다. 유연한 부모-자식 관계는 서브밴드 내의 공간적 의존성뿐만 아니라 다중 스케일 서브밴드 간의 계층적 의존성을 활용하도록 정의됩니다. 새로운 관계는 공간과 규모 측면에서 큰 계수가 이웃에 큰 계수를 가질 가능성이 더 높다는 특정 통계를 기반으로 합니다. 유연한 관계에서, 서브밴드의 상위 계수는 동일한 방향에서 다음으로 미세한 서브밴드의 4개의 하위 계수와 관련됩니다. 각 자식이 지정된 임계값보다 크면 부모는 부모 역할을 기존 자식과 가까운 이웃으로 확장합니다. 중요한 부모에게 스캔할 중요한 자녀가 있는지 여부를 나타내기 위해 프로빙 비트가 도입되었습니다. 이를 통해 중요하지 않은 계수를 과도하게 스캔하는 것을 방지할 수 있습니다. 또한 생성된 기호는 미리 정의된 규칙에 따라 일부 중복성을 제거하기 위해 단순 가변 길이 바이너리 코드로 다시 기호화됩니다. 결과적으로 웨이블릿 계수는 적은 수의 이진 기호로 설명할 수 있습니다. 이 이진 기호 스트림은 추가적인 엔트로피 코딩 없이도 경쟁력 있는 성능을 제공하므로 빠른 인코딩/디코딩이 가능합니다. 더욱이 이진 기호는 적응형 산술 코딩을 통해 더 압축될 수 있습니다. 우리의 실험 결과는 이진 코드 모드와 산술 코드 모드 모두에서 제공됩니다. 또한 이 결과를 EZW 코더의 결과와 비교합니다.
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.
부
Sanghyun JOO, Hisakazu KIKUCHI, Shigenobu SASAKI, Jaeho SHIN, "Flexible Zerotree Coding of Wavelet Coefficients" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 6, pp. 1117-1125, June 1999, doi: .
Abstract: We introduce an extended EZW coder that uses flexible zerotree coding of wavelet coefficients. A flexible parent-child relationship is defined so as to exploit spatial dependencies within a subband as well as hierarchical dependencies among multi-scale subbands. The new relationship is based on a particular statistics that a large coefficient is more likely to have large coefficients in its neighborhood in terms of space and scale. In the flexible relationship, a parent coefficient in a subband relates to four child coefficients in the next finer subband in the same orientation. If each of the children is larger than a given threshold, the parent extends its parentship to the neighbors close to its conventional children. A probing bit is introduced to indicate whether a significant parent has significant children to be scanned. This enables us to avoid excessive scan of insignificant coefficients. Also, produced symbols are re-symbolized into simple variable-length binary codes to remove some redundancy according to a pre-defined rule. As a result, the wavelet coefficients can be described with a small number of binary symbols. This binary symbol stream gives a competitive performance without an additional entropy coding and thus a fast encoding/decoding is possible. Moreover, the binary symbols can be more compressed by an adaptive arithmetic coding. Our experimental results are given in both binary-coded mode and arithmetic-coded mode. Also, these results are compared with those of the EZW coder.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_6_1117/_p
부
@ARTICLE{e82-a_6_1117,
author={Sanghyun JOO, Hisakazu KIKUCHI, Shigenobu SASAKI, Jaeho SHIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Flexible Zerotree Coding of Wavelet Coefficients},
year={1999},
volume={E82-A},
number={6},
pages={1117-1125},
abstract={We introduce an extended EZW coder that uses flexible zerotree coding of wavelet coefficients. A flexible parent-child relationship is defined so as to exploit spatial dependencies within a subband as well as hierarchical dependencies among multi-scale subbands. The new relationship is based on a particular statistics that a large coefficient is more likely to have large coefficients in its neighborhood in terms of space and scale. In the flexible relationship, a parent coefficient in a subband relates to four child coefficients in the next finer subband in the same orientation. If each of the children is larger than a given threshold, the parent extends its parentship to the neighbors close to its conventional children. A probing bit is introduced to indicate whether a significant parent has significant children to be scanned. This enables us to avoid excessive scan of insignificant coefficients. Also, produced symbols are re-symbolized into simple variable-length binary codes to remove some redundancy according to a pre-defined rule. As a result, the wavelet coefficients can be described with a small number of binary symbols. This binary symbol stream gives a competitive performance without an additional entropy coding and thus a fast encoding/decoding is possible. Moreover, the binary symbols can be more compressed by an adaptive arithmetic coding. Our experimental results are given in both binary-coded mode and arithmetic-coded mode. Also, these results are compared with those of the EZW coder.},
keywords={},
doi={},
ISSN={},
month={June},}
부
TY - JOUR
TI - Flexible Zerotree Coding of Wavelet Coefficients
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1117
EP - 1125
AU - Sanghyun JOO
AU - Hisakazu KIKUCHI
AU - Shigenobu SASAKI
AU - Jaeho SHIN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1999
AB - We introduce an extended EZW coder that uses flexible zerotree coding of wavelet coefficients. A flexible parent-child relationship is defined so as to exploit spatial dependencies within a subband as well as hierarchical dependencies among multi-scale subbands. The new relationship is based on a particular statistics that a large coefficient is more likely to have large coefficients in its neighborhood in terms of space and scale. In the flexible relationship, a parent coefficient in a subband relates to four child coefficients in the next finer subband in the same orientation. If each of the children is larger than a given threshold, the parent extends its parentship to the neighbors close to its conventional children. A probing bit is introduced to indicate whether a significant parent has significant children to be scanned. This enables us to avoid excessive scan of insignificant coefficients. Also, produced symbols are re-symbolized into simple variable-length binary codes to remove some redundancy according to a pre-defined rule. As a result, the wavelet coefficients can be described with a small number of binary symbols. This binary symbol stream gives a competitive performance without an additional entropy coding and thus a fast encoding/decoding is possible. Moreover, the binary symbols can be more compressed by an adaptive arithmetic coding. Our experimental results are given in both binary-coded mode and arithmetic-coded mode. Also, these results are compared with those of the EZW coder.
ER -