Coding and decoding of video with increased resistance to errors

FIELD: physics, video.

SUBSTANCE: invention relates to the field of digital signal processing and, in particular, to the field of video signal compression using the movement compensation. The coding method includes the obtaining of target number of movement information predictors to be used for the coded image section and generation of the set of movement information predictors using the obtained target quantity. The set is generated by means of: obtaining of the first set of movement information predictors, each of which is connected with the image section having the pre-set spatial and/or time ratio with the coded image section; modifications of the first set of movement information predictors by removal of the duplicated movement information predictors for obtaining of the reduced set of movement information predictors containing the first number of movement information predictors, and each movement information predictor from the reduced set differs from any other movement information predictor from the reduced set; comparisons of the first number of movement information predictors with the target quantity obtained, and if the first quantity is less than the target quantity, obtaining of the additional movement information predictor and its addition to the reduced set of movement information predictors.

EFFECT: decrease of spatial and time redundancies in video flows.

26 cl, 8 dwg

 

The technical field to which the invention relates

The invention relates to a method and apparatus for encoding a sequence of digital images and to a method and device for decoding a corresponding bit stream.

The invention relates to the field of digital signal processing and, in particular, to the field of video compression using motion compensation to reduce spatial and temporal redundancies in the video streams.

Prior art

Many compression formats of video, such as H. 263, H. 264, MPEG-1, MPEG-2, MPEG-4, SVC, use the block discrete cosine transform (DCT) and motion compensation to eliminate the spatial and temporal redundancies. They can be called predictive video formats. Each frame or image of the video signal is divided into sections (slices), which are encoded and can be decoded independently. The cut is typically a rectangular area of the frame or, more generally, the portion of the scene or the frame entirely. In addition, each slice is divided into macroblocks (MB), and each macroblock further divided into blocks, typically 8x8 blocks of pixels. Coded frames are of two types: frames with a temporal prediction (or projected on the basis of one reference frame, the so-called P-frames or prognosis�Amie on the basis of two reference frames, the so-called B-frames) and frames without temporal prediction (so-called intra-frames or I-frames).

Temporal prediction is to find in the reference frame, or a previous or future frame of the video sequence, the image area or the reference area, the nearest(s) to the encoded block. This stage is called motion estimation. Then the difference between the coded block and the reference phase encoded (motion compensation), together with the element of motion relative to the motion vector, which indicates the reference region used for motion compensation.

To further reduce the cost of traffic info for coding, was proposed to encode the motion vector difference from the predictor motion vectors are usually computed from the motion vectors of blocks surrounding the encoded block.

In H. 264, motion vectors are encoded relative to the median predictor, calculated from motion vectors arranged in a causal neighborhood of the encoded block, for example, blocks located above and to the left of the encoded block. Encoded only the difference, called the residual motion vector, between the median predictor and the motion vector of the current block.

Coding using residual motion vectors several e�onomic bit rate, but forcing the decoder to perform the same computation of the predictor motion vector for decoding the values of the motion vector of the block to decode.

Recently proposed incremental improvements, for example, the use of a set of possible predictors motion vectors. This method, referred to as the competition motion vectors, is to determine between multiple predictors motion vectors or candidate, any predictor motion vector minimizes the cost of encoding, usually the cost of rate-distortion, residual traffic info. Residual traffic information contains the residual vector, i.e. the difference between the actual motion vector of the encoded block and the selected predictor motion vector, and information indicating the selected predictor motion vector, for example, the encoded value of the selected index of the predictor motion vector.

In High Efficiency Video Coding (HEVC), currently under standardization, it was proposed to use multiple predictors to the motion vector, which is shown schematically in Fig. 1: 3 so-called spatial predictor (predictor) V1V2and V3motion vectors are taken from blocks located in the vicinity of the encoded block�and, median predictor motion vectors calculated on the basis of component three spatial predictors V1V2and V3motion vector and a temporal predictor V0motion vector which represents a motion vector collocated block in the previous image sequence (for example, the image block N-1, located in the same spatial position as the block 'encoded' image N). Currently in HEVC 3 spatial predictor motion vectors are taken from the block situated to the left of the encoded block (V3), unit located above it (V2), and one of the blocks located at corresponding corners of the encoded block according to a predetermined rule availability. This scheme is the choice of the predictor motion vectors is called Advanced Motion Vector Prediction (AMVP). In the example shown in Fig. 1, choose a vector V1block located above and to the left.

Eventually, get a set of 5 of the predictors of candidate motion vectors, consisting of spatial predictors and temporal predictors. To reduce the overhead of signaling the predictor motion vector in a bit stream, the set of predictors motion vectors is reduced by eliminating the duplicated motion vectors, i.e., motion vectors, �bearing the same value. For example, as shown in Fig. 1, V1and V2equal, and V0and V3also equal, so only two of them should remain as predictors of candidate motion vectors, such as V0and V1. In this case, only one bit is needed to indicate to the decoder the index of the predictor motion vector.

Possible additional reduction of the set of predictors motion vectors based on the values of the predictors. Selecting the best predictor motion vector and calculating a residual motion vector, it is possible to exclude from the set of predictors candidates who will not be selected, knowing the residual motion vector and the optimization criterion of the value of the encoder. Sufficient reduction of the set of predictors gives a gain in the cost of signaling, since the reference of the selected predictor motion vectors can be encoded using fewer bits. In the limiting case, the set of candidates can be reduced to 1, for example, if all predictors motion vectors are equal, which eliminates the need of inserting in the bitstream any information regarding the selected predictor motion vector.

In the end, the encoding of the motion vector difference from the predictor motion vector, together with the reduction in the number of predictors-candidate�datov motion vector gives a gain in compression. However, as explained above, for a given coded unit, reducing the number of predictors of candidate motion vectors based on the values taken by the predictors motion vectors from the set, in particular, the values of motion vectors of neighboring blocks and the motion vector of the collocated block. Also, the decoder must be able to apply the same analysis to the set of possible predictors of the motion vector, the coder, to get the number of bits used to indicate the selected predictor motion vector and must be able to decode the index of the predictor motion vector and, finally, to decode the motion vector using the received residual motion vector. According to the example shown in Fig. 1, the set of predictors to the motion vector of the block 'encoded' coder is reduced to V0and V1thanks to which, the index is encoded as a single bit. If the unit is 'combined' image N-1 is lost during transmission, the decoder can obtain the value of V0and, thus, cannot detect that V0and V3equal. Thus, the decoder cannot know how many bits were used to encode the index of the predictor motion vector for the block 'encoded' and, therefore, the decoder cannot correctly analyze the data for CP�for, because he can't find where the end of the coding index, and where to begin encoding the video data.

Thus, the fact that the number of bits used for signaling predictors motion vectors depends on the values taken by the predictors motion vectors, makes the method very vulnerable to transmission errors, when bit stream is transmitted to the decoder over the network losses. Indeed, the method requires knowledge of the values of the predictors motion vectors for correct analysis of the bitstream at the decoder. In the case of packet loss, when some of the values of the residual motion vectors are lost, the decoder cannot determine how many bits were used to encode the index representing the predictor motion vector that does not allow him to correctly analyze the bit stream. This error can propagate, leading to desynchronization of the decoder before the decoder will not accept the following image synchronization, encoded without prediction.

Preferably, at least be able to analyze the encoded bit stream to the decoder even in case of packet loss, so then you can apply in one form or another resynchronization or masking errors.

In document JCTVC-C166r1, 'TE11: Study on motion vector coding (experiment 3.3 a and 3.3 c)' for the author�K. Twomey Sato, published on the 3rd meeting of Joint Collaborative Team on Video Coding (JTC-VC) in Guangzhou, 7-15 October 2010, proposed to use only spatial predictors motion vectors coming from the same slice in the set of predictors. This solution solves the problem analysis at the decoder in case of loss slices. However, the encoding efficiency is greatly reduced because of the temporal predictor motion vector is not used anymore. Thus, this solution is not satisfactory for the indicators of compression.

Summary of the invention

It is desirable to eliminate one or more of the drawbacks of the prior art.

According to one aspect of the present invention is provided a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area,

moreover, for at least one encoded image, the method contains the stages on which:

- get the target number of predictors traffic info to be used for the encoded image area, and

- generate a set of predictors traffic info using the obtained target number of predictors information�ation movement;

wherein the step of generating includes the sub-stages, on which:

- get the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said encoded area of the image,

- modify mentioned first set of predictors traffic information by removing redundant predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the motion referred to the abbreviated dialing

- after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor information movement in said reduced set of predictors traffic info.

According to another aspect �altoadige of the invention is provided a method of decoding a bitstream, containing the encoded sequence of digital images, wherein at least one portion of the image is encoded through motion compensation relative to the reference image, wherein, for at least one decoded image area, the method contains the stages on which:

- get the target number of predictors traffic info to be used for the decoded image area, and

- generate a set of predictors traffic info using the obtained target number of predictors traffic info;

wherein the step of generating includes the sub-stages, on which:

- get the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,

- modify mentioned first set of predictors traffic information by removing redundant predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing is different from any other predse�Atelier traffic info mentioned speed dial,

- after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor information movement in said reduced set of predictors traffic info.

According to another aspect of the present invention provides a device for encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area,

wherein the device contains:

- means for obtaining a target number of predictors traffic info to be used for the encoded image area, and

- means for generating the set of predictors traffic info using the obtained target number of predictors traffic info;

wherein the generation facility includes:

- means for receiving a first set of predictors traffic info, each of which is associated with phase�m images having a predetermined spatial and/or temporal relationship with said decoded area of the image,

- means for modifying the first mentioned set of predictors traffic information by removing redundant predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the motion referred to the abbreviated dialing

- means, configured to, after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target number, and is further arranged to:

- if said first quantity is less than the target number,

- get additional predictor information of the movement and

- add the additional predictor information movement in said reduced set of predictors traffic info.

According to another aspect of the present invention is provided a method of decoding a bit stream�and, containing the encoded sequence of digital images, wherein at least one portion of the image is encoded through motion compensation relative to the reference image, wherein the device contains:

- means for obtaining a target number of predictors traffic info to be used for the decoded image area, and

- means for generating the set of predictors traffic info using the obtained target number of predictors traffic info;

wherein the generation facility includes:

- means for receiving a first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,

- means for modifying the first mentioned set of predictors traffic information by removing redundant predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the movement of the mentioned redundant�steering kit,

- means, configured to, after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target number, and is further arranged to:

- if said first quantity is less than the target number,

- get additional predictor information of the movement and

- add the additional predictor information movement in said reduced set of predictors traffic info.

Additional aspects of the present invention provide for a computer program that, when executed on a computer, instruct the computer to perform the above method of encoding a digital video signal or the above method of decoding a bitstream. In each case, the computer program may be stored on a computer-readable storage medium.

According to another aspect of the present invention is provided a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area,

and for at least one kodiruemogo� image area method includes the steps in which:

- get the target number of predictors traffic info to be used for the encoded image area, and

- get the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said encoded area of the image,

- exclude duplicates from the first set of predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the motion referred to the abbreviated dialing

- after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor information movement in said reduced set of predictors and�formation movement.

In one embodiment, the implementation, the information predictors of the reduced movement of the mentioned set are actual predictors of information movement, motion vectors which are obtained from the plots mentioned image of the encoded image or the reference image, and the additional predictor information of the movement is additionally predictor of actual traffic information.

In one embodiment, the implementation, the information predictors of the reduced movement of the mentioned set are actual predictors of information movement, motion vectors which are obtained from the plots mentioned image of the encoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned encoded image or a reference image.

In one embodiment of the method contains checks, less the number of predictors to information movement in said reduced set of target number, and, if so, the initial addition of one or more of the actual additional predictors traffic info, W�the reconsideration, less than the number of predictors traffic info, after adding additional predictors of actual traffic information, the task number, and, if so, adding one or more of the predictors virtual traffic info.

According to another aspect of the present invention is provided a method of decoding a bitstream containing the encoded sequence of digital images, wherein at least one portion of the image is encoded through motion compensation relative to the reference image, wherein, for at least one decoded image area, the method contains the stages on which:

- get the target number of predictors traffic info to be used for the decoded image area, and

- get the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,

- exclude duplicates from the first set of predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors information only�I, each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the motion referred to the abbreviated dialing

- after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor information movement in said reduced set of predictors traffic info.

In one embodiment, the implementation, the information predictors of the reduced movement of the mentioned set are actual predictors of information movement, motion vectors are derived from areas of the image mentioned decoded image or the reference image, and the additional predictor information of the movement is additionally predictor of actual traffic information.

In one embodiment, the implementation, the information predictors of the reduced movement of the mentioned set are actual predictors of information of motion vectors d�izheniya were obtained from areas of the image mentioned decoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned decoded image or a reference image.

In one embodiment of the method contains checks, less the number of predictors traffic info in a concise set the task number, and, if so, the initial addition of one or more of the actual additional predictors traffic info, then re-test, less the number of predictors traffic info, after adding additional predictors of actual traffic information, the task number, and, if so, adding one or more of the predictors virtual traffic info.

Additional aspects of the invention provide a corresponding device for encoding, the corresponding device for decoding and corresponding computer program and computer-readable storage media.

According to another aspect of the present invention is provided a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image encodes�I by motion compensation to the reference image area,

wherein at least one of the encoded image area method contains the stages on which:

- get the target number of predictors traffic info to be used for the encoded image area, and

- generate a set of predictors traffic info, and each predictor traffic info from the generated set is associated with the image area having a predetermined spatial and/or temporal relationship with said encoded area of the image;

- exclude duplicates from the generated set to receive the first set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the movement of the first set is different from any other predictor information of the movement of the first set;

- after receiving the above-mentioned first set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor INF�rmacie movement in said first set of predictors traffic info.

In one embodiment, the implementation, the information predictors of the movement from the first set are actual predictors of information movement, motion vectors which are obtained from the plots mentioned image of the encoded image or the reference image, and the additional predictor information of the movement is additionally predictor of actual traffic information.

In one embodiment of the predictors of information movement from the first set are actual predictors of information movement, motion vectors which are obtained from the plots mentioned image of the encoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned encoded image or a reference image.

In one embodiment of the method contains checks, less the number of predictors to information movement in said first mentioned set a target number, and, if so, the initial addition of one or more of the actual additional predictors of information movement, then repeat�th check less than the number of predictors traffic info, after adding additional predictors of actual traffic information, the task number, and, if so, adding one or more of the predictors virtual traffic info.

According to another aspect of the present invention is provided a method of decoding a bitstream containing the encoded sequence of digital images, wherein at least one portion of the image is encoded through motion compensation relative to the reference image, wherein at least one decoded image area, the method contains the stages on which:

- get the target number of predictors traffic info to be used for the decoded image area, and

- generate a set of predictors traffic info, and each predictor traffic info from the generated set is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded image;

- exclude duplicates from the generated set to receive the first set of predictors traffic information containing the first number of predictors informats�and movement, each predictor information of the movement of the first set is different from any other predictor information of the movement of the first set;

- after receiving the above-mentioned first set of predictors traffic info compare first mentioned the number of predictors traffic info with the obtained target amount, and,

- if said first quantity is less than the target number,

- receive an additional predictor of information movement, and

- add the additional predictor information movement in said first set of predictors traffic info.

In one embodiment, the implementation, the information predictors of the movement from the first set are actual predictors of information movement, motion vectors are derived from areas of the image mentioned decoded image or the reference image, and the additional predictor information of the movement is additionally predictor of actual traffic information.

In one embodiment of the predictors of information movement from the first set are actual predictors of information movement, motion vectors obtained from image plots� mentioned decoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned decoded image or a reference image.

In one embodiment of the method contains checks, less the number of predictors to information movement in said first mentioned set a target number, and, if so, the initial addition of one or more of the actual additional predictors traffic info, then re-test, less the number of predictors traffic info, after adding additional predictors of actual traffic information, the task number, and, if so, adding one or more of the predictors virtual traffic info.

Additional aspects of the invention provide a corresponding device for encoding, the corresponding device for decoding and corresponding computer program and computer-readable storage media.

It is also desirable to provide a method that enables us to analyze the decoder even in case of damage of the bitstream due to the transmission losses, at the same time, supporting you�will fetter the efficiency of compression.

To this end, the invention relates to a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area. Method provides for at least one encoded image area stages, on which:

- get the target number of predictors traffic info to be used for the encoded image area, and

- generate a set of predictors of information movement, consisting of the task the number of predictors traffic info, and each predictor information of the movement of the generated set is different from any other predictor information of the movement from the generated set.

Advantageously, the method of the invention permits the systematic identification of target number of predictors traffic info to be used to encode information (e.g., motion vectors associated with the area of the image, and the compression is mainly improved by the generation of a set of predictors traffic info, which differ from each other. The potential costs of using a fixed target number of predictors informats�and motion is compensated using multiple predictors, thereby increasing the degree of compression. The targeted number of different predictors of information movement is determined and is fixed regardless of the actual values of information elements of motion, e.g., motion vectors selected as predictors traffic info for the current encoded image area.

Variant implementation of the present invention is effective when the number of initially generated predictors of information movement is not known in advance, such as when using AMVP. For example, if the reduction of the initial set and the number of initial predictors removed in the reduction process is not known in advance, a variant implementation of the present invention can be used to ensure that the final set of predictors of the information traffic consists of a target number of predictors traffic info.

According to the embodiment of the implementation, a method of encoding further comprises the steps on which:

- choose the predictor information of the motion referred to the encoded phase image generated from the set of predictors traffic info, and

- encode an item of information representing the mentioned selected predictor traffic info, osnovnolozhenia mentioned target amount.

Predominantly, the predictor information of the movement can be selected for the current encoded block, and the selected predictor motion vector can be encoded depending on a certain number of predictors traffic info. The number of predictors traffic info can be systematically extracted by the decoder, so that the encoded bit stream can systematically evaluated at the decoder even in case of losses.

According to the embodiment of the implementation, an item of information representing the mentioned selected predictor motion vector is the index of the selected predictor motion vectors in the generated set of predictors traffic info, and the index is encoded by the number of bits that depends on the obtained target amount.

According to the embodiment of the implementation, at the stage of producing the target number of predictors traffic info to be used for the encoded image area, the task number is set to a predetermined value for any of the encoded image sequence of digital images.

The advantage of this embodiment is that the target number of predictors traffic info can easily be obtained b�W any subsidiary of calculating costs or alarm, on the encoder or the decoder.

According to another embodiment of the, at the stage of producing the target number of predictors traffic info to be used for the encoded image area mentioned target number is determined, for a given encoded image area, depending on the information mentioned encoding of the encoded image area.

Primarily, this information encoding may be an encoding option, for example, if images are divided into macroblocks of variable size for processing, the size of a macroblock, which owns the encoded image area. Such information coding can also be, for example, the encoding mode associated with the encoded area of the image.

According to another aspect, the invention relates to a device for encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area. The device comprises, for at least one encoded image area:

- means for obtaining a target number of predictors traffic info to be used for the encoded footage depicts�I, and

- means for generating a set of predictors of information movement, consisting of the task the number of predictors traffic info, and each predictor information of the movement of the generated set is different from any other predictor information of the movement from the generated set.

According to another aspect, the invention also relates to a computer program product that can be loaded into a programmable device, comprising sequences of instructions for implementing the method of encoding a sequence of digital images, briefly described above, when the program is loaded into the programmable device and executes them. Such a computer program may be transient or netrestore. In one implementation, a computer program may be stored on retransform (nevremena) a computer-readable carrier.

Specific characteristics and advantages of the device for encoding a sequence of digital images, a storage medium and a computer program product, similar characteristics and advantages of the method of coding a digital video signal, so they are not repeated here.

According to another aspect of the invention also relates to a method of decoding a bitstream, the content�the next encoded sequence of digital images, moreover, at least one portion of an image is encoded through motion compensation relative to the reference image. For at least one mentioned decoded image area method contains the stages on which:

- get the target number of predictors traffic info to be used for the decoded image area, and

- generate a set of predictors of information movement, consisting of the task the number of predictors traffic info, and each predictor information of the movement of the generated set is different from any other predictor information of the movement from the generated set.

An advantage of the method of decoding a bit stream is that it allows you to determine the target number of predictors traffic info and use a number of different predictors traffic info. The target number of predictors traffic info can be systematically removed and, consequently, the bit stream can be systematically analyzed, even in the case of transmission errors. An additional advantage is that in any case, the bitstream analysis is simplified and, in particular, easier than using traditional methods that are adaptive de�t the number of predictors traffic info instead to use a predetermined target amount that may be received by the decoder.

According to a variant implementation, the method further comprises the step of decoding item of information representing the selected predictor information of the movement for the decoded image area based on the obtained target amount.

Mostly, in case of encoding, depending on the number of predictors traffic info, applied at the encoder, an item of information representing the selected predictor information of the movement for the decoded image area, can be systematically decode, even in the case of transmission errors.

According to another aspect, the invention also relates to a device for decoding a bitstream containing the encoded sequence of digital images, wherein at least one portion of the image is encoded by motion compensation to the reference image area. The device comprises for at least one mentioned decoded image area:

- means for obtaining a target number of predictors traffic info to be used for the decoded image area, and

- deterge�in to generate the set of predictors traffic info, which consists of target the number of predictors traffic info, and each predictor information of the movement of the generated set is different from any other predictor information of the movement from the generated set.

According to another aspect, the invention also relates to a means of storing information that can be read by a computer or microprocessor, and this storage medium is replaceable, and it is stored instructions of a computer program for implementing the method of decoding a bitstream, briefly described above.

According to another aspect, the invention also relates to a computer program product that can be loaded into a programmable device, comprising sequences of instructions for implementing the method of decoding a bitstream, briefly described above, when the program is loaded into the programmable device and executes them. Such a computer program may be transient or netrestore. In one implementation, a computer program may be stored on retransform (nevremena) a computer-readable carrier.

Specific characteristics and advantages of the device for decoding the bit stream, a storage medium and a computer program product, similar in nature�the sticks and advantages of the method of decoding, so they are not repeated here.

According to another aspect of the present invention is provided a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image is encoded by motion compensation to the reference image area, the method includes generation of a set of predictors traffic info with controlled spacing and the choice of the predictor information of the motion referred to the encoded phase image generated from the set of predictors traffic info.

Controlled spacing means that the information predictors of the movement of the set differ from each other, but one or more of them with a high degree of statistical likelihood is close to the actual traffic info, the residue (the difference between actual traffic and information considered by the predictor) is small and therefore allows efficient compression.

The method may include:

the first generation of the predictors traffic info;

identification of one or more of the first predictors of information of motion as predictors of seed;

generating one or more second predictors traffic information on the basis of the seed(s) predskazat�La(s); and

the formation of the mentioned set of predictors of information of the movement of the first and/or second predictors traffic info.

In this case, the first fortunetellers traffic info can be predictors from which statistically expected good results in terms of compression efficiency. Second, the predictors of information movement, which is based on early predictors that can then be used for organized or systematic studies of other predictors in the space of the predictors, coterminous with the first predictors. Such predictors can also expect good results, and the more predictors will be investigated, the more likely to find a good match with the actual traffic information.

In one embodiment, the implementation of at least one of the first predictors of information movement is identified as such seed predictor on the basis of the importance of the first predictor information of the movement.

The importance may depend on how many times considered the first predictor information of the movement appears among the first predictors of information movement. The more times you receive the predictor, the more important it is considered to be, and the more likely that he will�t used in the set. In addition to searching identical predictors (duplicates) can also be effective search of close matches.

Alternatively, the importance may depend on measures of how consider first the predictor information of the movement is the first predictors of the information movement in General. For example, if the first information predictors of motion are averaged, the difference or the distance between the middle of the predictor data and the first predictor information of motion is the measure of how far a given predictor is the first predictors of the information movement in General.

One way to manage diversity is to generate at least one second mentioned predictor information of the movement by adding or subtracting the offset from one of the mentioned predictors of seed. The offset can be fixed. It can also be a pseudo-random value, provided that the decoder is available the same seed (seed) value as the encoder. If the seed predictors are vectors, the spacing can also be controlled by adding to the seed predictor another vector, for example a fixed value and a predetermined direction relative to the direction of the seed of the predictor.

Many mentioned the second predictor� traffic information can be generated on the basis of one and the same referred to the seed of the predictor. If each of the predictors traffic info are vectors has components X and Y, a lot of second predictors traffic info can be obtained by adding and/or subtracting the offset to/from one or both of the mentioned component is the same referred to the seed of the predictor. For example, the same offset can be added to or subtracted from the same seed of the predictor. If the seed predictor is a vector with components X and Y, there are several permutations of adding/subtracting offsets to/from one or both of the components X and Y of the same seed of the predictor. It also allows you to efficiently generate a managed diversity without much obrabotannoi load.

Another way of managing diversity involves generation of a set of second predictors traffic info by averaging the different pairs (or other combinations) of the first predictors of information movement. For example, if the first information predictors of motion are V1V2and V3that three second predictors traffic info can be formed from medium-V1 & V2, V2 & V3 and V3 & V1. You can also create different weighted combinations of the same first information predictors of the movement as different second predskazati�her traffic info.

Early predictors traffic info may constitute or include the information predictors of the movement, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with the encoded area of the image. For example, the information predictors of the techniques used in AMVP, may be the first information predictors of the movement. It is a good source of seed of the predictors.

In another embodiment of the method contains:

the first generation of the predictors traffic info;

check difference generated between the first information predictors of the movement; and

exceptions to the set of predictors traffic information of one or more of the first predictors of traffic information on the basis of differences.

Considering the differences between the first information predictors of the movement, you can control the spacing of the predictors traffic info set. In this case, it is required to identify predictors of seed among the first predictors of information to generate second information predictors of the movement on the basis of the seed of the predictors. This can be effective, for example, if initially there is quite a large number of first predskazati�her traffic info.

For example, according to the method of controlling the spacing, the first predictor information of the motion having the smallest difference from the other of the first predictor information of the movement can be removed. If necessary, the process can be repeated to sequentially remove all posted less predictors.

It is important to note that this aspect of the invention, the number of predictors traffic info in the above set can be variable.

However, according to another primary aspect of the present invention, the number of predictors traffic info in the above set may be predetermined, at least for a given encoded image area or even for all areas of the image (the target number). This allows not only managed to achieve separations between the set of predictors, but also solve the problem of the analysis specified in the introduction.

This aspect of the invention also provides a corresponding decoding method and corresponding device for encoding and decoding, as well as programs under which are encoding and decoding.

According to another aspect, the invention relates to a method of encoding a sequence of digital images into a bitstream, wherein at least one portion of the image to�varies by motion compensation to the reference image area. Method provides for at least one of the encoded portion of the picture, the stages at which:

- get the first set of predictors motion vectors to be used for the encoded image area, and

- generate a second set of predictors motion vectors from the first set of predictors motion vectors, with each predictor motion vector of the generated set is different from any other predictor motion vector generated from the second set of predictors motion vectors, wherein at least one predictor motion vector from the second set is calculated from the selected predictor motion vector of the first set.

Mainly generated by the second set of predictors motion vectors used for coding the motion vector associated with the encoded area of the image. The second set of predictors motion vectors contains many different predictors motion vectors that are generated (and possibly selected) to improve the compression efficiency.

According to the embodiment of the predictor motion vector of the first set is selected in the selection step according to an importance value.

According to a variant implementation, the method of encoding includes a step computing�of severity values, associated with each predictor motion vector of the first set.

According to the embodiment of the implementation, the predictor motion vector of the first set is selected in the selection step according to the distance between the predictors motion vectors of the first set.

Various implementation options for the choice of the predictor motion vector to generate additional or other virtual predictors motion vectors allow you to apply the choice of a managed separation, which has the advantage of increasing the compression efficiency. Indeed, the use of predictors motion vectors computed from important predictors of the initial motion vector set, allows you to more accurately represent the motion vector of the current coded block. Again not essential to have a fixed or targeted number of predictors in the final set.

According to the embodiment of the predictors motion vectors from the first set of predictors motion vectors are motion vectors associated with the regions of the image to encode the encoded image and/or reference image. The first set may consist of, or include, the predictors used in AMVP.

BRIEF description of the DRAWINGS

Other characteristics and advantages clear from Nigel�blowing descriptions which are only in the order of non-restrictive example with reference to the accompanying drawings, in which:

- Fig. 1, previously described, schematically illustrates a set of predictors motion vectors used in the prediction scheme of motion vectors;

- Fig. 2 - circuit processing device designed for the implementation of the embodiment of the present invention;

- Fig. 3 is a block diagram of the encoder according to the embodiment of the invention;

- Fig. 4 is a block diagram of a decoder according to the embodiment of the invention;

- Fig. 5 details the definition of a set of predictors motion vectors according to the first variant of implementation;

- Fig. 6 details the definition of a set of predictors motion vectors according to a second embodiment of the;

- Fig. 7 illustrates schematically a second set of predictors to the motion vector;

- Fig. 8 schematically illustrates the motion vectors in the coordinate system.

Detailed description of embodiments of

Fig. 2 illustrates a diagram of an apparatus 1000 treatment intended for implementation of one embodiment of the present invention. Device 1000 is, for example, a microcomputer, a workstation, or lightweight handheld device.

The device 1000 includes a bus 1113 regard to which, the preferred�about, connected:

- the CPU 1111, for example, a microprocessor, denoted CPU (CPU);

- permanent memory 1107 is able to contain a computer program for carrying out the invention, denoted ROM);

- random access memory 1112, denoted RAM, able to contain the executable code of the method of the invention, the registers are designed to record variables and parameters necessary for implementing the method of encoding a sequence of digital images and/or the method of decoding a bitstream; and

interface 1102 is connected to a network 1103 connection, which transmit digital data to be processed.

Optionally, the device 1000 may also have the following components:

- a means of data storage 1104, such as a hard disk, capable of containing software that implements the invention and data used or produced during the implementation of the invention;

drive 1105 for the disk 1106, and the drive is designed to read data from the disk 1106 or to write data to the disk.

screen 1109 for displaying data and/or graphical interface with the user through the keyboard 1110 or any other index funds.

The device 1000 may be connected to different peripherals, for example, C�proveu chamber 1100 or microphone 1108, each of which is connected to the card I / o (not shown) for supplying multimedia data to the device 1000.

The communication bus provides communication and interoperability between the different elements included in the device 1000, or connected to it. The performance of the tire is not restrictive, and, in particular, the Central processor is capable of transmitting instructions to any element of the device 1000 directly or through another element of the device 1000.

The disk 1106 can be replaced by any information carrier such as a CD-ROM (CD-ROM), rewritable or not, a ZIP disk or a memory card and, in General, a means of storing information that can be read by a microcomputer or microprocessor, integrated or not into the device, possibly removable, and designed to store one or more programs, the implementation of which allows to realize a method of encoding a sequence of digital images and/or method of decoding a bitstream according to the invention.

Executable code may be stored in permanent memory 1107, on the hard disk 1104 or on removable digital media, such as the previously described drive 1106. According to the embodiment, the executable code of the program can be taken through the network 1103 connection, via the interface 1102, for saving one funds �wounds of the device 1000, before it is executed, for example, on the hard disk 1104.

The CPU 1111 is designed to control and guide the execution of instructions or portions of software code of the program or programs according to the invention, instructions that are stored in one of the aforementioned storage means. At power up, the program or programs stored in nonvolatile memory, for example, on the hard disk 1104 or in permanent memory 1107 is transferred to the RAM 1112, which then contains the executable code of the program or programs, as well as registers for storing the variables and parameters necessary for implementation of the invention.

In this embodiment, the exercise device is a programmable device that uses software to implement the invention. However, the alternative, the present invention can be implemented via hardware (e.g., in the form of a specific integrated circuit or ASIC).

Fig. 3 illustrates a block diagram of the encoder according to the embodiment of the invention. The encoder is represented by connected modules, each module is designed to implement, for example in the form of programming instructions to be executed on the CPU 1111 of the device 1000, the corresponding stage of the method that implements a variant of implementation and�acquisition.

The original sequence of digital images with i0for in301 is taken as input by the encoder 30. Each digital image is represented as a set of samples, known as pixels.

Bit stream 310 is output by the encoder 30.

Bit stream 310 contains many units of encoding or of slices, and each slice includes a slice header for encoding of values of the encoding parameters used to encode the slice, and the body of the slice containing the encoded video data.

The input digital image are divided into blocks (302), and the blocks are parts of the picture and can have variable sizes (e.g., 4×4, 8×8, 16×16, 32×32). For each input unit selects the encoding mode. There are two families of encoding modes, the encoding spatial prediction or intracoronary, and coding with temporal prediction or intermediaware. Possible encoding modes are tested.

Module 303 implements infraprogressive in which the encoded block is predicted by the predictor computed from pixels in a neighborhood referred to the encoded block. An indication of the selected intraregionally and the difference between this block and its predictor is encoded, if the selected interaktywna.

Temporal prediction Rea�isoamsa modules 304 and 305. First of all, select a reference image from a set of reference images 316, and the area of the reference image, called the reference area, which is the region closest to the given encoded block, is selected by the module 304 of the motion estimation. The difference between the selected reference area and the data block, also called residual blocks is calculated by the module 305 motion compensation. Select a reference region indicated by the motion vector.

Information regarding the motion vector and the residual block is encoded, if the selected interrogazione. To further reduce bit rate, the motion vector is encoded by the relative difference of the predictor motion vector. The set of predictors motion vectors, also referred to as predictors traffic info, obtained from field 318 motion vectors module 317 prediction and coding of motion vectors.

Mainly, the set of predictors motion vectors are used to select the best predictor motion vector for encoding the current motion vector is generated as explained in more detail below with reference to Fig. 5 and 6. For the current encoded block, sets a predetermined number of Nmaxpredictors of the motion vector, and therefore the index wybrano� the predictor motion vector, which is an item of information representing the selected predictor motion vectors can be encoded using a predetermined number of bits. This predetermined number of bits may be extracted by a decoder even in case of losses, to ensure that the decoder will be able to analyze the bit stream even in case of errors or losses. Nmaxpredictors motion vectors are selected according to different variants of implementation so that they all differed from each other, to improve the compression efficiency.

Select a predetermined number of Nmaxpredictors motion vectors and the corresponding number of bits to encode the index of the predictor motion vector can be applied either to the whole sequence or group of images in the sequence, or block level, depending on the encoding parameters, such as block size or the encoding mode. For example, the first predetermined number of Nmax1predictors motion vectors can be used for blocks that are coded using interrogazione, wherein the encoded residual block and the second predetermined number of Nmax2predictors motion vectors can be used for blocks encoded using the SKIP mode, when encoded only the motion vector, but not the residual block. Appropriate amounts of Nmax1and Nmax2predictors motion vectors can, for example, be signaled in the bit stream by inserting in the heading, for example, a slice header, or at any appropriate metadata field.

The encoder 30 further comprises a module 306 select the encoding mode that uses the criterion of value encoding, for example, the criterion of rate-distortion, to determine which mode of spatial prediction and temporary predict is the best. The transformation 307 is applied to the residual block, then the resulting transformed data are quantized module 308 and statistically encoded by module 309. Finally, the encoded residual block of the current encoded block is inserted into the bit stream 310, together with information regarding the choice of the predictor. For blocks coded in the mode of 'SKIP', the bit stream is encoded only the link to the predictor without any residual block.

The encoder 30 performs additional decoding of the coded image to generate a reference image for estimating motion subsequent images. Module 311 performs inverse quantization of the quantized data with a subsequent inverse transformation�m 312. Module 313 predicting a reverse movement uses the information of the prediction to determine which predictor to use for this block, and the module 314 compensation return movement actually adds the residue obtained by module 312, in the support region, obtained from a set of reference images 316. Optionally, the unlocking of the filter 315 is used to eliminate the effects of lock and enhance the visual quality of the decoded image. The same unblocking the filter is applied at the decoder, resulting in no loss of transmission of the encoder and decoder use the same treatment.

Fig. 4 illustrates a block diagram of a decoder according to the embodiment of the invention. The decoder is represented by connected modules, each module is designed to implement, for example in the form of programming instructions to be executed on the CPU 1111 of the device 1000, the corresponding stage of the method that implements a variant of the invention.

The decoder 40 receives the bit stream 401 containing the units of encoding, each of which consists of a header that contains information about the encoding parameters, and a body containing encoded video data. As explained with reference to Fig. 3, the coded video data is statistically encoded, and indices of predestinator movement is encoded for this block, the predetermined number of bits. Adopted encoded video data statistically decoded (402), rescales (403), and then applies the inverse transform (404).

In particular, where the encoded video data correspond to a residual block of the current decoded block, the decoder also decodes the information of the motion estimation of the bit stream to the reference area used by the encoder.

The module 410 applies the decoding of the motion vector for each current block, is encoded by predicting a motion that contains the definition for the number of Nmaxused predictors of the motion vector and the retrieval of the index of the predictor motion vector of the coded number of bits, depending on Nmax. Similarly, the module 317, shown in Fig. 3, the module 410 decodes the motion vector, generates a set of Nmaxpredictors motion vectors. Implementation options, explained below with reference to Fig. 5 and 6, shall apply similarly. If the bit stream is taken without losses, the decoder generates the same set of predictors motion vectors, and coder. In the case of losses, it may not be possible to generate the set of predictors motion vectors and, thus, to correctly decode in�who movement, associated with the current block. However, the analysis of the bitstream is always possible, even in the case of losses, since the number of bits used to encode the index of the predictor motion vectors can be systematically removed by the decoder.

After receiving the index of the predictor motion vector for the current block, if no loss occurs, the actual value of the motion vector associated with the current block can be decoded and used to apply compensation (406) reverse movement. The reference region specified by the decoded motion vector is extracted from the reference image (408) application for final compensation 406 return movement.

In the case of the use of intrapulmonary return infraprogressive used by the module 405.

The result is a decoded block. The unlocking of the filter 407 is applied similarly to the unlocking of the filter 315 applied at the encoder. Finally, the decoded video signal 409 is provided by the decoder 40.

Fig. 5 details the generation of a set of predictors to the motion vector or vectors of candidate motion in the first embodiment of the present invention. All the stages of the algorithm shown in Fig. 5, can be implemented by software and executed by the CPU 1111 of the device 1000.

Fig.5 is a block diagram of the operations used for this current coded block associated with a motion vector indicating a reference region in the reference image.

First, in step S500 is obtained, an initial set of L1 predictors motion vectors. Set L1 consists of N candidates. According to the embodiment of the implementation, an initial set of predictors motion vectors contains the candidate vectors of movement selected according to the scheme of predicting motion vectors AMVP, previously described with reference to Fig. 1, for example vectors with V0at V3Fig. 1 and the median vector is calculated from V1V2and V3. Accordingly, N is equal to the maximum of 5.

Preferably, the initial set of L1 predictors of the motion vector contains only the motion vectors that differ from each other. In the example shown in Fig. 1, except that the motion vectors V0V1and the median vector must remain in L1 and the number of predictors to the motion vector of N=3.

In an alternative implementation can use any other scheme to select a previously calculated motion vectors and the calculation of other motion vectors from the available (i.e. average, median, etc.) for initial set L1 predictors motion vectors.

In yet another alternative implementation, an initial set of L1 predictors of the vectors�RA movement is empty and N=0.

At next step S502, the result is the target number of Nmaxused predictors of candidate motion vector. Nmaxcan either be predetermined for the whole sequence of coded digital images, such as Nmax=4, or can be selected according to the encoding parameters of the current coded block or a unit of encoding (e.g., cut), which belongs to the current encoded block.

For example, the number of Nmaxmay depend on the size of the transform applied to the macroblock belongs to the currently processed block: for example, Nmax=p for conversion that is applied on the block 2p+1x2p+1.

According to the embodiment of the implementation, the number k of bits used to encode the index of the predictor motion vector is directly linked to Nmax: k=INTsup(log2(Nmax)), where INTsup(x) - smallest integer greater than the value x. Preferably, Nmaxmust be a power of 2, Nmax=2kso you can use all the indexes that can be coded on k bits. Mostly all of the bits used for signaling, are used to specify many of the predictors motion vectors and to improve compression.

Alternatively, you can use any type of coding indexes, PR�dostavlyaemykh predictors motion vectors after determining the number of different predictors to the motion vector of Nmax. In particular, you can use any type of statistical coding, for example, the coding method Huffman or arithmetic coding. Furthermore, the indices can be encoded using code prefix type, for example, rice-Golomb (Rice-Colomb) or the unary code.

Then, in step S503 is checked whether more the number N of predictors motion vectors from the set L1 than Nmax.

In case of positive response, after checking the next step S503 S504 choice of the predictor candidate motion vector of L1, followed by removal of the selected predictor candidate motion vector from L1 in step S506 to form a modified set L2 predictors motion vectors.

The selection in step S504 is applied according to the removal criterion, for example, the criterion of distance. For example, the set L1 contains the predictors {V1,...,VN} motion vector, and each predictor motion vector is a vector, represented by their components or coordinates on the X-axis and Y-axis in the coordinate system shown in Fig. 8.

According to the embodiment of the implementation, at step S504 is determined by the distance between each vector of Vkand every other vector in Vnfrom L1 than the Vkp�the distance is calculated as: d(Vk,Vn)=|VkxVnx|+|VkyVny|where|a|represents the absolute value of a. In the example shown in Fig. 8, the vector V has coordinates (3,2), the vector V has coordinates (4,2) and V has coordinates (3,3). In this example, d(V,V')=d(V,V)=1, so V' and V” are both the same distance from the vector V, while d(V',V”)=2.

Alternatively you can apply any other type of metric for distance calculations.

Minimum found distance d(VpVqindicates two closest vector of VpVqfrom the set L1, and thus, one of these two vectors is selected for removal. Choose one of these two vectors can be based on the distance of each to the remaining vectors of the motion estimation in the modified set L1: the vector between Vpand Vqwhich has the smallest distance to another vector from the set L1, is selected for removal.

This allows g�to rasterbate, what is the distance between the other vectors in the modified set of L2 is maximized, so you can use more or different posted predictors motion vectors.

After removal of the selected vector, the value of N decreases (S508), then N is compared with Nmax(S510). If the value N has not reached Nmax(answer 'no' when checking S510) steps S504 - S510 are repeated. Otherwise, if N has reached Nmaxfor step S510 follows step S522 described below.

If the answer while checking S503 is no, the check S512 checks, less N than Nmax. In case of negative answer, i.e. if N=Nmaxfor checking S512 should step S522 described below.

If the answer while checking S512 is Yes, i.e., if N is strictly less than Nmaxthen check S512 should step S514 obtain or generate additional predictor candidate motion vector. Indeed, since the initial set L1 predictors motion vectors, you can add other candidates as predictors motion vectors in a predetermined order, to form a modified set L2 predictors motion vectors. In the example shown in Fig. 7, the motion vectors of the blocks 710, 720, 730 and 740 can be added as potential predictors of the motion vector. Except �wow, 2 predictor of 770, 760, 750, which were not selected in step S500, you can add as potential predictors of the motion vector.

For each potential predictor candidate motion vector MV, checks whether the predictor motion vector MV from all the predictors of candidate motion vectors previously stored in the set L2.

If each potential vector candidate motion under consideration, for example, as the motion vectors of the blocks 710, 720, 730, 740, 750, 760 and 770 of Fig. 7 equal to a predictor motion vector from the set L2, new 'virtual' predictors of candidate motion vector calculated in step S514.

Such predictors of candidate motion vectors are called virtual because they are not motion vectors of other blocks of the current image or the reference image. Virtual predictors motion vectors are computed from existing predictors motion vectors, for example by adding offsets. For example, the motion vector MV of the set L2 with coordinates (MVx, MVy), we can calculate four virtual predictor motion vector by adding/subtracting the offset off to its coordinates: MV'(MVx±off, MVy±off). Usually, off can be set equal to 1 or 2.

Alternatively, you can apply other modifications component pre�of skazala motion vector MV to obtain virtual predictors motion vectors to obtain the posted predictors of the motion vector, starting from the existing predictors motion vectors to improve the efficiency of compression.

For example, the components of the motion vector MV can be modified independently, using respectively two values offx and offy, offx and offy or can be set to 0.

According to the embodiment of the implementation, both offx and offy are proportional to the corresponding component: offx=aMVxand offy=bMVywhere a and b are usually less than 0.5. If necessary, the modified coordinates MVxand MVyare rounded to the nearest integer, to represent the offset to the pixel grid.

According to the embodiment of the implementation, the subsidiary motion vector with a predetermined norm is added to the vector MV, and the auxiliary vector has the same direction as a motion vector MV that is shown in Fig. 8: auxiliary vector 850 is added to the vector 820.

In yet another alternative implementation, the dispersion is calculated motion vectors from the set L2:var=MVL2(MVxMVx)2 +(MVyMVy)2whereMVxrepresents the average value of the coordinates of MVxvectors from L2, andMVyrepresents the average value of the coordinates of MVyvectors from L2. Then the offset off is selected by comparing the calculated var values with a predetermined threshold T. T may be equal to 50/L2. If var is less than T, the value off a little, for example off=1; if var is greater than T, off is assigned a larger value, for example off=3. In addition, in this embodiment, the implementation of each component can be calculated differential value offx offy or.

One predictor motion vector obtained in step S514, is added to the set L2 predictors motion vectors in step S516, and the number N is incremented by 1 (step S518).

Then, in step S520 is checked whether between N and Nmax. In case of negative answer, the steps S514-S520 are repeated.

In the case of a put�form of further answer, achieved a certain target number of predictors of candidate motion vector of Nmaxand after step S520, the encoder at step S522 choice of the optimal predictor motion vector for the current block from the set L2. For example, the criterion of rate-distortion optimization is used to select the optimal predictor of the motion vector MVifor encoding the motion vector of the current block.

The encoder encodes the remainder of the movement, i.e. the difference between the motion vector of the current block and the selected predictor motion vector and the predictor motion vector selected at step S524. For example, the index i of the selected predictor motion vector MVifrom L2 is encoded using k=INTsup(log2(Nmax)) bits.

Alternatively, you can apply statistical encoding of the index i.

In another alternative, the index i can be encoded using code prefix type, for example, the code of the rice-Golomb, in which each value of i is encoded using the i units, followed by zeros.

The algorithm shown in Fig. 5, may also be implemented by a decoder to generate the set of predictors of candidate motion vector or vectors of the candidate of the movement for this unit, no steps S522 and S524.

At the decoder, the index i selected pre�the ratio of the motion vector MV ifor a given decoded block is obtained from the bit stream on the basis of Nmaxand thus, the number k of bits, which are encoded index i. Steps S500 - S518 similarly implemented to retrieve the set of L2 predictors motion vectors, so that the index i is decoded from the bit stream, indicates the predictor motion vectors actually used by the encoder.

In the case of losses during transmission, since the number of Nmaxcan systematically retrieved by the decoder, the accepted bit stream can be systematically analysed to highlight the index i indicating the selected predictor motion vector, even if, depending on lost packets, the decoder may not be a complete set of L2 predictors motion vectors.

Fig. 6 details the generation of a set of predictors of candidate motion vector or vectors of candidate motion in the second embodiment of the present invention. All the stages of the algorithm shown in Fig. 6, can be implemented by software and executed by the CPU 1111 of the device 1000.

Fig. 6 is a block diagram of the operations used for this current coded block associated with a motion vector indicating a reference region in the reference image.

First of all,similarly to the step S502 in Fig. 5, the target number of Nmaxused predictors of candidate motion vector is determined in step S600.

According to the embodiment of the, Nmaxis expressed in the form 2ktherefore each value of the index, which may encode k bits corresponds to a possible predictor motion vector.

For example, to use all of the predictors of the motion vector of the AMVP scheme, which provides 5 predictors motion vectors need 3 bits to encode the index of the predictor motion vector. In this case, preferably Nmax=23=8.

The initial set L1 of the predictors of candidate motion vector is obtained in step S602. For example, select an initial set of N=5 predictors of AMVP motion vector.

The reduction process is applied to the initial set of predictors of the motion vector to eliminate duplicates, it for the purpose of obtaining a reduced set of predictors motion vectors, containing N1 elements. Preferably, the number of duplicates of each remaining vector after the reduction process is recorded and stored in memory for subsequent use at the stage of the s612 described below.

Next, it is checked (check S606 whether or not N1 is greater than or equal to Nmaxtarget number of predictors motion vectors. This moisturizing, what positive outcome of this check occurs only if the algorithm starts with the first set of predictors motion vectors greater number of motion vectors than Nmax. In case of positive response, at step S606 follows step S630 select top Nmaxpredictors of candidate motion vector from the set L1 to generate the set L2 predictors motion vectors.

In case of negative answer, i.e. if N1 is less than Nmaxthe set of predictors motion vectors should be supplemented by additional predictors motion vectors.

The second set L1' of the predictors of candidate motion vector obtained in step S608.

The second set L1' predictors of the motion vector is composed of the remaining predictors motion vectors of the first set of L1 and of the additional motion vectors, for example corresponding to the motion vectors of the block 710, 720, 730 and 740 reference image shown in Fig. 7. In addition, 2 of the predictor from 770, 760, 750, which have not been selected at step S600, it is possible to add as potential predictors of the motion vector. Each predictor motion vector from the set L1' has a corresponding index.

Then the reduction process is applied to the second set of predictors motion vectors in step S610 to obtain a reduced second set of L1-pre�tellers motion vector of N2 vectors. The reduction process eliminates duplicates, so that all predictors motion vectors from L1” differ from each other. The number of duplicates of each vector remaining in L1”, is recorded and stored in memory for subsequent use at the stage of the s612 described below.

Then, in step S628 is checked whether the number of predictors to the motion vector N2 is greater than or equal to Nmax. In case of positive response, at step S628 follows the previously described step S630.

In case of negative response, you must add additional predictors to the motion vector in an abbreviated second set L1” predictors motion vectors to obtain the final set of Nmaxpredictors motion vectors.

After checking S628, in case of negative answer, the importance assigned to each remaining predictor candidate motion vector from the reduced second set L1” predictors motion vectors at the stage of the s612.

In alternative implementation, the s612 stage immediately check S606, in case of negative response when checking S606.

The importance value is calculated in this embodiment, the implementation as the number of duplicates of the predictor motion vector, using the number of duplicates of this �of redcastle motion vector, calculated and stored at steps S604 and S610. In the example shown in Fig. 1, two vectors, V0and V3equal, so the vector V0matters of importance equal to 2.

In alternative implementation, the importance value can be calculated as a function of the distance to a representative vector from the set of considered vectors, for example, the average value of the vectors of the set or the median of a set of vectors. Then the importance can be calculated as the reciprocal of the distance of this vector from the set Vn to a representative vector, the closer the vector Vn to a representative vector set, the higher the importance Vn.

Then N2 remaining predictors of candidate motion vectors are ordered in step S614 according to descending value of importance. If multiple predictors motion vectors have the same importance, you can organize them in ascending order of their indices.

Reordered the predictors motion vectors are reassigned increasing indices {V0V1,...,VN2-1}.

On the next step S616, the variable n is initialized to 0 and the variable N is initialized to n 2, i.e. the current number of predictors motion vectors are reordered in the set.

Then, in step S618, the next step S616, virtual predictors of candidates victoriawhite added to the reordered set. In this variant of implementation, the virtual predictors motion vectors are computed from the remaining predictors motion vectors are ordered according to their importance. Consider the predictor motion vector with index n from the reordered set Vn with coordinates (Vnx, Vny). The following is a list of 8 virtual predictors motion vectors are defined by their coordinates can be computed from Vn by adding +to off and off to one or two coordinates Vn: {(Vnx+off, Vny), (Vnx-off, Vny), (Vnx+off, Vny+off), (Vnx+off, Vny-off), (Vnx-off, Vny+off), (Vnx-off, Vny-off), (Vnx, Vny+off), (Vnx, Vny-off}.

You can use any alternative calculation predictors virtual motion vector, starting with the predictor vector Vn of the movement, in particular, the alternatives described above relative to step S514 in Fig. 5.

This list of predictors virtual motion vector is added to the current set of predictors motion vectors.

Duplicates are eliminated in step S620.

The value of N is updated in step S622 to the remaining number of predictors motion vectors after removal of potential duplicates.

Then, in step S624, it checks whether N is greater than or equal to Nmax. In �the event of negative response the step followed step by step S624 S634 increase the value of n by 1, and steps S618 - S624 again.

In case of a positive answer in step S624, it is concluded that the sufficient number of predictors motion vectors. At step S624 should step S630 select top Nmaxvectors-candidates of the movement for the formation of the final set of the predictors of L2 motion vector of Nmaxvectors.

At the encoder, the step S630 should step S632, similar to the step S522 in Fig. 5, selection of the best predictor motion vector MVifrom the set of predictors motion vectors for the current block according to a predetermined criterion, for example the criterion of rate-distortion.

At step S632 should step S634, the coding the motion vector of the current block using the predictor motion vector MVi, similar to step S524 in Fig. 5. For example, the index i of the predictors of the motion vector MVi is encoded using k bits, and k is computed from Nmaxaccording to k=INTsup(log2(Nmax)).

Alternatively, you can apply statistical encoding of the index i.

In another alternative, the index i can be encoded using code prefix type, for example, the code of the rice-Golomb, in which each value of i is encoded using the i units, followed by zeros.

The algorithm until�representation in Fig. 6 can also be implemented by a decoder to generate the set of predictors of candidate motion vector or vectors of the candidate of the movement for this block, except that the steps S632 and S634 omitted on the side of the decoder.

At the decoder, the index i of the selected predictor motion vector MVifor a given decoded block is obtained from the bit stream on the basis of Nmaxand thus, the number k of bits, which are encoded index i. Steps S600 - S630 similarly implemented to retrieve the set of L2 predictors motion vectors, so that the index i is decoded from the bit stream, indicates the predictor motion vectors actually used by the encoder.

In the case of losses during transmission, since the number of Nmaxcan systematically retrieved by the decoder, the accepted bit stream can be systematically analysed to highlight the index i indicating the selected predictor motion vector, even if, depending on lost packets, the decoder may not be a complete set of L2 predictors motion vectors.

The above options for implementation based on partitioning the input image into blocks, but, more generally, we can consider any type of areas of the image for encoding or decoding, in particular, primogel�haunted areas or, more generally, geometric plots.

You can include other alternative embodiments of, for example, starting with a large set of predictors of candidate motion vector that contains the number N of vectors exceeding the targeted number of Nmaxcertain predictors motion vectors, and applying the clustering algorithm type for reducing a set of vectors. For example, partition a Voronoi) can be used to reduce the set to Nmaxthe most representative vectors from the set according to the predetermined distance between the vectors of the set.

More generally, any modification or improvement of the above-described variants of implementation, which may easily imagine the specialist in the art should be considered as meeting the scope of the invention.

According to this application claims priority patent application GB No. 1100462.9, filed January 12, 2011, the contents of which are fully incorporated in this description in the link order.

1. A method of encoding a sequence of digital images into a bitstream, at least one portion of the image is encoded by motion compensation to the reference image area,
and for at least one encoded at�Asda image method includes the steps in which:
get the target number of predictors traffic info to be used for the encoded image area, and
generate the set of predictors traffic info using the obtained target number of predictors traffic info,
wherein the step of generating includes the sub-stages, in which:
receive the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said encoded area of the image,
modify mentioned first set of predictors traffic info by removing one or more duplicate predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the movement of the mentioned speed dial, after receiving the above-mentioned reduced set of predictors traffic info compare first mentioned the number of predictors traffic info with the obtained target number and,
if the PE�the new quantity is less than the target quantity,
receive an additional predictor of information movement and
add the additional predictor information movement in said reduced set of predictors traffic info.

2. A method according to claim 1, wherein the information predictors of the movement from the first set are actual predictors of information movement, motion vectors which are obtained from the plots mentioned image of the encoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned encoded image or a reference image.

3. A method according to claim 2, comprising stages on which test (S512; S606), less if the number (N; N1) predictors of information movement in said reduced set of target number (Nmax), and, if so, first add one or more of the actual additional predictors traffic info, then check again, less if the number (N2) of the predictors traffic info, after adding additional predictors of actual traffic information, the task number (Nmax), and, if so, add one or more of the� virtual predictors traffic info.

4. A method according to claim 2, wherein at least one of the mentioned virtual predictor information is calculated from an existing predictor of information movement.

5. A method according to claim 4, wherein the auxiliary vector is added to the motion vector of the existing predictor information of the movement, and the auxiliary vector has a predetermined direction relative to the direction of the motion vector of the existing predictor of information movement.

6. A method according to claim 5, in which the magnitude of the auxiliary vector depends on the magnitude of the motion vector of the existing predictor of information movement.

7. A method according to claim 5, in which the auxiliary vector has components (aMVx, bMVy), proportional to the respective components of the motion vector of the existing predictor of information movement.

8. A method according to claim 1, additionally containing a stage at which encode an item of information representing the mentioned selected predictor information of the movement.

9. A method according to claim 1, additionally containing a stage, where the signal in said bit stream referred to a target number.

10. A method according to claim 1, wherein the set of predictors traffic information generated at the stage of generation, has a target number of predictors traffic info

11. Method of decoding a bitstream containing the encoded sequence of digital images, wherein at least one image area encoded by motion compensation relative to the reference image, wherein at least one decoded image area method contains the stages at which:
get the target number of predictors traffic info to be used for the decoded image, and
generate the set of predictors traffic info using the obtained target number of predictors traffic info,
wherein the step of generating includes the sub-stages, in which:
receive the first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,
modify mentioned first set of predictors traffic info by removing one or more duplicate predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the movements mentioned sacrameno� set different from any other predictor information of the motion referred to the abbreviated dial
after receiving the above-mentioned reduced set of predictors traffic info compare first mentioned the number of predictors traffic info with the obtained target number and,
if the first quantity is less than the target quantity,
receive an additional predictor of information movement and
add the additional predictor information movement in said reduced set of predictors traffic info.

12. A method according to claim 11, additionally containing phase, which determine the predictor information of the movement for the decoded image area using a set of predictors traffic information generated at the stage of generation.

13. A method according to claim 11, additionally containing a stage at which decode an item of information representing the selected predictor information of the movement for the decoded image area.

14. A method according to claim 13, additionally containing a stage at which extract referred to selected predictor information of the traffic generated from the set of predictors traffic info with the use of said decoded item of information.

15. A method according to claim 11 in which the predictors inform�tion of motion from the first set are actual predictors traffic info, the motion vectors are derived from areas of the image mentioned decoded image or the reference image, and the additional predictor information of the motion predictor is a virtual traffic info, not having motion vectors obtained from image spot mentioned decoded image or a reference image.

16. A method according to claim 15, comprising stages on which: validate (S512; S606), less if the number (N; N1) predictors of information movement in said reduced set of target number (Nmax), and, if so, first add one or more of the actual additional predictors traffic info, then check again, less if the number (N2) of the predictors traffic info, after adding additional predictors of actual traffic information, the task number (Nmax), and, if so, add one or more of the predictors virtual traffic info.

17. A method according to claim 15, in which at least one of the mentioned virtual predictor information is calculated from an existing predictor of information movement.

18. A method according to claim 17, in which the auxiliary vector is added to the motion vector of the existing predictor information d�izheniya, moreover, the auxiliary vector has a predetermined direction relative to the direction of the motion vector of the existing predictor of information movement.

19. A method according to claim 18, in which the magnitude of the auxiliary vector depends on the magnitude of the motion vector of the existing predictor of information movement.

20. A method according to claim 18, in which the auxiliary vector has components (aMVx, bMVy), proportional to the respective components of the motion vector of the existing predictor of information movement.

21. A method according to claim 11, further comprising a step in which get the task number from the bitstream.

22. A method according to claim 11, in which a set of predictors traffic information generated at the stage of generation, has a target number of predictors traffic info.

23. The device for encoding a sequence of digital images into a bitstream, at least one portion of the image is encoded by motion compensation to the reference image area,
wherein the device contains:
means for obtaining a target number of predictors traffic info to be used for the encoded image area, and
means for generating a set of predictors of information d�izheniya using the obtained target number of predictors traffic info,
wherein the generation facility includes:
means for receiving a first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,
means for modifying the first mentioned set of predictors traffic info by removing one or more duplicate predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any other predictor information of the movement of the mentioned speed dial, and
means, configured to, after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and additionally performed with the opportunity to:
if the first quantity is less than the target quantity,
to obtain additional predictor information of the movement and
add these additional predictor information of the UE movement in�mentioned a reduced set of predictors traffic info.

24. A device for decoding a bitstream containing the encoded sequence of digital images, wherein at least one image area encoded by motion compensation relative to the reference image, wherein the device contains:
means for obtaining a target number of predictors traffic info to be used for the decoded image area, and
means for generating a set of predictors traffic info using the obtained target number of predictors traffic info,
wherein the generation facility includes:
means for receiving a first set of predictors traffic information, each of which is associated with the image area having a predetermined spatial and/or temporal relationship with said decoded area of the image,
means for modifying the first mentioned set of predictors traffic info by removing one or more duplicate predictors traffic information for obtaining a reduced set of predictors traffic information containing the first number of predictors traffic info, and each predictor information of the motion referred to the abbreviated dialing different from any oth ... " � the predictor information of the movement of the mentioned speed dial, and
means, configured to, after receiving the above-mentioned reduced set of predictors traffic info, compare first mentioned the number of predictors traffic info with the obtained target amount, and additionally performed with the opportunity to:
if the first quantity is less than the target quantity, to obtain additional predictor information of the movement and
add these additional predictor information movement in said reduced set of predictors traffic info.

25. The machine-readable storage medium on which is stored a computer program which when executed on a computer causes the computer to perform a method of encoding a digital video signal according to claim 1.

26. The machine-readable storage medium on which is stored a computer program which when executed on a computer causes the computer to implement a method of decoding a bitstream according to claim 11.



 

Same patents:

FIELD: physics, video.

SUBSTANCE: invention relates to a broadcasting system for transmitting a digital television program, particularly a transmission device and a transmission method, in which content which meets needs can be acquired. A server generates a script PDI-S for obtaining a user side PDI-A representative of an answer of a user to a question about user preferences; generates launch information for executing the PDI-A; and transmits the launch information and PDI-S in response to the delivery of broadcast content, and transmits to the client in response to the delivery of reference content a provider side PDI-A representative of an answer set by a provider to the question. The client executes the PDI-S based on detection of launch information and carries out matching between the user side PDI-A and the provider side PDI-A to determine acquisition of reference content delivered by the server.

EFFECT: facilitating delivery of content to a client which satisfies the needs thereof at that time.

10 cl, 48 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering. An apparatus for encoding an image using intraframe prediction comprises a unit for determining an intraframe prediction mode, which determines the intraframe prediction of the current unit to be encoded, wherein the intraframe prediction mode indicates a defined direction from a plurality of directions, wherein the defined direction is indicated by one number dx in the horizontal direction and a constant number in the vertical direction and a number dy in the vertical direction and a constant number in the horizontal direction; and a unit for performing intraframe prediction, which performs intraframe prediction applied to the current unit in accordance with the intraframe prediction mode, wherein the intraframe prediction includes a step of determining the position of adjacent pixels through a shift procedure based on the position of the current pixel and one of the parameters dx and dy, indicating the defined direction, wherein adjacent pixels are located on the left side of the current unit or on the upper side of the current unit.

EFFECT: high efficiency of compressing images through the use of intraframe prediction modes having different directions.

9 cl, 21 dwg, 4 tbl

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to a method for bit-plane coding of signals, for example, an image or video signal in the DCT transform domain. The bit planes of the DCT blocks are transmitted plane by plane in order of significance. As each plane contains more signal energy than the less significant layers together, the resulting bitstream is scalable in the sense that it may be truncated at any position. The later the bitstream is truncated, the smaller the residual error when the image is reconstructed. For each bit plane, a zone or partition of bit plane is created that encompasses all the non-zero bits of the DCT coefficients in that bit plane. The partition is created in accordance with a strategy which is selected from a number of options depending on the content of the overall signal and/or the actual bit plane. A different zoning strategy may be used for natural images than for graphic content, and the strategy may vary from bit plane to bit plane. The form as well as other properties such as the size of each partition can thus be optimally adapted to the content. Two-dimensional rectangular zones and one-dimensional zigzag scan zones may be mixed within an image or even within a DCT block. The selected zone creating strategy is embedded in the bitstream, along with the DCT coefficient bits in the actual partition.

EFFECT: high efficiency of a scalable method of compressing signal content.

13 cl, 5 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to means of detecting illegal use of a processing device of a security system, used to descramble various media data distributed over multiple corresponding channels. The method includes counting new messages ECMj,c, received by the processing device of the security systems for channels, other than channel i, after the last received message ECMi,p; verifying that the message ECMi,c was received during said time interval by verifying that the number of new messages ECMj,c, received for channels other than i, reaches or exceeds a given threshold greater than two; increasing the counter Kchi by the given value each time when after verification a message ECMi,c is received during a given time interval, immediately after a message ECMi,p, otherwise the counter Kchi is reset to the initial value; detecting illegal use once the counter Kchi reaches said threshold.

EFFECT: reducing the probability of illegal use of a processing device.

10 cl, 3 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering. The method of decoding video comprises obtaining from a bit stream information on pixel value compensation in accordance with a pixel value band or a limiting value level, if information on pixel value compensation indicates a band, applying a compensation value of the predefined band obtained from the bit stream to the pixel included in the predefined band among pixels of the current block; and if information on pixel value compensation indicates a limiting value level, applying a compensation value of the predefined boundary direction obtained from the bit stream to the pixel in the predefined boundary direction among pixels of the current block, wherein the predefined band is one of bands formed by breaking down the full range of pixel values.

EFFECT: high quality of the reconstructed image.

3 cl, 22 dwg, 2 tbl

FIELD: physics, video.

SUBSTANCE: invention relates to means of encoding and decoding video. The method includes determining a first most probable intra-prediction mode and a second most probable intra-prediction mode for a current block of video data based on a context for the current block; performing a context-based adaptive binary arithmetic coding (CABAC) process to determine a received codeword, corresponding to a modified intra-prediction mode index; determining the intra-prediction mode index; selecting the intra-prediction mode.

EFFECT: high efficiency of signalling an intra-prediction mode used to encode a data block by providing relative saving of bits for an encoded bit stream.

50 cl, 13 dwg, 7 tbl

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to a media device and a system for controlling access of a user to media content. Disclosed is a device (100, 200) for controlling access of a user to media content, the device comprising: an identification code output (102, 103, 202) for providing an identification code to the user, the identification code identifying the media device; a control code generator (104, 204) for generating a control code depending on the identification code and an access right; an access code input (106, 107, 206) for receiving an access code from the user. The access code is generated depending on the identification code and the access right by a certain access code device, and an access controller (108, 208) enables to compare the access code to the control code, and when the access code matches the control code, grants the user access to the media content in accordance with the access right.

EFFECT: managing user access to media content, wherein access is granted specifically on the selected media device.

14 cl, 6 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to a method and an apparatus for controlling settings of a device for playback of a content item. Disclosed is a method of controlling settings of a rendering device for playback of a content item, said rendering device being configured to connect with at least one source device, said at least one source device providing at least one content item, wherein the method comprises steps of: generating a plurality of entries for said at least one source device, each of the plurality of entries corresponding to a different profile, each profile comprising settings for playback of a content item received from the corresponding source device. A user can request generation of a plurality of entries for the same source device and select one of said entries, wherein the rendering device is connected with the source device which corresponds to said selected entry; and settings of the rendering device for playback of the received content item are controlled according to the profile corresponding to said selected entry.

EFFECT: providing corresponding settings for playback of different types of content items.

9 cl, 2 dwg

FIELD: physics, video.

SUBSTANCE: invention relates to video encoding/decoding techniques which employ a loop filter which reduces blocking noise. The technical result is achieved due to that a video encoding/decoding device, which encodes or decodes video using a loop filter, includes a deviation calculating unit which calculates deviation between a target noise cancellation pixel and a neighbouring pixel of the target pixel using a decoded image. A pattern form establishing unit limits the pattern form such that the less the deviation from the maximum deviation in the decoded image, the smaller the pattern form. When removing target pixel noise, using a weight coefficient in accordance with the degree of similarity between the pattern of the target pixel and the pattern of each search point in the form of a search and a weighted sum of pixel values at search points, the loop filter compares patterns using the limited pattern form and removes the target pixel noise.

EFFECT: reduced computational complexity of the noise cancellation filter, thereby preventing deterioration of encoding efficiency.

5 cl, 19 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to technology of automatic selection of extra data, for example, ad, guide data, extra data, data on operating performances. Thus, processing, storage and/or transmission resources can be saved. This device for automatic selection of extra data to be included in content comprises classifier connected with user profile and selection means connected with extra data base. Extra data of definite category is placed in appropriate or contrasting context depending on used interest in thus goods category. Profiles of user are automatically classified as profiles with either pronounces or weak interest in this category.

EFFECT: adapted selection of extra data to be included in the content for twofold decrease in total volume of extra data.

11 cl, 2 dwg

FIELD: physics.

SUBSTANCE: method of decoding an image comprises steps of: determining hierarchically structured encoding units for decoding an image, a prediction unit and a transformation unit; obtaining transformation coefficients from a bitstream through analysis and restoring encoded data of at least one prediction unit by performing entropy decoding, inverse quantisation and inverse transformation of the transformation coefficients obtained by analysis; performing intra-prediction or mutual prediction of the restored encoded data and restoring the encoded video.

EFFECT: high efficiency of compressing, encoding and decoding images.

4 cl, 18 dwg

FIELD: physics, video.

SUBSTANCE: invention relates to video encoding techniques. Disclosed is a method of encoding a 3D video signal. The method includes a step of providing at least a first image of a scene as seen from a first viewpoint. The method also includes providing rendering information for enabling a decoder to generate at least one rendered image of the scene as seen from a rendering viewpoint, different from the first viewpoint. The method also includes providing a preferred direction indicator defining a preferred orientation of the rendering viewpoint relative to the first viewpoint.

EFFECT: high quality of generating images from different viewpoints by generating a preferred direction indicator.

13 cl, 4 dwg

Brightness meter // 2549605

FIELD: instrumentation.

SUBSTANCE: brightness meter contains an opaque light filter attached to a piezoelectric element which is connected to a frequency divider output, a lens, a pyramidal mirror octahedron with four external smooth surfaces and four disk photodetectors, each with two photoreception sectors. Photoreception sectors are fitted with colour light filters. The output of each photoreception sector is connected to the input of an analogue-digital converter. Each analogue-digital converter comprises the pulse amplifier to the output of which pulse light-emitting diodes are connected. Radiation from each light-emitting diode enters the group of eight identical photodetectors, each of which has on the reception side a neutral light filter with a ratio respectively of the register digit weight to which the output of each photodetector is connected.

EFFECT: possibility of synchronous receiving of brightness codes of eight colour components of the spectrum.

2 dwg, 1 tbl

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to image compression systems and methods. The method of compressing a digital image in a computing device comprises steps of dividing an image into a plurality of image subregions; selecting from a catalogue which includes a plurality of predetermined template forms, wherein each template form comprises a plurality of elements, properties and image variables, such as colour, colour gradient, gradient direction or reference pixel, and wherein each said form is identified by a code, the template form of each subregion best corresponding to one or more image elements of said subregion; and generating a compressed data set for the image, wherein each subregion is represented by a code which identifies the template form selected therefor.

EFFECT: improved compression of image data, thereby reducing the amount of data used to display an image.

22 cl, 4 dwg

FIELD: physics.

SUBSTANCE: this method comprises memorising the input raster video image as a flow of frames in the line input buffer. Said frames are splitted to micro blocs. The latter are compressed and stored in external memory. For processing, said micro blocs are retrieved from external memory, unclasped and written to internal memory. Raster macro blocs are formed and processed by appropriate processors.

EFFECT: efficient use of internal memory irrespective of processing algorithm type.

22 cl, 2 dwg

FIELD: physics, photography.

SUBSTANCE: invention relates to an image processing device and method, which can improve encoding efficiency, thereby preventing increase in load. The technical result is achieved due to that a selection scheme 71 from a prediction scheme 64 by filtering selects a motion compensation image for generating a prediction image at a high-resolution extension level from key frames at a low-resolution base level. The filter scheme 72 of the prediction scheme 64 by filtering performs filtration, which includes high-frequency conversion and which uses analysis in the time direction of a plurality of motion compensation images at the base level, selected by the selection scheme 71, in order to generate a prediction image at the extension level.

EFFECT: reducing load in terms of the amount of processing owing to spatial increase in sampling frequency at the base level for encoding the current frame.

19 cl, 26 dwg

FIELD: information technology.

SUBSTANCE: method of compression of graphic file by fractal method using ring classification of segments, in which the graphic file is split into rank regions and domains, and for each rank region the domain and the corresponding affine transformation is found, that best approximates it to the appropriate rank region, and using the obtained values of the domain parameters, comprising their coordinates, the coefficients of the affine transformations, the values of brightness and contrast, the archive is formed, and classification of domains and rank regions are introduced, based on the allocation in them of the "rings" and the calculation of the mathematical expectation of pixel intensity of these "rings", which enables to reduce the complexity of the phase of correlation of the segments and to accelerate compression.

EFFECT: reduced time of compression of the graphic file by fractal method.

3 dwg

FIELD: physics.

SUBSTANCE: method comprises making each array element in an image sensor from one "R, G, B radiation colour brightness to code" converter, which performs parallel synchronous conversion of radiation of three colours analogue video signals R, G, B into three codes. The frame image digitisation apparatus includes an objective lens, an image sensor comprising an array of elements, three switch units, three register units and a control signal generator, wherein each switch unit includes the same number of encoders as converters.

EFFECT: reduced cross dimensions of array elements in an image sensor, which enables to reduce the frame format size or increase resolution of the image sensor.

6 dwg, 1 tbl

FIELD: physics.

SUBSTANCE: disclosed is a frame image digitisation apparatus. The disclosed apparatus comprises a lens in the focal plane of which there is an image sensor having an array of elements, a control signal generator and three register units, the outputs of which are the outputs of the digitisation apparatus. Each array element consists of a converter for converting radiation of colours R, G, B into three codes. Images are input into the sensor, the number of said images being equal to the number of array elements and the number of colours R, G, B of analogue-to-digital converters (ADC).

EFFECT: high image frame resolution owing to conversion of three colours R, G, B into codes using one converter.

4 dwg, 2 tbl

FIELD: physics.

SUBSTANCE: apparatus comprises a lens, an image detector having an array situated in the focal plane of the lens, the array having elements which are converters for converting radiation to codes based on the frame resolution number 106, each having an opaque housing in the front part of which, in a partition wall, there is a microlens, on the optical axis of which and at an angle of 45° thereto semitransparent micromirrors are arranged in series and rigidly mounted based on the number of bits per code, each preceding micromirror transmitting to the next micromirror radiation flux with half the strength.

EFFECT: high speed of frame digitisation.

1 tbl, 4 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

Up!