Speech signal reconstruction based on the symmetric tight wavelet frame decomposition

Author(s):  
Souhir Bousselmi ◽  
Kais Ouni
2019 ◽  
Vol 29 (06) ◽  
pp. 1950075
Author(s):  
Yumei Zhang ◽  
Xiangying Guo ◽  
Xia Wu ◽  
Suzhen Shi ◽  
Xiaojun Wu

In this paper, we propose a nonlinear prediction model of speech signal series with an explicit structure. In order to overcome some intrinsic shortcomings, such as traps at the local minimum, improper selection of parameters, and slow convergence rate, which are always caused by improper parameters generated by, typically, the low performance of least mean square (LMS) in updating kernel coefficients of the Volterra model, a uniform searching particle swarm optimization (UPSO) algorithm to optimize the kernel coefficients of the Volterra model is proposed. The second-order Volterra filter (SOVF) speech prediction model based on UPSO is established by using English phonemes, words, and phrases. In order to reduce the complexity of the model, given a user-designed tolerance of errors, we extract the reduced parameter of SOVF (RPSOVF) for acceleration. The experimental results show that in the tasks of single-frame and multiframe speech signals, both UPSO-SOVF and UPSO-RPSOVF are better than LMS-SOVF and PSO-SOVF in terms of root mean square error (RMSE) and mean absolute deviation (MAD). UPSO-SOVF and UPSO-RPSOVF can better reflect trends and regularity of speech signals, which can fully meet the requirements of speech signal prediction. The proposed model presents a nonlinear analysis and valuable model structure for speech signal series, and can be further employed in speech signal reconstruction or compression coding.


2004 ◽  
Vol 2 (3) ◽  
pp. 227-252 ◽  
Author(s):  
L. Borup ◽  
R. Gribonval ◽  
M. Nielsen

We study tight wavelet frame systems inLp(ℝd)and prove that such systems (under mild hypotheses) give atomic decompositions ofLp(ℝd)for1≺p≺∞. We also characterizeLp(ℝd)and Sobolev space norms by the analysis coefficients for the frame. We consider Jackson inequalities for bestm-term approximation with the systems inLp(ℝd)and prove that such inequalities exist. Moreover, it is proved that the approximation rate given by the Jackson inequality can be realized by thresholding the frame coefficients. Finally, we show that in certain restricted cases, the approximation spaces, for bestm-term approximation, associated with tight wavelet frames can be characterized in terms of (essentially) Besov spaces.


Author(s):  
S. Pitchai Murugan ◽  
G. P. Youvaraj

The Franklin wavelet is constructed using the multiresolution analysis (MRA) generated from a scaling function [Formula: see text] that is continuous on [Formula: see text], linear on [Formula: see text] and [Formula: see text] for every [Formula: see text]. For [Formula: see text] and [Formula: see text], it is shown that if a function [Formula: see text] is continuous on [Formula: see text], linear on [Formula: see text] and [Formula: see text], for [Formula: see text], and generates MRA with dilation factor [Formula: see text], then [Formula: see text]. Conversely, for [Formula: see text], it is shown that there exists a [Formula: see text], as satisfying the above conditions, that generates MRA with dilation factor [Formula: see text]. The frame MRA (FMRA) is useful in signal processing, since the perfect reconstruction filter banks associated with FMRA can be narrow-band. So it is natural to ask, whether the above results can be extended for the case of FMRA. In this paper, for [Formula: see text], we prove that if [Formula: see text] generates FMRA with dilation factor [Formula: see text], then [Formula: see text]. For [Formula: see text], we prove similar results when [Formula: see text]. In addition, for [Formula: see text] we prove that there exists a function [Formula: see text] as satisfying the above conditions, that generates FMRA. Also, we construct tight wavelet frame and wavelet frame for such scaling functions.


2019 ◽  
Author(s):  
Prachi Govalkar ◽  
Johannes Fischer ◽  
Frank Zalkow ◽  
Christian Dittmar

Sign in / Sign up

Export Citation Format

Share Document