Group testing for image compression

Authors:
E. S. Hong;R. E. Ladner
Affiliations:
Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA;-
Venue:
IEEE Transactions on Image Processing
Year:
2002

Citing 0
Cited 7

Image coding with modulated wavelets

Pattern Recognition Letters
Set Partition Coding: Part I of Set Partition Coding and Image Wavelet Coding Systems

Foundations and Trends in Signal Processing
2-stage fault tolerant interval group testing

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Overlaps help: improved bounds for group testing with interval queries

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal group testing strktegies with interval queries and their application to splice site detection

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Threshold group testing

General Theory of Information Transfer and Combinatorics
Group testing with multiple mutually-obscuring positives

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents group testing for wavelets (GTW), a novel embedded-wavelet-based image compression algorithm based on the concept of group testing. We explain how group testing is a generalization of the zerotree coding technique for wavelet-transformed images. We also show that Golomb coding is equivalent to Hwang's group testing algorithm (Du and Hwang 1993). GTW is similar to SPIHT (Said and Pearlman 1996) but replaces SPIHT's significance pass with a new group testing based method. Although no arithmetic coding is implemented, GTW performs competitively with SPIHT's arithmetic coding variant in terms of rate-distortion performance.