Preview

Modeling and Analysis of Information Systems

Advanced search

Comparison of Doubling the Size of Image Algorithms

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

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)

About the Authors

S. E. Vaganov
Ivanovo State University
Russian Federation

Vaganov Sergey Evgenevich, graduate student

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



S. I. Khashin
Ivanovo State University
Russian Federation

Khashin Sergey Ivanovich, PhD

P.G. Ivanovo State University, Ermaka str., 39, Ivanovo, 153025



References

1. Vatolin D. et al., Metody szhatiya dannykh. Ustroystvo arkhivatorov, szhatie izobrazheniy i video, Dialog - MIFI, M., 2002, 384 pp., (in Russian).

2. Gonsales R., Vuds R., Tsifrovaya obrabotka izobrazheniy, Tekhnosfera, M., 2012, 1104 pp., (in Russian).

3. Prett U., Tsifrovaya obrabotka izobrazheniy, 1, Mir, M., 1982, 312 pp., (in Russian).

4. Khashin S. I., “Semnadtsatitochechnaya interpolyatsionnaya formula ot 2 peremennykh”, Ivanovo State University Bulletim, 2003, № 3, 133–137, (in Russian).

5. Yane B., Tsifrovaya obrabotka izobrazheniy, Tekhnosfera, M., 2007, 583 pp., (in Russian).

6. Wilhelm Burger, Mark J. Burge, Principles of digital image processing: core algorithms, Springer-Verlag, London, 2009, ISBN: 978-1-84800-194-7, 327 pp.

7. David S. Taubman, Michael W. Marcellin, JPEG2000: image compression fundamentals, standards, and practice, Springer Science+Business Media, LLC, 2002, ISBN: 978-1-46135245-7, 773 pp.

8. Wallace G. K., “The JPEG still picture compression standard”, IEEE Transactions on Consumer Electronics, 38:1 (1992), xviii – xxxiv. DOI: 10.1109/30.125072.

9. Robert G. Keys, “Cubic Convolution Interpolation for Digital Image”, Processing IEEE transaction on acoustics, speech, and signal processing, 29:6 (1981), 1153–1160. DOI: 10.1109/TASSP.1981.1163711.

10. Klette R., Concise Computer Vision. An Introduction into Theory and Algorithms, Springer-Verlag, London, 2014, ISBN: 978-1-4471-6320-6, 429 pp.

11. Xin Li, Michael T. Orchard, “New Edge-Directed Interpolation”, IEEE Transactions on Image Processing, 10:10 (2001), 1521–1527. DOI: 10.1109/83.951537.


Review

For citations:


Vaganov S.E., Khashin S.I. Comparison of Doubling the Size of Image Algorithms. Modeling and Analysis of Information Systems. 2016;23(4):382-400. (In Russ.) https://doi.org/10.18255/1818-1015-2016-4-382-400

Views: 1115


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)