Affiliation:
1. Academy of Applied Technical and Preschool Studies, Niš, Serbia
Abstract
The ideal interpolation kernel is described by the sinc function, and its
spectral characteristic is the box function. Due to the infinite length of
the ideal kernel, it is not achievable. Therefore, convolutional
interpolation kernels of finite length, which should better approximate the
ideal kernel in a specified interval, are formed. The approximation function
should have a small numerical complexity, so as to reduce the interpolation
execution time. In the scientific literature, great attention is paid to the
polynomial kernel of the third order. However, the time and spectral
characteristic of the third-order polynomial kernels differs significantly
from the shape of the ideal kernel. Therefore, the accuracy of cubic
interpolation is lower. By optimizing the kernel parameters, it is possible
to better approximate the ideal kernel. This will increase the accuracy of
the interpolation. The first part of the paper describes a three-parameter
(3P) Keys interpolation kernel, r. After that, the algorithm for optimizing
the parameters of the 3P Keys kernel, is shown. First, the kernel is
disassembled into components, and then, over each kernel component, Fourier
transform is applied. In this way the spectral characteristic of the 3P Keys
kernel, H, was determined. Then the spectral characteristic was developed in
the Taylor series, HT. With the condition for the elimination of the members
of the Taylor series, which greatly affect the ripple of the spectral
characteristic, the optimal kernel parameters (?opt, ?opt, gopt) were
determined. The second part of the paper describes an experiment, in which
the interpolation accuracy of the 3P Keys kernel, was tested. Parametric
cubic convolution (PCC) interpolation, with the 3P kernel, was performed
over the images from the Test database. The Test database is created with
standard Test images, which are intensively used in Digital Image
Processing. By analyzing the interpolation error, which is represented by
the Mean Square Error, MSE, the accuracy of the interpolation was
determined. The results (?opt, ?opt, gopt, MSEmin) are presented on tables
and graphs. Detailed comparative analysis showed higher interpolation
accuracy with the proposed 3P Keys interpolation kernel, compared to the
interpolation accuracy with, 1P Keys and 2P Keys interpolation kernels.
Finally, the numerical values of the optimal kernel parameters, which are
determined by the optimization algorithm proposed in this paper, were
experimentally verified.
Publisher
National Library of Serbia
Subject
General Materials Science
Reference17 articles.
1. R. G. Keys, "Cubic convolution interpolation for digital image processing" IEEE Trans. Acout. Speech, & Signal Processing, vol. ASSP-29, pp. 1153-1160, Dec. 1981.
2. E. Meijering, M. Unser, "A Note on Cubic Convolution Interpolation", IEEE Transactions on Image Processing, vol. 12, no. 4, pp. 447-479, April 2003.
3. N. Dodgson, "Quadratic Interpolation for Image Resampling", IEEE Transactions On Image Processing, vol. 6, no. 9, pp. 1322-1326, Sept. 1997.
4. O. Rukundo, B. Maharaj, "Optimization of image interpolation based on nearest neighbor algorithm", In Proceedings of the International Conference on Computer Vision Theory and Applications (VISAPP), 2014, vol. 1, pp. 641-647.
5. S. S. Rifman, "Digital rectification of ERTS multispectral imagery", In Proceedings of the Symp. Significant Results Obtained From the Earth Resources Technology Satellite-1, 1973, vol 1, sec. B, pp. 1131-1142.