{"id":11385,"date":"2022-03-19T03:07:32","date_gmt":"2022-03-19T01:07:32","guid":{"rendered":"http:\/\/journals.khnu.km.ua\/vestnik\/?p=11385"},"modified":"2022-04-14T11:20:54","modified_gmt":"2022-04-14T08:20:54","slug":"koduvannya-rastrovyh-zobrazhen-na-osnovi-podibnosti-fragmentiv","status":"publish","type":"post","link":"https:\/\/journals.khnu.km.ua\/vestnik\/?p=11385","title":{"rendered":"\u041a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044f \u0440\u0430\u0441\u0442\u0440\u043e\u0432\u0438\u0445 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c \u043d\u0430 \u043e\u0441\u043d\u043e\u0432\u0456 \u043f\u043e\u0434\u0456\u0431\u043d\u043e\u0441\u0442\u0456 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432"},"content":{"rendered":"

<\/p>\n

\u041a\u041e\u0414\u0423\u0412\u0410\u041d\u041d\u042f \u0420\u0410\u0421\u0422\u0420\u041e\u0412\u0418\u0425 \u0417\u041e\u0411\u0420\u0410\u0416\u0415\u041d\u042c \u041d\u0410 \u041e\u0421\u041d\u041e\u0412\u0406 \u041f\u041e\u0414\u0406\u0411\u041d\u041e\u0421\u0422\u0406 \u0424\u0420\u0410\u0413\u041c\u0415\u041d\u0422\u0406\u0412<\/p>\n

ENCODING RASTER IMAGES BASED ON FRAGMENT SIMILARITY<\/p>\n

\u00a0<\/strong>\u0421\u0442\u043e\u0440\u0456\u043d\u043a\u0438: 73-80. \u041d\u043e\u043c\u0435\u0440: \u21166, 2021 (303)<\/strong> \"\"<\/a>
\n\u0410\u0432\u0442\u043e\u0440\u0438<\/strong>:
\n\u041f\u041e\u0420\u0422\u042f\u041d\u0418\u0419 \u0406. \u0421.
\n\u041d\u0422\u0423\u0423 \u00ab\u041a\u0438\u0457\u0432\u0441\u044c\u043a\u0438\u0439 \u043f\u043e\u043b\u0456\u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0456\u043d\u0441\u0442\u0438\u0442\u0443\u0442 \u0456\u043c\u0435\u043d\u0456 \u0406\u0433\u043e\u0440\u044f \u0421\u0456\u043a\u043e\u0440\u0441\u044c\u043a\u043e\u0433\u043e\u00bb
\nORCID ID: 0000-0001-7477-3987
\ne-mail: iportianoy@gmail.com
\n\u041f\u041e\u0421\u041f\u0404\u041b\u041e\u0412\u0410 \u041a. \u0406.
\n\u041d\u0422\u0423\u0423 \u00ab\u041a\u0438\u0457\u0432\u0441\u044c\u043a\u0438\u0439 \u043f\u043e\u043b\u0456\u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0456\u043d\u0441\u0442\u0438\u0442\u0443\u0442 \u0456\u043c\u0435\u043d\u0456 \u0406\u0433\u043e\u0440\u044f \u0421\u0456\u043a\u043e\u0440\u0441\u044c\u043a\u043e\u0433\u043e\u00bb
\nORCID ID: 0000-0001-7374-2812
\n\u041e\u041b\u0406\u0419\u041d\u0418\u041a \u042e. \u041e.
\n\u041d\u0422\u0423\u0423 \u00ab\u041a\u0438\u0457\u0432\u0441\u044c\u043a\u0438\u0439 \u043f\u043e\u043b\u0456\u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0456\u043d\u0441\u0442\u0438\u0442\u0443\u0442 \u0456\u043c\u0435\u043d\u0456 \u0406\u0433\u043e\u0440\u044f \u0421\u0456\u043a\u043e\u0440\u0441\u044c\u043a\u043e\u0433\u043e\u00bb
\nORCID ID: 0000-0002-7408-4927
\nIVAN PORTIANYI, KAROLINA POSPIELOVA, YURII OLIINYK
\nNTUU \u00abIgor Sikorsky Kyiv Polytechnic Institute\u00bb
\nDOI:<\/strong> https:\/\/www.doi.org\/10.31891\/2307-5732-2021-303-6-73-80<\/a>
\n\u0420\u0435\u0446\u0435\u043d\u0437\u0456\u044f\/Peer review : <\/strong>20.11.2021 \u0440.
\n\u041d\u0430\u0434\u0440\u0443\u043a\u043e\u0432\u0430\u043d\u0430<\/strong>\/<\/strong>Printed<\/strong> :<\/strong> 30.12.2021 \u0440.<\/p>\n

\u0410\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u043c\u043e\u0432\u043e\u044e \u043e\u0440\u0438\u0433\u0456\u043d\u0430\u043b\u0443<\/strong><\/p>\n

\u0420\u043e\u0431\u043e\u0442\u0430 \u043f\u0440\u0438\u0441\u0432\u044f\u0447\u0435\u043d\u0430 \u043a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044e \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c \u043d\u0430 \u043e\u0441\u043d\u043e\u0432\u0456 \u0432\u0438\u0437\u043d\u0430\u0447\u0435\u043d\u043d\u044f \u043f\u043e\u0434\u0456\u0431\u043d\u043e\u0441\u0442\u0456 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432 \u0448\u043b\u044f\u0445\u043e\u043c \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u0430\u043d\u043d\u044f \u043d\u0435\u0439\u0440\u043e\u043d\u043d\u0438\u0445 \u043c\u0435\u0440\u0435\u0436 \u0434\u043b\u044f \u0432\u0438\u0434\u0456\u043b\u0435\u043d\u043d\u044f \u043e\u0437\u043d\u0430\u043a \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432 \u0442\u0430 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432 \u043c\u0430\u0448\u0438\u043d\u043d\u043e\u0433\u043e \u043d\u0430\u0432\u0447\u0430\u043d\u043d\u044f \u0434\u043b\u044f \u043f\u043e\u0448\u0443\u043a\u0443 \u043f\u043e\u0434\u0456\u0431\u043d\u0438\u0445 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432. \u0423 \u0440\u043e\u0431\u043e\u0442\u0456 \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u0430\u043d\u043e \u0437\u0433\u043e\u0440\u0442\u043a\u043e\u0432\u0456 \u043d\u0435\u0439\u0440\u043e\u043d\u043d\u0456 \u043c\u0435\u0440\u0435\u0436\u0456, \u0430 \u0442\u0430\u043a\u043e\u0436 \u043a\u043b\u0430\u0441\u0438\u0444\u0456\u043a\u0430\u0442\u043e\u0440 KNN (k-Nearest Neighbors) \u0434\u043b\u044f \u043a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044f \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c, \u043f\u0440\u043e\u0432\u0435\u0434\u0435\u043d\u043e \u043f\u043e\u0440\u0456\u0432\u043d\u044f\u043d\u043d\u044f \u0440\u043e\u0437\u043c\u0456\u0440\u0443 \u0437\u0430\u043a\u043e\u0434\u043e\u0432\u0430\u043d\u043e\u0433\u043e \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u043d\u044f \u0437 \u0432\u0445\u0456\u0434\u043d\u0438\u043c. \u0414\u043b\u044f \u0442\u043e\u0433\u043e, \u0449\u043e\u0431 \u043a\u043e\u0434\u0443\u0432\u0430\u0442\u0438 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u043d\u044f \u0434\u043b\u044f \u043f\u043e\u0447\u0430\u0442\u043a\u0443 \u043f\u043e\u0442\u0440\u0456\u0431\u043d\u043e \u0437\u0430\u043f\u043e\u0432\u043d\u0438\u0442\u0438 \u0441\u0445\u043e\u0432\u0438\u0449\u0435 \u0434\u0430\u043d\u0438\u0445 \u043e\u0437\u043d\u0430\u043a\u0430\u043c\u0438 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432 \u0441\u0445\u043e\u0436\u0438\u0445 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c, \u043f\u0456\u0441\u043b\u044f \u0447\u043e\u0433\u043e \u043f\u043e \u043a\u043e\u0436\u043d\u043e\u043c\u0443 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0443 \u043e\u0442\u0440\u0438\u043c\u0430\u043d\u0438\u0445 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c \u043f\u043e\u0442\u0440\u0456\u0431\u043d\u043e \u0432\u0438\u0434\u0456\u043b\u0438\u0442\u0438 \u043e\u0437\u043d\u0430\u043a\u0438 \u0442\u0430 \u0437\u0430\u043f\u0438\u0441\u0430\u0442\u0438 \u0432 \u0441\u0445\u043e\u0432\u0438\u0449\u0435 \u0434\u0430\u043d\u0438\u0445. \u041f\u0456\u0441\u043b\u044f \u0442\u043e\u0433\u043e, \u044f\u043a \u0441\u0444\u043e\u0440\u043c\u043e\u0432\u0430\u043d\u043e \u0431\u0430\u0437\u0443 \u043e\u0437\u043d\u0430\u043a \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432, \u043c\u043e\u0436\u043d\u0430 \u0432\u0438\u043a\u043e\u043d\u0443\u0432\u0430\u0442\u0438 \u043a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044f \u043d\u043e\u0432\u0438\u0445 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c \u0437\u0430 \u0434\u043e\u043f\u043e\u043c\u043e\u0433\u043e\u044e \u0437\u0431\u0435\u0440\u0435\u0436\u0435\u043d\u0438\u0445 \u0444\u0440\u0430\u0433\u043c\u0435\u043d\u0442\u0456\u0432.
\n\u041a\u043b\u044e\u0447\u043e\u0432\u0456 \u0441\u043b\u043e\u0432\u0430:<\/strong> \u043a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044f \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c, \u0437\u0433\u043e\u0440\u0442\u043a\u043e\u0432\u0456 \u043d\u0435\u0439\u0440\u043e\u043d\u043d\u0456 \u043c\u0435\u0440\u0435\u0436\u0456, \u0441\u0442\u0438\u0441\u043d\u0435\u043d\u043d\u044f \u0434\u0430\u043d\u0438\u0445, \u0434\u0435\u043a\u043e\u0434\u0443\u0432\u0430\u043d\u043d\u044f \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u044c.<\/p>\n

\u0420\u043e\u0437\u0448\u0438\u0440\u0435\u043d\u0430 \u0430\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u0430\u043d\u0433\u043b\u0456\u0439\u0441\u044c\u043a\u043e\u044e \u043c\u043e\u0432\u043e\u044e<\/strong><\/p>\n

This paper is devoted to image encoding based on determining the similarity of fragments by using neural networks to extract the features of fragments and machine learning algorithms to find similar fragments. In the modern world, the problem of image storage is quite relevant. Graphic data takes up quite a lot of disk space, while Internet users upload more and more pictures. Also, every year there is a development of photography and image quality is improving, respectively, and the size of graphic data is growing. Data warehouses of social networks, messengers, file sharers and other Internet resources are filled with tens of thousands of new pictures every day. Therefore, the question arises about reducing the size of graphic data. In general, it should be noted that one of the most important and defining aspects of both storage and transmission of information is its compression. The problem described above is solved by encoding and compressing images. With the help of coding, the size of graphic information is reduced, which saves storage space and, accordingly, the money spent. In view of this, it is important to develop a method and means of image coding. Many methods exist for compressing graphic information. For example, jpeg, webp, png and others. These methods usually use the removal of redundant information in the photo and work purely with the image itself, but none of the methods uses fragments of similar images. The article uses convolutional neural networks and KNN (k-Nearest Neighbors) classifier for image encoding. and compares the size of the encoded image with the input. In order to encode the image, you first need to fill the data warehouse with features of fragments of similar images, then for each fragment of the obtained images you need to select the features and write to the data warehouse. Once the snippet feature database is formed, you can encode new images using saved snippets.
\nKeywords:<\/strong> image encoding; convolutional neural networks; data compression; image decoding.<\/p>\n

References<\/strong><\/p>\n

    \n
  1. Various Image Compression Techniques: Lossy and Lossless. 2016. URL: https:\/\/www.researchgate.net\/publication\/ 303319054_Various_Image_Compression_Techniques _Lossy_and_Lossless.<\/li>\n
  2. LZW Data Compression. American Journal of Engineering Research (AJER). 2014. URL: https:\/\/www.ajer.org\/papers\/v3(2)\/C0322226.pdf.<\/li>\n
  3. Milano J. Compressed Image File Formats: JPEG, PNG, GIF, XBM, BMP. 1999. 288 p.<\/li>\n
  4. Sytnyk A. Yu. Obrobka hrafichnykh zobrazhen zasobamy fraktalnoi heometrii [Elektronnyi resurs] \/ Akym Yuriiovych Sytnyk. \u2013 2021. \u2013 Rezhym dostupu : https:\/\/ela.kpi.ua\/bitstream\/123456789\/43996\/1\/ Sytnyk_bacalavr.pdf.<\/li>\n
  5. Rohan T. Convolutional Networks for everyone. 2018. URL: https:\/\/medium.com\/@rohanthomas.me\/convolutional-networks-for-everyone-1d0699de1a9d<\/li>\n
  6. Antony K-Nearest Neighbor. 2021. URL: https:\/\/medium.com\/swlh\/k-nearest-neighbor-ca2593d7a3c4.<\/li>\n
  7. Erdem Isbilen. Image Similarity Detection in Action with Tensorflow 2.0. 2019. URL: https:\/\/towardsdatascience.com\/image-similarity-detection-in- action-with-tensorflow-2-0-b8d9a78b2509.<\/li>\n
  8. Datta P. All about Structural Similarity Index (SSIM). 2020. URL: https:\/\/medium.com\/srm-mic\/all-about-structural-similarity-index-ssim-theory-code- in-pytorch-6551b455541e.<\/li>\n
  9. Heinz M. All The Ways to Compress and Archive Files in Python. 2021. URL: https:\/\/towardsdatascience.com\/all-the-ways-to-compress-and-archive-files-in- python-e8076ccedb4b.<\/li>\n
  10. 102 Flowers Diff Species DataSet. 2016. URL: https:\/\/www.kaggle.com\/lenine\/flower-102diffspecies-dataset.<\/li>\n
  11. Burger W. Principles of Digital Image Processing: Advanced Methods (Undergraduate Topics in Computer Science. London: Springer, 2013. 382 p.<\/li>\n
  12. Thakar V. Deep Learning with Python and OpenCV: A beginners guide to perform smart image processing techniques using TensorFlow and Keras.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[60],"tags":[],"_links":{"self":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11385"}],"collection":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=11385"}],"version-history":[{"count":2,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11385\/revisions"}],"predecessor-version":[{"id":11936,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11385\/revisions\/11936"}],"wp:attachment":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11385"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=11385"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=11385"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}