8 March 2002 New way to search for the best base in wavelet packets
Author Affiliations +
Abstract
The binary-tree best base searching method developed by Coifman and his colleagues is well known and widely used in wavelet packet applications. However, the requirement that the base vectors be chosen from either a parent or its directly related children in the binary-tree structure is a limitation because it doesn't search all possible orthogonal bases and therefore may not provide a optimal result. We have recently found that the set of all possible orthogonal bases in a wavelet packet is much larger than the set searched by the binary-tree method. Based on this observation, we have developed a new way to search the best base among the larger set of orthogonal bases. Preliminary results on 1D signals show that we can achieve considerable improvement in signal compression and feature extraction using the new method. This method can also be readily extended to 2D images for improved image compression, feature extraction, and object classification.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hai-Wen Chen, Hai-Wen Chen, Teresa L. P. Olson, Teresa L. P. Olson, } "New way to search for the best base in wavelet packets", Proc. SPIE 4738, Wavelet and Independent Component Analysis Applications IX, (8 March 2002); doi: 10.1117/12.458745; https://doi.org/10.1117/12.458745
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Nonseparable 2D orthogonal wavelets with vanishing moments
Proceedings of SPIE (August 31 1995)
TBB (true best base) searching method and its applications
Proceedings of SPIE (November 12 2003)
Image compression with embedded multiwavelet coding
Proceedings of SPIE (March 21 1996)
Arithmetic gain of the lifting scheme
Proceedings of SPIE (December 04 2001)
Embedded wavelet coding of arbitrarily shaped objects
Proceedings of SPIE (May 29 2000)

Back to Top