Abstract
The discrete wavelet transform was originally a linear operator that works on signals that are modeled as functions from the integers into the real or complex numbers. However, many signals have discrete function values. This paper builds on two recent developments: the extension of the discrete wavelet transform to finite-valued signals and the research of nonlinear wavelet transforms triggered by the introduction of the lifting scheme by Sweldens. It defines discrete wavelet transforms as bijective, translation-invariant decompositions of signals that are functions from the integers into any finite set. Such transforms are essentially nonlinear, but they can be calculated very time efficiently since only discrete arithmetic is needed. Properties of these generalized discrete wavelet transforms are given along with an elaborate example of such a transform. In addition, the paper presents some ideas to find explicit examples of discrete wavelet transforms over finite sets. These ideas are used to show that, in case the finite set is a ring, there are much more nonlinear transforms than linear transforms. Finally, the paper exploits this increased number of transforms to do lossless compression of binary images.
Similar content being viewed by others
References
G. Caire, R.L. Grossman, and H. Vincent Poor, “Wavelet transforms associated with finite cyclic groups,” IEEE Transactions on Information Theory, Vol. 39, No. 4, pp. 1157–1166, 1993.
R. Calderbank, I. Daubechies, W. Sweldens, and B.-L. Yeo, “Wavelet transforms that map integers to integers,” Applied and Computational Harmonic Analysis, Vol. 5, No. 3, pp. 332–369, 1998.
I. Daubechies and W. Sweldens, “Factoring wavelet transforms into lifting steps,” Journal of Fourier Analysis and Applications, Vol. 4, No. 3, pp. 245–267, 1998.
Ö.N. Gerek, A.E. Ĉetin, A. Tewfik, and V. Atalay, “Subband domain coding of binary textual images for document archiving,” IEEE Transactions on Image Processing, Vol. 8, No. 10, pp. 1438–1446, 1999.
O.N. Gerek, M.N. Gürcan, and A.E. Ĉetin, “Binary morphological subband decomposition for image coding,” in International Symposium on Time-Frequency and Time-Scale Analysis. IEEE, 1996.
H.J.A.M. Heijmans and J. Goutsias, “Nonlinear multiresolution signal decomposition schemes-Part II: Morphological wavelets,” IEEE Transactions on Image Processing, Vol. 9, No. 11, pp. 1897–1913, 2000.
L. Kamstra, “Discrete wavelet transforms over finite sets which are translation invariant,” Technical Report PNA-R0112, CWI, Amsterdam, The Netherlands, 2001.
A. Klappenecker, M. Holschneider, and K. Flornes, “Two-channel perfect reconstruction FIR filter banks over commutative rings,” Applied and Computational Harmonic Analysis, Vol. 8, pp. 113–121, 2000.
A. Klappenecker, F.U. May, and A. Nückel, “Lossless image compression using wavelets over finite rings and related architectures,” in Akram Aldroubi, Andrew F. Laine, and Michael A. Unser, Eds. Wavelet Applications in Signal and Image Processing V, vol. 3169, SPIE, October 1997, pp. 139–147.
S. MacLane and G. Birkhoff, Algebra, MacMillan, New York, 2nd edition, 1979.
S. Mallat, A Wavelet Tour of Signal Processing, Academic Press: San Diego, 2nd edition, 1999.
M.D. Swanson and A.H. Tewfik, “A binary wavelet decomposition of binary images,” IEEE Transactions on Image Processing, Vol. 5, No. 12, pp. 1637–1650, 1996.
W. Sweldens, “The lifting scheme: A construction of second generation wavelets,” SIAM Journal on Mathematical Analysis, Vol. 29, No. 2, pp. 511–546, 1997.
Author information
Authors and Affiliations
Additional information
The research is sponsored (grant no. 613.006.570) by the Dutch Science Foundation (NWO).
Rights and permissions
About this article
Cite this article
Kamstra, L. Nonlinear Discrete Wavelet Transforms over Finite Sets and an Application to Binary Image Compression. J Math Imaging Vis 23, 321–343 (2005). https://doi.org/10.1007/s10851-005-2026-7
Issue Date:
DOI: https://doi.org/10.1007/s10851-005-2026-7