Development of a Method of Encoding a Significant Coordinate Brightness Component of a Video Image Vladimir Barannik1[0000-0002-2848-4524] and Oleksandr Yudin 3[0000-0002-6417-0768], Anton Sorokun3[0000-0001-8469-641X] and Maksym Parkhomenko 1[0000-0001-6062-7743] and Victoriya Himenko2[0000-0003-1337-2404] 1,2 Kharkiv National Air Force University, Kharkiv, Ukraine vvbar.off@gmail.com, sorokun@gmail.com 3 Taras Shevchenko National University of Kyiv, Kyiv, Ukraine yak333@ukr.net Abstract. A method of encoding a significant coordinate luminance component of a video image based on its representation in the form of a structural position number with global and local inequality of values of neighboring elements has been developed. The distinguishing points are that it is taken into account; a two-hierarchical code-value formation scheme for a set of coherence areas after uneven subversion to exclude items with equal values; the value of the local sensitivity indicator that determines the floating number of significant elements of ОКГ. In this case, by eliminating prohibited sequences that allow the content of items with equal values (i.e., which is contrary to the rule of building mean- ingful areas of coherence), the structural elimination is achieved redundancy without making any additional mistakes. Keywords: data, image coding, video processing, telecommunication systems. 1 Introduction Humanity actively uses digital photo-video technology not only to meet its own needs for bright photo-gras and videos, but also to ensure the vitality of both individual and small firms and large firms, and large associations of people, corporations, or-gan (structures) of state power and the state as a whole (including its international activi- ties). Therefore, there have been frequent recent issues of ensuring the confidentiality of digital images, both to protect personal data and to protect information in crisis management systems of the defence, security and law enforcement sectors. At the same time, crisis management systems need to address the current scientific problem of increasing privacy at a given level of accessibility of video information that is pro- cessed and transmitted using wireless telecommunications technologies in real time without losing the integrity of the data [1-5]. The problem is that increasing the privacy of video data (static and dynamic) leads to: Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons Li- cense Attribution 4.0 International (CC BY 4.0). CybHyg-2019: International Workshop on Cyber Hygiene, Kyiv, Ukraine, November 30, 2019. ─ On the one hand, to increase the time cost of processing and delivering data, i.e. reducing its availability; ─ On the other hand, reducing the amount of useful information (image quality) to maintain a given speed, resulting in a decrease in credibility, i.e. loss of integrity [6]. Accordingly, reducing the volume of video data in order to increase the perfor- mance of information communication systems with the specified quality of video service is a significant scientific and application task 2 Method of Encoding Significant Coordinate- Brightness Component of Video Image Process of arrays coding G m(u, k) is proposed to carry out in the row direction. This al- lows you to take into account not only restrictions on the amplitude values of the sig- nificant elements of coherence areas, g1,1  w( g )1  g max 1 but also local and global restrictions on inequality of adjacent elements, g j  g  , j,   1, k . It takes into account that according to the condition of the identification and descrip- tion of areas of video images regression coherence assumed that coherence areas con- tains significant elements from the local sensitivity index position. Then there will be a reduction in the level of visual assessments. Such distortions can propagate in the re- construction process within bounded area of the coherence. However, if such areas are long, it is an option when such correction will be visually noticeable. It means that for locating such consequences should be carried out subsequent processing of significant elements of coherence area without inserting mistakes [7-11]. For this approach, the process of forming the code description is proposed to con- duct on the basis of building code designs for position numbers. Building code description for the structural positional number of global and local inequality of numbers arranged in two stages:  the first step is to determine the code string describing G i , considering only lim- itations on the dynamic range w(g ) array elements Gm( u,k) significant coordinate- brightness component of the video;  the second step is used to obtain a code description with additional consideration of the limitation on the inequality of related elements in the rows G i . 3 Building Code Designs for Positional Numbers Coding position numbers as rows G i of arrays Gm( u,k) it is set by the following expres- sion: k E ( g )i   g i, j Q( g ) j (1) j 1 where Q( g ) j - weight coefficient of j structural element of the position of G k ; g i, j - (i; j ) element of array Gm( u,k) ; k - the number of elements in a row G i . Because the dynamic range for the array elements of a meaningful coordinate- brightness component is equal to w(g ) , so corresponding weight will be determined by the equation: Q (g ) j  w (g ) k  j (2) The resulting value E ( g ) i of code description of the structural positional number G i will be calculated using following expression: k E ( g )i   g i, j w( g ) k  j (3) j 1 Equation (3) allows to calculate the value of the code description E ( g ) i to row G i array of a significant coordinate-brightness component without taking into account the condition of inequality of neighboring elements. This condition is taken into account at the second stage of ratio construction for code generation. In the second step, is additionally taken into account the condition of global and lo- cal inequality of elements in the rows of the array Gm( u,k) , i.e. g j  g  , j,   1, k . In the case where the code value E ( g ) i calculated using equation (2), the permitted string combinations G i array of significant elements of coherence area will be se- quences (strings) for which at least one pair of adjacent elements are allowed equality, i.e. [12-14]: gi, j  gi, j 1 (4) During code value determination E ( g ) i for structural position ща numbers, taking into account the global and local inequalities of related elements, it is necessary to exclude all combinations that:  first, precede the current (i.e. specific line G i );  second, it contains at least one pair, for adjacent elements of which it is neces- sary to exclude cases when adjacent elements will be equal to each other. Consider j step up the coding process of i row of array G m(u, k) , i.e. when the first ( j  1) Elements, g i,  ,  1, j  1 is carried out. Here's the number  j untreated items of the current row G i , including j element, will be calculated by equation:  j  (k  j 1) (5) where k - is the length of the array string Gm( u,k) of significant elements of the total of the areas of coherence. At the same time, untreated items will be further treated as younger than previously processed [15-17]. To specify, enter a sequence G( j )i , which is part of the row G i , and consists from  j elements of raw elements, i.e.: G( j )i {gi , j ;...; gi ,  ;...; gi ,k }   j , k (6) Next, the sequence will be considered to obtain the weighting value. G( j )i from two aspects. The first aspect is to determine the quantity Q( gi , j 1 ) valid sequences but which begin with an element gi , j 1 . And here the number of prohibited elements, i.e. for which equality of values is performed, on j to position it will be equal 1. While for the others ( j  1) elements of the dynamic range limit and the inequality of the values of related elements will be met. Then, because by the condition of coding the associate ( j  1) elements are elements of a structural positional number G i with a dynamic range equal to w(g ) , that number Q( gi , j 1 ) such acceptable numbers are found using an equation: Q( gi , j 1)  1 (w( g )  1)k  j (7) where (w( g )  1) k  j is number of sequences (length equal ( j  1) ), elements that meet the limitations of dynamic range and the inequality of neighboring elements. With the second aspect, consider the number of forbidden sequences that precede current. here, the value Q( gi , j 1 ) also allows you to determine the number of Q( gi, j  gi , j 1 ) of forbidden sequences, composed of  j elements preceding the en- coded sequence G( j )i , gi, j - auxiliary element preceding sequence. In view of that, we find that the condition gi, j  gi , j 1 perhaps then and only when the ratio is performed next inequality: gi, j 1  gi, j (8) Then, after generalization and considering equation (7) and inequality (8), quantity Q( g ) i( j ) permissible sequences that precede G( j )i will be determined by the follow- ing system of expressions:  g i , j ( w( g )  1) ( k  j )  ( w( g )  1) k  j ,  g i , j 1  g i , j ; Q( g )i   ( j) (9) (k  j )  g i , j ( w( g )  1) ,  g i , j 1  g i , j , Or according to the equation (7) for value Q( gi, j  gi , j 1) :  gi , j ( w( g )  1)( k  j )  ( w( g )  1) k  j ,  gi , j 1  gi , j ; Q ( g )i   ( j) (10) (k  j )  gi , j ( w( g )  1) ,  gi , j 1  gi , j , where g i , j ( w( g )  1) ( k  j ) is total number of sequences (length equal to  j ), for all the elements of which, except j , limits on dynamic range and on the inequality of neighboring elements. Using the relationship to calculate the string code value G i significant elements of the array of coherent regarded as structural positional number of global and local ine- quality between the values of adjacent elements such kind will be given by following equation: k E ( g )i   Q( g )i( j ) (10) j 1 In the initial processing step for an element g1,1 as a prior element g 0 Value w(g ) is chosen, equal to the dynamic range of an array of significant coordinate-brightness component, i.e.. g 0  w( g ) (11) This choice is due to the fact that, first, the values of the elements preceding the ele- ment are not restricted to the zero element. Second, the choice of condition (11) allows to meet the conditions of inequality g 0  w( g )  g1,1 . The resulting code value E ( g ) i has a two-hierarchical structure. This is because it is formed for several areas of coherence (the upper level of the hierarchy), each of which in turn is described by several significant elements (lower level of hierarchy). Moreover, the number of such elements is determined by the indicator  (loc) of local sensitivity. Then the code value E ( (loc) ; g ) i from the position of the two hierarchies and the dependence on the size of the  (loc) , can be determined by following equa- tion:  ok R E ( (loc) ; g ) i    Q( (loc) ; g ) i(,r) (12)   1 r 1 Here  ok - the number of significant regions of coherence in row; R - the number of significant elements in  coherence area; Q( (loc) ; g )i(,r) - weight coefficient for (  r ) significant element  areas of co- herence, structured in i row of array Gm( u,k) . Then, after summarizing the number of Q( g ) i( j ) permissible sequences of previous G( j )i will be determined by the following system of expressions:   1 ( k  r   R  )   1 ( x(i ) ,   1) ( w( g )  1) ,    x(i ) 1,   R 11  x(i ) ,  & r  0; Q ( (loc) ; g )i(,r)   (13)  1  ( k  r   R  )   1 ( x(i ) ,   r  1) ( w( g )  1) ,   x(i ) ,   r 1  x(i ) ,   r & r  1;    1 ( k  r   R  )   1  x (i )   , ( w ( g )  1) ,   x(i )  1,   R 1 1  x(i )  ,  & r  0; Q ( (loc) ; g ) i(,r)   (14)  1  ( k  r   R  )   1  x(i )  ,   r ( w( g )  1) ,  x(i )    ,   r 1  x (i )  ,   r & r  1 . Here x(i) ,  r - (  r ) significant element of the sequence Х ( ) (areas of coher- ence) structured in i row of array Gm( u,k) ; R - the number of elements in the sequence Х ( ) ; r - variable index, r  0, R 1 ;  1  R - the total number of significant elements in (  1) coherence areas.  1 Base code value E((loc ) ; g)i for incremental (filled) code construction Z(g; R ) u forming an array row element G ( u ) , which in turn are interpreted as structural posi- m, k tional numbers with global and local values of neighboring elements inequality. In general, the value of E((loc ) ; g)i defined by a two-hierarchical scheme using the following ratio system: ─ for the condition x (i)  1,   R  1 1  x (i) ,  :   1 ( k  r   R )  ok ( x(i)   1) ( w( g )  1) R  1 ,  r  0; (15)  E ( ; g ) i     ( loc ) ,  1   1 r 1  ( k  r   R ) ( x(i) ,   r  1) ( w( g )  1)  1 ,  r  1; ─ for the condition x(i) 1,   R   x(i),  :  1 1   1 ( k  r   R )  ok  x(i)  ( w( g )  1) R  1 ,  r  0; (16)  E ( (loc) ; g ) i      ,   1   1 r 1  ( k  r   R )  x(i) ,   r ( w( g )  1)  1 ,  r  1. According to the fourth methodological basis for the code description of the mag- nitude E((loc ) ; g)i used a uniform number of bits equal to the Vnec . As a result, we obtain the expression for the value V(g)i : V(g)i [k og2 (w(g)  1)]  1 (17) In the general case is carried out the following inequality: V ( g ) i  Vnec (18) Then a number of V code redundancy, and accordingly there are older bits of code description that have a non-zero value, i.e.: V  Vnec  V ( g ) i  0 (19) In some cases, when the  (loc) sensitivity is chosen equal: -  (loc)  0 , we get that there are no insignificant elements, and all elements of the identified area of coherence are received for processing. Here, psychovisual redun- dancy is not reduced; -  (loc)   ( glob) , indicators of global and local sensitivity are aligned. In this case, the entire coherence area is approximated by a single value, such as the average R 1 x  , x  (  x ,  r ) / R . In particular cases, namely when the sensitivity index is r 0 equal to: -  (loc)  0 , Obtaining that the number of minor elements is not present, and all elements of the detected coherence region are processed. Here psycho-mental redun- dancy does not shrink; -  (loc)   ( glob) , That is, global and local sensitivity measures are aligned. In this case, the entire coherence region is approximated by a single value, for example, R 1 an average value of x , x  (  x ,  r ) / R . Accordingly, the formation of the r 0 code value E( (loc) ; g )i will be carried out on the same level of hierarchy. Equations (12) (13) will take that look:  ok  n E ( (loc) ; g ) i   Q( (loc) ; g )i( ) (20)  1  n  ( x(i )  1) ( w( g )  1) ,  x (i ) 1  x(i ) ; Q( (loc) ; g ) i( )   (21) (k  )  x(i ) ( w( g )  1)  ,  x(i ) 1  x(i ) . For this option, the largest decrease in bit volume is achieved on the one hand, but on the other hand the greatest decrease in the level of visual assessment is achieved. In case of proceeding of all array G m( u, k) of significant elements of coherence areas, i.e. the formation of code values for all its lines based on the ratio (10), forming a sequence E (u ) of code values, namely: E (u )  {E( (loc) ; g )1 ;...; E( (loc) ; g )i ;...; E( (loc) ; g )m} . So, expressions (9) – (10) provide code values for rows of an array of significant coordination-brightness components of the video, which are structural positional numbers with global and local properties of inequality between the values of neigh- boring elements. In this case, by excluding prohibited sequences that allow the con- tent of elements with equal values (that is, contrary to the rule of building significant areas of coherence), structural redundancy is eliminated without adding additional errors. This is done even in cases where the values of the unobstructed coherent areas of elements tend to the level of the upper amplitude value, i.e.: gi, j  w( g ) [18-23]. Conclusions A method of encoding a significant coordinate brightness component of a video im- age based on its representation in the form of a structural position number with global and local inequality of values of neighboring elements has been developed. The dis- tinguishing points are that it is taken into account; a two-hierarchical code-value for- mation scheme for a set of coherence areas after uneven subversion to exclude items with equal values; the value of the local sensitivity indicator that determines the float- ing number of significant elements of coherence area [24-26]. In this case, by elimi- nating prohibited sequences that allow the content of items with equal values (i.e., which is contrary to the rule of building meaningful areas of coherence), the structural elimination is achieved redundancy without making any additional mistakes. At the same time, this processing ensures that the level of visual assessment is maintained. The ratio for estimating the top level of the number of bits, which is spent on the rep- resentation of the code value of the line of the array of a significant coordinate- brightness component of the video [27-28]. References 1. Richardson J. Video encoding H.264 and MPEG-4 - standards of the new generation [text]. TECHNOSPHERE. 156 - 192 p. (2012) 2. Wang S., Zhang X., Liu X., Zhang J., Ma S. and Gao W.Utility-Driven Adaptive Prepro- cessing for Screen Content Video Compression. IEEE Transactions on Multimedia, vol. 19, no. 3, pp. 660-667, (2017). 3. Gonzales R.C. and Woods R.E. Digital image processing.Prentice Hall, New Jersey, edi- tion. II, 1072 p. (2002). 4. Kubasov D.V., Vatolin S. Review of methods of motion compensation . Computer graphics and multimedia. Kharkiv.: KPI,. Vip. No. 3 (2) pp. 33-43 (2010). 5. Tsai W. J. and Sun Y. C. Error-resilient video coding using multiple reference frames. 2013 IEEE International Conference on Image Processing, Melbourne, VIC, pp. 1875- 1879 (2013). 6. Zhang Y., Negahdaripour S.and Li Q. Error-resilient coding for underwater video trans- mission. OCEANS 2016 MTS/IEEE Monterey, Monterey, CA, pp. 1-7 (2016). 7. Stankiewicz O., Wegner K., Karwowski D., Stankowski J., Klimaszewski K. and Grajek T. Encoding mode selection in HEVC with the use of noise reduction. 2017 International Conference on Systems, Signals and Image Processing (IWSSIP), Poznan, pp. 1-6 (2017). 8. Baccouch H., Ageneau P. L, Tizon N.and Boukhatem N. Prioritized network coding scheme for multi-layer video streaming. 2017 14th IEEE Annual Consumer Communica- tions & Networking Conference (CCNC), Las Vegas, NV, USA, pp. 802-809 (2017). 9. Musienko A., Ganjaric J. Technology of coding of digital aerial photographs taking into account classes of a semantic saturation of blocks in system of air monitoring. VII Inter University Conference of Students, PhD Students and Young Scientists ["Engineer of XXI Century"], 08 December 2016 at the University of Bielsko-Biała (ATH). / Bielsko-Biała, Poland – pp. 215-220.( 2016). 10. Barinova O., Lempitsky V., Kholi P., On detection of multiple object instances using hough transforms, Pattern Analysis and Machine Intelligence, IEEE Trans, pp. 177-184, (2012) 11. Lee S.Y., Yoon J.C., Lee I.K. Temporally coherent video matting. Graphical Models 72. – pp. 25-33, (2010). 12. Akimov D., Shestov A., Voronov A., Vatolin D. Occlusion Refinement for Stereo Video Using Optical Flo. International Conference on 3D Imaging. pp. 115-138 (2012). 13. Bai X., Wang J. Towards temporally-coherent video matting. Proceedings of the 5th inter- national conference on Computer vision/computer graphics collaboration techniques. MIRAGE'11, Springer-Verlag. pp. 63 74 (2011). 14. Christophe E., Lager D., Mailhes C. Quality criteria benchmark for hiperspectral imagery. IEEE Transactions on Geoscience and Remote Sensing. Vol. 43. No 9. P. 2103–2114 (2005). 15. Zheng B.and Gao S. A soft-output error control method for wireless video transmission. 2016 8th IEEE International Conference on Communication Software and Networks (ICCSN), Beijing, pp. 561-564 (2016). 16. Miano J. Formats and image compression algorithms in action. [Text] K.: Triumph, - 336p. (2013). 17. Ding Z., Chen H., Gua Y., Peng Q. GPU accelerated interactive space-time video matting. In Computer Graphics International. pp. 163-168 (2010). 18. Lee S. Y. Yoon J. C. Temporally coherent video matting. Graphical Models 72. pp. 25-33 (2010). 19. Sindeev M., Konushin A., Rother C. Alpha-flow for video matting. Technical Report. pp. 41–46 (2012). 20. BarannikVV, KharchenkoN, TverdokhlebVV, Kulitsa O. The issue of timely delivery of video traffic with controlled loss of quality. Modern Problems of Radio Engineering. Tele- communications and Computer Science (TCSET), 2016 13th International Conference on,DOI: 10.1109/TCSET.2016.7452220 pp. 902-904m (2016) 21. BarannikV., RyabukhaY., TverdokhlibV., DodukhA., SuprunO., Tarasenko D. Integration the non-equilibrium position encoding into the compression technology of the transformed images. East-West Design & Test Symposium (EWDTS), 2017 IEEE, DOI: 10.1109/EWDTS.2017.8110030, pp. 1-5 (2017). 22. BarannikV, KrasnoruckiyA, Hahanova A.The positional structural-weight coding of the binary view of transformants. East-West Design & Test Symposium, DOI: 10.1109/EWDTS.2013.6673178, pp. 1-4, (2013). 23. BarannikV., Shulgin S. The method of increasing accessibility of the dynamic video in- formation resource. Modern Problems of Radio Engineering. Telecommunications and Computer Science (TCSET), 2016 13th International Conference, DOI: 10.1109/TCSET.2016.7452133, pp. 621-623, (2016) 24. Parkhomey, S. Gnatyuk, R. Odarchenko, T. Zhmurko et al, Method For UAV Trajectory Parameters Estimation Using Additional Radar Data, Proceedings of the 2016 4th Interna- tional Conference on Methods and Systems of Navigation and Motion Control, Kyiv, Ukraine, October 18-20, 2016, рр. 39-42. 25. Z. Hassan, R. Odarchenko, S. Gnatyuk, A. Zaman, M. Shah, Detection of Distributed De- nial of Service Attacks Using Snort Rules in Cloud Computing & Remote Control Sys- tems, Proceedings of the 2018 IEEE 5th International Conference on Methods and Systems of Navigation and Motion Control, October 16-18, 2018. Kyiv, Ukraine, pp. 283-288. 26. M. Iavich, S. Gnatyuk, E. Jintcharadze, Yu. Polishchuk, R. Odarchenko, Hybrid Encryp- tion Model of AES and ElGamal Cryptosystems for Flight Control Systems, Proceedings of the 2018 IEEE 5th International Conference on Methods and Systems of Navigation and Motion Control, October 16-18, 2018, Kyiv, Ukraine, pp. 229-233. 27. Odarchenko R., Abakumova A., Polihenko O., Gnatyuk S. Traffic offload improved meth- od for 4G/5G mobile network operator, Proceedings of 14th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET-2018), pp. 1051-1054, 2018. 28. M. Zaliskyi, R. Odarchenko, S. Gnatyuk, Yu. Petrova. A. Chaplits, Method of traffic monitoring for DDoS attacks detection in e-health systems and networks, CEUR Work- shop Proceedings, Vol. 2255, pp. 193-204, 2018.