Solution of a wavelet crime (Q4524065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1551853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution of a wavelet crime |
scientific article; zbMATH DE number 1551853 |
Statements
15 January 2001
0 references
wavelet
0 references
decomposition algorithm
0 references
pyramid algorithm
0 references
optimal initialization
0 references
0.7403478026390076
0 references
0.7394846677780151
0 references
0.7392779588699341
0 references
Solution of a wavelet crime (English)
0 references
In the wavelet theory, the analysis of a given function \(x\in L^2\) begins by projecting \(x\) onto one of the approximation subspaces. A problem is how to initialize the decomposition algorithm (= pyramid algorithm) when only sampled values of \(x\) are available. Common practice is to use the sampled values of \(x\) directly in the initialization. The authors consider the error resulting from this initialization and propose an optimal initialization adapted from the theory of optimal sampled-data control. For the entire collection see [Zbl 0937.00060].
0 references
