CA2578872C - Process for coding or decoding motion vectors and coding or decoding device implementing the said process - Google Patents
Process for coding or decoding motion vectors and coding or decoding device implementing the said process Download PDFInfo
- Publication number
- CA2578872C CA2578872C CA 2578872 CA2578872A CA2578872C CA 2578872 C CA2578872 C CA 2578872C CA 2578872 CA2578872 CA 2578872 CA 2578872 A CA2578872 A CA 2578872A CA 2578872 C CA2578872 C CA 2578872C
- Authority
- CA
- Canada
- Prior art keywords
- vector
- block
- components
- macro
- coded
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention relates to a process for the differential coding of a motion vector (MV0) associated with a macro-block (M0). This process comprises the steps:
determining the components (MV0x, MV0y) of the said motion vector (MV0), determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of at least three candidate motion vectors (MV1, MV2, MV3), a candidate motion vector being a vector associated with a previously coded macro-block, subtracting the components thus obtained from the components of the vector to be coded. The invention also relates to a process for decoding motion vectors coded in the manner described above, as well as to the implementation devices. The invention applies to the field of image compression.
determining the components (MV0x, MV0y) of the said motion vector (MV0), determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of at least three candidate motion vectors (MV1, MV2, MV3), a candidate motion vector being a vector associated with a previously coded macro-block, subtracting the components thus obtained from the components of the vector to be coded. The invention also relates to a process for decoding motion vectors coded in the manner described above, as well as to the implementation devices. The invention applies to the field of image compression.
Description
PROCESS FOR CODING OR DECODING MOTION VECTORS AND CODING OR
DECODING DEVICE IMPLEMENTING THE SAID PROCESS
This is a divisional of Application Serial No. 2,160,087 filed October 6, 1995.
The present invention relates to a process for coding motion vectors in an image compression system. The invention applies especially, but not uniquely, to the coding of video images in respect of telecommunication channels rated at less than 64 kbit/s.
The invention also relates to a decoding process, to a coding device and to a decoding device.
An image compression device, or coder, is described for example in Recommendation H.261 of the Comite Consultatif International Telegraphique et Telephonique (CCITT), especially with reference to Figure 3 ("source coder") of this document.
The device is based on the processing of the image in pixel blocks or macro-blocks. A block is composed of a matrix of eight times eight pixels, whereas a macroblock comprises four blocks. A macro-block can be coded in one of two modes termed "inter" or "intra", all the blocks making up the macro-block being coded in the same mode. In the case of "intra" coding, the blocks are subjected to a discrete cosine transformation, the coefficients thus obtained being quantized, and then coded in accordance with a variable-length code process ("VLC" coding). In the case of "inter"
coding, it is the difference between the blocks and blocks of like position in a reference image which is subjected to the discrete cosine transformation.
To improve the performance of the coding in the "inter" mode, motion compensation processes are employed. A
process of this type makes it possible to determine, in the reference image or a window thereof, a macro-block which will allow the effective "inter" coding of the macro-block to be coded of the current image. Various selection criteria exist for determining such a macro-block in the reference image. The relative position of the reference macro-block with respect to the position of the macro-block to be coded in the current image is determined by what is called a motion vector. This motion vector is transmitted in the header of the coded macro-block.
A decoder also possesses a memory containing the reference image. Knowing the motion vector and the coefficients corresponding to the coded macro-block, it will be able to restore the values of the pixels of the original macro-block. These values may contain errors, especially a quantization error.
The motion vectors are coded differentially with respect to a prediction vector. This vector is equal to the motion vector of the macro-block lying immediately to the left of the macro-block to be coded or decoded. The horizontal H and vertical V components of a vector are coded separately. According to a known process, the prediction vector is reinitialized to (0,0) in the following two cases:
if the macro-block immediately to the left of the macro-block to be coded or decoded was coded in "intra"
mode, if the macro-block to be coded lies on the left edge of the image.
DECODING DEVICE IMPLEMENTING THE SAID PROCESS
This is a divisional of Application Serial No. 2,160,087 filed October 6, 1995.
The present invention relates to a process for coding motion vectors in an image compression system. The invention applies especially, but not uniquely, to the coding of video images in respect of telecommunication channels rated at less than 64 kbit/s.
The invention also relates to a decoding process, to a coding device and to a decoding device.
An image compression device, or coder, is described for example in Recommendation H.261 of the Comite Consultatif International Telegraphique et Telephonique (CCITT), especially with reference to Figure 3 ("source coder") of this document.
The device is based on the processing of the image in pixel blocks or macro-blocks. A block is composed of a matrix of eight times eight pixels, whereas a macroblock comprises four blocks. A macro-block can be coded in one of two modes termed "inter" or "intra", all the blocks making up the macro-block being coded in the same mode. In the case of "intra" coding, the blocks are subjected to a discrete cosine transformation, the coefficients thus obtained being quantized, and then coded in accordance with a variable-length code process ("VLC" coding). In the case of "inter"
coding, it is the difference between the blocks and blocks of like position in a reference image which is subjected to the discrete cosine transformation.
To improve the performance of the coding in the "inter" mode, motion compensation processes are employed. A
process of this type makes it possible to determine, in the reference image or a window thereof, a macro-block which will allow the effective "inter" coding of the macro-block to be coded of the current image. Various selection criteria exist for determining such a macro-block in the reference image. The relative position of the reference macro-block with respect to the position of the macro-block to be coded in the current image is determined by what is called a motion vector. This motion vector is transmitted in the header of the coded macro-block.
A decoder also possesses a memory containing the reference image. Knowing the motion vector and the coefficients corresponding to the coded macro-block, it will be able to restore the values of the pixels of the original macro-block. These values may contain errors, especially a quantization error.
The motion vectors are coded differentially with respect to a prediction vector. This vector is equal to the motion vector of the macro-block lying immediately to the left of the macro-block to be coded or decoded. The horizontal H and vertical V components of a vector are coded separately. According to a known process, the prediction vector is reinitialized to (0,0) in the following two cases:
if the macro-block immediately to the left of the macro-block to be coded or decoded was coded in "intra"
mode, if the macro-block to be coded lies on the left edge of the image.
According to one aspect the invention is a process for the differential coding of a motion vector (MVO) associated with a block (MO) on the left edge of an image, characterized in that it comprises the steps:
- of determining the components (MVOx, MVOy) of the said motion vector (MVO), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of a zero vector and of the corresponding components of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - of subtracting the components thus obtained from the components of the vector to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors are.
macro-blocks adjacent to the macro-block of which a vector is to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors form part of the macro-blocks lying above or to the left of the macro-block of which a vector is to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors comprise the macro-block lying immediately to the left, the macro-block lying immediately above and the macro-block lying above and to the right of the macro-block of which a vector is to be coded.
- of determining the components (MVOx, MVOy) of the said motion vector (MVO), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of a zero vector and of the corresponding components of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - of subtracting the components thus obtained from the components of the vector to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors are.
macro-blocks adjacent to the macro-block of which a vector is to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors form part of the macro-blocks lying above or to the left of the macro-block of which a vector is to be coded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors comprise the macro-block lying immediately to the left, the macro-block lying immediately above and the macro-block lying above and to the right of the macro-block of which a vector is to be coded.
According to another aspect the invention is a process for the decoding of a motion vector (MVO) associated with a block (MO) on the left edge of an image and coded by differential coding, characterized in that it comprises the steps:
- of extracting, from the data received, the differences in components (MVDx, MVDy) corresponding to this vector (MVO), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of vectors associated with the two blocks (MV2, MV3) lying immediately above and lying above and to the right of the block of which a vector is to be decoded, - of adding the said differences in components (MVDx, MVDy) to the components (Px, Py) of the prediction vector.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors are macro-blocks adjacent to the macro-block of which a vector is to be decoded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors form part of the macro-blocks lying above or to the left of the macro-block of which a vector is to be decoded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors comprise the macro-block lying immediately to the left, the macro-block lying immediately above and the macro-block lying above and to the right of the macro-block of which a vector is to be decoded.
According to another aspect the invention is an image compression device including a motion estimation processor producing motion vectors (MVO), characterized in that, for the coding of a motion vector associated with a block (MO) on the left edge of an image, the said device comprises:
- means for determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - means for subtracting the components thus obtained from the components of the vector to be coded, - means for coding the values (MVDx, MVDy) obtained through the said subtraction.
According to another aspect the invention is a device for decompressing images compressed with the aid of a motion compensation process, characterized in that it comprises:
means for extracting data relating to components of a motion vector associated with a block (MO) on the left edge of an image, - means for determining a prediction vector on the basis of a median value of a zero vector and of the motion vectors corresponding to two blocks (MV2, MV3) lying immediately above and lying above and to the right of said block on the left edge of an image - means for adding a component value relating to extracted data to a component value relating to said prediction vector.
According to a particular embodiment, the compression, respectively decompression device implements the coding, respectively decoding process.
The invention will be better understood through the description of a non-limiting preferred particular example illustrated by the figures among which:
- Figure 1 is a functional diagram of an image coder implementing the invention, - Figure 2 represents the numbering of the macro-blocks of an image with the CIQF format, - Figure 3 illustrates the processing of candidate vectors corresponding to macro-blocks lying beyond the boundaries of the image, - Figure 4 is a functional diagram of a decoder implementing the process according to the invention.
A video image coder is represented in Figure 1.
This coder comprises a video input 1 feeding a motion compensation processor 10 (associated with a reference memory 2), a subtractor 3 and one of the inputs of a multiplexer 4 with two inputs. The second input of the multiplexer 4 is connected to the output of the subtractor 3. The output of the multiplexer 4 is linked to a discrete cosine transformation processor (DCT processor 5).
- of extracting, from the data received, the differences in components (MVDx, MVDy) corresponding to this vector (MVO), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of vectors associated with the two blocks (MV2, MV3) lying immediately above and lying above and to the right of the block of which a vector is to be decoded, - of adding the said differences in components (MVDx, MVDy) to the components (Px, Py) of the prediction vector.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors are macro-blocks adjacent to the macro-block of which a vector is to be decoded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors form part of the macro-blocks lying above or to the left of the macro-block of which a vector is to be decoded.
According to a particular embodiment, the macro-blocks associated with the candidate motion vectors comprise the macro-block lying immediately to the left, the macro-block lying immediately above and the macro-block lying above and to the right of the macro-block of which a vector is to be decoded.
According to another aspect the invention is an image compression device including a motion estimation processor producing motion vectors (MVO), characterized in that, for the coding of a motion vector associated with a block (MO) on the left edge of an image, the said device comprises:
- means for determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - means for subtracting the components thus obtained from the components of the vector to be coded, - means for coding the values (MVDx, MVDy) obtained through the said subtraction.
According to another aspect the invention is a device for decompressing images compressed with the aid of a motion compensation process, characterized in that it comprises:
means for extracting data relating to components of a motion vector associated with a block (MO) on the left edge of an image, - means for determining a prediction vector on the basis of a median value of a zero vector and of the motion vectors corresponding to two blocks (MV2, MV3) lying immediately above and lying above and to the right of said block on the left edge of an image - means for adding a component value relating to extracted data to a component value relating to said prediction vector.
According to a particular embodiment, the compression, respectively decompression device implements the coding, respectively decoding process.
The invention will be better understood through the description of a non-limiting preferred particular example illustrated by the figures among which:
- Figure 1 is a functional diagram of an image coder implementing the invention, - Figure 2 represents the numbering of the macro-blocks of an image with the CIQF format, - Figure 3 illustrates the processing of candidate vectors corresponding to macro-blocks lying beyond the boundaries of the image, - Figure 4 is a functional diagram of a decoder implementing the process according to the invention.
A video image coder is represented in Figure 1.
This coder comprises a video input 1 feeding a motion compensation processor 10 (associated with a reference memory 2), a subtractor 3 and one of the inputs of a multiplexer 4 with two inputs. The second input of the multiplexer 4 is connected to the output of the subtractor 3. The output of the multiplexer 4 is linked to a discrete cosine transformation processor (DCT processor 5).
In "intra" mode, the subtractor is not used. The values of pixels are transmitted directly from the input 1 to the DCT processor 5.
In "inter" mode, it is the difference between the signal at the input of the device and a portion of the reference image stored in the memory 2 which is transmitted to the DCT processor 5.
The output of the DCT processor 5 is connected to a quantization circuit 6, the output of which is connected on the one hand to a dequantization circuit 7 followed by an inverse DCT processor 8, and on the other hand to a coding and multiplexing circuit 14. The coding circuit carries out, in particular, the VLC coding of the motion vector differences, the VLC coding of the DCT transform coefficients and the assembling of the various data in accordance with the structure required.
A block to be coded is subjected to the DCT
transformation, whether it be an "inter" or "intra" block, that is to say one containing pixel values or differences in pixel values respectively. The DCT coefficients obtained are quantized and then coded in accordance with VLC coding. Such VLC codings, as well as the associated processes (block scan direction, coding of coefficient pairs and of lengths of strings of zero coefficients) will not be described in further detail since they are well known to those skilled in the art. The coded coefficients are inserted into the video multiplex in an appropriate manner.
The quantized coefficients are subjected to dequantization and then to inverse DCT transformation. This is the process to which these same data will be subjected in the decoder, the resulting pixel values containing the same errors, at least in part, notably the quantization errors.
In the coder, these decoded data serve to update the reference image stored in the memory 2.
The output of the memory 2 is connected to an input of the subtractor 3, possibly across a spatial loop filter 9. The output of the inverse DCT processor 8 is connected to the reference memory 2 across a two-input adder 11. The second input of the adder 11 is connected to the output of a second multiplexer 12 with two inputs, one of which is connected to the output of the loop filter 9, and the other of which is not connected up, delivering zero pixel values. In "intra" mode, the output of the multiplexer 12 delivers the zero values. The two multiplexers 4 and 12 are controlled simultaneously by a control unit 13 which also handles the quantizing of the coefficients, notably as a function of the degree of fill of the video buffer register (not illustrated).
The motion compensation processor compares macro-blocks originating from the input 1 with macro-blocks of the reference image, and determines on the one hand whether a macro-block is to be coded in intra or inter mode. Such a decision can be made by evaluating the value of an error function as the sum of the squares of the pixel differences in the case of the "inter" mode with respect to threshold values.
The coding in "intra" mode is enforced from time to time if it is not chosen for a given number of images for one and the same macro-block. This is done in order to limit the accumulation of reconstruction errors within the inverse DCT transformation. For example, following recommendation H.261 mentioned earlier, such enforcement is carried out at least every 132 transmissions of one and the same block.
In "inter" mode, it is the difference between the signal at the input of the device and a portion of the reference image stored in the memory 2 which is transmitted to the DCT processor 5.
The output of the DCT processor 5 is connected to a quantization circuit 6, the output of which is connected on the one hand to a dequantization circuit 7 followed by an inverse DCT processor 8, and on the other hand to a coding and multiplexing circuit 14. The coding circuit carries out, in particular, the VLC coding of the motion vector differences, the VLC coding of the DCT transform coefficients and the assembling of the various data in accordance with the structure required.
A block to be coded is subjected to the DCT
transformation, whether it be an "inter" or "intra" block, that is to say one containing pixel values or differences in pixel values respectively. The DCT coefficients obtained are quantized and then coded in accordance with VLC coding. Such VLC codings, as well as the associated processes (block scan direction, coding of coefficient pairs and of lengths of strings of zero coefficients) will not be described in further detail since they are well known to those skilled in the art. The coded coefficients are inserted into the video multiplex in an appropriate manner.
The quantized coefficients are subjected to dequantization and then to inverse DCT transformation. This is the process to which these same data will be subjected in the decoder, the resulting pixel values containing the same errors, at least in part, notably the quantization errors.
In the coder, these decoded data serve to update the reference image stored in the memory 2.
The output of the memory 2 is connected to an input of the subtractor 3, possibly across a spatial loop filter 9. The output of the inverse DCT processor 8 is connected to the reference memory 2 across a two-input adder 11. The second input of the adder 11 is connected to the output of a second multiplexer 12 with two inputs, one of which is connected to the output of the loop filter 9, and the other of which is not connected up, delivering zero pixel values. In "intra" mode, the output of the multiplexer 12 delivers the zero values. The two multiplexers 4 and 12 are controlled simultaneously by a control unit 13 which also handles the quantizing of the coefficients, notably as a function of the degree of fill of the video buffer register (not illustrated).
The motion compensation processor compares macro-blocks originating from the input 1 with macro-blocks of the reference image, and determines on the one hand whether a macro-block is to be coded in intra or inter mode. Such a decision can be made by evaluating the value of an error function as the sum of the squares of the pixel differences in the case of the "inter" mode with respect to threshold values.
The coding in "intra" mode is enforced from time to time if it is not chosen for a given number of images for one and the same macro-block. This is done in order to limit the accumulation of reconstruction errors within the inverse DCT transformation. For example, following recommendation H.261 mentioned earlier, such enforcement is carried out at least every 132 transmissions of one and the same block.
Motion compensation or estimation is employed in particular at the level of the processor 10. There are numerous processes for searching for the best motion vector and as many variants thereof: exhaustive comparison of blocks, hierarchical comparison processes etc. These processes can be implemented in particular by microprocessors, special-purposes processors etc.
According to the present example, the structure for sampling the luminance of an image is 144 lines of 176 pixels, this corresponding to a format of 11 times 9 macro-blocks. For the chrominance and for each of the colour components, the format is 72 lines of 88 pixels. This corresponds to a so-called 4:1:1 luminance chrominance structure.
This image format is also called the CIQF format (standing for Common Intermediate Quarter Format).
In this example it will be assumed that such an image format is available at the input 1 of the coder.
Hereafter, for the purposes of simplifying the explanations, only the luminance will be considered.
Figure 2 gives the numbering of the luminance macro-blocks. The actual macro-blocks of an image are surrounded by continuous lines. Hereafter, the eight macro-blocks which surround a current macro-block (that is to say the one currently being processed) will be referred to as adjacent macro-blocks. The macro-blocks adjacent to the macro-block 13 are the macro-blocks 1, 2, 3, 12, 14, 23, 24 and 25. Again for the purposes of simplifying the explanations, the presence of dummy macro-blocks beyond the boundary of the image will be assumed. Macro-block A is a macro-block adjacent to the macro-blocks 1, 12 and 23.
According to the present example, the structure for sampling the luminance of an image is 144 lines of 176 pixels, this corresponding to a format of 11 times 9 macro-blocks. For the chrominance and for each of the colour components, the format is 72 lines of 88 pixels. This corresponds to a so-called 4:1:1 luminance chrominance structure.
This image format is also called the CIQF format (standing for Common Intermediate Quarter Format).
In this example it will be assumed that such an image format is available at the input 1 of the coder.
Hereafter, for the purposes of simplifying the explanations, only the luminance will be considered.
Figure 2 gives the numbering of the luminance macro-blocks. The actual macro-blocks of an image are surrounded by continuous lines. Hereafter, the eight macro-blocks which surround a current macro-block (that is to say the one currently being processed) will be referred to as adjacent macro-blocks. The macro-blocks adjacent to the macro-block 13 are the macro-blocks 1, 2, 3, 12, 14, 23, 24 and 25. Again for the purposes of simplifying the explanations, the presence of dummy macro-blocks beyond the boundary of the image will be assumed. Macro-block A is a macro-block adjacent to the macro-blocks 1, 12 and 23.
For each macro-block coded in "inter" mode, the processor 10 provides a pair of components of the motion vector associated with this block. In accordance with the present embodiment, the components have a precision of half a pixel and are confined to the interval [-16, +15.5].
According to the present embodiment, the circuit 14, which comprises for example a memory and a suitably programmed microprocessor, determines a prediction vector for each motion vector. The components Px and Py of this prediction vector are subtracted from the components of the motion vector to be coded.
According to the present embodiment, the components of the prediction vector are calculated in a manner made explicit by Figure 3.
MO denotes the current macro-block, that is to say the macro-block for which a prediction vector is being determined. On the other hand, MVix and MViy denote the first and second components respectively of the motion vector associated with macro-block i.
Ml denotes the macro-block immediately to the left of MO, M2 the macro-block immediately above MO, and M3 the macro-block above and to the right of MO. The motion vectors associated with the macro-blocks M1 to M3 are called candidate vectors and are denoted MV1 to MV3. Figure 3a gives the arrangement of the macro-blocks M1 to M3 around MO.
Since a motion vector is defined only for macro-blocks coded in "inter" mode, the components of the candidate vectors are assumed to be zero in the following cases:
- when a macro-block has been coded in "intra"
mode, - when a macro-block lies beyond the boundary of the image.
Figures 3b, 3c and 3d illustrate various cases.
The pairs (0,0) indicate the macro-blocks for which the candidate vector is regarded as zero. The dotted line indicates the boundaries of the image.
Having determined the components of the three candidate vectors, the components of the prediction vector are calculated by choosing for each component of this vector the median value of the corresponding components of the candidate vectors. For example, if the candidate vectors are respectively:
MV1 = (-2; 3), MV2 = (1; 5), MV3 = (-1; 7) then the prediction vector will be (Px; Py) = (-1; 5).
We then form the difference between this prediction vector and the motion vector MVO:
MVDx = MVx-Px MVDy = MVy-Py.
These differences are next coded by VLC coding and introduced into the video multiplex.
Given that the calculation of the prediction vector demands a knowledge of the vectors Ml to M3, these vectors are held in memory by the processor 10.
During decoding, a prediction vector is determined in a similar manner. Of course, addition of the components of this vector with the decoded differences will be carried out.
Figure 4 gives a functional diagram of a decoder.
The data received from a reception and demodulation system are stored in a register 15. This register is required in order to match the speed of transmission of the data to their actual use. The data are demultiplexed by a demultiplexer 16. The coefficients are decoded, undergo inverse quantization (circuit 17), and then an inverse DCT
transformation (circuit 18). The resulting blocks are added (by the adder 19) to the result of the prediction in the case of coding in "inter" mode. The prediction memory 21 is of course updated appropriately.
A processor 20 is tasked with controlling the quantization and in decoding the data corresponding to the motion vectors. It carries out the VLC decoding of the data, retains in memory the vectors required for the calculation of the prediction vector, determines this vector and then adds to the components thereof the decoded differences of components. The motion vectors thus re-established are used in a known manner.
According to an embodiment variant, motion vectors are associated with the macro-blocks coded in "intra" mode.
This makes it possible to compensate for the transmission errors which could corrupt the coded coefficients of this macro-block. In this case, the corresponding candidate vectors are not regarded as being zero.
Obviously, the present invention is not limited to the embodiment example described, but applies to other compression systems using motion compensation.
According to the present embodiment, the circuit 14, which comprises for example a memory and a suitably programmed microprocessor, determines a prediction vector for each motion vector. The components Px and Py of this prediction vector are subtracted from the components of the motion vector to be coded.
According to the present embodiment, the components of the prediction vector are calculated in a manner made explicit by Figure 3.
MO denotes the current macro-block, that is to say the macro-block for which a prediction vector is being determined. On the other hand, MVix and MViy denote the first and second components respectively of the motion vector associated with macro-block i.
Ml denotes the macro-block immediately to the left of MO, M2 the macro-block immediately above MO, and M3 the macro-block above and to the right of MO. The motion vectors associated with the macro-blocks M1 to M3 are called candidate vectors and are denoted MV1 to MV3. Figure 3a gives the arrangement of the macro-blocks M1 to M3 around MO.
Since a motion vector is defined only for macro-blocks coded in "inter" mode, the components of the candidate vectors are assumed to be zero in the following cases:
- when a macro-block has been coded in "intra"
mode, - when a macro-block lies beyond the boundary of the image.
Figures 3b, 3c and 3d illustrate various cases.
The pairs (0,0) indicate the macro-blocks for which the candidate vector is regarded as zero. The dotted line indicates the boundaries of the image.
Having determined the components of the three candidate vectors, the components of the prediction vector are calculated by choosing for each component of this vector the median value of the corresponding components of the candidate vectors. For example, if the candidate vectors are respectively:
MV1 = (-2; 3), MV2 = (1; 5), MV3 = (-1; 7) then the prediction vector will be (Px; Py) = (-1; 5).
We then form the difference between this prediction vector and the motion vector MVO:
MVDx = MVx-Px MVDy = MVy-Py.
These differences are next coded by VLC coding and introduced into the video multiplex.
Given that the calculation of the prediction vector demands a knowledge of the vectors Ml to M3, these vectors are held in memory by the processor 10.
During decoding, a prediction vector is determined in a similar manner. Of course, addition of the components of this vector with the decoded differences will be carried out.
Figure 4 gives a functional diagram of a decoder.
The data received from a reception and demodulation system are stored in a register 15. This register is required in order to match the speed of transmission of the data to their actual use. The data are demultiplexed by a demultiplexer 16. The coefficients are decoded, undergo inverse quantization (circuit 17), and then an inverse DCT
transformation (circuit 18). The resulting blocks are added (by the adder 19) to the result of the prediction in the case of coding in "inter" mode. The prediction memory 21 is of course updated appropriately.
A processor 20 is tasked with controlling the quantization and in decoding the data corresponding to the motion vectors. It carries out the VLC decoding of the data, retains in memory the vectors required for the calculation of the prediction vector, determines this vector and then adds to the components thereof the decoded differences of components. The motion vectors thus re-established are used in a known manner.
According to an embodiment variant, motion vectors are associated with the macro-blocks coded in "intra" mode.
This makes it possible to compensate for the transmission errors which could corrupt the coded coefficients of this macro-block. In this case, the corresponding candidate vectors are not regarded as being zero.
Obviously, the present invention is not limited to the embodiment example described, but applies to other compression systems using motion compensation.
Claims (4)
1. Process for the differential coding of a motion vector (MV0) associated with a block (M0) on the left edge of an image, characterized in that it comprises the steps:
- of determining the components (MV0x, MV0y) of the said motion vector (MV0), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of a zero vector and of the corresponding components of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - of subtracting the components thus obtained from the components of the vector to be coded.
- of determining the components (MV0x, MV0y) of the said motion vector (MV0), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of a zero vector and of the corresponding components of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - of subtracting the components thus obtained from the components of the vector to be coded.
2. Process for the decoding of a motion vector (MV0) associated with a block (M0) on the left edge of an image and coded by differential coding, characterized in that it comprises the steps:
- of extracting, from the data received, the differences in components (MVDx, MVDy) corresponding to this vector (MV0), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of vectors associated with the two blocks (MV2, MV3) lying immediately above and lying above and to the right of the block of which a vector is to be decoded, - of adding the said differences in components (MVDx, MVDy) to the components (Px, Py) of the prediction vector.
- of extracting, from the data received, the differences in components (MVDx, MVDy) corresponding to this vector (MV0), - of determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of vectors associated with the two blocks (MV2, MV3) lying immediately above and lying above and to the right of the block of which a vector is to be decoded, - of adding the said differences in components (MVDx, MVDy) to the components (Px, Py) of the prediction vector.
3. Image compression device including a motion estimation processor producing motion vectors (MVO), characterized in that, for the coding of a motion vector associated with a block (M0) on the left edge of an image, the said device comprises:
- means for determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - means for subtracting the components thus obtained from the components of the vector to be coded, - means for coding the values (MVDx, MVDy) obtained through the said subtraction.
- means for determining a prediction vector, each component (Px, Py) of which is equal to the median value of the corresponding components of a zero vector and of two candidate motion vectors (MV2, MV3), said candidate motion vectors being the vectors associated with blocks lying immediately above and lying above and to the right of the block of which a vector is to be coded, - means for subtracting the components thus obtained from the components of the vector to be coded, - means for coding the values (MVDx, MVDy) obtained through the said subtraction.
4. Device for decompressing images compressed with the aid of a motion compensation process, characterized in that it comprises:
- means for extracting data relating to components of a motion vector associated with a block (M0) on the left edge of an image, - means for determining a prediction vector on the basis of a median value of a zero vector and of the motion vectors corresponding to two blocks (MV2, MV3) lying immediately above and lying above and to the right of said block on the left edge of an image - means for adding a component value relating to extracted data to a component value relating to said prediction vector.
- means for extracting data relating to components of a motion vector associated with a block (M0) on the left edge of an image, - means for determining a prediction vector on the basis of a median value of a zero vector and of the motion vectors corresponding to two blocks (MV2, MV3) lying immediately above and lying above and to the right of said block on the left edge of an image - means for adding a component value relating to extracted data to a component value relating to said prediction vector.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FR9412083 | 1994-10-10 | ||
| FR9412083A FR2725577B1 (en) | 1994-10-10 | 1994-10-10 | CODING OR DECODING METHOD OF MOTION VECTORS AND CODING OR DECODING DEVICE USING THE SAME |
| CA002160087A CA2160087C (en) | 1994-10-10 | 1995-10-06 | Process for coding or decoding motion vectors and coding or decoding device implementing the said process |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002160087A Division CA2160087C (en) | 1994-10-10 | 1995-10-06 | Process for coding or decoding motion vectors and coding or decoding device implementing the said process |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2578872A1 CA2578872A1 (en) | 1996-04-11 |
| CA2578872C true CA2578872C (en) | 2010-11-30 |
Family
ID=38162431
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2578872 Expired - Lifetime CA2578872C (en) | 1994-10-10 | 1995-10-06 | Process for coding or decoding motion vectors and coding or decoding device implementing the said process |
| CA 2578871 Expired - Lifetime CA2578871C (en) | 1994-10-10 | 1995-10-06 | Process for coding or decoding motion vectors and coding or decoding device implementing the said process |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2578871 Expired - Lifetime CA2578871C (en) | 1994-10-10 | 1995-10-06 | Process for coding or decoding motion vectors and coding or decoding device implementing the said process |
Country Status (1)
| Country | Link |
|---|---|
| CA (2) | CA2578872C (en) |
-
1995
- 1995-10-06 CA CA 2578872 patent/CA2578872C/en not_active Expired - Lifetime
- 1995-10-06 CA CA 2578871 patent/CA2578871C/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| CA2578872A1 (en) | 1996-04-11 |
| CA2578871C (en) | 2010-11-30 |
| CA2578871A1 (en) | 1996-04-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2160087C (en) | Process for coding or decoding motion vectors and coding or decoding device implementing the said process | |
| USRE36507E (en) | Apparatus and method for processing groups of fields in a video data compression system to encode a single frame as an I-field and a P-field | |
| EP1672926B1 (en) | Bi-directional predicting method for video coding/decoding | |
| US6639942B1 (en) | Method and apparatus for estimating and controlling the number of bits | |
| KR100680452B1 (en) | Method and apparatus for updating motion vector memory | |
| KR19980018426A (en) | Optimal judgment for stereoscopic video coding | |
| EP1359770A2 (en) | Signaling for fading compensation in video encoding | |
| WO1999051033A2 (en) | Method and device for modifying data in an encoded data stream | |
| US6795498B1 (en) | Decoding apparatus, decoding method, encoding apparatus, encoding method, image processing system, and image processing method | |
| EP0680217B1 (en) | Video signal decoding apparatus capable of reducing blocking effects | |
| KR20000053028A (en) | Prediction method and device with motion compensation | |
| JP3426668B2 (en) | Video coding method | |
| KR0121162B1 (en) | Compensating device of image moving in digital tv | |
| KR100367468B1 (en) | Method and device for estimating motion in a digitized image with pixels | |
| US5751357A (en) | Method and arrangement for coding and decoding a video data stream for all picture elements of the video data stream | |
| CA2578872C (en) | Process for coding or decoding motion vectors and coding or decoding device implementing the said process | |
| JP3725232B2 (en) | Motion vector determination method | |
| US20030165194A1 (en) | Picture segment coding with motion prediction | |
| US6754270B1 (en) | Encoding high-definition video using overlapping panels | |
| KR100240620B1 (en) | Method and apparatus to form symmetric search windows for bidirectional half pel motion estimation | |
| KR0181067B1 (en) | Moving picture encoder of having compatibility | |
| KR100207396B1 (en) | Method for preventing error in encoder | |
| KR100203638B1 (en) | Method for estimating motion using half-pixel by half-pixel | |
| KR100215429B1 (en) | An estimation method of concealment moving vector of macro block formating video signal bit stream | |
| JPH02131697A (en) | High efficiency stereo moving picture encoding system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20151006 |