=Paper=
{{Paper
|id=Vol-3200/paper8
|storemode=property
|title=The Basic Principles of the Compact Video Frames Representation Technology, Which are Presented in a Differential Form in Computer Systems
|pdfUrl=https://ceur-ws.org/Vol-3200/paper8.pdf
|volume=Vol-3200
|authors=Oleksandr Tymochko,Maksim Pavlenko,Volodymyr Larin
}}
==The Basic Principles of the Compact Video Frames Representation Technology, Which are Presented in a Differential Form in Computer Systems ==
https://ceur-ws.org/Vol-3200/paper8.pdf
The Basic Principles of the Compact Video Frames Representation
Technology, Which are Presented in a Differential Form in
Computer Systems
Oleksandr Tymochko 1, Maksim Pavlenko 2, Volodymyr Larin 3
1,2,3
Ivan Kozhedub Kharkiv National Air Force University, 77/79 Sumska str., Kharkiv, 61023, Ukraine
Abstract
In order to reveal regularities in sequences of series lengths, it is necessary to justify an informative
attribute possessing the following properties:
1) is informative for the lengths of the binary series, taking into account the adaptation to the
peculiarities of the formation of arrays of the binary mask of the differential frame.
Here, it is required to provide a potential opportunity for reducing redundancy for arbitrary content
of the bit plane;
2) do not require significant computational costs for estimating and detecting regularities that do
not exceed order O(n) ;
3) to ensure that there are sharp structural differences for the binary indicators of the stationary
and dynamic components of the differential frame represented.
The compression ratio of the differential-represented frame's binary mask varies from 3 to 21
depending on the correlation coefficient between adjacent frames. The most preferable method for
constructing the compact representation technology of the binary masks of frames represented in
a differential form is the approach.
It will be developed an approach for reducing redundancy in arrays of a binary mask of a
differential frame based on the requirements advanced.
Keywords 1
Binary series, binary mask, differential frame, redundancy, indicator, component, Bodo code,
compact representation.
1. Introduction simpliest and at the same time effective codes that
take account of restrictions on the alphabet's
power are Bodo codes. The Bodo code
In order to take into account the proposed
corresponds to the first two requirements.
requirements, it is proposed to use the approach
A simple Bodo element-by-element code
for code representation of the sequence of binary
provides information about:
mask series lengths. Which is based on the
- the size of the computer memory;
discovery of regularities in the alphabet's power
. The data source alphabet is a set of values that - the maximum value rmax of the series length
message elements can accept. Then the power in the arrays of the differential frame's binary
of the message source alphabet is the number of mask [1,2].
different elements in the alphabet. One of the
III International Scientific And Practical Conference “Information
Security And Information Technologies”, September 13–19, 2021,
Odesa, Ukraine
EMAIL: timochko.alex@gmail.com (A. 1); bpgpma@ukr.net (A. 2);
l_vv83@ukr.net (A. 3)
ORCID: 0000-0002-4154-7876 (A. 1); 0000-0003-3216-1864 (A.
2); 0000-0003-0771-2660 (A. 3)
©️ 2021 Copyright for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
CEUR Workshop Proceedings (CEUR-WS.org)
If a lengths sequence of binary series is given, by small elements of the dynamic component. In
i.e., = {r1,..., rФ } then a simple Bodo code is this case, the lengths r (0) formed for the zero
formed from three stages: sequences will prevail over the length relative to
Stage 1. The maximum value of the length of the lengths r (1) of the individual element
the binary series is sought, for which the formula sequences [14-17]. For such situation, the use of a
is used: power code in one alphabet will lead to the
rmax = max ( ri ) . (1) formation of code redundancy. Indeed, in
1i Ф accordance to the power code of one alphabet for
Stage 2. The determination of the number of all series lengths, regardless of their origin, code
bits L(r ) , which is required to represent the sequences of the same length L(r ) are formed. In
maximum value of the binary series rmax length, this case, the total number of bits L(r ) per
which is given by the relation: representation of the entire sequence of binary
series lengths will be equal to:
L(r ) = [log 2 rmax ] + 1 . (2)
Ф
Step 3. The value L(r ) is writing at the L( r ) = L ( r )i
beginning of the code representation and is the i =1
service information, which is indicating the code's Here are
description boundaries of the neighboring image L(r )i - the number of bits per representation
elements [3-7]. After that, for every length of the of the i-th element of the sequences of the mask's
binary series, a bit L(r ) is assigned to the code binary series lengths;
representation [8-10]. The total number of bits Ф - the number of the binary series lengths,
L(r ) , which is required to represent all the which are formed for the binary mask array of the
lengths of a binary series is given by the differential frame.
expression: At the same time, due to the heterogeneity of
the structural content, the actual number of binary
bits necessary to represent the entire sequence of
L(r ) = Ф L(r ) . (3)
binary series L(r ) lengths will be much less
Bodo's simple block code consists in
representing in each code word several elements than the value L(r ) , ie:
of the original image fragment. For example, this
situation occurs when several elements of the L(r ) L(r )
encoded sequence are represented in one
computer word (one external memory register). This leads to the presence of code redundancy:
R = L(r ) − L(r )
2. Research of a compact
This situation is due to the fact, that for the
representation of a differential- code representation of the units' series lengths, a
represented frame's stationary significantly smaller number of bits is required in
component's binary mask array comparison with the code representation of the
zeros' series lengths, ie:
The Bodo method is mono-alphabetic. In this
case, all elements of the processed sequence L(r (1)) L(r (0))
belong to the same alphabet. Such sequences are Here are
called mono-alphabetic [11-13]. L(r (1)) - the number of bits for the code
However, the Bodo code does not meet the representation of the zeros series lengths;
third requirement. This is due to the fact that the L(r (0)) - the number of bits for the code
differential-represented frame's binary mask, representation of the units' series lengths.
under conditions of removal by a stationary In order to eliminate the code redundancy, it is
camera, has a significant heterogeneity of the proposed to use two alphabets for the sequence
structural content. Under the heterogeneity of the of binary series lengths [18]. The first alphabet
structural content is understood that the stationary 0 is defined for the zeros series lengths,
component can occupy a considerable space, cut
respectively the second alphabet 1 is defined for mмnм
м = =
the lengths of the one sseries. This approach Ф0 log 2 r (0) max + Ф1 log 2 r (1) max
allows to take into account the presence of a sharp Ф
heterogeneity in the structural content of the ri
binary mask array. Accordingly, the generation of = i =1
a power code for such sequences will be realized Ф0 Ф1
log 2 ( r (0) max r (1) max )
using a two-alphabet scheme [19].
The essence of the scheme is that: Here are
1. The lengths of the zeros and ones series are Ф0 -the number of the zeros' lengths for the
formed, which are based on the array of the binary binary mask of the differential-represented frame;
mask.
Ф1 - the number of units' series lengths for the
2. The entire sequence of binary series lengths
is divided into two sub-sequences. binary mask of the differential-represented frame.
The first sub-sequence is formed on the basis Example. Let's calculate the number of digits
of the zeros' series lengths: L(r ) in order to represent the entire sequence of
series lengths for the binary mask of the
(0)
= {r (0)1,..., r (0)Ф } differential-represented frame Q due to a one-rate
0 power code.
The second sub-sequence is formed on the First, let's define the maximum value of the
basis of the units' series lengths: binary series length rmax in a sequence of binary
series lengths
(1)
= {r (1)1,..., r (1)Ф } = {r1 = 19; r2 = 1; r3 = 4; r4 = 5; r5 = 1; r6 = 3; r7 = 3} ,
1
Then the total number of bits per which is based on expression r1 = 19 ; L(r )1 = 5
representation of the subsequences of the zeros' bits; r2 = 1 ; L(r ) 2 = 1 bit; r3 = 4 ; L(r )3 = 2
series lengths will be:
bits; r4 = 5 ; L(r ) 4 = 3 bits; r5 = 1 ; L(r )5 = 1
L(r (0)) = Ф0 log 2 r (0) max , (4) bit; r6 = 3 ; L(r )6 = 2 bits; r7 = 3 ; L(r )7 = 2
And the total number of bits per sub-sequence bits.
representation of the units' series lengths will be: The maximum binary mask series length of a
L(r (1)) = Ф0 log 2 r (1) max . (5) differential-represented frame rmax = 19 . Then,
3. For each subsequence, own alphabet is on the basis of expression (2), the number of bits
forming, respectively, 1 and 0 . required to represent the maximum binary mask
series length is equal to L(r ) = 5 bits.
4. The power code is constructed in
accordance with the constructed alphabets [20]. The number of the binary series lengths is
The power code is constructed according to the formed for the differential frame's binary mask's
scheme, which is considered above, is called a array Ф = 7 . Then, on the basis of the expression
two-halftone code. In other words, a two- (3) the total number of bits on the representation
alphabetic power code is a power code generated of the binary series lengths sequence will be equal
for two-alphabetic sequences. to a L(r ) = 5 7 = 35 bits.
Here, the sizes of the binary regions are taken At the same time, 36 digits are required for the
into account as a result of identifying the binary code representation of the original image
series lengths. It will be shown, that for a two- fragment (the image fragment is classified as
index power code relative to the binary series highly saturated with details having different
lengths of the differential frame's binary mask, the dynamic components) [21]. Consequently, by
condition holds, i.e. provides a degree of applying a single-alphabetic power code for all
compression: sequences of series lengths, the binary mask size
of the differential-represented frame will be
reduced by 3%.
At the same time, 36 bits are required for the
code representation of the original image
fragment (the image fragment is classified as
highly saturated with details having different www.exelisinc. com/ solutions/ Enhanced-
dynamic components). Therefore, due to the use High-Capacity-Data-Radio/
of a double-alphabetic power code for the Documents/Centaur-Enhanced-High-Capacity-
subsequences of the lengths of zeros and ones Data-Radio-(EnHCDR).pdf.
series. The differential-represented frame's binary [4] VNI Forecast Highlights, [Электронный
mask volume will decrease by 20%. Also, due to ресурс] / Cisco // Cisco. – 2015. –
the double-alphabetic power code, the volume of http://www.cisco.com/c/en/us/solutions/service
the differential-represented frame's binary mask is -provider/visual-networking-index-vni/vni-
relative to the single-alphabet code will decrease forecast.html.
by 17%. [5] Pavlenko. Conceptual Basis of Cascading
Differential Masking Technology. / Pavlenko,
3. Conclusions Tymochko, Kolmykov, Khmelevskiy, Larin.//
IEEE 11 th International Conference on
Dependable Systems, Services and
1. As the correlation coefficient between
Technologies. DESSERT: 2020. – p. 290 -294.
adjacent frames increases, the compression ratio
DOI: 10.1109/DESSERT50317.2020.9125024.
of the differential-represented frame's binary
[6] Li, L. (2015). The UAV intelligent
mask increases.
inspection of transmission lines. Proceedings
2. The compression ratio of the differential- of the 2015 International Conference on
represented frame's binary mask varies from 3 to Advances in Mechanical Engineering and
21 depending on the correlation coefficient
Industrial Informatics.
between adjacent frames.
DOI: https://doi.org/10.2991/ameii-
3. Estimation of the bit representation's
15.2015.285.
information content of the differential-
[7] Gonzales R.C. Digital image processing / R.C.
represented frame's binary mask on the basis of Gonzales, R.E. Woods. – Prentice Inc. Upper
accounting for the nonequilibrium of the bases of
Saddle River, New Jersey, 2002. – 779 p.
the lengths of the binary series does not require an
http://web.ipac.caltech.edu/staff/fmasci/hom
increase in the complexity of the software-
e/astro_refs/Digital_Image_Processing_2nd
hardware implementation.
Ed.pdf.
4. Due to the double-alphabetic power code, [8] Kharchenko V., Mukhina M. Correlation-
the differential-represented frame's binary mask is extreme visual navigation of unmanned aircraft
relative to the single-alphabet code will decrease
systems based on speed-up robust features
by 17%.
//Aviation. 2014. Vol. 18, Issue 2. P. 80–85.
DOI:
4. References https://doi.org/10.3846/16487788.2014.926645.
[9] M.Pavlenko, A.Timochko, N.Korolyuk,
[1] V. Larin, D. Yerema, Y. Bolotska. The M.Gusak. Hybrid model of knowledge for
reasoning of necessity enhancing video privacy situation recognition in airspace. Automatic
in conditions of providing the quality of the Control and Computer SciencesVolume 48,
video information service provided in virtual Issue 5, 2014, Pages 257-263.
infocommunication systems. Системи https://www.edi.lv/wp-
озброєння і військова техніка 2(35). – Х. content/uploads/2019/09/Vol.48_Issue-
ХНУПС. 2019, P. 158-162. 5_2014.pdf.
http://www.hups.mil.gov.ua/periodic- [10] Wang, S., Zhang, X., Liu, X., Zhang, J., Ma,
app/article/19290. S., Gao, W. Utility-Driven Adaptive
[2] Qassim, H., Verma, A., Feinzimer, D. (2018). Preprocessing for Screen Content Video
Compressed residual-VGG16 CNN model for Compression. (2017) IEEE Transactions on
big data places image recognition. 2018 IEEE Multimedia, 19 (3), art. no. 7736114, pp. 660-
8th Annual Computing and Communication 667. DOI: 10.1109/TMM.2016.2625276.
Workshop and Conference (CCWC). [11] Tkachov, V. M., Tokariev, V. V., Radchenko,
DOI: https://doi.org/10.1109/ccwc.2018.83017 V. O., Lebediev, V. O. (2017). The Problem of
29. Big Data Transmission in the Mobile "Multi-
[3] Centaur ® Enhanced High Capacity Data Radio Copter – Sensor Network" System. Control,
(EnHCDRTM) – ITT Exelis Inc., 2012. Navigation and Communication Systems, 2,
[Електронний ресурс].URL: http:// 154–157.
URL: http://openarchive.nure.ua/bitstream/d recognition of ground-based air objects
ocument/4536/1/suntz_2017_2_40.pdf. (2018) Proceedings of 2018 IEEE 9th
[12] Kharchenko N. The Problem Aspect of International Conference on Dependable
Control of Bit Speed of the Video Stream in Systems, Services and Technologies,
Telecommunication Networks / Andrii DESSERT 2018, pp. 589-592. URL:
Krasnorutskij, Andrii Tristan, https://ieeexplore.ieee.org/
N. Kharchenko // International Conference abstract/document/8409200.
TCSET’2014 [“Modern problems of radio [19] Mashtalir, S., Mikhnova, O., Stolbovyi, M.
engineering, telecommunications, and Sequence Matching for Content-Based Video
computer science”] (Lviv-Slavske, Ukraine, Retrieval (2018) Proceedings of the 2018 IEEE
February 25 – March 1, 2014) / Lviv 2nd International Conference on Data Stream
Polytechnic National University, 2014. – Mining and Processing, DSMP 2018, art. no.
P. 533-534. 8478597, pp. 549-553.
https://www.researchgate.net/publication/30 URL:https://ieeexplore.ieee.org/document/8
1793981_Developing_PC_Software_Project 478597.
_Duration_Model_based_on_Johnson_trans [20] Piramanayagam, S., Saber, E., Cahill,
formation. N.D., Messinger, D. Shot boundary detection
[13] Mistry, D., Modi, P., Deokule, K., Patel, A., and label propagation for spatio-temporal video
Patki, H., Abuzaghleh, O. (2016). Network segmentation (2015). Proceedings of SPIE - The
traffic measurement and analysis. 2016 IEEE International Society for Optical
Long Island Systems, Applications and Engineering, 9405.
Technology Conference (LISAT). DOI: 10.1117/12.2076661.
URL: http://ieeexplore.ieee.org/abstract/doc [21] Serhii Yevseiev. Development of an
ument/7494141. advanced method of video information
[14] The Problem of Big Data Transmission in the resource compression in navigation and
Mobile "Multi-Copter – Sensor Network" traffic control systems. EUREKA: Physics
System / Tkachov V. M., Tokariev V. V., and Engineering. No. 5 (2020), Pages 31-42.
Radchenko V. O., Lebediev V. O. // Control, DOI: 10.21303/2461-4262.2020.001405.
Navigation and Communication Systems. 2017.
Issue 2. P. 154–157.
URL: http://nbuv.gov.ua/UJRN/suntz_2017
_2_40.
[15] Network traffic measurement and analysis /
Mistry D., Modi P., Deokule K., Patel A., Patki
H., Abuzaghleh O. // 2016 IEEE Long Island
Systems, Applications and Technology
Conference (LISAT). 2016.
DOI: 10.1109/lisat.2016.7494141.
[16] Buranova M. A., Kartashevskyi V. H.,
Samoilov M. S. The comparative analysis of
statistical characteristics of the video traffic in
networks of the packet transmission of data //
Infokommunikacionnye tehnologii. 2013. Vol.
11, Issue 4. P. 33–39.
URL: https://readera.ru/read/140191662.
[17] Development of a method for the experimental
estimation of multimedia data flow rate in a
computer network. Sumtsov, D. Osiievskyi, S.
Lebediev, V. Eastern-European Journal of
Enterprise Technologies. Volume 2, Issue 2-92,
2018, Pages 56-64.
URL: http://journals.uran.ua/eejet/article/vie
w/128045.
[18] Ruban, I., Smelyakov, K., Vitalii, M., Dmitry,
P., Bolohova, N. Method of neural network