Predicting motion vector of current image section indicating reference zone overlapping multiple sections of reference image, encoding and decoding using said prediction

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to means of encoding and decoding images. In the method, the motion vector of a reference section has the same shape as the current section and belongs to a reference image which is different from the current image and is broken down in advance as a result of encoding with subsequent decoding into a plurality of sections. When a reference section overlaps a set of reference sections from said plurality of sections of the reference image, said motion vector of the current image section is determined based on a reference motion vector function belonging to a set of reference motion vectors associated with k overlapped reference sections.

EFFECT: high accuracy of predicting the motion vector of an image section.

15 cl, 6 dwg

 

The level of technology

The present invention generally relates to the field of image processing and, in particular, to encoding and decoding by comparing digital images and sequences of digital images.

To transfer images there are several methods of encoding and decoding. In particular, there are large types of coding, such as coding, called "intra"when the image encode offline, i.e. without reference to other images, or encoding, called "inter", which is the encoding of the current image relative to the previous images to Express and transmit only the differences between these images.

Typically, the encoding method of the above type include stage predictive coding, in which parts of the image, called blocks or macroblocks, predict the current image relative to the other thrust blocks or macroblocks, that is previously encoded and then decoded blocks or macroblocks.

For example, in the case of the use of standard H264/MPEG-4 AVC (Advanced Video Coding") predictive coding macroblock consists in the breakdown of macroblocks on a variety of topics, which usually have the form of blocks of smaller size.

In private the tee, in the case of inter-coding according to the above standards used for coding the current macroblock can be divided into sections according to options 16×16, 8×16, 16×8 and 8×8. If you choose option 8×8, each block of 8×8 is again divided into sections on options 8×8, 4×8, 8×4 and 4×4. Each current block is compared with one or more blocks, respectively, one or more reference images. Thus, receive the motion vector describes motion between the current block and the reference block, which occupies the same position as the current macroblock in the previous image. This calculates the predicted value of the motion vector to encode the balance between the above-mentioned motion vector and the calculated predicted motion vector.

Such a prediction motion vector is not suitable for all types of partitioning and, in particular, to the case when the reference macroblock overlaps several reference sections reference image. This situation is shown in figa, which illustrates the case of the provisional prediction to encode the current macroblock indicated by MBCNimages N designed for encoding according to the above standards. In the presented example of such a macroblock MBCNhas a square shape and it matches the type of 4×4. Macroblock MBCNROC the wives of other macroblocks BR1, BR2, BR3, BR4, which are in the immediate vicinity and have the same shape and size as the macroblock MBCN.

In the present example, the motion vector of the current macroblock MBCNdenoted by MV, indicates the reference macroblock MBCN-1the reference image is denoted by N-1, which is, for example, the previous image. Reference MBCN-1has the same position as the current macroblock MBCNin the previous image N-1. Feature reference macroblock MBCN-1is that it overlaps the already encoded and then decoded reference sections, denoted by BR'1, BR'2, BR'3 and BR'4 figa.

In accordance with the standard H264/AVC the above-mentioned motion vector MV predict only spatial. In particular, calculate the reference motion vector, which is equal to the average of the motion vectors MV1, MV3, MV4, respectively associated with the reference macroblocks BR1, BR3, BR4. In some situations, the motion vector MV2 associated with the reference macroblock BR2, can be used instead of one of the vectors MV1, MV3, MV4.

In addition, recently, new types of partitioning intended for encoding the current macroblock, which were not provided by the standard H264/AVC. As shown in figv encoded current MBCNcan be divided into several section is in P1-PP, having a linear shape, G-shape or an arbitrary shape.

Standard H264/AVC does not provide predictions for different types of partitioning, shown in figv, and for a particular case, when broken thus the reference macroblock overlaps several sections of the reference image. This situation presents on pigs, which illustrates the case of the provisional prediction to encode the current macroblock indicated by MBCNimages N designed for encoding according to the above standards. In the presented example of such a macroblock MBCNdivided into several smaller partitions P1, P2, P3, which have any geometric shape.

In the present example, the motion vector of the first partition P1 of the current macroblock MBCNmarked MVp1, point to the partition P'1 of the reference macroblock MBCN-1in the previous image N-1. Feature reference macroblock MBCN-1is that it overlaps the already encoded and then decoded reference sections, denoted by BR'1, BR'2, BR'3 and BR'4 figs.

In accordance with the standard H264/AVC to predict the above-mentioned motion vector MVp1, calculate the reference motion vector, which is usually equal to the spatial average of the motion vectors MV1, MV3, MV4, with the NGOs associated with the reference macroblocks BR1, BR3, BR4.

Such spatial prediction of motion vector may be inaccurate, since the image N-1, there are differences in shape and size between the reference section R'1 and reference macroblocks BR'1, BR'2, BR'3 and BR'4.

In addition, other known methods of calculating the predicted motion vector with the purpose of inter-coding of the current macroblock.

One of them is described in the publication IEEE Transactions on Circuits and System for Video Technology, volume 18, 1247-1257 (September 2008), G.Laroche, J.Jung and .Pesquet-Popescu, and true when, as in the standard H264/AVC, the macroblock is divided into many sections, which usually have the form of blocks of smaller size. According to this method, predicting the motion vector of the macroblock of the current image relative to the reference vector that is chosen as the vector pointing to the pixel at the top extreme left of the macroblock having the same position as the current macroblock in the previous image.

If you try to use this last method for predicting vector MV on figa or for prediction vector MVp1 on figs, each of the vectors MV and MVp1 is obtained on the basis of the reference vector MV2 associated with the reference macroblock BR'2, with the leftmost pixel of the reference macroblock MBCN-1is the reference macroblock BR'2, associated with the motion vector MV.

The prediction motion vector using this method too is not exact for the same reasons that were stated above.

Task and disclosure of inventions

One of the objectives of the present invention is to eliminate the above disadvantages of the prior art.

In this regard, the first object of the present invention is a method of predicting a motion vector of the current partition of the image relative to the motion vector of the reference section, having the same form as the current section, and belonging to a reference picture different from the current image and the previously broken after encoding and subsequent decoding on the set of n partitions.

According to the invention, in the case when the reference section covers a set of k reference partition of the set n of sections of the reference image, where k≤n, the motion vector of the current partition image is determined on the basis of the function of at least one reference motion vector belonging to k than k reference motion vectors respectively associated with k overlapped reference sections.

This distinctive feature makes it possible to significantly improve the prediction accuracy, given:

- a special partitioning of the current macroblock or a reference macroblock,

only PE ecrivaine zone support partition.

In addition, the prediction in accordance with the present invention can be applied to any method of calculating the predicted motion vector of the current partition, for example, for the method according to the standard H264/AVC or to the method described in the link above IEEE.

In an embodiment, the determining of the motion vector of the current section contains the following stages:

- calculate the total number of pixels between the reference section and k respectively overlapping the supporting sections

- comparison of the calculated total number of pixels between the overlapped k reference sections on the basis of a predetermined criterion of comparison.

This distinctive feature allows you to accurately choose the reference motion vector on the basis of certain characteristics, which in this case is based on the number of common pixels between the reference section and overlapping the supporting sections.

According to the first variant, the criterion of comparison is the choice of k reference motion vectors respectively associated with k overlapping the supporting sections, the reference motion vector associated with the reference section, which calculated the total number of pixels is the largest.

According to the second variant, the criterion of comparison consists in weighting, using the calculated number of total pixels, Wed is the last value of k reference motion vectors, respectively associated with k overlapped reference sections.

Under the third option, the criterion of comparison is the choice of k reference motion vectors respectively associated with k overlapping the supporting sections, the reference motion vector that is associated with the overlapped reference section with more pixels within the reference section than outside of this reference section.

In another embodiment, the determining of the motion vector of the current section contains the following stages:

the calculation for each k, the overlap of the reference partition coefficient, which is a function of the spatial gradient of the reference section,

the choice of the coefficient having the largest calculated value

the choice of the reference motion vector, which corresponds to the overlap of the reference section with the selected ratio.

This distinctive feature allows you to accurately choose the reference motion vector based on a certain characteristic, which in this case is based on calculating the coefficient expressing the degree of reliability in the choice of the reference motion vector, which is assumed to be more accurate in the area of the image containing stutter than in the area of the whole image.

According to a variant implementation, the motion vector of the current partition determined in accordance with the ATA stage of calculating the average value of k reference motion vectors, respectively associated with k overlapped reference sections, this average value is weighed using k calculated coefficients.

In yet another embodiment, the determining of the motion vector of the current section contains the following stages:

- the selection of a single point of reference section

the choice of the reference motion vector associated with the overlapped reference section containing the selected single point.

This distinctive feature allows you to accurately choose the reference motion vector based on a certain characteristic, which in this case is based on the assessment of the location of the supporting section relative to k, the overlap of the reference sections.

According to another variant implementation, the determination of the motion vector of the current section contains the following stages:

- identification of the reference section characteristics associated with the image content

the choice of the reference motion vector associated with the overlapped reference section that contains the specified feature.

This distinctive feature allows you to accurately choose the reference motion vector based on a certain characteristic, which in this case is based on the identification of pattern, color, contour, etc. in the reference section.

The second object of the invention is a method encoded in the I image or image sequence, which generate a data stream containing data characterizing at least one partition image, the method includes a step of predicting a motion vector for the partition of the image.

According to the invention, the step of predicting this method of encoding is carried out according to the above method of prediction.

The third object of the invention is a method of decoding a stream of data describing the image or sequence of images, the stream contains data characterizing the at least one partition image, the method includes a step of predicting a motion vector for the partition of the image.

According to the invention, the step of predicting this method of decoding is carried out according to the above method of prediction.

Accordingly, the fourth object of the present invention is a device for predicting a motion vector for the current section of the image relative to the motion vector for the reference section, having the same form as specified in the partition, and belonging to a reference picture different from the current image and the previously broken after encoding and subsequent decoding in a multiple n of the sections.

According to the invention, in the case when the reference section covers sookun is here from k reference partition of the set n of sections of the reference image, where k≤n, such a prediction device includes a computing module configured to determine the motion vector of the current partition image based on the function of at least one reference motion vectors belonging to a set of k reference motion vectors respectively associated with k overlapped reference sections.

Accordingly, the fifth object of the invention is a device for encoding an image or a sequence of images generating a data stream containing data characterizing at least one partition image, with such a device includes means for predicting a motion vector of a partition of the image.

According to the invention, the device of the predictions of such a device coding complies with the above prediction device.

Accordingly, the sixth object of the invention is a device for decoding a stream of data describing the image or sequence of images, and the data stream contains data characterizing the at least one partition image, with such a device includes means for predicting a motion vector for the partition of the image.

According to the invention, the device of the predictions of such a device decoding corresponds vishey is related to the prediction device.

The object of the invention is also a computer program containing commands to apply one of the methods in accordance with the present invention, when it takes the computer.

The encoding method, the method of decoding a prediction device, the encoding device and the decoding device have at least the same advantages as the advantages provided by the method of prediction in accordance with the present invention.

Brief description of drawings

Other distinctive features and advantages of the invention will be more apparent from the following description of the preferred options of execution with reference to the accompanying drawings, on which:

figa - known example of a temporary predictions, which use temporal relationship between allocated for encoding the current macroblock image N and the reference macroblock in the previous image N-1, while the reference macroblock has a square shape and covers several adjacent reference macroblocks;

figw - macroblock, divided into sections of different types according to known solutions;

figs - known example of a temporary predictions, which use temporal relationship between allocated for encoding the current macroblock image N and the reference macroblock of the previous and what the considerations applying N-1, when the reference macroblock is divided into several sections of arbitrary shape and covers several adjacent reference macroblocks;

figure 2 - stages of the encoding method in accordance with the present invention;

figure 3 embodiment of the encoder in accordance with the present invention;

figure 4 is an example of temporal prediction in accordance with the present invention, in which use temporal relationship between allocated for encoding the current macroblock image and the reference macroblocks of the previous image;

5 is a decoding device in accordance with the present invention;

6 - stages of a method of decoding in accordance with the present invention.

The implementation of the invention

What follows is a description of a variant implementation of the invention in which is used a method of encoding in accordance with the present invention for inter-coding a sequence of images as a binary stream, close to the stream obtained according to the standard H264/MPEG-4 AVC. In this embodiment, the encoding method in accordance with the present invention is carried out using software or hardware through changes in the encoder, originally corresponding to the standard H264/MPEG-4 AVC. The encoding method in accordance with h is a worthwhile invention is presented in the form of the algorithm, containing phases C0-C7, as shown in figure 2.

The encoding method in accordance with the present invention carried out using the encoder CO, shown in figure 3.

The first stage C0, shown in figure 2, is a choice for a macroblock belonging to the image intended for encoding an image sequence, denoted by INfigure 3 - the particular partitioning corresponding macroblock.

It should be noted that the phase C0 may be optional, and the prediction motion vector of the current macroblock can be performed, considering the last one in its entirety, that is, as the only and single partition.

During phase C0 macroblock MBNfor example, having a size of 4×4 and belongs to the image of IN, is directed to the input module SP choice partitioning shown in figure 3.

In this module SP binning is used, for example, the method of choice by redundant mapping or selection method using the apriori algorithm. Such methods are well known in the art (see: G.F.Sullivan and T.Wiegand, "Rate-distorsion optimization for video compression", IEEE Signal Proc. Mag., p.74-90, 1998). Therefore, their description is omitted.

Different types of algorithms partitioning grouped in the database BD encoder CO. They allow the breakdown current is it macroblock into multiple sections or rectangular or square shape, or other geometric shapes, such as a substantially linear shape, or completely free-form.

In the present example, the selection module SP selects the partitioning of an arbitrary shape.

The next step S1, as shown in figure 2, represents a partitioning of the macroblock MBNon the number of p are designed for predicting the partition.

For example, the macroblock MBn is divided into three sections P1, P2 and P3 of arbitrary shape. This breakdown provides a module RMSO breakdown of macroblocks shown in figure 3, which uses classical algorithm partitioning.

Figure 4 shows the macroblock MBNreceived after this breakdown.

After step S1 partitioning during step S2, shown in figure 2, the module breakdown RMSO passes just partitioned macroblock MBNin the module PREDCO predictions, shown in figure 3.

Classically this module PREDCO prediction is to predict the chaptered current macroblock MBNabout the already encoded and then decoded macroblock indicated by MBrN-1in figure 4, which has the same position as the current macroblock MBNin the previous image IN-1which was previously broken after encoding and subsequent decoding on many n section is in r'1, r'2, ..., R n.

According to the invention, the reference macroblock MBrN-1covers a set of k reference sections r'1, r'2, ..., R k, for k≤n. In the present example, the reference macroblock MBrN-1partially overlaps the four reference section r'1, r'2, r'3 and r'4. Of course, other possible versions of the reference macroblock MBrN-1can completely block one or more anchor sections r'1, r'2, r'3 and r'4.

As shown in figure 3, such a reference macroblock MBrN-1code according to the standard H264/MPEG-4 AVC, that is, as is well known, it is subjected to:

coding by discrete cosine transform and quantization that is performed by the module TQCO transformation and quantization,

- then decoded by the inverse discrete-cosine transform and quantization that is performed by the module TQICO inverse transform and quantization.

As shown in the same figure 3, according to the invention, the module PREDCO prediction contains:

module RMV partitioning, designed to split the reference macroblock MBrN-1on a set of reference topics

computing the CAL module designed to calculate each motion vector MVp1, MVp2, ..., MVpp, which are respectively associated with sections P1, P2, ..., PP of the current macroblock MBrN-1on the basis of function, what about the least one reference motion vectors belonging to a set of k reference motion vector MVr'1, MVr'2, ..., MVr'k, which are respectively associated with k overlapped reference sections r'1, r'2, ..., R k.

During C3, shown in figure 2, the module RMV partitioning shown in figure 3, produces a breakdown of the reference macroblock MBrN-1p reference sections. In the example shown in figure 4, the reference macroblock MBrN-1smash is identical to the current macroblock MBN, three section Pr'1, Pr'2 and Pr'3, which have different shape and size.

During phase C4, shown in figure 2, the computing module CAL, shown in figure 3, calculates for each current partition P1, P2 and P3 associated with the predicted motion vector MVp1, MVp2 and MVp3 by means described below, various methods in accordance with the present invention.

According to the first method, the CAL module determines a predicted motion vector MVpl the current partition P1 depending on the reference motion vector MVr'1, MVr'2, MVr'3 and MVr'4, respectively associated with four overlapping reference sections r'1, r'2, r'3 and r'4, shown in figure 4. This definition includes, for example, in the calculation of the average values of the reference motion vector MVr'1, MVr'2, MVr'3 and MVr'4 according to the following equation:

MVp1=Moy(MVr'1, MVr'2, MVr'3, MVr'4)

According to the second IU the ode, presented with reference to figure 4, the CAL module determines a predicted motion vector MVp1 as equal to the reference motion vector associated with the overlapped base section having the largest number of pixels in common with the supporting topic Pr'1 reference macroblock MBrN-1.

In the example shown in figure 4, MVp1=MVr'2.

According to the first version of this second method, the CAL module determines a predicted motion vector MVp1 as equal to the reference motion vector associated with the overlapped base section having the largest percentage of pixels in common with the reference section, WG'1 reference macroblock MBrN-1.

In the example shown in figure 4, MVp1=MVr'2.

According to the second variant of this second method, the CAL module determines the average value of the reference motion vector MVr'1, MVr'2, MVr'3 and MVr'4, which is weighed by the number of common pixels between the reference section Pr'1 macroblock MBrN-1and each of the overlapped reference sections r'1, r'2, r'3 and r'4. This definition consists in calculating the predicted motion vector MVp1 according to the following equation:

MVP1=1T[k=1Kpr'1rk'MVr'k]

where:

- K=4,

- T is the number of pixels forming the reference macroblock MBrN-1

-Pr'1r'kis the number of pixels shared between the supporting topic Pr'1 macroblock MBrN-1and each of the overlapped reference sections r'1, r'2, r'3 and r'4,

In the example shown in figure 4, MVp1=MVr'2.

Alternative to the above average can be weighted by the number of total pixels minus the number of common pixels.

Another alternative consists in weighting the average of the percentage of pixels in common between the topic Pr'1 reference macroblock MBrN-1and each of the reference sections of r'1, r ' 2, r'3 and r'4.

Another alternative is the determination of the predicted motion vector MVp1 as equal to the reference motion vector associated with the overlapped reference section, which has more pixels inside Pr'1 than outside Pr'1.

According to the third method, is presented with reference to figure 4, the computing module CAL:

- defines, for each k, the overlap of the reference sections of r'1, r'2, r'3 and r'4, - coefficient of Ck(k=4), the cat is which is a function of the spatial gradient g of the specified reference section Pr'1,

- selects the coefficient Cj (1≤j≤k), the calculated value which is the largest, according to the following equation:

Cj=argmaxk{Ck}where(Ck=1Pr'1rk'i=1Pr'1rk'gx2(i)+gy2(i))

This third method involves first alternative, according to which computing the CAL module determines a predicted motion vector MVp1 as equal to the reference motion vector associated with the overlapped reference section corresponding to the computed coefficient Cj.

This third method involves the second al is ternative, according to which computing the CAL module determines a predicted motion vector MVp1 equal to the average value of the reference motion vector MVr'1, MVr'2, MVr'3 and MVr'4, which is weighed by using the calculated coefficients C1C2C3With4.

According to the fourth method, presented with reference to figure 4, the computing module CAL primarily used to identify a single point of reference section Pr'1, for example, its center is denoted by CTr'1. Center CTr'1 is calculated using an algorithm that minimizes the sum of distances with respect to all points in the reference section Pr'1.

After computing the CAL module determines a predicted motion vector MVpl as equal to the reference motion vector associated with the overlapped reference section that contains the selected single point, i.e. the center CTr'1. In the present example, the center CTr'1 is contained in the reference section r'2, and, therefore, MVp1=MVr'2.

According to the fifth method, presented with reference to figure 4, the computing module CAL first identifies in the reference section Pr'1 individual characteristic associated with the image content. In the present example, such a characteristic is shown a cross inserted in the image of IN-1and marked CIr'1.

Then computing the CAL module determines the forecast is hydrated motion vector MVp1 as equal to a reference motion vector, associated with the overlapped reference section that contains the selected characteristic, that is, the cross CIr'1. In the present example, the cross CIr'l is contained in the reference section r'1, and, therefore, MVp1=MVr'1.

Alternatively, this fifth method of characteristics associated with the image content can be a single color, single picture, a path which intersects the reference section Pr'1, or any other feature of the image that violates its homogeneity.

Upon completion of this step C4 calculations on one or another of the above methods in accordance with the present invention the computing module predictions PREDCO generates a first predicted vector MVp1, which when selected by the encoder CO as the optimal motion vector immediately coded module TQCO transformation and quantization, and then decoded by the module TQICO inverse transformation and quantization, which are presented in figure 3.

Then the above step S4 is repeated to predict other motion vectors MVp2 and MVp3, which are respectively associated with sections P2 and P3 of the current macroblock MBN.

After a variety of possible predictions calculated by a compute module predictions PREDCO, at step S5, shown in figure 2, the module DCNCO decision, shown in figure 3, looking at the broken the and sections of the macroblocks of the image I Nand selects at this stage C5 variant prediction to encode each of these macroblocks. Among the possible predictions for the macroblock module decision DCNCO selects the optimal prediction according to the criterion of the degree of distortion is well known to specialists.

As shown in figure 2, each predicted macroblock encode at step C6, as specified in the standard H264/MPEG-4 AVC.

As shown in figure 3, after the implementation of structural encoding module DCNCO decision factors residues, if they exist, correspond to the blocks of the image INsend in the module TQCO transformation and quantization, where they are subjected to discrete cosine transform, and then the quantization. After that, lots of macroblocks with quantized coefficients are passed to the module CE entropy coding to generate, together with other images of the sequence, already encoded the same way as the image of IN- the binary stream video F, encoded in accordance with the invention.

Encoded binary stream F is passed through the communication network to the remote terminal. It contains the decoder DO in accordance with the present invention, is shown in figure 5.

First binary stream F is sent to the module DE entropy decoding, which is the inverse Kadirova the Oia, implemented by the module CE entropy encoding, shown in figure 3. Then, for each macroblock reconstructing image coefficients decoded by the module DE, sent to the module QTIDO inverse quantization and transformation.

Module RI playback image receives the decoded data corresponding to the data produced by the module DCNCO (3) in step C5 coding in accordance with the present invention, taking into account transmission errors. Module RI performs the stages D0-D6 of the method of decoding in accordance with the present invention, shown in Fig.6. This method of decoding in accordance with the present invention can also be implemented using software or hardware modifications to the decoder, corresponding to the original standard H264/MPEG-4 AVC.

The first stage DO is a decoding patterns encoded data in the first area of the current macroblock decoded image IN. As is known, the module RI playback determines on the basis of data of the specified area of the macroblock:

- the encoding type of the specified data, Intra or Inter: in accordance with the present invention is Inter-coding,

- type partitioning playing macroblock, Inter 4×4, 8×8, linear, etc.: in the described embodiment, the Inter 4×4,

- the index of the optimal predictor, the selected module DCNCO decision-making at the above step S5.

The next step D1 shown in Fig.6, is a breakdown intended for decoding the current macroblock in accordance with the partitioning determined at step D0. For this purpose, as shown in figure 5, the module PMBDO dividing the macroblock into partitions, which is absolutely similar to the module shown in figure 3, divides the macroblock on the set p of partitions, i.e. three sections of arbitrary shape in the present example.

During D2, shown in Fig.6, the module PMBDO partitioning passes intended for decoding the current macroblock that has just been split into p=3 sections in the module PREDDO predictions, shown in figure 5, which is identical to module PREDCO the predictions of the encoder, shown in figure 3, and therefore further detailed description is omitted.

During D3 and D4 shown in Fig.6, the module PREDDO predictions, shown in figure 5, performs the same algorithm as the module PREDCO the above encoder CO to get the current macroblock, the corresponding motion vectors which were predicted according to one or another of the methods described above.

At step D5 module DCNDO decision selects the optimal prediction under criterion degree of IP is Azania, well-known to experts.

After that, at step D6 each predicted macroblock decode as it is provided by the standard H264/MPEG-4 AVC.

After decoding all of the macroblocks of the image INas shown in figure 5, the module RI image playback outputs of the decoder DO the image IDNcorresponding to the decoding image IN.

Given that the prediction is performed by the decoder DO, according to all indicators is similar to the algorithm implemented by the coder CO, cost information, depending on the used predictors significantly reduced.

Of course, the described embodiments of the provided solely as examples and are not restrictive, and the specialist may make various changes without departing from the scope of the invention.

1. Way prediction motion vector of the current partition of the image relative to the motion vector of the reference section, having the same form as the current section, and belonging to a reference image different from the current image and the previously broken by the encoding and subsequent decoding on the set n of partitions (r'1, r'2, ..., R n), containing the stage at which the case, when the specified reference section covers a set of k reference section the crystals from the specified set of n sections (r'1, r'2, ..., R n) of the reference image, where k≤n, define the specified motion vector of the current partition image based on the function of at least one reference motion vectors belonging to the aggregate of the k reference motion vector (mvr'1, mvr'2, ..., mvr'k), respectively, associated with k overlapped reference sections.

2. The way the predictions of claim 1, wherein the step of determining the motion vector of the current section contains the steps are:
calculate the total number of pixels between the reference section and k respectively overlapping the supporting sections,
compare the calculated total number of pixels between the overlapped k reference sections on the basis of a given criterion of comparison.

3. Way prediction according to claim 2, in which the criterion of comparison is based on the choice of k reference motion vectors respectively associated with k overlapping the supporting sections, the reference motion vector associated with the reference section, which calculated the total number of pixels is the greatest.

4. Way prediction according to claim 2, in which the criterion of comparison is based on weighting, using the calculated total number of pixels, the average value of k reference motion vectors respectively associated with k overlapped reference sections.

5. Way prediction according to claim 2, in which the criterion of comparison is based on the ora of the k reference motion vectors, respectively associated with k overlapping the supporting sections, the reference motion vector associated with the overlapped reference section with more pixels within the reference section, than outside the support section.

6. The way the predictions of claim 1, wherein determining the motion vector of the current section contains the steps are:
compute for each k, the overlap of the reference partition coefficient, which is a function of the spatial gradient of the specified reference section,
choose the coefficient having the largest calculated value,
choose the reference motion vector corresponding to the overlapped reference section with the selected ratio.

7. The way the predictions of claim 1, wherein the step of determining the motion vector of the current section contains the steps are:
compute for each k, the overlap of the reference partition coefficient, which is a function of the spatial gradient of the specified reference section,
calculates the mean value of the k reference motion vectors respectively associated with k overlapped reference sections, with the specified mean value is weighed by means of these k calculated coefficients.

8. The way the predictions of claim 1, wherein the step of determining the motion vector of the current section contains the steps are:
choose individual p is th point of the reference section,
choose the reference motion vector associated with the overlapped reference section containing the selected single point.

9. The way the predictions of claim 1, wherein the step of determining the motion vector of the current section contains the steps are:
identify in the reference section of the characteristic associated with the image content,
choose the reference motion vector associated with the overlapped reference section that contains the specified feature.

10. A method of coding an image or a sequence of images, characterized by the fact that generate a flow (F) data containing data characterizing at least one partition image, the method includes a step of predicting the motion vector of the specified partition image,
moreover, the specified prediction is carried out according to the method of prediction according to any one of claims 1 to 9.

11. The way to decode the stream (F) data describing the image or sequence of images, and the specified stream contains data characterizing the at least one partition image, while the method includes a step of predicting the motion vector of the specified partition image,
moreover, the specified prediction is carried out according to the method of prediction according to any one of claims 1 to 9.

12. Device (PREDCO) prediction vector movement is possible in the current section of the image relative to the motion vector of the reference section, having the same form as specified in the partition, and belonging to a reference image different from the current image and the previously broken by the encoding and subsequent decoding on the set n of partitions (r'1, r'2, ..., R n),
in the case when the reference section covers a set of k reference sections from the specified set of n sections (r'1, r'2, ..., R n) of the reference image, where k≤n, the prediction device includes a computing module (CAL), is configured to determine the specified motion vector of the current partition image based on the function of at least one reference motion vectors belonging to the aggregate of the k reference motion vector (mvr'1, mvr'2, ..., mvr'k), respectively, associated with k overlapped reference sections.

13. Device (CO) encoding an image or sequence of images, characterized in that arranged to generate a flow (F) data containing data characterizing at least one partition image, when the specified device contains a means of predicting the motion vector of the specified partition image,
moreover, the use of predictions contained in the device (PREDCO) predictions corresponding to the device according to item 12.

14. The device (DO) decoding stream is (F) data characterized in that the specified data flow describes the image or sequence of images, and the specified stream (F) data contains data characterizing the at least one partition image, when the specified device contains a means of predicting the motion vector of the specified partition image,
moreover, the use of predictions contained in the device (PREDDO) predictions corresponding to the device according to item 12.

15. A computer program containing a command to execute one of the methods according to any one of claims 1 to 11 when executed by the computer.



 

Same patents:

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to predictive motion vector predictive encoding/decoding of moving pictures. The moving picture encoding apparatus includes a primary candidate reference motion vector determination unit which sets N primary candidate reference motion vectors, a degree of reliability calculation unit which calculates the reliability of each primary candidate reference motion vector which quantitatively represents effectiveness in motion vector prediction of the block to be decoded, using encoded or decoded picture information, a reference motion vector determination unit selects M (M<N) secondary candidate reference motion vectors in accordance with the degree of reliability of N primary candidate reference motion vectors, a motion vector encoding unit calculates a predictive motion vector of the block to be encoded using M secondary candidate reference motion vectors with high reliability.

EFFECT: improved efficiency of predicting and encoding moving pictures.

16 cl, 14 dwg

FIELD: information technology.

SUBSTANCE: method for alphabetical representation of images includes a step for primary conversion of an input image to a multi-centre scanning (MCS) format, constructed according to rules of a plane-filling curve (PFC). The initial MSC cell is a discrete square consisting of nine cells (3×3=9), having its own centre and its own four faces (sides). Scanning of the initial MSC cell is performed from the centre to the edge of the square while bypassing the other cells on a circle. The path with a bypass direction to the left from the centre of the square and then on a circle, clockwise, is the priority path for scanning and displaying images.

EFFECT: high efficiency of encoding images.

3 cl, 5 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to video monitoring means. The method involves a mobile client sending a request, at the request of an external control device, to a multimedia transcoder; the multimedia transcoder receiving said request; requesting an encoded multimedia stream of said external control device from a fixed streaming media network server; transcoding the obtained encoded multimedia stream; the multimedia transcoder outputting a transcoded encoded multimedia stream to the mobile client or mobile streaming media network server, where the multimedia transcoder sets video transcoding parameters corresponding to various mobile network standards.

EFFECT: enabling a user to perform video monitoring of a control point using a mobile terminal.

10 cl, 4 dwg

FIELD: physics, computation hardware.

SUBSTANCE: invention relates to coding/decoding of picture signals. Method for variation of reference block (RFBL) with reference pixels in reference picture (I_REF) converts (TRF) reference block to first set of factors (REF (u, v,)). It changes the first set of factors (REF (u, v,)) with the help of one or several weights (TR (u, v,)) and executes the inversion (ITR) of changed. Note here that weights (TR (u, v,)) are defined by extra pixels in current picture (I_CUR) and extra reference pixels in reference picture. Application of extra pixels and extra reference pixels allows the determination of spectral weights so that they display the effects of attenuation. Particularly, if reference frame consists of two black-out frames one of which should be forecast with the help of reference frame, then assignment of weights in spectral band allows isolation of significant frame from two frames.

EFFECT: efficient coding in the case of attenuation.

10 cl, 3 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering. The method of transmitting a stream of unencrypted images involves encoding the stream of images and sending a compressed stream of images to at least one receiving device. Before encoding, images of the unencrypted stream of images are converted via a secure reversible conversion to obtain a converted stream of images which is encoded and transmitted in place of the unencrypted stream of images. The secure reversible conversion converts each image from a sequence of unencrypted images.

EFFECT: high security of a stream of unencrypted images.

12 cl, 9 dwg

FIELD: information technology.

SUBSTANCE: method of compressing images programmed in a controller of a device, comprising: partitioning an image into one or more blocks; applying gamma conversion to each pixel of the image to generate data with the same number of bits; computing prediction values for each pixel in each block of the one or more blocks using a plurality of prediction modes; applying quantisation to each pixel of each block of the one or more blocks using a plurality of quantisation numbers; computing differential pulse code modulation (DPCM) to generate residuals of the quantised values for each of the plurality of quantisation numbers, wherein the number of bits generated for each block of the one or more blocks is equal to the bit budget; computing pulse code modulation (PCM), which includes shifting each pixel value by a fixed number of bits; selecting for each block of said one or more blocks, DPCM with a quantisation number where the best quantisation accuracy is achieved; selecting an encoding method from the DPCM with said quantisation number and PCM; and generating a bit stream containing data encoded using the selected encoding method.

EFFECT: compression without visual losses.

14 cl, 17 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to means of digitising a frame image.

EFFECT: frame digitisation with not three converters in each matrix element but with one converter in each matrix element which, during the frame period, concurrently and synchronously performs three successive conversions of colours R, G, B with 15 bits each, and image digitisation ends at the end of the frame period.

4 dwg

FIELD: information technology.

SUBSTANCE: image compression method, based on excluding a certain portion of information, wherein the information is excluded from the space domain through numerical solution of Poisson or Laplace differential equations, and subsequent estimation of the difference between the obtained solution and actual values at discrete points of the image; generating an array of boundary conditions, which includes a considerable number of equal elements which is compressed, and the image is reconstructed by solving Poisson or Laplace partial differential equations using the array of boundary conditions.

EFFECT: eliminating loss of image integrity, high efficiency of compressing images having large areas of the same tone or gradient and maintaining contrast of boundaries between different objects of an image.

2 cl, 16 dwg

FIELD: information technology.

SUBSTANCE: method is carried out by realising automatic computer formation of a prediction procedure which is appropriately applied to an input image. The technical result is achieved by making an image encoding device for encoding images using a predicted pixel value generated by a predetermined procedure for generating a predicted value which predicts the value of a target encoding pixel using a pre-decoded pixel. The procedure for generating a predicted value, having the best estimate cost, is selected from procedures for generating a predicted value as parents and descendants, where the overall information content for displaying a tree structure and volume of code estimated by the predicted pixel value, obtained through the tree structure, is used as an estimate cost. The final procedure for generating a predicted value is formed by repeating the relevant operation.

EFFECT: high efficiency of encoding and decoding, and further reduction of the relevant volume of code.

12 cl, 14 dwg

FIELD: information technologies.

SUBSTANCE: in the method of processing of raster images, including compression of an image by the method of "cut block coding" or its modifications, before the procedure of compressing coding they perform digital filtration, which increases sharpness of the compressed image, and after the decoding procedure they perform smoothing digital filtration of the decoded image.

EFFECT: improved quality of decoded raster images when methods used for their compressing coding on the basis of cut block coding or their modifications, improved current formalised criteria.

3 cl, 8 dwg

FIELD: systems for encoding and decoding video signals.

SUBSTANCE: method and system for statistical encoding are claimed, where parameters which represent the encoded signal are transformed to indexes of code words, so that decoder may restore the encoded signal from aforementioned indexes of code words. When the parameter space is limited in such a way that encoding becomes inefficient and code words are not positioned in ordered or continuous fashion in accordance with parameters, sorting is used to sort parameters into various groups with the goal of transformation of parameters from various groups into indexes of code words in different manner, so that assignment of code word indexes which correspond to parameters is performed in continuous and ordered fashion. Sorting may be based on absolute values of parameters relatively to selected value. In process of decoding, indexes of code words are also sorted into various groups on basis of code word index values relatively to selected value.

EFFECT: increased efficiency of compression, when encoding parameters are within limited range to ensure ordered transformation of code word indexes.

6 cl, 3 dwg

FIELD: method for encoding and decoding digital data transferred by prioritized pixel transmission method or stored in memory.

SUBSTANCE: in accordance to the invention, informational content being encoded and decoded consists of separate pixel groups, where each pixel group contains value of position, at least one pixel value and priority value assigned to it, where at least one key is used, with which value of position and/or pixel value/values of pixels of pixel group are selectively encoded or decoded. Depending on used keys and on parts of informational content which are encoded, for example, value of positions and/or values of pixel groups, many various requirements may be taken into consideration during encoding.

EFFECT: ensured scaling capacity of encoding and decoding of digital data.

8 cl, 5 dwg, 3 tbl

FIELD: image processing systems, in particular, methods and systems for encoding and decoding images.

SUBSTANCE: in accordance to the invention, input image is divided onto several image blocks (600), containing several image elements (610), further image blocks (600) are encoded to form encoded representations (700) of blocks, which contains color code word (710), intensity code word (720) and intensity representations series (730). Color code word (710) is a representation of colors of elements (610) of image block (600). Intensity code word (720) is a representation of a set of several intensity modifiers for modification of intensity of elements (610) in image block (600), and series (730) of representations includes representation of intensity for each element (610) in image block (600), where the series identifies one of intensity modifiers in a set of intensity modifiers. In process of decoding, code words (710, 720) of colors and intensity and intensity representation (730) are used to generate decoded representation of elements (610) in image block (600).

EFFECT: increased efficiency of processing, encoding/decoding of images for adaptation in mobile devices with low volume and productivity of memory.

9 cl, 21 dwg, 3 tbl

FIELD: technology for processing digital images, namely, encoding and decoding of images.

SUBSTANCE: in the system and the method, serial conversion and encoding of digital images are performed by means of application of transformation with superposition (combination) of several resolutions, ensuring serial visualization and reduction of distortions of image block integrity and image contour when compared to many standard data compression systems. The system contains a converter of color space, block for transformation with superposition of several resolutions, quantizer, scanner and statistical encoder. Transformation by scanning with usage of several resolutions outputs transformation coefficients, for example, first transformation coefficients and second transformation coefficients. Representation with usage of several resolutions may be produced using second transformation coefficients with superposition of several resolutions. The transformer of color space transforms the input image to representation of color space of the input image. Then, the representation of color space of input image is used for transformation with superposition of several resolutions. The quantizer receives first transformation coefficients and/or second transformation coefficients and outputs quantized coefficients for use by scanner and/or statistical encoder. The scanner scans quantized coefficients for creating a one-dimensional vector, which is used by statistical encoder. The statistical encoder encodes quantized coefficients received from quantizer and/or scanner, which results in compression of data.

EFFECT: increased traffic capacity and increased precision of image reconstruction.

27 cl, 19 dwg

FIELD: digital processing of images, possible use for transmitting images through low speed communication channels.

SUBSTANCE: in accordance to the invention, the image is divided onto rank blocks, for each rank block of original image a domain or a block is found in the code book and a corresponding transformation, which best covers the given rank block, if no sufficiently precise match is found, then rank blocks are divided onto blocks of smaller size, continuing the process, until acceptable match is achieved, or the size of rank blocks reaches certain predetermined limit, while after the division of the image onto rank blocks, classification of the blocks is performed, in accordance to which each domain is related to one of three classes, also except classification of domain blocks of original image, code book blocks classification is also performed, and further domain-rank matching is only performed for those domains, which belong to similarity class of given rank area. As a result, during the encoding, the search for area, which is similar to a rank block, is performed not only among the domains which are blocks of the image being encoded, but also among the code book blocks which match the rank area class.

EFFECT: increased speed of encoding with preserved speed of transmission and frame format length.

3 dwg

FIELD: video data encoding, in particular, masking of distortions introduced by errors.

SUBSTANCE: method and device are claimed which are meant for masking errors in video sequences. When a transition between scenes exists in a video sequence and an error is present in the image which is subject to transition between scenes, error masking procedure is used, which is based on type of transition between scenes, to conceal the error. Information about transition between scenes together with information about the type of transition between scenes is transferred to video decoder in the message of additional extension information, if the transition between the scenes represents a gradual transition between the scenes, algorithm of spatial-temporal masking of errors is used for masking the image, if the transition between the scenes represents a scene cut, and only a part of the image is lost or damaged, then spatial error masking is used to mask the lost or damaged part of the image, and if the whole image belonging to scene cut is lost or damaged, and the image begins a new scene, it is not masked.

EFFECT: creation of method, by means of which the appropriate form of error masking may be selected for frames which are subject to transitions between scenes in a video series.

3 cl, 3 dwg, 11 tbl

FIELD: electrical engineering.

SUBSTANCE: invention relates to communication, in particular, to reducing the message redundancy. The developed method allows transmitting additional data without increasing the volume of transmitted data with the transmission rate left intact. First, the initial image is separated into not overlapping range units to be classified. Here, note that every range unit is refereed to one of the three classes, and the said classification is applied to the domains and units from the code book as well. Additional data is entered into lower category of the domain or units indices, to the rest categories of indices of the domain of the initial image or units from the code book applied is the trial inversion procedure. Now, the domain indices and units from the code book are optimised to be transmitted, along with the data on indices of their orientation, over the communication channel. The receiving party isolates the additional data and restores the initial image.

EFFECT: transmission of additional data without increasing the common volume of transmitted data at the required transmission rate.

4 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: invention refers to method and electronic device for determination of applicability of the encoded file in an application, which allows for using such type of files but has some restrictions related to properties of such file type, as well as to the computer-readable medium containing the computer programme for performing the said method. To fulfill the above method, the electronic device contains at least one block for correlating the files associated with the application, which accepts (50) at least one property of the encoded file and correlates (52) the property with the application, creates (54) an indicator showing whether the file can be used by the application relying on correlation, and connects (56) the indicator with the encrypted file for further provision of quick decision making regarding usage of the file by the application.

EFFECT: provision of quick choosing encoded files for usage by the application without preliminary decoding of the file.

16 cl, 7 dwg

FIELD: information technology.

SUBSTANCE: method contains steps of processing information on the basis of mathematical transformations, divisions of the image into blocks of the image and coding of the current block, and the division of the image is carried out repeatedly on square blocks whose sizes are defined by a mass of initial data. For blocks which are not analysed before, an un-oriented graph is built, whose each top corresponds to one of such blocks, and each block consistently subject to affine transformations. Each transformed block is compared to all other blocks and if the degree of distortions of such a block at replacement of one of other blocks satisfies with it to the set restrictions on quality of the image between corresponding tops the column create an edge for reception the column, minimal covering which the set of tops answers an optimum base subset of blocks. The information is compared with that stored in memory of the block therefore leaving the information on the storage of the image corresponding to the minimal volume of data necessary for restoration of the image, then the procedure is repeated for the next size of the square block.

EFFECT: increase in the factor of compression of the image with minimal loss of quality at its restoration.

2 cl, 1 dwg

FIELD: physics, image processing.

SUBSTANCE: invention is related to method of reduction of redundancy of transmitted information. Invention actually consists in creation of method for additional information transmission at fractal coding of images. Transmission of additional information is carried out in the following manner: whenever initial image is compressed with the help of fractal compression method, in indices of domain units orientation binary sequence of three digits is recorded, which represents additional information, then based on this additional information processed domain is turned and brightness coefficients - o and contrast coefficients - s are searched for by method of least squares, which correspond to optimal values, at which the following expression is minimised: where {dij} and {rij} accordingly are values of pixels in domain and range areas, as a result of which optimal domain is found with account of inbuilt additional information for coding of range unit, after that indices of domains, coefficients of brightness and contrast, additional information are sent through communication channel. On receiving side additional information is separated and initial image is restored.

EFFECT: creation of method for additional information transmission with fractal coding of images.

4 dwg

Up!