This study investigates the usefulness of wavelet transforms in phoneme recognition. Both discrete wavelet transforms (DWT) and sampled continuous wavelet transforms (SCWT) are tested. The wavelet transform is used as a part of the front-end processor which extracts feature vectors for a speakerindependent HMM-based phoneme recognizer. The results are evaluated on a portion of TIMIT corpus cons...

A series expansion with remainder for functions in a Sobolev space is derived in terms of the classical Bernoulli polynomials, the B-spline scale-space and the continuous wavelet transforms with the derivatives of the standardized B-splines as mother wavelets. In the limit as their orders tend to infinity, the B-splines and their derivatives converge to the Gaussian function and its derivatives...

this article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. we present a concrete formulation for the frobenius norm of the classical wavelet transforms over finite fields. it is shown that each vector defined over a finite field can be represented as...

Contents Preface ix 1. Wavelet and frame transforms originated from continuous and discrete splines, Amir Z. Averbuch and Valery A. Zheludev 1 1.1. Introduction 1 1.2. Preliminaries 4 1.3. Prediction filters originated from splines 9 1.4. Biorthogonal wavelet transforms generated by filter banks with downsampling factor N = 2 (diadic transforms) 17 1.5. Application of spline-based wavelet trans...

We investigate the formulation of boundary compensated wavelet transforms supported on a nite interval. A uni ed approach to boundary compensated wavelet transforms is presented which fosters new insights into previous constructions, including both continuous and discrete approaches to the problem. The framework enables the design of boundary-compensated transforms with speci c properties, incl...

Several algorithms are reviewed for computing various types of wavelet transforms: the Mallat algorithm, the “a trous” algorithm and their generalizations by Shensa. The goal is 1) to develop guidelines for implementing discrete and continuous wavelet transforms efficiently, 2) to compare the various algorithms obtained and give an idea of possible gains by providing operation counts. The compu...

It is well-known that every two dimensional rotation around the origin in the plane R can be represented by the multiplication of the complex number e = cos θ + i sin θ, 0 ≤ θ < 2π. Similarly, every three dimensional rotation in the space R can be represented by the multiplications of the quaternion q from the left-hand side and its conjugate q̄ from the right-hand side, where q = cos(θ/2) + α s...

In this paper we present a new form of wavelet transform. Unlike the continuous wavelet transform (CWT) or discrete wavelet transform (DWT), the mother wavelet is chosen to be a discrete-time signal and wavelet coefficients are computed by correlating a given discrete-time signal with continuous dilations of the mother wavelet. The results developed are based on the definition of a discrete-tim...