We present a general framework for the design of discrete geometrical transformation operators, including rotations and scaling. The first step is to fit the discrete input image with a continuous model that provides an exact interpolation at the pixel locations. The corresponding image model is selected within a certain subspace V(/spl phi/)/spl sub/L/sub 2/(R/sup P/) that is generated from the integer translates of a generating function /spl phi/; particular examples of this construction include polynomial spline and bandlimited signal representations. Next, the geometrical transformation is applied to the fitted model, and the result is re-projected onto the representation space. This procedure yields a solution that is optimal in the least squares sense. We show that this method can be implemented exactly using a combination of digital filters and a re-sampling step that uses a modified sampling kernel. We then derive explicit implementation formulas for the piecewise constant and cubic spline image models. Finally, we consider image processing examples and show that the present method compares very favorably with a standard interpolation that uses the same model.<>
Affine transformations of images: a least squares formulation
Proceedings of 1st International Conference on Image Processing ; 3 ; 558-561 vol.3
1994-01-01
311865 byte
Conference paper
Electronic Resource
English
Affine Transformations of Images: A Least Squares Formulation
British Library Conference Proceedings | 1994
|Animated Heads from Ordinary Images: A Least-Squares Approach
British Library Online Contents | 1999
|