Translator Disclaimer
5 December 2001 Discrete wavelet transforms over finite sets: a general approach
Author Affiliations +
Abstract
The discrete wavelet transform was introduced as a linear operator. It works on signals that are modeled as functions from the integers into the real or complex numbers. Since many signals have finite function values, a linear discrete wavelet transform over a finite ring has been proposed recently. Another recent development is the research of nonlinear wavelet transforms triggered by the introduction of Sweldens' lifting scheme. This paper builds on these developments and defines an essentially nonlinear translation invariant discrete wavelet transform that works on signals that are functions from the integers into any finite set. As only discrete arithmetic is needed, such transforms can be calculated very time efficiently. The basic properties of these generalized discrete wavelet transforms are given along with explicit examples.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lute Kamstra "Discrete wavelet transforms over finite sets: a general approach", Proc. SPIE 4478, Wavelets: Applications in Signal and Image Processing IX, (5 December 2001); https://doi.org/10.1117/12.449720
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Balanced multiwavelet bases based on symmetric FIR filters
Proceedings of SPIE (October 26 1999)
Wavelets and signal processing
Proceedings of SPIE (March 22 1996)
Fast approximate Fourier transform via wavelets transform
Proceedings of SPIE (October 23 1996)
Design of low-complexity wavelet-based image codec
Proceedings of SPIE (August 19 1998)
Fast computation of the 2D discrete wavelet transform
Proceedings of SPIE (August 06 1993)
Minimum memory implementations of the lifting scheme
Proceedings of SPIE (December 04 2000)

Back to Top