Abstract
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs are proposed for selecting bases in wavelet packet transforms. These new methods are compared with the best bases and additive information costs of Coifman and Wickerhauser (see IEEE Trans. Information Theory, vol.38, p.713-18, 1992). All near-best and best bases were also compared with the matching pursuit decomposition of Mallat and Zhang (see IEEE Trans. Signal Processing, vol.41, p.3397-3415, 1993). Preliminary experiments suggest that for the application of time-frequency analysis, a wide variety of results can be obtained with the different methods, and that for the application of data compression, the near-best basis selected with non-additive costs may outperform the best basis selected with additive costs. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
