Natalia Kokriatskaia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Natalia Kokriatskaia has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Leonid Timchenko
State University of Infrastructure and Technology
4 shared publications - Volodymyr Tverdomed
Educational and Research Kyiv Institute of Railway Transport, National Transport University, Mykhaila Omelianovycha—Pavlenka Str. 1, 01010 Kyiv, Ukraine
4 shared publications - Dmytro Zhuk
State University of Infrastructure and Technology, Kyiv, Ukraine
3 shared publications - Saule Smailova
D. Serikbayev East Kazakhstan state technical university
2 shared publications - Vladyslav Plisenko
State University of Infrastructure and Technology, Kyiv, Ukraine
2 shared publications - Iryna Shakhina
Vinnytsia Mykhailo Kotsiubynskyi State Pedagogical University
1 shared publication
Latest Publications
- Open Access
- 31 March 2024
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 14 (1) , 46-52
ARCHITECTURAL AND STRUCTURAL AND FUNCTIONAL FEATURES OF THE ORGANIZATION OF PARALLEL-HIERARCHICAL MEMORY
Parallel hierarchical memory (PI memory) is a new type of memory that is designed to improve the performance of parallel computing systems. PI memory is composed of two blocks: a mask RAM and a tail element RAM. The mask RAM stores the masks that are used to encode the information, while the tail element RAM stores the actual information. The address block of the PI memory is responsible for generating the physical addresses of the cells where the tail elements and their masks are stored. The address block also stores the field of addresses where the array was written and associates this field of addresses with the corresponding external address used to write the array. The proposed address block structure is able to efficiently generate the physical addresses of the cells where the tail elements and their masks are stored. The address block is also able to store the field of addresses where the array was written and associate this field of addresses with the corresponding external address used to write the array. The proposed address block structure has been implemented in a prototype PI memory. The prototype PI memory has been shown to be able to achieve significant performance improvements over traditional memory architectures. The paper will present a detailed description of the PI transformation algorithm, a description of the different modes of addressing organization that can be used in PI memory, an analysis of the efficiency of parallel-hierarchical memory structures, and a discussion of the challenges and future research directions in the field of PI memory.
- 31 March 2024
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 14 (1) , 46-52
Open AccessARCHITECTURAL AND STRUCTURAL AND FUNCTIONAL FEATURES OF THE ORGANIZATION OF PARALLEL-HIERARCHICAL MEMORY
Parallel hierarchical memory (PI memory) is a new type of memory that is designed to improve the performance of parallel computing systems. PI memory is composed of two blocks: a mask RAM and a tail element RAM. The mask RAM stores the masks that are used to encode the information, while the tail element RAM stores the actual information. The address block of the PI memory is responsible for generating the physical addresses of the cells where the tail elements and their masks are stored. The address block also stores the field of addresses where the array was written and associates this field of addresses with the corresponding external address used to write the array. The proposed address block structure is able to efficiently generate the physical addresses of the cells where the tail elements and their masks are stored. The address block is also able to store the field of addresses where the array was written and associate this field of addresses with the corresponding external address used to write the array. The proposed address block structure has been implemented in a prototype PI memory. The prototype PI memory has been shown to be able to achieve significant performance improvements over traditional memory architectures. The paper will present a detailed description of the PI transformation algorithm, a description of the different modes of addressing organization that can be used in PI memory, an analysis of the efficiency of parallel-hierarchical memory structures, and a discussion of the challenges and future research directions in the field of PI memory.
- Open Access
- 30 September 2023
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 13 (3) , 47-50
SEGMENTATION OF MULTIGRADATION IMAGES BASED ON SPATIAL CONNECTIVITY FEATURES
The article aims to study the multi-level segmentation process of images of arbitrary configuration and placement based on features of spatial connectivity. Existing image processing algorithms are analyzed, and their advantages and disadvantages are determined. A method of organizing the process of segmentation of multi-gradation halftone images is developed and an algorithm of actions according to the described method is given.
- 30 September 2023
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 13 (3) , 47-50
Open AccessSEGMENTATION OF MULTIGRADATION IMAGES BASED ON SPATIAL CONNECTIVITY FEATURES
The article aims to study the multi-level segmentation process of images of arbitrary configuration and placement based on features of spatial connectivity. Existing image processing algorithms are analyzed, and their advantages and disadvantages are determined. A method of organizing the process of segmentation of multi-gradation halftone images is developed and an algorithm of actions according to the described method is given.
- Open Access
- 30 June 2023
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 13 (2) , 69-73
LOCAL DIFFERENCE THRESHOLD LEARNING IN FILTERING NORMAL WHITE NOISE
The article was aimed at studying the process of learning by the local difference threshold when filtering normal white noise. The existing learning algorithms for image processing were analyzed and their advantages and disadvantages were identified. The influence of normal white noise on the recognition process is considered. A method for organizing the learning process of the correlator with image preprocessing by the GQP method has been developed. The dependence of the average value of readings of the rank CCF (RCCF) of GQPs of the reference and current images, representing realizations of normal white noise, on the probability of formation of readings of zero GQP is determined. Two versions of the learning algorithm according to the described learning method are proposed. A technique for determining the algorithm efficiency estimate is proposed.
- 30 June 2023
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 13 (2) , 69-73
Open AccessLOCAL DIFFERENCE THRESHOLD LEARNING IN FILTERING NORMAL WHITE NOISE
The article was aimed at studying the process of learning by the local difference threshold when filtering normal white noise. The existing learning algorithms for image processing were analyzed and their advantages and disadvantages were identified. The influence of normal white noise on the recognition process is considered. A method for organizing the learning process of the correlator with image preprocessing by the GQP method has been developed. The dependence of the average value of readings of the rank CCF (RCCF) of GQPs of the reference and current images, representing realizations of normal white noise, on the probability of formation of readings of zero GQP is determined. Two versions of the learning algorithm according to the described learning method are proposed. A technique for determining the algorithm efficiency estimate is proposed.
- Open Access
- 30 December 2022
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 12 (4) , 41-46
THE USE OF Q-PREPARATION FOR AMPLITUDE FILTERING OF DISCRETED IMAGE
The article was aimed at improving the amplitude filtering process of the sampled image through the use of generalized Q-preparation. The existing correlation algorithms for image preprocessing were analyzed and their advantages and disadvantages were identified. The process of amplitude filtering and the main methods of preprocessing with such filtering were considered. A method of amplitude filtering of images based on the generalized Q-transformation with the use of sum-difference preprocessing of images has been developed. The efficiency of this method was analyzed, and a variant of the scheme for the corresponding preprocessing of images was proposed. The efficiency of the method was confirmed by computer simulation.
- 30 December 2022
- Published by Politechnika Lubelska in Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
- Vol. 12 (4) , 41-46
Open AccessTHE USE OF Q-PREPARATION FOR AMPLITUDE FILTERING OF DISCRETED IMAGE
The article was aimed at improving the amplitude filtering process of the sampled image through the use of generalized Q-preparation. The existing correlation algorithms for image preprocessing were analyzed and their advantages and disadvantages were identified. The process of amplitude filtering and the main methods of preprocessing with such filtering were considered. A method of amplitude filtering of images based on the generalized Q-transformation with the use of sum-difference preprocessing of images has been developed. The efficiency of this method was analyzed, and a variant of the scheme for the corresponding preprocessing of images was proposed. The efficiency of the method was confirmed by computer simulation.