Andrii Boichuk

Mr. Andrii Boichuk

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2023 in Systems
Verified
Journal Article
Open access
PDF file
KPKirtee Panwar
Kirtee Panwar
ASAkansha Singh
Akansha Singh
SKSonal Kukreja
Sonal Kukreja
KSKrishna Kant Singh
Krishna Kant Singh
Nataliya ShakhovskaNataliya Shakhovska
Nataliya Shakhovska
ABAndrii Boichuk
Andrii Boichuk
Chaos-based image encryption schemes are applied widely for their cryptographic properties. However, chaos and cryptographic relations remain a challenge. The chaotic systems are defined on the set of real numbers and then normalized to a small group of integers in the range 0–255, which affects the security of such cryptosystems. This paper proposes an image encryption system developed using deep learning to realize the secure and efficient transmission of medical images over an insecure network. The non-linearity introduced with deep learning makes the encryption system secure against plaintext attacks. Another limiting factor for applying deep learning in this area is the quality of the recovered image. The application of an appropriate loss function further improves the quality of the recovered image. The loss function employs the structure similarity index metric (SSIM) to train the encryption/decryption network to achieve the desired output. This loss function helped to generate cipher images similar to the target cipher images and recovered images similar to the originals concerning structure, luminance and contrast. The images recovered through the proposed decryption scheme were high-quality, which was further justified by their PSNR values. Security analysis and its results explain that the proposed model provides security against statistical and differential attacks. Comparative analysis justified the robustness of the proposed encryption system.

28 April 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
VRVasyl Rusyn
Vasyl Rusyn
ABAndrii Boichuk
Andrii Boichuk
LMLesia Mochurad
Lesia Mochurad
Many people admire the Japanese language and culture, but mastering the language’s writing system, particularly handwritten kanji, presents a significant challenge. Furthermore, translating historical manuscripts containing archaic or rare kanji requires specialized expertise. To address this, we designed a new model for handwritten kanji recognition based on the concept of cross-language transfer learning using a Preact ResNet-18 architecture. The model was pretrained in a Chinese dataset and subsequently fine-tuned in a Japanese dataset. We also adapted and evaluated two fine-tuning strategies: unfreezing only the last layer and unfreezing all the layers during fine-tuning. During the implementation of our training algorithms, we trained a model with the CASIA-HWDB dataset with handwritten Chinese characters and used its weights to initialize models that were fine-tuned with a Kuzushiji-Kanji dataset that consists of Japanese handwritten kanji. We investigated the effectiveness of the developed model when solving a multiclass classification task for three subsets with the one hundred fifty, two hundred, and three hundred most-sampled classes and showed an improvement in the recognition accuracy and an enhancement in a number of recognizable kanji with the proposed model compared to those of the existing methods. Our best model achieved 97.94% accuracy for 150 kanji, exceeding the previous SOTA result by 1.51%, while our best model for 300 kanji achieved 97.62% accuracy (exceeding the 150-kanji SOTA accuracy by 1.19% while doubling the class count). This confirms the effectiveness of our proposed model and establishes new benchmarks in handwritten kanji recognition, both in terms of accuracy and the number of recognizable kanji.

2 May 2022 in Herald of Khmelnytskyi National University. Technical sciences
Verified
Journal Article
Closed access
DBD. Berdnyk
D. Berdnyk
ABAndrii Boichuk
Andrii Boichuk
LULviv Polytechnic National University
Lviv Polytechnic National University
Nowadays, people often use online services for their daily tasks. The Internet has increased the demand for applications and services to provide a better customer experience. However, nowadays the Internet is full of information that can make it difficult to understand customer needs and confuse users when searching for the information they need. Therefore, there is a need to use effective methods and tools that can help in identifying and analyzing information from a large number of sources stored as online text. For such tasks, it is convenient to use natural language processing – an industry that combines the capabilities of computational linguistics, computer science and artificial intelligence to allow computer to understand and analyze meaning of human speech. One of the fundamental tasks of natural language processing is the definition of keywords. Identified keywords are used to determine the needs of users of the product when it comes to analyzing product reviews, and quickly find information about the product by the average user. Topic modeling methods are often used to determine keywords in the text This study provides a comparative analysis of topic modeling methods for use in text documents taken from reviews of digital products in the online store. Topic modeling is an unsupervised machine learning technique that allows you to analyse collection of documents and divide them into different topics. Three of the most popular topic modeling methods presented in this paper for document research are latent semantic analysis LSA, probabilistic latent semantic analysis PLSA, and latent Dirichlet allocation LDA. Comparative analysis is performed using numerical metrics such as coherence, perplexity and “human eye” evaluation metrics using word cloud visualization of results for different parameters of these methods. In addition, a comparison of performance methods was performed.

29 December 2022 in Herald of Khmelnytskyi National University. Technical sciences
Verified
Journal Article
Closed access
ABAndrii Barna
Andrii Barna
ABAndrii Boichuk
Andrii Boichuk
LULviv Polytechnic National University
Lviv Polytechnic National University
There is a significant increase in the amount of data that needs to be stored worldwide. More and more companies are turning their attention to deduplication systems, which effectively increase data warehouse volume and reduce storage costs. Deduplication not only reduces the overall amount of information in storage but also reduces the load on networks by eliminating the need to retransmit duplicate data. In this work, we considered the stages that any deduplication system includes, namely chunking, hashing and indexing, mapping. The effectiveness of deduplication systems primarily depends on the choice of the method of dividing the data stream at the chunking stage. We considered the classic Two Threshold Two Divisor (TTTD) method, which is widely used in modern deduplication systems. This method uses Rabin’s fingerprint to find the hash of the substring value. The formula for calculating the hash for the first substring and the formula for calculating the rest of the substring are given. Another method we investigated is Content Based Two Threshold Two Divisor (CB-TTTD) – it uses new hash functions to fragment the data stream, and the corresponding formulas for calculating the first and each subsequent substring are given. To test the effectiveness of these two methods, we developed a test deduplication system, implemented these two fragmentation methods, and tested their performance on two sets of text data. We have modified these methods with the addition of a new string-splitting condition based on the content specification of the data we tested. The results of a comparison of the work of classical and modified methods are given. Using metrics to compare the efficiency of data fragmentation methods, we obtained experimental data, based on which we can make conclusions about the feasibility of using CB-TTTD as an alternative to TTTD in new deduplication systems. The obtained data can be used in the development of new highly efficient data deduplication systems and to improve old solutions

1 October 2021 in Herald of Khmelnytskyi National University. Technical sciences
Verified
Journal Article
Open access
ABAndrii Boichuk
Andrii Boichuk
RKR Kaminsky
R Kaminsky
Nataliya ShakhovskaNataliya Shakhovska
Nataliya Shakhovska
BKB. Khudoba
B. Khudoba
LULviv Polytechnic National University
Lviv Polytechnic National University

2 May 2022 in Herald of Khmelnytskyi National University. Technical sciences
Verified
Journal Article
Closed access
DPDmytro Petrov
Dmytro Petrov
ABAndrii Boichuk
Andrii Boichuk
LULviv Polytechnic National University
Lviv Polytechnic National University
Clusterization is one of the types of algorithms of unsupervised learning. The idea behind it is that an algorithm learns patterns from untagged data. Such type of algorithm helps to find unseen dependencies in the untagged data itself. This paper presented algorithms based on Breadth-First Search or BFS for a Graph. The method was built based on the basic theory of clusterization. To the theory of clusterization, the calculated distance between the two farthest points in the cluster should be less than the distance between the closest two points from different clusters. By this rule, we defined that two parameters of the method should be the maximum distance between points by which these can be connected and assumed to be in one cluster. The second had to be the maximum distance in the cluster, aka the cluster’s diameter. A cluster’s diameter is the farthest distance between two points within a cluster. With these hyperparameters and the defined distance method, we can assume that every point is a vertex of a graph, two points within the threshold of the distance between pairs of ones are neighbours, and count the connection between counts as an edge of a graph. The group of connected vertexes or a particular vertex is a graph. The diameter hyperparameter ought to keep the data homogeneity in a cluster. We can define every graph as a cluster with defined rules based on previous assumptions. Later in this paper will be visualized the clusterization of three-dimensional data points. We took one of the most popular clusterization dataset – the iris dataset for visualizing purposes. The paper contains several examples of clusterization of the dataset with different hyperparameters. We took KMeans [3] as an example of the clusterization method. The method based on BFS is a flexible clusterization method that relies on meta-information about distancing between data points.