Share Email Print
cover

Proceedings Paper

New way to search for the best base in wavelet packets
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 8 March 2002
PDF: 12 pages
Proc. SPIE 4738, Wavelet and Independent Component Analysis Applications IX, (8 March 2002); doi: 10.1117/12.458745
Show Author Affiliations
Hai-Wen Chen, Lockheed Martin Missiles and Fire Control (United States)
Teresa L. P. Olson, Lockheed Martin Missiles and Fire Control (United States)


Published in SPIE Proceedings Vol. 4738:
Wavelet and Independent Component Analysis Applications IX
Harold H. Szu; James R. Buss, Editor(s)

© SPIE. Terms of Use
Back to Top