scholarly journals Periodic wavelet frames and time–frequency localization

2014 ◽  
Vol 37 (2) ◽  
pp. 347-359 ◽  
Author(s):  
Elena A. Lebedeva ◽  
Jürgen Prestin
2014 ◽  
Vol 977 ◽  
pp. 532-535
Author(s):  
Qing Jiang Chen ◽  
Yu Zhou Chai ◽  
Chuan Li Cai

Information science focuses on understanding problems from the perspective of the stake holders involved and then applying information and other technologies as needed. A necessary and sufficient condition is identified in term of refinement masks for applying the unitary extension principle for periodic functions to construct tight wavelet frames. Then a theory on the approxi-mation order of truncated tight frame series is established, which facilitates construction of tight periodic wavelet frames with desirable approximation order. The pyramid decomposition scheme is derived based on the generalized multiresolution structure.


2018 ◽  
Vol 5 (1) ◽  
pp. 241-249
Author(s):  
Pavel Andrianov ◽  
Maria Skopina

Mathematics ◽  
2015 ◽  
Vol 3 (4) ◽  
pp. 1171-1191
Author(s):  
Sunita Goyal ◽  
Firdous Shah

Author(s):  
Enrico Capobianco

Function approximation methods based on frames or other overcomplete dictionaries of approximating functions offer advantages over the orthogonal schemes due to the fact that the associated redundancy may lead to better de-noising and reconstruction power. Wavelet packets represent special wavelet frames; they combine overcompleteness with high time-frequency localization power through an optimal frequency-then-time segmentation. Compared to cosine packets, which enable optimal adaptation through time-then-frequency segmentation, wavelet packets show a different time-frequency resolution trade-off that might be useful for analyzing some kinds of non-stationary phenomena. We study the properties of covariance non-stationary stochastic processes whose realizations are observed at very high frequencies; the data are supplied by time series of a stock market return index. For these complex processes the effectiveness of wavelet and cosine packets is explored by implementing entropic optimization, greedy approximation techniques and dimension reduction methods.


Sign in / Sign up

Export Citation Format

Share Document