JP4760551B2 - Motion vector decoding method and decoding apparatus - Google Patents

Description

  The present invention relates to a motion vector decoding applied to decoding an encoded motion vector in an image encoding method for compressing image information by orthogonal transform and motion compensation such as discrete cosine transform or Karhunen-Labe transform. The present invention relates to a method and a decoding device.

  2. Description of the Related Art Recently, image information encoding devices and decoding devices compliant with a scheme such as MPEG that uses image information as digital and compresses by orthogonal transform such as discrete cosine transform and motion compensation using redundancy unique to image information have been developed. It is becoming popular in both information distribution in broadcasting stations and information reception in general households.

  In particular, MPEG2 (ISO (International Organization for Standardization) / IEC (International Electrotechnical Commition) 13818-2) is defined as a general-purpose image coding system. MPEG2 is a standard covering both interlaced scanning images and progressive scanning images, as well as standard resolution images and high-definition images, and is currently widely used in a wide range of applications for professional use and consumer use.

  MPEG2 was mainly intended for high-quality encoding suitable for broadcasting, but it did not support a coding amount (low bit rate) smaller than MPEG1, that is, an encoding method with a higher compression rate. With the widespread use of mobile terminals, the need for such an encoding system is expected to increase in the future, and the MPEG4 encoding system has been standardized accordingly. Regarding the image coding system, ISO / IEC14496-2 standard was approved as an international standard in December 1998.

  Furthermore, in recent years, the standardization of the standard called H.26L (ITU (International Telecommunication Union) -T Q6 / 16 VCEG), which was originally formulated for the purpose of image coding for video conferencing, has been advanced. H. 26L is known to achieve higher encoding efficiency compared to conventional encoding schemes such as MPEG2 and MPEG4, although a large amount of computation is required for encoding and decoding. In addition, as part of MPEG4 activities, this H.264 Based on H.26L Standardization that realizes higher coding efficiency by incorporating functions not supported by H.26L was performed as Joint Model of Enhanced-Compression Video Coding. The standard called H.264 / AVC (Advanced Video Coding) has been accepted as an international standard. Non-Patent Document 1 describes the contents of processing based on this standard.

`` Draft Errata List with Revision-Marked Corrections for H.264 / AVC '', JVT-1050, Thomas Wiegand et al., Joint Video Team (JVT) of ISO / IEC MPEG & ITU-T VCEG, 2003

  In September 2003, Microsoft submitted an extension to WMP9 for SMPTE (Society of Motion Picture and Television Engineers) and standardization work at SMPTE in October 2005. Was completed and announced as SMPTE 421M. This standard is referred to as the VC-1 format. The VC-1 format is H.264. H.264 / AVC has similarities and differences, and the comparison of the two methods is described in Non-Patent Document 2 below, for example.

Nikkei Electronics, March 29, 2004, pages 131-136, and Nikkei Electronics, April 12, 2004, pages 115-120, “This is different from WMV9 H.264, which takes off the veil”

  1 and 2 are block diagrams showing the flow of encoding and decoding in the VC-1 format described in Non-Patent Document 2. The input image data is divided and input to the intra (intraframe) predictive encoding unit 1 and the inter (interframe) predictive encoding unit 2, respectively. The intra prediction encoding unit 1 includes an orthogonal transform unit 3 and a quantization unit 4, and quantized coefficient data from the quantization unit 4 is supplied to an entropy encoding (variable length encoding) unit 5. The entropy encoding unit 5 outputs encoded data that has been subjected to variable length encoding.

  The inter prediction coding unit 2 quantizes the coefficient data from the adder 6 for obtaining the difference between the input image data and the locally decoded image data, the orthogonal transform unit 7 that orthogonally transforms the difference, and the orthogonal transform unit 7. The quantization unit 8 is included. The quantized coefficient data from the quantization unit 8 is supplied to the entropy coding unit 9. Entropy encoding unit 9 outputs variable length encoded data.

  For local decoding, an inverse quantization unit 10 to which the outputs of the quantization units 4 and 8 are supplied, an inverse transform unit 11 that performs inverse transform of orthogonal transform, a motion compensation unit 12, and a motion compensation unit 12 An adder 13 that adds the output and the output of the inverse transform unit 11, the output of the adder 13 are supplied, a deblocking filter 14 for smoothing the block boundary, and a motion prediction unit 15 that detects the motion of the input image data Is provided. The motion vector formed by the motion prediction unit 15 is supplied to the motion compensation unit 12, is predictively encoded, and is supplied to the entropy encoding unit 9.

  The input image signal is separated into one encoded by intra prediction and one encoded by inter prediction, and supplied to the intra prediction encoding unit 1 and the inter prediction encoding unit 2, respectively. In the intra prediction encoding unit 1, encoding is performed using a single frame. In the intra prediction encoding unit 1, the difference information between the pixel value of the input image and the pixel value generated by the intra prediction is input to the orthogonal transformation unit 3, where orthogonal transformation such as discrete cosine transformation and Karhunen-Labe transformation is performed. Applied. An output (transform coefficient) of the orthogonal transform unit 3 is provided to the quantization unit 4, and the quantization process is performed in the quantization unit 4. The quantized transform coefficient from the quantizing unit 4 is supplied to the entropy coding unit 5 for variable length coding.

  In the inter prediction encoding unit 2, an input image signal is encoded using image information of a plurality of frames. The difference between the reference image obtained from the motion compensation unit 12 and the input image by local decoding is obtained at the output of the adder 6. The motion compensation unit 12 performs motion compensation processing on image information of another frame different from the input frame, and generates reference image information. The motion vector from the motion prediction unit 15 is used for motion compensation, the motion vector information is output to the entropy encoding unit 9, the motion vector information is variable-length encoded, and is inserted into the header portion of the image compression information Is done. Other processes are the same as those related to intra coding.

  Next, the image information decoding apparatus will be described with reference to the block diagram of FIG. The received encoded data is divided into data to be decoded by intra prediction and data to be decoded by inter prediction, and is supplied to the intra prediction decoding unit 21 and the inter prediction decoding unit 22, respectively.

  The intra prediction decoding unit 21 includes an entropy decoding (variable length code decoding) unit 23, an inverse quantization unit 24 that performs an inverse process of quantization, and an inverse transform unit 25 that performs an inverse transform of orthogonal transform. And a deblocking filter 26 for reducing block distortion. A decoded image is obtained at the output of the deblocking filter 26.

  The inter prediction decoding unit 22 includes an entropy decoding unit 23, an inverse quantization unit 28 that performs an inverse process of quantization, an inverse transform unit 29 that performs an inverse transform of orthogonal transform, an adder 30, and a block A deblocking filter 31 for smoothing the boundary, a motion vector decoding unit 32, and a motion compensation unit 33 that performs motion compensation using the decoded motion vector. In the motion compensation unit 33, the decoded image obtained from the deblocking filter 31 is motion-compensated, and the decoded image is supplied to the adder 30. In the adder 30, the difference signal from the inverse transform unit 29 and the decoded image signal are added.

  The VC-1 format is processed differently from MPEG. According to Non-Patent Document 2, the main ones are listed as follows.

1. Orthogonal transformation with adaptive block size (Orthogonal transformation is performed using orthogonal transformation blocks of multiple sizes.)
2. Orthogonal transformation set premised on 16-bit processing (invert transformation is implemented using 16-bit fixed-point arithmetic to reduce the amount of computation at the time of decoding)
3. Motion compensation (specifies four motion compensation modes based on a combination of three parameters: a search block, a pixel unit for detecting a motion vector, and a filter type used to generate a prediction value.)
4). Quantization and inverse quantization (two quantization methods can be switched)
5. Deblocking filter (In order to prevent discontinuity at the block boundary, a deblocking filter is introduced in the same manner as H.264 / AVC to smooth the block boundary.)
6. Two interlaced encoding schemes (two interlaced picture encoding schemes and interlaced frame picture encoding schemes are possible as interlaced encoding schemes)
7). B picture coding method (has features such as coding by explicitly indicating the positional relationship of the B picture with respect to the picture to be referenced)

  The present invention is applied to motion vector predictive decoding in the motion vector decoding unit 32 in the VC-1 format decoding apparatus described above. In order to reduce the coding amount of the motion vector, the intermediate value (the x component of the motion vector and y) of the motion vector of the macroblock adjacent to the upper, upper right, and left of the macroblock to be encoded (referred to as the current macroblock). (Intermediate value of each component) is used as a predicted motion vector, the difference between the motion vector of the current macroblock and the predicted motion vector is encoded, and at the time of decoding, a predicted motion vector is generated, and the generated motion vector and the difference are added. Then, the motion vector is decoded. This processing is called median prediction (Median Prediction) as the first prediction method. Median prediction can greatly reduce the amount of code of a motion vector when the motion vector changes over the entire screen.

  On the other hand, in the case of median prediction, if a motion vector having a significantly different size and direction appears locally, the difference may be increased depending on the prediction. In the VC-1 format, not only median prediction but also median prediction is not used, and it is possible to specify a block that directly uses a motion vector of a block adjacent to the upper or left as a prediction value. In the VC-1 format, this second motion vector prediction method is called hybrid prediction. The hybrid prediction will be described in detail later.

  Next, a motion vector prediction method defined in the VC-1 format will be described with reference to the drawings. A motion vector of a macro block to be predicted (hereinafter referred to as a current macro block) or a motion vector of a block to be predicted (hereinafter referred to as a current block) uses a plurality of adjacent macro blocks or motion vectors of blocks. It is done. An adjacent macroblock or block used for this prediction is called a predictor. A plurality of predictors used in adjacent macroblocks or blocks are referred to as patterns.

Further, in this specification, terms similar to those used in “SMPTE 421M” “DRAFT SMPTE STANDARD for Television: VC-1 Compressed Video Bitstream Format and Decoding Process” are appropriately used. The meanings of the terms are as follows.

VLD: Variable Length Decoder
MVP: Motion Vector Prediction
MV: Motion Vector
MB: Macroblock (1 MVmode means 1 MV mode for 1 MB, and 4 MVmode means 1 MV mode for each block (8 × 8 size))
Predictor MV: a decoded motion vector detected by a predetermined algorithm from surrounding MB / blocks, and a predicted motion vector of the current MB / block is obtained using the predictor MV.
Intra MB / block: MB / block that does not have a motion vector and can be decoded only by block layer information Inter MB / block: MB / block that has a motion vector and needs to reference a decoded picture for decoding DMV: VLD Is the difference vector value that is decoded from the MVDATA and BLKMVDATA syntax elements PMV: the vector value that MVP is calculated from the predictor MV with a predetermined algorithm MVDATA: syntax elements that represent DMV information when MVmode is 1 (0 to 1 in variable length) / 1MB)
BLKMVDATA: A syntax element that represents DMV information in 4MV mode (0-4 variable / 1MB in variable length)
HYBRIDPRED: Syntax elements used for hybrid prediction (0 to 4/1 MB in 1 bit)
Bit plane: A data structure in which 1-bit information of each MB is encoded for one picture, and the following MVDATABIT is included in the bit plane.
MVDATABIT: A syntax element that specifies 1MV / 4MVmode (1 bit per bit / 1MB or bit plane)
NUMREF (Number of Reference Pictures): A 1-bit syntax element that exists only in the interlaced P-field header. If NUMREF = 0, the current interlaced P-field picture refers to one field. If NUMREF = 1, the current interlaced P-field picture refers to the closest I or P field picture in time in display order. NUMREF is used to decode P-field pictures.
Predictor flag: Interlaced field and syntax element with 1 bit when NUMREF = 1

FIG. 3 illustrates motion vector prediction in a Progressive 1-MV P picture in which all six blocks of a macroblock (MB) are replaced with prediction blocks by a single motion vector. And 3 adjacent MBs. FIG. 3A shows the MB above the current MB (Predictor A), the upper right MB (Predictor B) of the current MB, and the left MB of the current MB (Predictor C). The intermediate value of the MVs of these predictors is set as the predicted motion vector (PMV) of the current MB, the difference of the current MB is added to the PMV, and the MV of the current MB is decoded.

  In the rightmost end of a macroblock array row (also referred to as a row or a slice), there is no upper right MB, so the upper left MB of the current MB is used as the predictor B as shown in FIG. 3B. The From the order of processing, at the time of decoding the current MB, three predictors necessary for generating the PMV are obtained. If the adjacent block is an intra-coded block, the MV of the predictor MV is set to zero.

Another type of P picture is a Mixed-MV P picture. In this case, each MB is decoded as 1-MVmodeMB or 4-MVmodeMB. In 4-MVmodeMB, each of the four luminance blocks has a motion vector.

  FIG. 4 shows prediction of a motion vector of 1-MVmode MB in a Progressive Mixed-MV P picture. In FIG. 4, a large rectangle indicates an MB having a size of (16 × 16), and a small rectangle indicates a block of an orthogonal transform unit having a size of (8 × 8). In FIG. 4, it is assumed that adjacent blocks around the current macroblock are 4-MVmodeMB. In this case, a predetermined block in each MB is used as a predictor.

  In order to define four blocks of the luminance signal within 1 MB, block 0 to block 3 are defined according to the position. That is, in the drawing, the upper left block is block 0, the upper right block is block 1, the lower left block is block 2, and the lower right block is block 3. As shown in FIG. 4A, block 2 in the upper right adjacent block is designated as predictor B, block 2 in the upper adjacent block is designated as predictor A, and block 1 in the left adjacent block is designated as predictor C. Using these predictors A, B and C, one PMV of the current MB is calculated.

  When the current MB is at the end of the row, as shown in FIG. 4B, each of block 2, block 3 and block 1 of the three upper, left, and left adjacent MBs is used as a predictor. PMVs are calculated.

  FIG. 5 shows prediction of a 4-MVmode MB motion vector in a Progressive Mixed-MV P picture. The PMV of each of the four current blocks (block 0 to block 3) in the current MB is calculated.

  As shown in FIG. 5A, if the current MB is not the first MB in the row, the upper, upper left, and left MBs of the current MB are set as adjacent MBs, and the upper, upper left, Each of the left blocks is used as predictors A, B and C.

  As shown in FIG. 5B, if the current MB is the first MB in the row, the MB above the current MB is set as the adjacent MB, and each of the blocks above and right above the block 0 of the current MB among the adjacent MBs. Are used as predictors A and B. The MV of the predictor C is set to zero.

  As shown in FIG. 5C, if the current MB is not the last MB in the row, the upper and upper right MBs of the current MB are the adjacent MBs, and the upper and upper right blocks of the block 1 of the current MB are respectively Used as predictors A and B. As the predictor C, the left block of the block 1 in the current MB is used.

  As shown in FIG. 5D, if the current MB is the last MB in the row, the MB above the current MB is set as the adjacent MB, and each of the blocks above and at the upper left of block 1 of the current MB among the adjacent MBs. Are used as predictors A and B. As the predictor C, the left block of the block 1 in the current MB is used.

  As shown in FIG. 5E, for block 2 of the current MB, the upper and upper right blocks in the same MB are used as predictors A and B, and the left adjacent MB is used as a predictor C.

  As shown in FIG. 5F, when the current block is block 3 in the current MB, the other three blocks in the same MB are used as predictors A, B, and C, respectively.

Next, motion vector prediction in the case of interlace will be described. FIG. 6A illustrates motion vector prediction in an Interlaced field 1-MV P picture. The MV is predicted in the same manner as the motion vector prediction in the Progressive 1-MV P picture described above (FIG. 3A). Further, as shown in FIG. 6B, in the last case of the row, the upper left MB of the current MB is used as the predictor B as in the case of FIG. 3B.

  FIG. 7 shows prediction of a motion vector of 1-MVmode MB in an Interlaced field P picture. In FIG. 7, a large rectangle indicates an MB having a size of (16 × 16), and a small rectangle indicates a block of an orthogonal transform unit having a size of (8 × 8). In FIG. 7, it is assumed that the adjacent MB is 4-MVmodeMB. In this case, a predetermined block in each adjacent MB is used as a predictor.

  As shown in FIG. 7A, block 2 in the upper right adjacent MB is designated as predictor B, block 2 in the upper adjacent MB is designated as predictor A, and block 1 in the left adjacent MB is designated as predictor C. Using these predictors A, B and C, one PMV of the current MB is calculated.

  If the current MB is at the end of the row, as shown in FIG. 7B, each block 2, block 2 and block 1 of the three adjacent MBs in the upper, upper left and left are used to PMV is calculated.

  FIG. 8 shows prediction of a 4-MV mode motion vector in an Interlaced field Mixed-MV P picture. The PMV of each of the four current blocks (block 0 to block 3) in the current MB is calculated.

  FIG. 8A, FIG. 8B, and FIG. 8C illustrate the prediction of the motion vector of block 0 in the upper left of the current MB. As shown in FIG. 8A, if the current MB is not the first MB in the row, the block 2 of the MB above the current MB, the block 3 of the upper left MB, and the block 1 of the left MB are designated as predictors A, B, and C. used.

  As shown in FIG. 8B, if the current MB is the first MB in the row, the block 2 and block 3 of the MB above the current MB are used as the predictors A and B. In this case, the MV of the predictor C is set to zero.

  In the special case where the frame is 1 MB wide, as shown in FIG. 8C, the MVs of the predictors B and C are set to 0, and the predictor of the block 2 of the upper MB is set as the PMV of the current block.

  8D and 8E illustrate the prediction of the motion vector of block 1 of the current MB. If the current MB is not the last MB in the row, MB block 2 above the current MB, block 2 in the upper right MB and block 0 in the same MB are used as predictors A, B and C.

  As shown in FIG. 8E, if the current MB is the last MB in the row, MB blocks 2 and 3 above the current MB are used as predictors A and B, respectively. In this case, block 0 of the same MB is used as predictor C.

  FIG. 8F illustrates the prediction of the motion vector of block 2 of the current MB. Block 0 and block 1 of the same MB are used as predictors A and B, and block 3 of the left adjacent MB is used as predictor C. When the current MB is the first line, the MV of the predictor C is set to zero.

  The motion vector of block 3 of the current MB is predicted using the other three blocks of the same MB as predictors A, B and C, as shown in FIG. 8G.

  In a special case where the frame is 1 MB wide, as shown in FIG. 8H, the MVs of the predictors B and C are set to 0, and the predictor A of the block 0 of the same MB is set as the PMV of the current block.

As described above, picture layer information (Progressive / Interlaced, NUMREF =
0 or 1), macroblock layer information (1MV / 4MV, Predictor flag = 0 or 1), and a predictor pattern used for motion vector prediction differ depending on whether or not the end of a row.

  The motion vector decoding unit includes a VLD (variable length decoding unit) and an MVP (motion vector prediction unit). When decoding a video bit stream compressed in the VC-1 format, the VLD determines the type and number of syntax elements using the information decoded immediately before. The current sequence, picture, slice, and MB information decoded by the VLD is held in an easily accessible memory area, and the VLD recursively uses the information to decode lower layers. Is made.

However, the HYBRIDPRED syntax element relating to hybrid prediction existing in the VC-1 format cannot be decoded without using the processing result of MVP. As described above, the MVP determines the MV of the MB using the surrounding MV information that has already been decoded and confirmed and the MB (current macroblock) information decoded by the VLD. That is, the MVP acquires information on the predictor A, the predictor B, and the predictor C adjacent to the MB, and obtains each vector value (PMV A, PMV B, PMV C)) is converted by a function defined in the VC-1 format to obtain one vector value PMV.

The final MV of the MB is obtained by adding a difference (DMV) decoded from the bit stream to this PMV and performing a clipping process so as to be within a predetermined range. However, PMV and PMV When the absolute value of the difference of A is larger than the threshold value specified in the specification, or PMV and PMV When the absolute value of the difference of C is larger than the threshold value defined in the specification, the specification specifies that the HYBRIDPRED syntax element is present in the bitstream.

The HYBRIDPRED syntax element has a fixed length of 1 bit, and when this is 0 (logical 0), PMV = PMV When the values of A and PMV are reset and this is 1 (logical 1), PMV = PMV The values of C and PMV are reset. The difference (DMV) decoded from the bit stream is added to the PMV updated in this way, and a final MV is obtained by performing clipping processing so that the addition result falls within a predetermined range. The above processing is an outline of the MV prediction method specific to the VC-1 format, and the function of resetting the PMV using the HYBRIDPRED syntax element is called hybrid prediction.

Hybrid prediction is performed in Progressive P pictures of all profiles and Interlaced field P pictures of Advanced Profiles. B picture and Interlaced frame
This is not done for P pictures. Needless to say, this is not done for I / BI pictures without MV. For Progressive P pictures of all profiles for which hybrid prediction is performed and Interlaced field P pictures of Advanced Profile, HYBRIDP in 1MV mode
There is one RED syntax element per 1 MB, and there are four HYBRIDPRED syntax elements per 1 MB in Mixed MVmode.

  FIG. 9 shows a configuration of the MV decoding unit 32 implemented according to the algorithm described in the standard. The MV decoding unit 32 includes a VLD 41, an MVP 42, and an MV storage area 43 such as an SDRAM (Synchronous Dynamic Random Access Memory). The MVP 42 includes a PMV calculation unit 42a and an MV calculation unit 42b. FIG. 10 shows the data exchange between the VLD 41 and the MVP 42 in time order.

  The VLD 41 decodes up to the bit before the bit where the HYBRIDPRED syntax element may exist, transmits the picture parameters obtained so far to the PMV calculation unit 42a of the MVP 42 (step ST1 in FIG. 10), and further MB information (intra / 1MV / 4MVmode, DMV information) is output to the MV calculation unit 42b of the MVP 42 (step ST2), and decoding is stopped at that time.

The PMV calculation unit 42a includes the picture parameter and MB information from the VLD 41, and three vector values (PMV) of adjacent MB / blocks stored in the MV storage area 43. A, PMV B, PMV PMV is obtained by conversion by a function defined in VC-1 using C). This method is median prediction. For example, the median value of three vector values is selected. MVP42 is PMV and PMV When the absolute value of the difference of A is greater than the value specified in the specification, or PMV and PMV When the absolute value of the difference of C is larger than the value specified in the specification, it is determined that the HYBRIDPRED syntax element is present in the input stream for the VLD in the bit stream, and the 1-bit flag USEDHYBRID indicating the determination result is set in the VLD 41. On the other hand, it outputs (step ST3).

  The VLD 41 that has received USEDHYBRID outputs one bit immediately after the decoding stop position of the bitstream to the MVP 42 as the HYBRIDPRED syntax element when the MVP 42 determines that there is a HYBRIDPRED syntax element (step ST4). If the MVP 42 determines that there is no HYBRIDPRED syntax element, the VLD 41 resumes decoding of the next syntax element (step ST5, step ST6,...).

When it is determined by USEDHYBRID that the HYBRIDPRED syntax element is present, the MVP 42 receives the HYBRIDPRED syntax element in step ST4. MVP42 is PMV = PMV when the HYBRIDPRED syntax element is 0. If the values of A and PMV are updated and the HYBRIDPRED syntax element is 1, PMV = PMV Update the values of C and PMV. The DMV decoded from the bit stream is added to the updated PMV, and clipping processing is performed so that the addition result is within a predetermined range, and the MV of the MB is determined. The decrypted MV is stored in the MV storage area 43. Also, the decoded MV is read from the MV storage area 43 and used for motion compensation.

  In the conventional MV prediction apparatus, data waiting times as indicated by W1, W2, and W3 in FIG. 10 occur. The data waiting time W1 occurs from when the MVP 42 receives picture parameters until it receives MB information. The data waiting time W2 occurs until the MVP 42 determines whether the HYBRIDPRED syntax element is present and the VLD 41 receives the determination result flag USEDHYBRID from the MVP 42. The data waiting time W3 occurs after the MVP 42 outputs USEDHYBRID until the next data is received from the VLD 41 by the MVP 42.

  Among these waiting times, the waiting time W2 is a time for stopping the decoding until the presence / absence of the HYBRIDPRED syntax element is determined, and is specific to the VC-1 format having the interdependency of decoding. MPEG-4 or H.264 H.264 / AVC has a function of MV prediction, but since VLD does not require a prediction result of MVP for decoding, there is no interdependence between VLD and MVP in MV decoding.

  Accordingly, an object of the present invention is to provide a motion vector decoding method and a decoding apparatus capable of reducing the waiting time caused by the interdependence between the variable length decoding process and the motion vector prediction process and shortening the processing time. It is in.

In order to solve the above-mentioned problem, the present invention predicts a motion vector of a current block from motion vectors of a plurality of predictors adjacent to the current block, and entropy-encodes a difference between the predicted motion vector and the motion vector of the current block. A motion vector decoding method in which a motion vector is decoded from an input stream including entropy encoded data,
A plurality of Puridiku data is picture layer information referred to for generating the prediction motion vector of the current block (Progressive / Interlaced, NUMREF = 0 or 1), the macroblock layer information (1MV / 4MV, Predictor flag = 0 or 1) and it is defined by,
Threshold greater than the absolute value is set in advance of the difference between the first prediction method is selected as the predicted motion vector, a motion vector of the predicted motion vector and a predetermined Predictor median of motion vectors of a plurality of Puridiku data In this case, a motion to perform decoding by any one of the second prediction methods in which the HYBRIDPRED syntax is selected while selecting a motion vector of a predetermined predictor as a motion vector predictor from among a plurality of motion vectors of the predictor. In vector decoding method,
In the state of no information macroblock layer, possible to correspond to the respective information of the macroblock layer generates a predictive motion vector holds the absolute value of the difference corresponding to the predicted motion vector generated Entropy decoding step of determining whether or not is larger than a preset threshold , generating flag information USEDHYBRID indicating the presence or absence of HYBRIDPRED syntax from the determination result, and decoding the generated flag information USEDHYBRID with entropy coding To
In the entropy decoding step, presence or absence of the HYBRIDPRED syntax element is determined corresponding to the flag information USEDHYBRID , and the HYBRIDPRED syntax when it is determined to be present and the macroblock layer information are output from the entropy decoding step. ,
The final predicted motion vector is selected from the HYBRIDPRED syntax when it is determined to be present and the macroblock layer information, and the final predicted motion vector and the difference obtained in the entropy decoding step are added. A motion vector decoding method comprising: a motion vector decoding step for decoding a motion vector.

In the present invention, the motion vector of the current block is predicted from the motion vectors of a plurality of predictors adjacent to the current block, the difference between the predicted motion vector and the motion vector of the current block is entropy encoded, and the input includes entropy encoded data A motion vector decoding device for decoding a motion vector from a stream,
A plurality of Puridiku data is picture layer information referred to for generating the prediction motion vector of the current block (Progressive / Interlaced, NUMREF = 0 or 1), the macroblock layer information (1MV / 4MV, Predictor flag = 0 or 1) and it is defined by,
Threshold greater than the absolute value is set in advance of the difference between the first prediction method is selected as the predicted motion vector, a motion vector of the predicted motion vector and a predetermined Predictor median of motion vectors of a plurality of Puridiku data In this case, a motion to perform decoding by any one of the second prediction methods in which the HYBRIDPRED syntax is selected while selecting a motion vector of a predetermined predictor as a motion vector predictor from among a plurality of motion vectors of the predictor. In the vector decoding device,
In the state of no information macroblock layer, possible to correspond to the respective information of the macroblock layer generates a predictive motion vector holds the absolute value of the difference corresponding to the predicted motion vector generated There determines greater or not than a predetermined threshold, the determination result from generating flag information USEDHYBRID indicating the presence or absence of HYBRIDPRED syntax, entropy decoding unit the generated flag information USEDHYBRID decodes the entropy coding To
In the entropy decoding unit, presence / absence of the HYBRIDPRED syntax element is determined corresponding to the flag information USEDHYBRID , and the HYBRIDPRED syntax when it is determined to be present and the macroblock layer information are output from the entropy decoding unit. ,
The final predicted motion vector is selected from the HYBRIDPRED syntax when it is determined to be present and the macroblock layer information, and the final predicted motion vector and the difference obtained by the entropy decoding unit are added. A motion vector decoding device comprising: a motion vector decoding unit for decoding a motion vector; and a storage unit for storing the decoded motion vector.

  In this invention, before the motion vector decoding unit receives the macroblock layer information from the entropy decoding unit, the motion vector decoding unit performs prediction motion vector generation processing for all possible predictor patterns, and By returning flag information indicating the presence or absence of the HYBRIDPRED syntax element for each to the entropy decoding unit, the waiting time for the decoding process of entropy decoding is reduced, and the time required for decoding the motion vector is reduced.

  An embodiment of the present invention will be described below with reference to the drawings. This embodiment is an example in which the present invention is applied to the VC-1 format. However, even in a format other than the VC-1 format, it is possible to determine whether or not there is a syntax element from the motion vector prediction result, and to perform a decoding process having interdependency that extracts the syntax element based on the determination result. Thus, the present invention can be applied.

  As shown in FIG. 11, an MV (motion vector) decoding unit 50 according to the present invention includes a VLD (variable length decoding unit) 51, an MVP (motion vector prediction unit) 52, an MV storage area 53 such as an SDRAM, and the like. Consists of The MVP 52 includes a PMV calculation unit 52a, a selector 52b, and an MV calculation unit 52c. FIG. 12 shows data exchange between the VLD 51 and the MVP 52 in time order.

The PMV calculation unit 52a reads the MV vector value of the adjacent MB / block (predictor) required for prediction from the decoded MVs stored in the MV storage area 53 into the memory. Three vector values (PMV) held in memory A, PMV B, PMV
C) is used to obtain the PMV by the conversion by the function defined by VC-1, for example, the method of selecting the median. In this case, the PMV is calculated under the condition of no MB (macroblock information). However, it is assumed that decoding results (Progressive, Interlaced field, NUMREF, etc.) beyond the picture layer are given. For example, the picture layer decoding result is known from the picture parameter information from the VLD 51. That is, the PMV calculation unit 52a calculates in advance PMV (for example, there are four at most) for all possible predictor patterns using the MV of the predictor stored in the MV storage area 53, The presence or absence of the HYBRIDPRED syntax element is determined. The calculation of a plurality of PMVs may be performed by either sequential (serial) or parallel processing.

As described above, the vector values of the predictor A, the predictor B, and the predictor C adjacent to the MB are converted by a function defined in the VC-1 format to obtain one vector value PMV. However, PMV and PMV When the absolute value of the difference of A is greater than the value specified in the specification, or PMV and PMV When the absolute value of the difference of C is larger than the value defined in the specification, it is determined that the HYBRIDPRED syntax element is present in the bitstream. That is, when the HYBRIDPRED syntax element is 0 (logical 0), PMV = PMV When the values of A and PMV are reset and this is 1 (logical 1), PMV = PMV The values of C and PMV are reset. The PMV calculation unit 52a calculates the PMV, determines the presence or absence of the HYBRIDPRED syntax element with respect to the PMV calculated regarding the pattern of each predictor, and generates a flag.

  Then, after acquiring MB information from the VLD 51, a real PMV is selected by the selector 52b, the selected PMV is supplied to the MV calculation unit 52c, and the DMV decoded from the bit stream is added to the PMV to obtain a predetermined range. Clipping processing is performed so that the addition result falls within the range, and the MV of the MB is determined. The decrypted MV is stored in the MV storage area 53. Also, the decoded MV is read from the MV storage area 53 and used for motion compensation.

  The MB information includes information indicating whether the current macroblock / block is 1 MV mode or 4 MV mode, a predictor flag (1 bit), and a motion vector difference DMV. Therefore, in order for the PMV calculation unit 52a to calculate PMV without MB information, the PMV calculation unit 52a calculates PMVs with respect to the four types of predictor patterns, and outputs the four PMVs to the selector 52b. In the PMV calculation unit 52a, a 4-bit (b0, b1, b2, b3) flag USEDHYBRID corresponding to the calculated four PMVs is generated, and the flags b0 to b3 are supplied to the VLD 51. The calculated four PMVs and the 4-bit flag USEDHYBRID are held in a memory included in the PMV calculation unit 52a until the processing related to the MB / block is completed.

The meaning of each of the 4 bits of the flag is as follows.
b0: (1MV, Predictor flag = 0)
b1: (4MV, Predictor flag = 0)
b2: (1MV, Predictor flag = 1)
b3: (4MV, Predictor flag = 1)

  In each case indicated by each of these bits b0 to b3, if it is determined that the HYBRIDPRED syntax element is present, the value of the corresponding bit in b0 to b3 is set to 1, and if it is determined that this is not present, The value of the corresponding bit in b0 to b3 is set to 0. Upon receiving the flag USEDHYBRID, the VLD 51 cuts out and outputs a HYBRIDPRED syntax element from the MB information and the flag.

  The selector 52b selects the real PMV in the PMV from the MB information (intra / 1MV / 4MVmode, DMV information) output from the VLD 51 and the HYBRIDPRED syntax element, and supplies the selected PMV to the MV calculation unit 52c. The DMV decoded by the VLD 51 is added to the selected PMV, and clipping processing is performed so that the addition result falls within a predetermined range, and the MV of the MB is determined. The decrypted MV is stored in the memory included in the PMV calculation unit 52 a and is also stored in the MV storage area 53. Also, the decoded MV is read from the MV storage area 53 and used for motion compensation.

  Describing according to the flow of FIG. 12, the VLD 51 performs decoding, and transmits the picture parameters obtained so far to the PMV calculation unit 52a of the MVP 52 (step ST11 in FIG. 12).

  The PMV calculation unit 52a performs MV prediction under all assumed conditions, and determines whether or not hybrid prediction is performed for each condition, thereby determining the presence or absence of the HYBRIDPRED syntax element and a 4-bit flag. USEDHYBRID is generated. In step ST12, the flag USEDHYBRID is supplied to the VLD 51.

  The VLD 51 that has received the flag USEDHYBRID determines the presence or absence of the HYBRIDPRED syntax element based on the MB information extracted from the input bitstream and one bit in the flag USEDHYBRID corresponding to the condition specified by the Predictor flag. When the HYBRIDPRED syntax element is present, the VLD 51 outputs the MB information of the bit stream and the 1-bit HYBRIDPRED syntax element to the MVP 52, and when the HYBRIDPRED syntax element is not present, the VLD 51 It outputs to MVP52 (step ST13). Thus, the VLD 51 can output the MB information and the HYBRIDPRED syntax element together to the MVP 52.

  In step ST12, the MVP 52 generates a data waiting time W4 from the output of USEDHYBRID (4 bits) to the reception of MB information and HYBRIDPRED syntax elements (which may not be present) from the VLD 51. In the conventional processing (FIGS. 9 and 10), there is a waiting time during which the VLD cannot perform any decoding until the VLD outputs MB information until the USEDHYBRID is input from the MVP. In the present invention, the VLD 51 can output the MB information and the HYBRIDPRED syntax element together, so that the waiting time can be eliminated, and the processing of the VLD 51 does not stop.

  The selector 52b of the MVP 52 selects one PMV as a real PMV from the macroblock information and the HYBRIDPRED syntax element, and outputs it to the MV calculation unit 52c. In this case, the MB information may be supplied to the PMV calculator 52a, and the PMV calculator 52a may generate a control signal for the selector 52b. The MV calculation unit 52c adds DMV to PMV, performs clipping processing so that the addition result is within a predetermined range, and determines the MV of the MB.

  Here, FIG. 13 shows an argument table relating to the above-described PMV calculation processing. That is, the types of PMVs calculated by the PMV calculation unit 52a are shown in FIG. The PMV calculation process is defined by the picture layer information and the 1MV / 4MV information. One MV prediction is represented by a set of arguments as follows. However, in the case of 1MV mode, it is expressed as block = 0.

  (1MV / 4MV, block, Predictor flag)

  In the above description, it is assumed that there are four PMVs. However, given the information of the picture layer, the number of PMVs that actually needs to be calculated is a maximum of four, and a smaller one or It can be seen from FIG. 13 that it is sufficient to calculate two PMVs. The picture layer information includes a bit plane in which 1-bit information indicating 1 MV / 4 MV of each MB is compressed and encoded for one picture. Therefore, when the PM calculation unit 52a receives the picture parameter, it can determine from the information of the bit plane in the picture parameter whether each MB is 1MV / 4MV. However, this is not the case in Raw mode.

By using the information of the picture layer and the bit plane, the number of PMVs to be calculated can be reduced. For example, in the case of Progressive, except for Raw mode, one PMV may be calculated for each MB / block.

  When Interlaced field NUMREF = 1, the Predictor flag may change to 0 or 1, so it is necessary to calculate PMV twice per MV. In 1 MB, the processing is (1MV, 0, 0), (1MV, 0, 1). If Interlaced field NUMREF = 1 and 4 MV, PMV calculation processing is performed twice per block.

  In one embodiment, since it is known in advance that all MBs in a picture are either 1MV / 4MVmode, the type of PMV can be reduced, and as a result, the number of times of PMV calculation can be reduced. . Further, the bit of the USEDHYBRID flag corresponding to the case where PMV calculation is not performed (the combination of the predictors) is not referred to in the VLD 51, and may be any value.

  It is necessary to calculate the maximum number of four PMVs in the Raw mode in which 1 MV / MV mode is not fixed unless the MB layer is decoded as shown in FIG. That is, since there is a possibility of 1MV / 4MVmode and Predictor flag 0 or 1, it is necessary to calculate four types of PMVs. The Predictor flag cannot be determined until each MB is decoded. The value of the coefficient to be multiplied with PMV changes according to the bit of the Predictor flag.

  The above-described embodiment of the present invention is an algorithm for calculating the PMV in advance (preceding). For the PMV calculation process, the capacity of the predictor holding memory is reduced as much as possible, and the MV storage area 53 is used. It is necessary to efficiently read MV from Hereinafter, the process of reading the predictor will be described.

  15 and FIG. 16, the hatched MB is the MV acquired from the MV storage area 53, the MB surrounded by the solid line is the current MB, and the MB surrounded by the dotted line indicates the MB before decoding. In the row to which the current MB belongs (sometimes called a slice), the left MB of the current MB is set as the predictor C. The upper right MB of the current MB belongs to the row above the row to which the current MB belongs, and the predictor A is the upper right MB of the current MB.

  In the processing of the next current MB shifted to the right by 1 MB, only the MV information of the upper right MB (predictor B) of the current MB need be acquired from the MV storage area 53. That is, in order to calculate PMV, it is only necessary to read 1 MB of MV per 1 MB.

  When the current MB is the right end of the screen, there is no upper right MB, so the upper and upper left MBs are used as predictors A and B, respectively, and the left MB in the same row is used as the predictor C. . These are already acquired MBs. If the current MB is at the right end, as shown in FIG. 16, the MV of the left end MB in the same row as the current MB is read. Next, when the current MB is at the left end position of the lower row, the MV of the predictor for calculating PMV is simply read from the MV storage area 53 by reading the MV of the upper right MB (Predictor B). can get.

  In the processing of FIG. 15 and FIG. 16, the current MB is included from the time when the position of the current MB becomes the right end of the upper line until the position of the current MB becomes the position immediately before the right end of the same line. The MV is read from the MV storage area 53 only from the line above the line. That is, since MV is read from only one line, access can be facilitated and speeded up. In the VC-1 format, MV prediction is not performed in the uppermost row of the picture, and (PMV = 0 vector) is defined. Therefore, in all the rows of the picture, the MV exceeds the row boundary. You don't have to get

  Although one embodiment of the present invention has been specifically described above, the present invention is not limited to the above-described embodiment, and various modifications based on the technical idea of the present invention are possible. . For example, the present invention is not limited to the VC-1 format, and in motion vector prediction, two types of prediction methods are possible, such as median prediction and hybrid prediction. In order to determine a prediction method and extract syntax elements This can be applied to a method of calculating a predicted motion vector and using the calculated predicted motion vector.

It is a block diagram of an example of the encoding apparatus which can apply this invention. It is a block diagram of an example of the decoding apparatus which can apply this invention. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction in a Progressive1MV P picture. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction of 1MVmode macroblock in a Progressive Mixed-MV P picture. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction of 4MVmode macroblock in a Progressive Mixed-MV P picture. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction in Interlaced field 1MV P picture. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction of 1MVmode macroblock in an Interlaced field P picture. It is a basic diagram for demonstrating the pattern of the predictor used for the motion vector prediction of 4MVmode macroblock in an Interlaced field P picture. It is a block diagram of the conventional MV prediction part. It is a flowchart which shows the flow of a process of the conventional MV prediction part. It is a block diagram of one embodiment of an MV prediction unit according to the present invention. It is a flowchart which shows the flow of the process of one Embodiment of this invention. It is a basic diagram which shows the argument table | surface of PMV calculation in one embodiment of this invention. It is an approximate line figure used for explanation of processing in the case of Raw mode in one embodiment of this invention. It is a basic diagram used for description of the predictor read in order to calculate PMV in one embodiment of this invention. FIG. 6 is a schematic diagram used for explaining a predictor read in order to calculate PMV when the current macroblock is at the end of a row in the embodiment of the present invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Intra prediction encoding part 2 Inter prediction encoding part 21 Intra prediction decoding part 22 Inter prediction decoding part 32,50 Motion vector decoding part 41,51 VLD
42,52 MVP
42a, 52a PMV calculation unit 42b, 52c MV calculation unit 52b selector 43, 53 MV storage area

Claims (6)

An input stream in which a motion vector of the current block is predicted from motion vectors of a plurality of predictors adjacent to the current block, a difference between the predicted motion vector and the motion vector of the current block is entropy encoded, and includes the entropy encoded data A motion vector decoding method in which the motion vector is decoded from:
Information of a plurality of the Puridiku data is the picture layer to be referred for generating a predictive motion vector of the current block (Progressive / Interlaced, NUMREF = 0 or 1) and, in the macroblock layer information (1MV / 4MV, Predictor flag = it is defined by 0 or 1) and,
First prediction methods and the threshold an absolute value of the difference is preset between the motion vector of the prediction motion vector and predetermined the Predictor selecting a median of motion vectors of a plurality of the Puridiku data as the predicted motion vector Any of the second prediction methods in which a predetermined motion vector of the predictor is selected as the predicted motion vector from among the plurality of motion vectors of the predictor and the HYBRIDPRED syntax is present when the value is larger than the value. In a motion vector decoding method for performing decoding by
In the state of no information the macroblock layer, possibly corresponding with each information of the macroblock layer generates the predictive motion vector, and holds, in correspondence with the generated the predicted motion vector It is determined whether or not the absolute value of the difference is larger than a preset threshold value, flag information USEDHYBRID indicating the presence or absence of the HYBRIDPRED syntax is generated from the determination result, and the generated flag information USEDHYBRID is the entropy code. The entropy decoding step for decoding
In the entropy decoding step, the presence or absence of the HYBRIDPRED syntax element is determined corresponding to the flag information USEDHYBRID , and the HYBRIDPRED syntax when determined to be present from the entropy decoding step , and the macroblock layer Is output and
And the HYBRIDPRED syntax when it is determined that the there, select the final prediction motion vector from the information of the macroblock layer, obtained above Symbol final prediction motion vector and the entropy decoding step A motion vector decoding method comprising: a motion vector decoding step of adding a difference and decoding a motion vector. The current block and the Predictor, the motion vector decoding method according to claim 1, wherein a block obtained by dividing the macroblock or macroblock. By using the information obtained above picture layer above Symbol entropy decoding step, the motion vector decoding method according to claim 1, wherein reducing the types of predicted motion vectors to be generated. An input stream in which a motion vector of the current block is predicted from motion vectors of a plurality of predictors adjacent to the current block, a difference between the predicted motion vector and the motion vector of the current block is entropy encoded, and includes the entropy encoded data A motion vector decoding device for decoding the motion vector from
Information of a plurality of the Puridiku data is the picture layer to be referred for generating a predictive motion vector of the current block (Progressive / Interlaced, NUMREF = 0 or 1) and, in the macroblock layer information (1MV / 4MV, Predictor flag = it is defined by 0 or 1) and,
First prediction methods and the threshold an absolute value of the difference is preset between the motion vector of the prediction motion vector and predetermined the Predictor selecting a median of motion vectors of a plurality of the Puridiku data as the predicted motion vector Any of the second prediction methods in which a predetermined motion vector of the predictor is selected as the predicted motion vector from among the plurality of motion vectors of the predictor and the HYBRIDPRED syntax is present when the value is larger than the value. In a motion vector decoding device that performs decoding according to
In the state of no information the macroblock layer, possibly corresponding with each information of the macroblock layer generates the predictive motion vector, and holds, in correspondence with the generated the predicted motion vector It is determined whether or not the absolute value of the difference is larger than a preset threshold value, flag information USEDHYBRID indicating the presence or absence of the HYBRIDPRED syntax is generated from the determination result, and the generated flag information USEDHYBRID is the entropy code. To the entropy decoder that decodes
In the entropy decoding unit, the presence or absence of the HYBRIDPRED syntax element is determined corresponding to the flag information USEDHYBRID , and the HYBRIDPRED syntax in the case where it is determined by the entropy decoding unit and the macroblock layer Is output and
And the HYBRIDPRED syntax when it is determined that the there, select the final prediction motion vector from the information of the macroblock layer, obtained above Symbol final prediction motion vector and the entropy decoding unit A motion vector decoding device comprising: a motion vector decoding unit that adds a difference to decode a motion vector; and a storage unit that accumulates the decoded motion vector. 5. The motion vector decoding apparatus according to claim 4, wherein the current block and the predictor are macroblocks or blocks obtained by dividing a macroblock. 5. The motion vector decoding apparatus according to claim 4, wherein the type of predicted motion vector to be generated is reduced by using the information of the picture layer obtained by the entropy decoding unit.

Images