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 meaningful areas of coherence), the structural elimination is achieved redundancy without making any additional mistakes.
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 activities). 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 processed 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:
─ 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 performance 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 allows you to take into account not only restrictions on the amplitude values of the significant elements of coherence areas, g1,1 w(g)1 gmax 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 description of areas of video images regression coherence assumed that coherence areas contains 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 reconstruction 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 conduct 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 limitations on the dynamic range w(g) array elements G m(u,k) significant coordinatebrightness 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 G m(u,k) it is set by the following expression:
k
E(g)i gi, j Q(g) j
j1
(
Because the dynamic range for the array elements of a meaningful coordinatebrightness component is equal to w(g) , so corresponding weight will be determined by the equation:
The resulting value E(g)i of code description of the structural positional number G i will be calculated using following expression:
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 necessary 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, gi, , 1, j 1 is carried out. Here's the number j untreated items of the current row Gi , including j element, will be calculated by equation: Q(g) j w(g)k j
k E(g)i gi, j w(g)k j
j1 j (k j 1)
Equation (
In the second step, is additionally taken into account the condition of global and local inequality of elements in the rows of the array G m(u,k) , i.e. g j g , j, 1, k .
In the case where the code value E(g)i calculated using equation (
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
(
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, j1) valid sequences but which begin with an element gi , j1 . 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 , j1) such acceptable numbers are found using an equation:
Q(gi, j1) 1(w(g) 1)k j 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 , j1) also allows you to determine the number of Q(gi, j gi, j1) of forbidden sequences, composed of j elements preceding the encoded sequence G( j)i , gi, j - auxiliary element preceding sequence.
In view of that, we find that the condition gi, j gi, j1 perhaps then and only when the ratio is performed next inequality:
gi, j1 gi, j
Then, after generalization and considering equation (
gi, j (w(g) 1)(k j) , gi, j 1 gi, j ,
Or according to the equation (
gi, j (w(g) 1)(k j) (w(g) 1)k j , gi, j1 gi, j ; Q(g)i( j)
gi, j (w(g) 1)(k j) , gi, j1 gi, j , where gi, 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 inequality between the values of adjacent elements such kind will be given by following equation:
k E(g )i Q(g )i( j)
j 1 g0 w(g)
In the initial processing step for an element g1,1 as a prior element g0 Value w(g) is chosen, equal to the dynamic range of an array of significant coordinate-brightness component, i.e..
This choice is due to the fact that, first, the values of the elements preceding the
element are not restricted to the zero element. Second, the choice of condition (
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 equation:
ok R
E( (loc) ; g)i Q( (loc) ; g)i(,r)
Here ok - the number of significant regions of coherence in row;
(
Q( (loc); g)i(,r) - weight coefficient for ( r) significant element areas of coherence, structured in i row of array G m(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: ( x(i) , 1) (w(g ) 1) Q( (loc) ; g )i(,r) ( x(i) , r 1) (w( g ) 1) x(i) 1, R 11 x(i) , & r 0;
1 (k r R )
1 x(i) , r1 x(i) , r & r 1;
1 (k r R ) 1 ,
,
x(i) , (w(g ) 1) (k r 11R ) ,
x(i) 1, R 11 x(i) , & r 0;
Q( (loc) ; g ) i(,r)
x(i) , r (w( g ) 1) (k r 11R ) ,
x(i) , r 1 x(i) , r & r 1.
(
Here x(i), r - ( r) significant element of the sequence Х ( ) (areas of coherence) structured in i row of array G m(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(mu,)k , which in turn are interpreted as structural positional 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 11 x(i), : ─ for the condition x(i)1, R11 x(i), :
ok R (x(i), 1) (w(g) 1) E( (loc) ; g)i 1 r1 (x(i), r 1) (w(g) 1)
1 (k r R ) 1 1 (k r R ) 1 , r 0; , r 1; ok R x(i), (w(g) 1) E( (loc) ; g)i 1 r1 x(i), r (w(g) 1) (k r1 R )
1 (k r1 R ) 1 , r 0; , r 1.
V (g)i Vnec V Vnec V (g)i 0
According to the fourth methodological basis for the code description of the magnitude 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
In the general case is carried out the following inequality:
(
Then a number of V code redundancy, and accordingly there are older bits of code description that have a non-zero value, i.e.:
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 redundancy 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 r0 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 redundancy 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
r0
code value E( (loc); g)i will be carried out on the same level of hierarchy. Equations
(
E( (loc) ; g)i
Q( (loc) ; g)i( ) ok n 1 (x(i) 1) (w(g) 1)n , Q( (loc) ; g)i( ) x(i) (w(g) 1)(k ) , x(i) 1 x(i) ; 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 (
E(u) {E( (loc); g)1;...; E( (loc); g)i;...; E( (loc); g)m} .
So, expressions (