Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348) 1999
DOI: 10.1109/icip.1999.822901
|View full text |Cite
|
Sign up to set email alerts
|

On zerotree quantization for embedded wavelet packet image coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0
1

Year Published

2000
2000
2008
2008

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 9 publications
0
4
0
1
Order By: Relevance
“…However, it is difficult to define the parent-child relationships for the diverse structure of WP subbands. Furthermore, even if one can define the hierarchical tree structure for arbitrary WP decompositions, as Meyer et al [11,16] did in their work, the possibility of a tree being insignificant will be reduced further by the fact that WP transform can magnify the dynamic range of high frequency coefficients. Rajpoot and Meyer [16] also observed that the occurrence probability of zerotree in WP decomposition is much lower than that in wavelet decomposition, which explains why their compatible zerotree quantization scheme for WP subbands is not efficient.…”
Section: Comparison Of the Set-partitioning Schemesmentioning
confidence: 95%
See 2 more Smart Citations
“…However, it is difficult to define the parent-child relationships for the diverse structure of WP subbands. Furthermore, even if one can define the hierarchical tree structure for arbitrary WP decompositions, as Meyer et al [11,16] did in their work, the possibility of a tree being insignificant will be reduced further by the fact that WP transform can magnify the dynamic range of high frequency coefficients. Rajpoot and Meyer [16] also observed that the occurrence probability of zerotree in WP decomposition is much lower than that in wavelet decomposition, which explains why their compatible zerotree quantization scheme for WP subbands is not efficient.…”
Section: Comparison Of the Set-partitioning Schemesmentioning
confidence: 95%
“…These constrained basis selection methods may result in a suboptimal WP decomposition that influences the overall coding efficiency. Rajpoot and Meyer et al [11,16] presented a solution to the conflict problem by making great efforts to define and testify the parent-child relationships for arbitrary WP structures. In their work, a set of rules was made to define a zerotree structure, which was termed as compatible zerotree.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, the coefficients of a salient feature in the image will only appear at a single scale that characterizes the feature. Another technical difficulty [21] comes from the fact that we usually cannot define the "parent" subband in a general wavelet packet tree. Because of all these issues, we limit the context to be a spatial context.…”
Section: B Ordering Of the Coefficients And Entropy Codingmentioning
confidence: 99%
“…LSP 过程 对于 LSP (在以前位平面已经重要的系数)中的每一个像素 注意不包括 由上两个过程在本次位平面 刚加入的像素, 执行: 行定义, 如Meyer等人 [11,16] 所作的那样, 一棵树是不重要集合的概率也会因为小波包变换会放 大高频系数的幅值范围而进一步降低. Rajpoot和Meyer [16]…”
unclassified