Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders

Zhen Liu, Lina Karam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The basis of compression is redundancy removal. In digital image compression, discrete wavelet transform (DWT) is applied to remove the inter-pixel redundancies. Although the DWT is very powerful at removing the linear redundancy, there are still various correlations left in the DWT coefficients. These correlations can be modeled as within-subband clustering(Intra) and cross-subband similarity(Inter). The success of recent wavelet image coders can be mainly attributed to the innovative strategies for data organization and representation that exploit these Inter and Intra correlations one way or the other. In this paper, we try to quantify the performance loss if these correlations are removed. Experiments are performed on two best zero-tree coders: set partitioning in hierarchical frees(SPIHT) and set partitioned embedded block coder(SPECK). After recapitulate the data organization adopted in SPIHT and SPECK in a more general tree formation framework, a block or coefficient based pseudo-randomization is applied to remove the Inter, Intra correlation. Our experimental results indicate that the performance loss due to the removal of Intra correlation is much bigger than the performance loss due to the removal of Inter correlation. Therefore, the excellent PSNR performance of the well-known SPIHT algorithm should be much credited for the data structure that exploit the Intra correlation although only the Inter correlation is widely mentioned in the previous literature.

Original languageEnglish (US)
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
EditorsM.B. Matthews
Pages1730-1734
Number of pages5
Volume2
StatePublished - 2002
EventThe Thirty-Sixth Asilomar Conference on Signals Systems and Computers - Pacific Groove, CA, United States
Duration: Nov 3 2002Nov 6 2002

Other

OtherThe Thirty-Sixth Asilomar Conference on Signals Systems and Computers
CountryUnited States
CityPacific Groove, CA
Period11/3/0211/6/02

Fingerprint

Discrete wavelet transforms
Redundancy
Image compression
Data structures
Pixels
Experiments

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Hardware and Architecture

Cite this

Liu, Z., & Karam, L. (2002). Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders. In M. B. Matthews (Ed.), Conference Record of the Asilomar Conference on Signals, Systems and Computers (Vol. 2, pp. 1730-1734)

Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders. / Liu, Zhen; Karam, Lina.

Conference Record of the Asilomar Conference on Signals, Systems and Computers. ed. / M.B. Matthews. Vol. 2 2002. p. 1730-1734.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, Z & Karam, L 2002, Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders. in MB Matthews (ed.), Conference Record of the Asilomar Conference on Signals, Systems and Computers. vol. 2, pp. 1730-1734, The Thirty-Sixth Asilomar Conference on Signals Systems and Computers, Pacific Groove, CA, United States, 11/3/02.
Liu Z, Karam L. Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders. In Matthews MB, editor, Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 2. 2002. p. 1730-1734
Liu, Zhen ; Karam, Lina. / Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders. Conference Record of the Asilomar Conference on Signals, Systems and Computers. editor / M.B. Matthews. Vol. 2 2002. pp. 1730-1734
@inproceedings{31642885901d4e1a918eff0dc6fe3dc9,
title = "Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders",
abstract = "The basis of compression is redundancy removal. In digital image compression, discrete wavelet transform (DWT) is applied to remove the inter-pixel redundancies. Although the DWT is very powerful at removing the linear redundancy, there are still various correlations left in the DWT coefficients. These correlations can be modeled as within-subband clustering(Intra) and cross-subband similarity(Inter). The success of recent wavelet image coders can be mainly attributed to the innovative strategies for data organization and representation that exploit these Inter and Intra correlations one way or the other. In this paper, we try to quantify the performance loss if these correlations are removed. Experiments are performed on two best zero-tree coders: set partitioning in hierarchical frees(SPIHT) and set partitioned embedded block coder(SPECK). After recapitulate the data organization adopted in SPIHT and SPECK in a more general tree formation framework, a block or coefficient based pseudo-randomization is applied to remove the Inter, Intra correlation. Our experimental results indicate that the performance loss due to the removal of Intra correlation is much bigger than the performance loss due to the removal of Inter correlation. Therefore, the excellent PSNR performance of the well-known SPIHT algorithm should be much credited for the data structure that exploit the Intra correlation although only the Inter correlation is widely mentioned in the previous literature.",
author = "Zhen Liu and Lina Karam",
year = "2002",
language = "English (US)",
volume = "2",
pages = "1730--1734",
editor = "M.B. Matthews",
booktitle = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Quantifying the intra and inter subband correlations in the zero-tree-based wavelet image coders

AU - Liu, Zhen

AU - Karam, Lina

PY - 2002

Y1 - 2002

N2 - The basis of compression is redundancy removal. In digital image compression, discrete wavelet transform (DWT) is applied to remove the inter-pixel redundancies. Although the DWT is very powerful at removing the linear redundancy, there are still various correlations left in the DWT coefficients. These correlations can be modeled as within-subband clustering(Intra) and cross-subband similarity(Inter). The success of recent wavelet image coders can be mainly attributed to the innovative strategies for data organization and representation that exploit these Inter and Intra correlations one way or the other. In this paper, we try to quantify the performance loss if these correlations are removed. Experiments are performed on two best zero-tree coders: set partitioning in hierarchical frees(SPIHT) and set partitioned embedded block coder(SPECK). After recapitulate the data organization adopted in SPIHT and SPECK in a more general tree formation framework, a block or coefficient based pseudo-randomization is applied to remove the Inter, Intra correlation. Our experimental results indicate that the performance loss due to the removal of Intra correlation is much bigger than the performance loss due to the removal of Inter correlation. Therefore, the excellent PSNR performance of the well-known SPIHT algorithm should be much credited for the data structure that exploit the Intra correlation although only the Inter correlation is widely mentioned in the previous literature.

AB - The basis of compression is redundancy removal. In digital image compression, discrete wavelet transform (DWT) is applied to remove the inter-pixel redundancies. Although the DWT is very powerful at removing the linear redundancy, there are still various correlations left in the DWT coefficients. These correlations can be modeled as within-subband clustering(Intra) and cross-subband similarity(Inter). The success of recent wavelet image coders can be mainly attributed to the innovative strategies for data organization and representation that exploit these Inter and Intra correlations one way or the other. In this paper, we try to quantify the performance loss if these correlations are removed. Experiments are performed on two best zero-tree coders: set partitioning in hierarchical frees(SPIHT) and set partitioned embedded block coder(SPECK). After recapitulate the data organization adopted in SPIHT and SPECK in a more general tree formation framework, a block or coefficient based pseudo-randomization is applied to remove the Inter, Intra correlation. Our experimental results indicate that the performance loss due to the removal of Intra correlation is much bigger than the performance loss due to the removal of Inter correlation. Therefore, the excellent PSNR performance of the well-known SPIHT algorithm should be much credited for the data structure that exploit the Intra correlation although only the Inter correlation is widely mentioned in the previous literature.

UR - http://www.scopus.com/inward/record.url?scp=0038304991&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038304991&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0038304991

VL - 2

SP - 1730

EP - 1734

BT - Conference Record of the Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, M.B.

ER -