RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Model. Anal. Inform. Sist.: Year: Volume: Issue: Page: Find

 Model. Anal. Inform. Sist., 2016, Volume 23, Number 4, Pages 389–400 (Mi mais510)

Comparison of doubling the size of image algorithms

S. E. Vaganov, S. I. Khashin

Ivanovo State University, Ermaka str., 39, Ivanovo, 153025, Russia

Abstract: In this paper the comparative analysis for quality of some interpolation non-adaptive methods of doubling the image size is carried out. We used the value of a mean square error for estimation accuracy (quality) approximation. Artifacts (aliasing, Gibbs effect (ringing), blurring, etc.) introduced by interpolation methods were not considered. The description of the doubling interpolation upscale algorithms are presented, such as: the nearest neighbor method, linear and cubic interpolation, Lanczos convolution interpolation (with $a=1, 2, 3$), and $17$-point interpolation method. For each method of upscaling to twice optimal coefficients of kernel convolutions for different down-scale to twice algorithms were found. Various methods for reducing the image size by half were considered the mean value over $4$ nearest points and the weighted value of $16$ nearest points with optimal coefficients. The optimal weights were calculated for each method of doubling described in this paper. The optimal weights were chosen in such a way as to minimize the value of mean square error between the accurate value and the found approximation.
A simple method performing correction for approximation of any algorithm of doubling size is offered. The proposed correction method shows good results for simple interpolation algorithms. However, these improvements are insignificant for complex algorithms ($17$-point interpolation, Lanczos $a=3$). According to the results of numerical experiments, the most accurate among the reviewed algorithms is the $17$-point interpolation method, slightly worse is Lanczos convolution interpolation with the parameter $a=3$ (see the table at the end).

Keywords: interpolation, convolution of function, Lanczos filter, 17-point interpolation.

 Funding Agency Grant Number Ministry of Education and Science of the Russian Federation 2014/40 This work was supported by the Federal targeted Program "Scientific and Scientific-pedagogical Personnel of Innovative Russia" under the Grant No 162 (2014/40).

DOI: https://doi.org/10.18255/1818-1015-2016-4-389-400

Full text: PDF file (573 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.67

Citation: S. E. Vaganov, S. I. Khashin, “Comparison of doubling the size of image algorithms”, Model. Anal. Inform. Sist., 23:4 (2016), 389–400

Citation in format AMSBIB
\Bibitem{VagKha16} \by S.~E.~Vaganov, S.~I.~Khashin \paper Comparison of doubling the size of image algorithms \jour Model. Anal. Inform. Sist. \yr 2016 \vol 23 \issue 4 \pages 389--400 \mathnet{http://mi.mathnet.ru/mais510} \crossref{https://doi.org/10.18255/1818-1015-2016-4-389-400} \mathscinet{http://www.ams.org/mathscinet-getitem?mr=3549342} \elib{http://elibrary.ru/item.asp?id=26561559}