Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) 1999
DOI: 10.1109/dcc.1999.785691
|View full text |Cite
|
Sign up to set email alerts
|

Zerotree coding of wavelet coefficients for image data on arbitrarily shaped support

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…In 2000, Li and Li [8] proposed a simple algorithm for shape-adaptive wavelet transform (SAWT), which works seamlessly with objects of arbitrary geometry. At about the same time, various algorithms were developed [9], [10] to efficiently encode the coefficients produced by SAWT, with very promising results. We used some of these tools for the compression of multispectral images in [6] and [7], where, unlike in [1], the focus was on the encoding of compact individual regions rather than classes and only global spectral transforms were used.…”
Section: Improved Class-based Coding Of Multispectral Images With Shamentioning
confidence: 98%
See 1 more Smart Citation
“…In 2000, Li and Li [8] proposed a simple algorithm for shape-adaptive wavelet transform (SAWT), which works seamlessly with objects of arbitrary geometry. At about the same time, various algorithms were developed [9], [10] to efficiently encode the coefficients produced by SAWT, with very promising results. We used some of these tools for the compression of multispectral images in [6] and [7], where, unlike in [1], the focus was on the encoding of compact individual regions rather than classes and only global spectral transforms were used.…”
Section: Improved Class-based Coding Of Multispectral Images With Shamentioning
confidence: 98%
“…Class-adaptive KLT will not be changed as it stands at the core of the class-oriented approach. The major innovations take place in the two spatial-domain coding blocks, where DCT (i.e., data linearization followed by 1-D-DCT) is replaced by SAWT and scalar quantization by shape-adaptive set partitioning in hierarchical trees (SPIHT) coding (SA-SPIHT) [9], which is a version of the well-known bit-plane coder SPIHT [12], adapted to work on arbitrary-geometry support. Although both techniques are already described in the literature, there are some points that merit discussion.…”
Section: Wavelet-based Cbcmentioning
confidence: 99%
“…Especially important for our needs, it can be readily modified to encode images of arbitrary geometry after a shape-adaptive WT. In our own implementation [43] (similar to that formerly proposed in [44] and further refined in [45]), we introduce only two major changes with respect to the basic algorithm. First, only active nodes, that is nodes belonging to the support of the SA-WT of the object, are considered while scanning a spatial orientation tree.…”
Section: Region Coding and Shape-adaptive Spihtmentioning
confidence: 99%
“…To this end, in modern embedded wavelet coders, one employs a SA-DWT [13] that transforms only opaque regions in the image. For shape-adaptive SPIHT (SA-SPIHT) coding, transparent regions are considered to be permanently insignificant, as in [15]. In this case, zerotree structures aggregate large regions of transparent coefficients into zerotree symbols along with the opaque insignificant coefficients.…”
Section: A Shape-adaptive Codingmentioning
confidence: 99%