This paper presents an approach to articulatory inversion using audio and video of the user’s face, requiring no special markers. The video is stabilized with respect to the face, and the mouth region cropped out. The mouth image is projected into a learned independent component subspace to obtain a low-dimensional representation of the mouth appearance. The inversion problem is treated as one ...

This paper presents an articulatory codebook construction method which gives a good space coverage with a limited number of points. We represent the articulatory space by hypercubes. Therefore the articulatory space is decomposed into regions represented by few number of points. We describe our interpolation method to retrieve points from the hypercube and the inversion method based on the same...

The generalized Stieltjes transform (GST) is an integral transform that depends on a parameter ρ > 0. In previous work a convenient form of the inverse transformation was derived for the case ρ = 3/2. This paper generalizes that result to all ρ > 0. It is a well-known fact that the GST can be formulated as an iterated Laplace transform, and that therefore its inverse can be expressed as an iter...

We establish the inverse Lebedev expansion with respect to parameters and arguments of the modified Bessel functions for an arbitrary function from Hardy’s space H2,A, A> 0. This gives another version of the Fourier-integral-type theorem for the Lebedev transform. The result is generalized for a weighted Hardy space Ĥ2,A ≡ Ĥ2((−A,A);|Γ(1+Rez+iτ)|2dτ), 0 < A < 1, of analytic functions f(z),z = R...

We introduce the operator Z that is often called the Zak transform. Our definition is a bit different from the one that usually appears in the literature. We will discuss this difference and will also give a historical account that the reader may find particularly interesting. In order to do this, however, we need to present our treatment of the operator Z (and Z̃) which shows that the Fourier t...

The main idea behind the Laplace transformation is that we can solve an equation (or system of equations) containing differential and integral terms by transforming the equation in time (t) domain into Laplace (2) domain. For example, we can use Laplace transforms to turn an initial value problem into an algebraic problem which is easier to solve. After we solved the problem in Laplace domain w...

Computing the Fourier transform and its inverse is important in many applications of mathematics, such as frequency analysis, signal modulation, and filtering. Two methods will be derived for numerically computing the inverse Fourier transforms, and they will be compared to the standard inverse discrete Fourier transform (IDFT) method. The first computes the inverse Fourier transform through di...

this paper presents a rational haar wavelet operational method for solving the inverse laplace transform problemand improves inherent errors from irrational haar wavelet. the approach is thus straightforward, rather simple andsuitable for computer programming. we define that $p$ is the operational matrix for integration of the orthogonalhaar wavelet. simultaneously, simplify the formulaes of li...