Sergey Makov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sergey Makov has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Viacheslav Voronin
Moscow State Univ. of Technology "STANKIN" (Russian Federation)
13 shared publications Vladimir Marchuk
Don State Technical University, Rostov-on-Don, Rostov reg., Russia
5 shared publications- Vladimir Mladenovic
Faculty of Technical Sciences Čačak, University of Kragujevac, Čačak, Serbia
4 shared publications Alexandr Minaev
Don State Technical University
3 shared publicationsAnton Nikitin
Don state Technical University, 344000, Rostov-on-Don, Russian Federation
3 shared publicationsIlya Svirin
G.M. SJSC Nordawind
2 shared publications
Latest Publications
- Open Access
- 1 November 2019
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 680 (1) , 012025
Modernized RC4 encryption algorithm
A modernized RC4 encryption algorithm with implementation of the resulting algorithm in program for encrypting files is proposed. The program has simple and intuitive interface Testing showed that the modernized encryption algorithm is slower for 4 milliseconds than the standard RC4, which is explained by a more complex key expansion algorithm. Proposed algorithm can replace RC4 without substantial loss in file encryption.
- 1 November 2019
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 680 (1) , 012025
Open AccessModernized RC4 encryption algorithm
A modernized RC4 encryption algorithm with implementation of the resulting algorithm in program for encrypting files is proposed. The program has simple and intuitive interface Testing showed that the modernized encryption algorithm is slower for 4 milliseconds than the standard RC4, which is explained by a more complex key expansion algorithm. Proposed algorithm can replace RC4 without substantial loss in file encryption.
- Open Access
- 21 June 2019
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 104, 02002
Energy efficiency digital filter design for spectral analysis of primary electrical values
In this paper, the knowledge based design of digital filter for analysis of spectral components is illustrated. The primary electrical values are analyzed observing of the faults which appear by earth short circuits. The main point of view is negative sequence component and higher harmonics in distributed electrical networks. Method of symbolic processing is used to design digital filter that realizes negative sequence component. Designing of digital filter is based on active analog filter in the three-phase electrical networks using bilinear transformation. We use methods of computer algebra tools (Mathematica) to simulate processes in network. Also, we automatically derive properties of digital filter, and the knowledge embedded in symbolic expressions was used to simulate an example system. The characteristics of digital filter are given and annotated using different sampling frequency and entire cases of earth short circuits.
- 21 June 2019
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 104, 02002
Open AccessEnergy efficiency digital filter design for spectral analysis of primary electrical values
In this paper, the knowledge based design of digital filter for analysis of spectral components is illustrated. The primary electrical values are analyzed observing of the faults which appear by earth short circuits. The main point of view is negative sequence component and higher harmonics in distributed electrical networks. Method of symbolic processing is used to design digital filter that realizes negative sequence component. Designing of digital filter is based on active analog filter in the three-phase electrical networks using bilinear transformation. We use methods of computer algebra tools (Mathematica) to simulate processes in network. Also, we automatically derive properties of digital filter, and the knowledge embedded in symbolic expressions was used to simulate an example system. The characteristics of digital filter are given and annotated using different sampling frequency and entire cases of earth short circuits.
- Open Access
- 21 June 2019
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 104, 02007
Electro-optical dust sensors calibration by aerosol image analysis
The paper describes the process of data obtaining for designing electro-optical sensors using a television aerosol particles image analyzer. Using simulation based on Mie theory, the process of calibration of simple electro-optical aerosol (dust) sensor is carried out. In the paper the main dependences for sensor calibration are shown. The proper calibration allows power saving by selection certain laser beam power level.
- 21 June 2019
- Published by EDP Sciences in E3S Web of Conferences
- Vol. 104, 02007
Open AccessElectro-optical dust sensors calibration by aerosol image analysis
The paper describes the process of data obtaining for designing electro-optical sensors using a television aerosol particles image analyzer. Using simulation based on Mie theory, the process of calibration of simple electro-optical aerosol (dust) sensor is carried out. In the paper the main dependences for sensor calibration are shown. The proper calibration allows power saving by selection certain laser beam power level.
- Open Access
- 31 October 2017
- Published by EDP Sciences in MATEC Web of Conferences
- Vol. 132, 05012
Multi-channel monitoring approach of E1 streams
The object of development is a device for multi-channel monitoring of the El stream state. The subject of the development is the monitoring of the status of the channels and analysis of traffic in each time slot of the El stream. The purpose of this paper is to develop an approach that allows multi-channel monitoring of the El stream state.
- 31 October 2017
- Published by EDP Sciences in MATEC Web of Conferences
- Vol. 132, 05012
Open AccessMulti-channel monitoring approach of E1 streams
The object of development is a device for multi-channel monitoring of the El stream state. The subject of the development is the monitoring of the status of the channels and analysis of traffic in each time slot of the El stream. The purpose of this paper is to develop an approach that allows multi-channel monitoring of the El stream state.
- 29 January 2017
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 29 (13) , 149-155
Feature representation learning by sparse neural network for multi-camera person re-identification
In this paper we study ability to sparse the neural networks which are used in the task of person re-identification in multi-camera CCTV systems. Sparse neural network allows significant reducing of the computation complexity. It means increasing of processing speed for huge volume of data. The main idea of our research is decreasing of computation complexity with simultaneous preserving of neural network efficiency in the task of person re-identification. The paper consists of 4 parts and conclusion. The first part – introduction, describes sphere of person re-identification applying and the key problems in this field. The second part – related work, describes main state-of-the-art approaches related to person re-identification techniques. In the third part called proposed approach, we formulate technique of sparse neural network learning. The fourth part – experiment results, describes experiment conditions, constrains, training datasets, and results. In the conclusion we make our proposal on new technique usage.
- 29 January 2017
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 29 (13) , 149-155
Feature representation learning by sparse neural network for multi-camera person re-identification
In this paper we study ability to sparse the neural networks which are used in the task of person re-identification in multi-camera CCTV systems. Sparse neural network allows significant reducing of the computation complexity. It means increasing of processing speed for huge volume of data. The main idea of our research is decreasing of computation complexity with simultaneous preserving of neural network efficiency in the task of person re-identification. The paper consists of 4 parts and conclusion. The first part – introduction, describes sphere of person re-identification applying and the key problems in this field. The second part – related work, describes main state-of-the-art approaches related to person re-identification techniques. In the third part called proposed approach, we formulate technique of sparse neural network learning. The fourth part – experiment results, describes experiment conditions, constrains, training datasets, and results. In the conclusion we make our proposal on new technique usage.
- 29 January 2017
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 29 (13) , 16-20
Texture representations in different basis functions for image synthesis using system criteria analysis
This paper introduces a texture representation suitable for image synthesis of textured surfaces. An efficient representation for natural images is of fundamental importance in image processing and analysis. The automated analysis of texture is widely applied in a number of real-world applications, e.g., image and video retrieval, object recognition and classification. For texture representation we consider the orthogonal decomposition of two-dimensional signals (images) using spectral transform in the different basis functions. This paper focuses on the analysis of the following basis functions Fourier, Walsh, Haar, Hartley and cosine transform using system criteria analysis. This criterion includes error signal representation and computational cost. For correct calculation of the components of the system criterion we use statistical averaging. It is shown that the Haar transform can represent textural patches more efficiently with smaller average risk than other basis functions. The texture representations results compare favourably against other state-of-the-art directional representations.
- 29 January 2017
- Published by Society for Imaging Science & Technology in Electronic Imaging
- Vol. 29 (13) , 16-20
Texture representations in different basis functions for image synthesis using system criteria analysis
This paper introduces a texture representation suitable for image synthesis of textured surfaces. An efficient representation for natural images is of fundamental importance in image processing and analysis. The automated analysis of texture is widely applied in a number of real-world applications, e.g., image and video retrieval, object recognition and classification. For texture representation we consider the orthogonal decomposition of two-dimensional signals (images) using spectral transform in the different basis functions. This paper focuses on the analysis of the following basis functions Fourier, Walsh, Haar, Hartley and cosine transform using system criteria analysis. This criterion includes error signal representation and computational cost. For correct calculation of the components of the system criterion we use statistical averaging. It is shown that the Haar transform can represent textural patches more efficiently with smaller average risk than other basis functions. The texture representations results compare favourably against other state-of-the-art directional representations.
- RetractedOpen Access
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (2) , 229-244
Spatio-temporal image inpainting for video applications
Video inpainting or completion is a vital video improvement technique used to repair or edit digital videos. This paper describes a framework for temporally consistent video completion. The proposed method allows to remove dynamic objects or restore missing or tainted regions presented in a video sequence by utilizing spatial and temporal information from neighboring scenes. Masking algorithm is used for detection of scratches or damaged portions in video frames. The algorithm iteratively performs the following operations: achieve frame; update the scene model; update positions of moving objects; replace parts of the frame occupied by the objects marked for remove by using a background model. In this paper, we extend an image inpainting algorithm based texture and structure reconstruction by incorporating an improved strategy for video. Our algorithm is able to deal with a variety of challenging situations which naturally arise in video inpainting, such as the correct reconstruction of dynamic textures, multiple moving objects and moving background. Experimental comparisons to state-of-the-art video completion methods demonstrate the effectiveness of the proposed approach. It is shown that the proposed spatio-temporal image inpainting method allows restoring a missing blocks and removing a text from the scenes on videos. This article has been retracted. Link to the retraction 10.2298/SJEE1803373E
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (2) , 229-244
RetractedOpen AccessSpatio-temporal image inpainting for video applications
Video inpainting or completion is a vital video improvement technique used to repair or edit digital videos. This paper describes a framework for temporally consistent video completion. The proposed method allows to remove dynamic objects or restore missing or tainted regions presented in a video sequence by utilizing spatial and temporal information from neighboring scenes. Masking algorithm is used for detection of scratches or damaged portions in video frames. The algorithm iteratively performs the following operations: achieve frame; update the scene model; update positions of moving objects; replace parts of the frame occupied by the objects marked for remove by using a background model. In this paper, we extend an image inpainting algorithm based texture and structure reconstruction by incorporating an improved strategy for video. Our algorithm is able to deal with a variety of challenging situations which naturally arise in video inpainting, such as the correct reconstruction of dynamic textures, multiple moving objects and moving background. Experimental comparisons to state-of-the-art video completion methods demonstrate the effectiveness of the proposed approach. It is shown that the proposed spatio-temporal image inpainting method allows restoring a missing blocks and removing a text from the scenes on videos. This article has been retracted. Link to the retraction 10.2298/SJEE1803373E
- Open Access
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (3) , 313-321
Steganography method for the G.711 channel
This paper deals with an improved algorithm developed for the transmission of the hidden information in the G.711 channel [1]. The subject of the research is a method of improving characteristics of a steganography system by means of using specially developed codes. Also analysis of transmission characteristics of the hidden information depending on a number of bits of the original data replaced at a given threshold was conducted.
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (3) , 313-321
Open AccessSteganography method for the G.711 channel
This paper deals with an improved algorithm developed for the transmission of the hidden information in the G.711 channel [1]. The subject of the research is a method of improving characteristics of a steganography system by means of using specially developed codes. Also analysis of transmission characteristics of the hidden information depending on a number of bits of the original data replaced at a given threshold was conducted.
- Open Access
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (3) , 415-431
Fast computation of the iteration-based simulation method - case study of non-coherent ask with shadowing
This article presents a new method of fast symbolic computations of very complex calculations, which are necessary for the analysis, simulation, and design of wireless communication systems using CAS (Computer Algebra System). CAS is applied to formulate hypotheses and define joint probability density functions of certain modulation technique. This is used to prepare for the semi-symbolic calculation to complete specify wireless system by using CAS. We have developed an iteration-based simulation method that aids to solve semisymbolic expressions and gives closed form solutions (with some parameters specified as numbers and some as symbols). So far, they are solved by numerical methods. Students can perform performance analysis and understand the processes in the data transfer. Engineers and researchers may have a better insight into the impact of the important parameters necessary to properly transmit and detect information unlike traditional numerical methods. The main contribution is to obtain solutions for the probability density function, and outage probability where no solution can be obtained using numerical methods. A strong emphasis is placed on very fast calculations that significantly save the time of analysis, simulation, and design.
- 1 January 2017
- Published by National Library of Serbia in Serbian Journal of Electrical Engineering
- Vol. 14 (3) , 415-431
Open AccessFast computation of the iteration-based simulation method - case study of non-coherent ask with shadowing
This article presents a new method of fast symbolic computations of very complex calculations, which are necessary for the analysis, simulation, and design of wireless communication systems using CAS (Computer Algebra System). CAS is applied to formulate hypotheses and define joint probability density functions of certain modulation technique. This is used to prepare for the semi-symbolic calculation to complete specify wireless system by using CAS. We have developed an iteration-based simulation method that aids to solve semisymbolic expressions and gives closed form solutions (with some parameters specified as numbers and some as symbols). So far, they are solved by numerical methods. Students can perform performance analysis and understand the processes in the data transfer. Engineers and researchers may have a better insight into the impact of the important parameters necessary to properly transmit and detect information unlike traditional numerical methods. The main contribution is to obtain solutions for the probability density function, and outage probability where no solution can be obtained using numerical methods. A strong emphasis is placed on very fast calculations that significantly save the time of analysis, simulation, and design.