We present a generative model for spontaneous smiles that preserves their dynamics and can thus be used to generate genuine animations. We use a high-resolution motion capture dataset of spontaneous smiles to represent the accurate temporal information present in spontaneous smiles. The smile model consists of data-driven interpolation functions generated from a Principal Component Analysis mod...

This paper describes an interpolation method that takes into account the edge orientation in order to avoid typical interpolation artifacts (jagging, staircase effects...). It is first based on an edge orientation estimation, performed in the wavelet domain. The estimation uses the multi-resolution features of wavelets to give an accurate and non-biased description of the frequency characterist...

BACKGROUND Intravascular ultrasound (IVUS) is a standard imaging modality for identification of plaque formation in the coronary and peripheral arteries. Volumetric three-dimensional (3D) IVUS visualization provides a powerful tool to overcome the limited comprehensive information of 2D IVUS in terms of complex spatial distribution of arterial morphology and acoustic backscatter information. Co...

the polynomial interpolation in one dimensional space r is an important method to approximate the functions. the lagrange and newton methods are two well known types of interpolations. in this work, we describe the semi inherited interpolation for approximating the values of a function. in this case, the interpolation matrix has the semi inherited lu factorization.

This paper compares the theoretical effectiveness of bilinear approximation over quadrilaterals with linear approximation over triangles. Anisotropic mesh transformation is used to generate asymptotically optimally efficient meshes for piecewise linear interpolation over triangles and bilinear interpolation over quadrilaterals. For approximating a convex function, although bilinear quadrilatera...

A practical implementation of azimuth moveout (AMO) must be both computationally efficient and accurate. We achieve computational efficiency by parameterizing the AMO operator with the help of a transformed midpoint coordinate system. To achieve accuracy, the AMO operator needs to be carefully designed for antialiasing. We propose a modified version of Hale’s antialiasing algorithm, which switc...

A fast and accurate algorithm for the reinitialization of the signed distance function in two and three spatial dimensions is presented. The algorithm has computational complexity O(N logN) for the reinitialization of N grid points. The order of accuracy of the reinitialization is demonstrated to depend primarily on the interpolation algorithm used. Bicubic interpolation is demonstrated to resu...

Observers viewed flashed random-dot stereograms depicting a pair of long, narrow, curved ribbons of textured surface defined by a Gabor function in disparity. Observers judged the location of the peak of the depth profile of one ribbon relative to that of the other. In one ribbon, disparity changed smoothly while in the other disparity was periodically sampled. Up to a limiting sampling period,...