Comparison of Doubling the Size of Image Algorithms
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 b...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2016-08-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/365 |
| _version_ | 1797877876628914176 |
|---|---|
| author | S. E. Vaganov S. I. Khashin |
| author_facet | S. E. Vaganov S. I. Khashin |
| author_sort | S. E. Vaganov |
| collection | DOAJ |
| description | 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) |
| first_indexed | 2024-04-10T02:24:04Z |
| format | Article |
| id | doaj.art-657a4a0d4cfb46a8bb655a4a7b49d4bd |
| institution | Directory Open Access Journal |
| issn | 1818-1015 2313-5417 |
| language | English |
| last_indexed | 2024-04-10T02:24:04Z |
| publishDate | 2016-08-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj.art-657a4a0d4cfb46a8bb655a4a7b49d4bd2023-03-13T08:07:34ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172016-08-0123438240010.18255/1818-1015-2016-4-382-400311Comparison of Doubling the Size of Image AlgorithmsS. E. Vaganov0S. I. Khashin1Ивановский государственный университет, ИвановоИвановский государственный университет, Иваново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)https://www.mais-journal.ru/jour/article/view/365интерполяциясвертка функцийфильтр ланцоша17-точечная интерполяция |
| spellingShingle | S. E. Vaganov S. I. Khashin Comparison of Doubling the Size of Image Algorithms Моделирование и анализ информационных систем интерполяция свертка функций фильтр ланцоша 17-точечная интерполяция |
| title | Comparison of Doubling the Size of Image Algorithms |
| title_full | Comparison of Doubling the Size of Image Algorithms |
| title_fullStr | Comparison of Doubling the Size of Image Algorithms |
| title_full_unstemmed | Comparison of Doubling the Size of Image Algorithms |
| title_short | Comparison of Doubling the Size of Image Algorithms |
| title_sort | comparison of doubling the size of image algorithms |
| topic | интерполяция свертка функций фильтр ланцоша 17-точечная интерполяция |
| url | https://www.mais-journal.ru/jour/article/view/365 |
| work_keys_str_mv | AT sevaganov comparisonofdoublingthesizeofimagealgorithms AT sikhashin comparisonofdoublingthesizeofimagealgorithms |