Abstract
A universal representation for perceptual weighted zerotree coding algorithm is developed, in which the perceptual weighted zerotree coding is decomposed into two separate parts, i.e. visual weighting and zerotree representation, which can be realized independently. Prior to zerotree processing, the extracted full-tree is weighted by using a visual weighting matrix. Any zerotree algorithm like EZW, SPIHT and zerotree space-frequency quantization can be used to encode the weighted coefficients of wavelet transform. In other words, any previous algorithm without perceptual weighting can be easily extended to form a new perceptual coder using the proposed framework. Several examples of visual weighting matrices are given to show the effect of the new method.
| Original language | English |
|---|---|
| Pages (from-to) | 261-265 |
| Number of pages | 5 |
| Journal | IEE Proceedings: Vision, Image and Signal Processing |
| Volume | 147 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 23 Jun 2000 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
User-Defined Keywords
- data compression
- image coding
- image representation
- matrix algebra
- quantisation (signal)
- transform coding
- trees (mathematics)
- video coding
- wavelet transforms
Fingerprint
Dive into the research topics of 'Universal perceptual weighted zerotree coding for image and video compression'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver