Tight wavelet frames via semi-definite programming (Q1958428): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.jat.2010.03.005 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JAT.2010.03.005 / rank | |||
Normal rank |
Latest revision as of 15:49, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight wavelet frames via semi-definite programming |
scientific article |
Statements
Tight wavelet frames via semi-definite programming (English)
0 references
29 September 2010
0 references
The paper studies an optimization approach for multivariate tight wavelet frames in the shift-invariant setting, where the frame generators are defined in Fourier space. The results are based on the characterization of multivariate tight frames with maximal number of vanishing moments in the shift-invariant setting, called the oblique extension principle. Techniques of semi-definite programming allow to show that the existence of a tight frame is equivalent to the existence of a certain matrix from a cone of positive semi-definite matrices, whose entries satisfy linear constraints. A constructive method for computing the frame generators is thus given. The reduction of the number of frame generators in the univariate and the multivariate cases is also addressed. Examples for several subdivision schemes illustrate the theoretical results.
0 references
wavelets
0 references
tight frames
0 references
oblique extension principle
0 references
subdivision semi-definite programming
0 references
0 references
0 references
0 references