Optimization and assessment of wavelet packet decompositions with evolutionary computation
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Summary: In image compression, the wavelet transformation is a state-of-the-art component. Recently, wavelet packet decomposition has received quite an interest. A popular approach for wavelet packet decomposition is the near-best-basis algorithm using nonadditive cost functions. In contrast to additive cost functions, the wavelet packet decomposition of the near-best-basis algorithm is only suboptimal. We apply methods from the field of evolutionary computation (EC) to test the quality of the near-best-basis results. We observe a phenomenon: the results of the near-best-basis algorithm are inferior in terms of cost-function optimization but are superior in terms of rate/distortion performance compared to EC methods.
- Wavelet packet best basis selection on moderate parallel MIMD architectures
- Measures of Uniform Distribution in Wavelet Based Image Compression
- Wavelet transform application to the compression of images
- New image compression techniques using multiwavelets and multiwavelet packets
- scientific article; zbMATH DE number 1984383
This page was built for publication: Optimization and assessment of wavelet packet decompositions with evolutionary computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885150)
