Optimization and assessment of wavelet packet decompositions with evolutionary computation (Q1885150)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimization and assessment of wavelet packet decompositions with evolutionary computation |
scientific article; zbMATH DE number 2111340
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization and assessment of wavelet packet decompositions with evolutionary computation |
scientific article; zbMATH DE number 2111340 |
Statements
Optimization and assessment of wavelet packet decompositions with evolutionary computation (English)
0 references
28 October 2004
0 references
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.
0 references
image compression
0 references
genetic algorithms
0 references
random search
0 references
0.778160035610199
0 references
0.7485898733139038
0 references
0.7434697151184082
0 references