Volodymyr Maidaniuk

Volodymyr Maidaniuk

Auto-generated profile, based on publicly available information

Volodymyr Maidaniuk

Vinnytsia National Technical University

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
1 January 2024 in Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science
Verified
Journal Article
Closed access
VMVolodymyr Maidanіuk
Volodymyr Maidanіuk
OROleksandr Romanyuk
Oleksandr Romanyuk
SPSergii Pavlov
Sergii Pavlov
MNMykola Nechyporuk
Mykola Nechyporuk
The features of image compression based on two-dimensional orthogonal transformations are considered. It is shown that the increase in the compression ratio can be achieved through the grouping of transformants of discrete orthogonal transformations (Walsh-Hadamard, DCT, and others) and their vector quantization using a self-organizing neural network proposed by Finnish scientist T. Kohonen (Self-Organizing Feature Map – SOFM). Grouping coefficients is an alternative to JPEG zigzag scanning and can not only improve the accuracy of vector quantization but also increase the compression ratio at the lossless compression stage by improving the accuracy of the modeler in adaptive lossless coding schemes, which can increase the compression ratio. Also, after grouping the coefficients, it is easy to organize zonal selection of coefficients, as the coefficients with the same frequencies are localized in certain areas of the image space, which allows them to be excluded from the image synthesis process. Testing has shown that grouping DCT coefficients increases the compression ratio by 1.2-2 times compared to methods without coefficient grouping. Further increase in the image compression ratio is possible with the application of vector quantization of DCT transformants. Studies have shown that the best results are provided by combined quantization – integer quantization for low-frequency transformants and vector quantization using a two-dimensional Kohonen map for high-frequency ones, which allowed increasing the compression ratio of Grayscale images by 30% compared to the JPEG method.

1 January 2026 in Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science
Verified
Journal Article
Closed access
VMVolodymyr Maidaniuk
Volodymyr Maidaniuk
OROleksandr Romanyuk
Oleksandr Romanyuk
IAIgor Arseniuk
Igor Arseniuk
OSOleksii Skladaniuk
Oleksii Skladaniuk
MNMykola Nechyporuk
Mykola Nechyporuk
"Ensuring the confidentiality of biomedical images is an important task in modern medical information systems, especially in the context of telemedicine development. X-ray images are widely used for diagnostics and are transmitted over communication n networks, which increases the risk of unauthorized access and data leakage. Traditional cryptographic methods provide a high level of data protection but do not conceal the fact of data transmission, which limits their effectiveness in certain applications. This paper investigates a steganographic approach to biomedical image protection based on embedding one X-ray image into another X-ray image. The purpose of the study is to ensure high quality of the container image and to minimize visual distortions during embedding. Methods in both spatial and frequency domains are used, in particular embedding based on Walsh– Hadamard transform coefficients. Experimental results show that avoiding coefficient normalization during the forward transform and applying normalization only at the inverse stage reduces distortions and preserves high visual quality even at full container capacity. It is established that embedding in transform coefficients provides higher container capacity compared to spatial-domain methods. The obtained results confirm the effectiveness of using X-ray images as containers for hiding images of the same type, ensuring high imperceptibility and steganographic robustness."

28 August 2025 in Measuring and computing devices in technological processes
Verified
Journal Article
Open access
ОПОлег Прус
Олег Прус
ВМВолодимир Майданюк
Володимир Майданюк
У статті представлено відтворювану методику емпіричного оцінювання параметрів узагальненого закону Амдала для веб-інтерфейсів із фокусом на перцентильні UX-метрики. Запропоновано багаторесурсну модель критичного шляху з частками етапів (мережа, JS/CPU, рендер тощо), локальними прискореннями для окремих технік оптимізації та явним урахуванням неадитивності через множники взаємодій . Ідентифікацію параметрів реалізовано на основі дворівневих факторних дизайнів і регресії в лог-просторі перцентилів з коваріатами страт (клас пристрою, тип мережі, стан кешу). Операціоналізацію здійснено за Chrome trace/HAR через робастний «breakdown» часу; оцінювання – за парами «увімкнено/вимкнено» та, за необхідності, у схемі difference-in-differences на польових даних (RUM). Якість прогнозів контролюється через MAPE та RMSE у лог-шкалі, невизначеність – через bootstrap-інтервали; калібровка «факт → прогноз» перевіряє зсув і масштаб. На репрезентативних маршрутах (hero-зображення та списковий інтерфейс) показано, що попарні взаємодії оптимізацій істотно впливають на та , а безпосереднє моделювання зменшує похибку передбачення порівняно з адитивними припущеннями. Отримано типові похибки 6–9% для перцентильних метрик із коректною калібровкою масштабу, що є достатнім для включення оцінених до процедур перцентильного прогнозування та планування «пакетів» змін у CI-циклах. Практичну значущість становить перехід від евристичного налаштування до кількісно обґрунтованого вибору оптимізацій із прозорою інтерпретацією внесків і взаємодій. Наукова новизна полягає у поєднанні багаторесурсної моделі з перцентильною регресією й явним урахуванням неадитивності для промислових веб-систем.

1 January 2020
Verified
Book Chapter
Closed access
SHShadi M. S. Hilles
Shadi M. S. Hilles
VMVolodymyr P. Maidaniuk
Volodymyr P. Maidaniuk
This chapter presents image compression based on SOFM and vector quantization (VQ). The purpose of this chapter is to show the significance of SOFM with bandpass filter in process of image compression to increase compression ratio and to enhance image compression effectiveness. Image compression by SOFM model is presented and consists of three stages: The first is band-pass filter. The result experiments used Lena.bmp, girl256.bmp, and show compression in block image 16x16 given best compression ratio with a small signal-noise ratio (SNR).

1 September 2026
Verified
Conference Paper
Closed access
RCRoman Chekhmestruk
Roman Chekhmestruk
OROleksandr Romanyuk
Oleksandr Romanyuk
OSOleksii Stakhov
Oleksii Stakhov
VMVolodymyr Maidaniuk
Volodymyr Maidaniuk
NBNatalia Babiuk
Natalia Babiuk

12 June 2001
Verified
Conference Paper
Closed access
PDF file
APAnatoliy M. Petukh
Anatoliy M. Petukh
VKVolodymyr P. Kojemiako
Volodymyr P. Kojemiako
VMVolodymyr P. Maidanuk
Volodymyr P. Maidanuk
OROleh V. Rudyi
Oleh V. Rudyi
The receiving of good coefficients of the image compression probably in the event that the compressor is specialized and it takes into account special features of the image structure. The submitted method of the statistical block compression of images takes into account the presence in the image many areas with almost identical brightness. The in itself given method does not represent the special value, as its unique positive quality is account of special features of the image structure. The method makes the analysis of the image on with the purpose of detection of areas with close brightness. But the given method actually reduces volume of an initial file, coding the information thus, at which it is convenient for compression by a method LZW. The method of statistical block compression of images consists in the analysis of blocks, which turn out by division of the entrance image. The size of received blocks is identical. Above received blocks are made affine transformations and those blocks, which satisfy to the element control criterion are considered identical. The basic task consists in search of the greatest amount of acceptable blocks. Certainly, the search is possible to make very much plenty of time, as if we have the image size 100 X 100, the amount of blocks of the different size can be equal 10,000. But to make it is unprofitable, therefore block has a kind of a square. The submitted method has two variants: one uses the block of the fixed size 8 X 8 (given size was determined experimentally), another uses blocks of the various size, which turn out by dynamic division of unacceptable blocks. Upon termination of the analysis of blocks at presence of acceptable blocks in a final file the following information enters the name: amount of blocks, blocks, coded information, which defines the place of the block and the identifier of affine transformation. Two variants of the submitted method practically are identical on efficiency, as use of dynamic division of the block improves the factor of compression on 15 - 20%, but increases the program time.