JP2013146057A - Video decoding device, video decoding method, and video decoding program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve coding efficiency by reducing the code amount of a quantization parameter.SOLUTION: In a video decoding device which decodes a bit stream obtained by coding a video while a first block into which each picture of the video is partitioned at a predetermined size is further partitioned into one or a plurality of second blocks, a decoding unit 202 decodes the bit stream to extract a differential quantization parameter of a second block; a predictive quantization parameter derivation unit 205 derives a predictive quantization parameter of the second block using quantization parameters of a third block close to the left of the second block and a fourth block close to the top of the second block; and a quantization parameter generation unit 203 adds the differential quantization parameter and the predictive quantization parameter of the second block to generate a quantization parameter of the second block.

Description

  The present invention relates to a moving picture decoding technique, and more particularly to a moving picture decoding technique using predictive coding of quantization parameters.

  MPEG-2 Part 2 (hereinafter referred to as MPEG-2) and MPEG-4 Part 10 / H. In digital video coding such as H.264 (hereinafter referred to as AVC), an image is divided into blocks of a predetermined size and coded to indicate the roughness of quantization for a prediction error signal (or simply an image signal). Transmit quantization parameters. By variably controlling the quantization parameter in units of predetermined blocks on the encoding side, it is possible to control the code amount and improve the subjective image quality.

  As a control of the quantization parameter for improving the subjective image quality, Adaptive Quantization (adaptive quantization) is often used. In adaptive quantization, it is changed according to the activity of each macroblock so that it is quantized more finely in the flat part that is visually noticeable, and coarser in the complicated part of the pattern that is relatively inconspicuous. . That is, in a macroblock with a high activity that tends to have a large allocated bit amount when encoded, the quantization parameter is changed so that a large quantization scale is set. Subjective image quality is improved while controlling the number of bits to be as small as possible in the data.

  In MPEG-2, it is determined whether the quantization parameter of the previous block and the quantization parameter of the block to be encoded are the same in the encoding / decoding order, and if not, the quantization parameter is transmitted. To do. In AVC, the quantization parameter of the previous block in the encoding / decoding order is used as a prediction value, and the quantization parameter of the encoding target block is differentially encoded. This is based on the fact that since the code amount control is generally performed in the coding order, the quantization parameter of the previous block in the coding order is closest to the quantization parameter of the coding block. It aims to suppress the amount of information of the conversion parameter.

JP 2011-91772 A

  In the conventional quantization parameter control, the difference between the quantization parameter of the encoding target block is calculated using the quantization parameter of the encoded left block as a prediction quantization parameter, and the calculated difference quantization parameter is calculated. The amount of code of the quantization parameter was reduced by encoding. However, depending on the content in the screen, for example, as shown in FIG. 8, when the characteristics of the image in the encoding target block and the image in the encoded left block are different, it is calculated by adaptive quantization. Therefore, there is a problem that even if the prediction of the quantization parameter with the left block is executed uniquely, the difference quantization parameter becomes large and the code amount increases.

  In addition, since the quantization parameter calculated by the code amount control is performed in the raster scan order from the upper left to the lower right of the normal screen, the processing order is separated between slices when the block size to be encoded is reduced. Therefore, when the quantization parameter of the encoded block that is close to the encoding target block is used for prediction, it is close but the processing order in the code amount control is far away, so the code amount control The quantization parameter calculated in step 1 is not necessarily the same or close to the encoding target block and the encoded block adjacent to the upper side, and it cannot be said that the code amount of the differential quantization parameter can be reduced. There was a problem.

  The present invention has been made in view of such circumstances, and an object of the present invention is to provide a technique for improving the coding efficiency by reducing the code amount of the quantization parameter.

  In order to solve the above problems, a moving picture decoding apparatus according to an aspect of the present invention further divides a first block obtained by dividing each picture of a moving picture by a predetermined size into one or a plurality of second blocks. A decoding unit (202) that decodes the bitstream in which the moving image is encoded, and that decodes the bitstream and extracts the differential quantization parameter of the second block; Using the quantization parameters of the third block adjacent to the left of the second block and the fourth block adjacent to the second block, the predicted quantization parameter of the second block is derived. A predictive quantization parameter deriving unit (205) adds the difference quantization parameter of the second block and the predictive quantization parameter to calculate the quantization parameter of the second block. Comprising quantization parameter generation unit for generating a data and a (203). The predicted quantization parameter deriving unit (205), when the third block is in a position not exceeding the boundary of the first block, converts the quantization parameter of the third block to the first quantization If the parameter is located beyond the boundary of the first block, the quantization parameter of the fifth block decoded before the second block is set as the first quantization parameter, and the fourth Is located at a position that does not exceed the boundary of the first block, the quantization parameter of the fourth block is set as the second quantization parameter, and the position of the block exceeds the boundary of the first block. In some cases, the quantization parameter of the fifth block is set as the second quantization parameter, and the second block is used by using the first quantization parameter and the second quantization parameter. To the deriving predictive quantization parameter.

  Another aspect of the present invention is also a video decoding device. The apparatus further divides a block obtained by dividing each picture of a moving image by a predetermined size into one or a plurality of encoded blocks, and decodes a bitstream in which the moving image is encoded in units of encoded blocks. A decoding unit (202) for decoding a bit block of a decoded block and extracting a differential quantization parameter of the decoded block, and a quantization of a decoded adjacent block adjacent to the decoded block, the moving picture decoding apparatus A predictive quantization parameter deriving unit (205) for deriving a predictive quantization parameter of the decoded block according to a prediction mode of the decoded block using a parameter; a differential quantization parameter of the decoded block; and the predictive quantization A quantization parameter generation unit (2) that generates a quantization parameter of the decoded block by addition with a parameter 3) and a. The predictive quantization parameter deriving unit (205), when an adjacent block adjacent to the decoded block in a predetermined direction is located beyond a boundary of the predetermined size block, is adjacent to the predetermined block The prediction quantization parameter of the decoded block is derived using the quantization parameter of another decoded block different from.

  Yet another aspect of the present invention is a video decoding method. In this method, a first block obtained by dividing each picture of a moving image by a predetermined size is further divided into one or a plurality of second blocks, and a moving picture for decoding a bitstream in which the moving image is encoded is decoded. A decoding method for decoding the bitstream to extract a differential quantization parameter of the second block, a third block adjacent to the left of the second block, and the second block A predictive quantization parameter deriving step of deriving a predictive quantization parameter of the second block using a quantization parameter of a block of the fourth block adjacent on the block; and a differential quantization of the second block A quantization parameter generating step for generating a quantization parameter for the second block by adding a parameter and the predicted quantization parameter; That. The predictive quantization parameter derivation step uses the quantization parameter of the third block as the first quantization parameter when the third block is in a position not exceeding the boundary of the first block; When the position is beyond the boundary of the first block, the quantization parameter of the fifth block decoded before the second block is set as the first quantization parameter, and the fourth block is When it is in a position that does not exceed the boundary of the first block, the quantization parameter of the fourth block is set as the second quantization parameter, and when it is in a position beyond the boundary of the first block, , The quantization parameter of the fifth block is set as a second quantization parameter, and the first block and the second quantization parameter are used to To derive the Sokuryoko parameter.

  It should be noted that any combination of the above-described constituent elements and a conversion of the expression of the present invention between a method, an apparatus, a system, a recording medium, a computer program, etc. are also effective as an aspect of the present invention.

  According to the present invention, it is possible to improve the coding efficiency by reducing the code amount of the quantization parameter.

It is a block diagram which shows the structure of the moving image encoder which comprised the derivation | leading-out method of the prediction quantization parameter which concerns on embodiment. It is a block diagram which shows the structure of the moving image decoding apparatus provided with the derivation method of the prediction quantization parameter which concerns on embodiment. It is a figure explaining the code amount control in the screen of MPEG-2 TM5. H. It is a figure which shows the H.264 quantization parameter prediction method. It is a figure which shows an example of the encoding process order at the time of using hierarchy tree encoding. It is a figure which shows prediction of the quantization parameter of the encoding block of the upper left inside the tree block divided | segmented by hierarchy tree encoding. It is a figure which shows an example of the encoding process order inside the tree block divided | segmented by hierarchy tree encoding. It is a figure showing an example with which a design is contained in the block on the left and the upper left with respect to the surrounding block which has already been encoded close to the encoding block of encoding object. FIG. 4 is a diagram for explaining the positions of adjacent coding blocks in the upper and lower sides in code amount control within a screen of MPEG-2 TM5. It is a figure showing an example of a Golomb encoding table with a signed exponent sign of a difference quantization parameter. It is a figure which shows the relationship between an encoding object tree block and an encoded tree block. It is a figure which shows the relationship between the encoding block inside the tree block divided | segmented by hierarchy tree encoding, and the encoded block. In a 1st Example, it is a figure showing the reference place of the prediction quantization parameter of an encoding block. It is a figure showing an example which shows as a reference destination the quantization parameter of the adjacent block of an already encoded near as a prediction quantization parameter of an encoding block. It is a flowchart for demonstrating operation | movement of the prediction quantization parameter derivation | leading-out part of a 1st Example. It is a flowchart for demonstrating another operation | movement of the prediction quantization parameter derivation | leading-out part of a 1st Example. In a 2nd Example, it is a figure showing the reference destination of the prediction quantization parameter of an encoding block. It is a flowchart for demonstrating operation | movement of the prediction quantization parameter derivation | leading-out part of a 2nd Example. In a 2nd Example, it is a figure showing the reference destination of the prediction quantization parameter of an encoding block. It is a flowchart for demonstrating operation | movement of the prediction quantization parameter derivation | leading-out part of a 2nd Example. In a 3rd Example, it is a figure showing the reference place of the prediction quantization parameter of an encoding block. It is a flowchart for demonstrating operation | movement of the prediction quantization parameter derivation | leading-out part of a 3rd Example. In a 4th Example, it is a figure showing the reference destination of the prediction quantization parameter of an encoding block. It is a flowchart for demonstrating operation | movement of the prediction quantization parameter derivation | leading-out part of a 4th Example. It is a figure explaining an example of a quantization group. It is a figure explaining an example of prediction of the quantization parameter of a quantization group unit.

  The embodiment of the present invention divides a picture into rectangular blocks of a predetermined size, further divides the block into one or a plurality of encoded blocks, and performs video coding that performs quantization / encoding in units of encoded blocks In order to reduce the coding amount of the quantization parameter of the block to be processed, the optimal prediction quantization parameter is derived from the coding information of the surrounding coded blocks and the difference from the prediction quantization parameter is calculated. Thus, a code amount control technique for encoding is provided.

  A preferred moving image encoding apparatus 100 and moving image decoding apparatus 200 that implement the present invention will be described. FIG. 1 is a block diagram showing the configuration of a moving picture coding apparatus 100 that implements the present invention, in which an image memory 101, a residual signal generation unit 102, an orthogonal transform / quantization unit 103, and a second encoded bit string generation unit. 104, an inverse quantization / inverse orthogonal transform unit 105, a decoded image signal superimposing unit 106, a decoded image memory 107, a predicted image generation unit 108, an activity calculation unit 109, a quantization parameter calculation unit 110, a differential quantization parameter generation unit 111, A first encoded bit string generation unit 112, an encoded information storage memory 113, a predicted quantization parameter derivation unit 114, and an encoded bit string multiplexing unit 115 are configured. The thick solid arrows connecting the blocks represent picture image signals, and the thin solid arrows represent the flow of parameter signals for controlling encoding.

  The image memory 101 temporarily stores image signals to be encoded supplied in the order of shooting / display time. The image memory 101 supplies the stored image signal to be encoded to the residual signal generation unit 102, the predicted image generation unit 108, and the activity calculation unit 109 in units of predetermined pixel blocks. At this time, the images stored in the order of shooting / display time are rearranged in the encoding order and output from the image memory 101 in units of pixel blocks.

  The residual signal generation unit 102 subtracts the image signal to be encoded from the prediction signal generated by the prediction image generation unit 108 to generate a residual signal, and supplies the residual signal to the orthogonal transform / quantization unit 103.

  The orthogonal transform / quantization unit 103 performs orthogonal transform and quantization on the residual signal, generates an orthogonal transform / quantized residual signal, and performs inverse quantization with the second encoded bit string generation unit 104. Supply to the inverse orthogonal transform unit 105.

  The second encoded bit sequence generation unit 104 generates a second encoded bit sequence by entropy encoding the orthogonally transformed and quantized residual signal according to a prescribed syntax rule, and the encoded bit sequence multiplexing unit 115 Supply.

  The inverse quantization / inverse orthogonal transform unit 105 calculates a residual signal by performing inverse quantization and inverse orthogonal transform on the orthogonal transform / quantized residual signal supplied from the orthogonal transform / quantization unit 103 to perform decoding. This is supplied to the image signal superimposing unit 106.

  The decoded image signal superimposing unit 106 superimposes the predicted image signal generated by the predicted image generating unit 108 and the residual signal subjected to inverse quantization and inverse orthogonal transform by the inverse quantization / inverse orthogonal transform unit 105 to generate a decoded image. It is generated and stored in the decoded image memory 107. The decoded image may be subjected to a filtering process for reducing distortion such as block distortion due to encoding, and may be stored in the decoded image memory 107. In that case, a post filter such as a deblocking filter may be used as necessary. Predicted encoded information such as a flag for identifying the information is stored in the encoded information storage memory 113.

  The predicted image generation unit 108 uses an image signal supplied from the image memory 101 and a decoded image signal supplied from the decoded image memory 107, based on a prediction mode, for intra-frame prediction (intra prediction) or inter-frame prediction (inter prediction). To generate a predicted image signal. Intra prediction is a coding target block obtained by dividing an image signal supplied from the image memory 101 by a predetermined block unit and a coding target block supplied from the decoded image memory 107 in the same frame. A prediction image signal is generated using pixel signals of surrounding encoded blocks adjacent to the block to be converted. In the inter prediction, the decoded image memory 107 is separated by several frames before or behind in the time series of the frames (encoded frames) of the block to be encoded obtained by dividing the image signal supplied from the image memory 101 in a predetermined block unit. The encoded frame stored in is used as a reference frame, block matching is performed between the encoded frame and the reference frame, a motion amount called a motion vector is obtained, and motion compensation is performed from the reference frame based on this motion amount. To generate a predicted image signal. The predicted image signal generated in this way is supplied to the residual signal generation unit 102. Coding information such as a motion vector obtained by the predicted image generation unit 108 is stored in the coding information storage memory 113 as necessary. Furthermore, when a plurality of prediction modes can be selected, the prediction image generation unit 108 evaluates the distortion amount between the generated prediction image signal and the original image signal, and thereby selects an optimum prediction mode. The prediction image signal generated by the prediction in the determined prediction mode is selected and supplied to the residual signal generation unit 102. When the prediction mode is intra prediction, the intra prediction mode is selected as the encoded information storage memory. 113 and the first encoded bit string generator.

  The activity calculation unit 109 calculates an activity that is a coefficient indicating the complexity and smoothness of the image of the encoding target block supplied from the image memory 101, and supplies it to the quantization parameter calculation unit 110. The detailed configuration and operation of the activity calculation unit 109 will be described in an embodiment described later.

  The quantization parameter calculation unit 110 calculates the quantization parameter of the block to be encoded based on the activity calculated by the activity calculation unit 109, and supplies the quantization parameter to the differential quantization parameter generation unit 111 and the encoded information storage memory 113. . The detailed configuration and operation of the quantization parameter calculation unit 110 will be described in an embodiment described later.

  The difference quantization parameter generation unit 111 performs subtraction on the quantization parameter calculated by the quantization parameter calculation unit 110 and the prediction quantization parameter derived by the prediction quantization parameter derivation unit 114 to obtain the difference quantum. The calculation parameter is calculated and supplied to the first encoded bit string generation unit 112.

  The first encoded bit sequence generation unit 112 generates a first encoded bit sequence by encoding the differential quantization parameter calculated by the differential quantization parameter generation unit 111 according to a specified syntax rule, and generates an encoded bit sequence multiplexed To the conversion unit 115.

  The encoding information storage memory 113 stores the quantization parameter of the block that has been encoded. Although the connection is not shown in FIG. 1, the encoding information such as the prediction mode and the motion vector generated by the prediction image generation unit 108 is also used as information necessary for encoding the next encoding target block. Store. Furthermore, encoded information generated in units of pictures and slices is also stored as necessary.

  The predictive quantization parameter deriving unit 114 derives a predictive quantization parameter using quantization parameters and coding information of already-encoded blocks that are close to the periphery of the block to be encoded, and generates a differential quantization parameter. Supplied to the unit 111. The detailed configuration and operation of the predicted quantization parameter deriving unit 114 will be described in an embodiment described later.

  The encoded bit string multiplexing unit 115 multiplexes the first encoded bit string and the second encoded bit string in accordance with a specified syntax rule, and outputs a bit stream.

  FIG. 2 is a block diagram showing a configuration of a moving picture decoding apparatus 200 according to an embodiment corresponding to the moving picture encoding apparatus 100 of FIG. The moving picture decoding apparatus 200 according to the embodiment includes a bit string separation unit 201, a first encoded bit string decoding unit 202, a quantization parameter generation unit 203, an encoded information storage memory 204, a predicted quantization parameter derivation unit 205, and a second code. A decoded bit string decoding unit 206, an inverse quantization / inverse orthogonal transform unit 207, a decoded image signal superimposing unit 208, a predicted image generating unit 209, and a decoded image memory 210. As in the moving picture encoding apparatus 100 of FIG. 1, the thick solid line arrows connecting the blocks represent picture image signals, and the thin solid line arrows represent the flow of parameter signals for controlling encoding.

  The decoding process of the moving picture decoding apparatus 200 in FIG. 2 corresponds to the decoding process provided in the moving picture encoding apparatus 100 in FIG. 1, and therefore the inverse quantization / inverse orthogonal transform unit in FIG. 2. 207, the decoded image signal superimposing unit 208, the predicted image generating unit 209, the decoded image memory 210, and the encoded information storage memory 204 are configured by the inverse quantization / inverse orthogonal transform unit 105 of the moving image encoding apparatus 100 in FIG. , The decoded image signal superimposing unit 106, the predicted image generating unit 108, the decoded image memory 107, and the encoded information storage memory 113.

  The bit stream supplied to the bit string separation unit 201 is separated according to a rule of a prescribed syntax, and the separated encoded bit string is supplied to the first encoded bit string decoding unit 202 and the second encoded bit string decoding unit 206.

  The first encoded bit string decoding unit 202 decodes the supplied encoded bit string, outputs encoding information related to the prediction mode, motion vector, differential quantization parameter, and the like, and converts the differential quantization parameter to the quantization parameter generation unit 203. And the encoded information is stored in the encoded information storage memory 204.

  The quantization parameter generation unit 203 adds the difference quantization parameter supplied from the first encoded bit string decoding unit 202 and the quantization parameter derived by the prediction quantization parameter deriving unit 205 to calculate the quantization parameter. And supplied to the inverse quantization / inverse orthogonal transform unit 207 and the encoded information storage memory 204.

  The encoded information storage memory 113 stores the quantization parameter of the block that has been decoded. Furthermore, not only the block unit encoded information decoded by the first encoded bit string decoding unit 202 but also the encoded information generated in units of pictures and slices are stored as necessary. Although not shown in FIG. 2, the encoded information such as the decoded prediction mode and motion vector is supplied to the prediction image generation unit 209.

  The predicted quantization parameter deriving unit 205 derives a predicted quantization parameter using the quantization parameters and coding information of the already decoded blocks that are close to the periphery of the decoding target block, and supplies the predicted quantization parameter to the quantization parameter generating unit 203. To do. The predictive quantization parameter deriving unit 205 has a function equivalent to that of the predictive quantization parameter deriving unit 114 of the video encoding device 100, and a detailed configuration and operation will be described in an embodiment described later.

  The second encoded bit string decoding unit 206 decodes the supplied encoded bit string to calculate an orthogonally transformed / quantized residual signal, and dequantizes / inverts the orthogonally transformed / quantized residual signal. This is given to the orthogonal transform unit 207.

  The inverse quantization / inverse orthogonal transform unit 207 generates a quantization signal generated by the quantization parameter generation unit 203 for the orthogonal transform / quantized residual signal decoded by the second encoded bit string decoding unit 206. Using the parameters, inverse orthogonal transform and inverse quantization are performed to obtain a residual signal subjected to inverse orthogonal transform and inverse quantization.

  The decoded image signal superimposing unit 208 superimposes the predicted image signal generated by the predicted image generating unit 209 and the residual signal subjected to inverse orthogonal transform / inverse quantization by the inverse quantization / inverse orthogonal transform unit 207. The decoded image signal is generated, output, and stored in the decoded image memory 210. When stored in the decoded image memory 210, the decoded image may be stored in the decoded image memory 210 after filtering processing for reducing block distortion or the like due to encoding is performed on the decoded image.

  The predicted image generation unit 209 uses the decoded image memory 210 based on the encoded information such as the prediction mode and motion vector decoded by the second encoded bit string decoding unit 206 and the encoded information from the encoded information storage memory 204. A predicted image signal is generated from the decoded image signal supplied from, and supplied to the decoded image signal superimposing unit 208.

  Next, various parts 120 surrounded by a thick dotted line in the moving picture coding apparatus 100, in particular, a predictive quantization parameter deriving part 114, and various parts 220 surrounded by a thick dotted line in the moving picture decoding apparatus 200, In particular, details of a method for deriving a predictive quantization parameter that is commonly performed by the predictive quantization parameter deriving unit 205 will be described.

  First, the operation of each section of the sections 120 surrounded by the thick dotted line in the moving picture coding apparatus 100 according to the present embodiment will be described. The units 120 use a pixel block of a predetermined pixel size unit supplied from the image memory 101 as a coding block, and determine a quantization parameter for quantizing the block. The quantization parameter is mainly determined by code amount control and adaptive quantization algorithms. First, an adaptive quantization method in the activity calculation unit 109 will be described.

  In the activity calculation unit 109, since human visual characteristics are generally sensitive to low-frequency components with few edges, a more complex portion of a pattern that is quantized more finely on a flat part that is visually conspicuous and is relatively inconspicuous. The activity expressing the complexity and smoothness of the image is calculated for each predetermined block so as to quantize more roughly.

  As an example of the activity, there is a calculation based on a variance value of pixels in a coding block described in MPEG-2 TestModel 5 (TM5). The variance value is a value indicating the degree of dispersion from the average of the pixels constituting the image in the block. The flatter the image in the block (the smaller the luminance change), the smaller the value, and the more complex the image (the luminance change is). The larger the value, the larger the value, so use it as a block activity. When the pixel value in the block is represented by p (x, y), the activity act of the block is calculated by the following equation.

  Here, BLK is the total number of pixels in the coding block, and p_mean is the average value of the pixels in the block.

  Further, the present invention is not limited to the above variance, and the absolute value of the difference between the pixels in the coding block and the pixels adjacent in the horizontal direction and the vertical direction may be taken, and the sum in the block may be taken. Even in this case, it is small when the image is flat, and a large value is obtained in a complicated picture portion having many edges, and can be used as an activity. It is calculated by the following formula.

  The activity act calculated in this way is supplied to the quantization parameter calculation unit 110.

  Next, code amount control will be described. The moving image coding apparatus 100 according to the present embodiment does not particularly include a unit that realizes the code amount control. However, in the code amount control, the quantization parameter of the coding block is determined based on the generated code amount. It is assumed that the function is included in the parameter calculation unit 110.

  Code amount control is aimed at adjusting the generated code amount of a predetermined unit such as a frame to the vicinity of the target code amount, and when it is determined that the generated code amount of the encoded block is larger than the target code amount, If relatively coarse quantization is applied to the block to be encoded, and it is determined that the generated code amount of the encoded block is less than the target code amount, relatively fine quantization is applied to the block to be encoded thereafter. To do.

  A specific code amount control algorithm will be described with reference to FIG.

  First, a target code amount (T) is determined for each frame. In general, T is determined so that I picture> P picture> reference B picture> non-reference B picture. For example, when the target bit rate of a moving image is 5 Mbps, there are 1 I picture, 3 P pictures, 11 reference B pictures, and 15 non-reference B pictures per second, Assuming that the target code amount is Ti, Tp, Tbr, Tb, when it is desired to control the target code amount so that the ratio of Ti: Tp: Tbr: Tb = 4: 3: 2: 1, Ti = 400 kbit, Tp = 300 kbit. , Tbr = 200 kbit, Tb = 100 kbit. However, the allocated code amount for each picture type does not affect the essence of the present invention.

となる。ここで、ｊは符号化ブロックの符号化処理順カウント番号である。Ｄ（０）は目標符号量差分の初期値である。 Next, code amount control within a frame will be described. When the number of blocks, which are units for determining the quantization parameter, is N, the generated code amount is B, and the difference bit from the target code amount is D

It becomes. Here, j is the encoding processing order count number of the encoding block. D (0) is an initial value of the target code amount difference.

The quantization parameter bQP by code amount control is determined as follows.

  Here, r is a proportional coefficient for converting the target code amount difference into a quantization parameter. The proportional coefficient r is determined according to the available quantization parameter.

  The quantization parameter calculation unit 110 changes the quantization parameter of the coding block calculated by the code amount control using the activity act calculated by the activity calculation unit 109 for each coding block. In the following, since the calculation is performed for each coding block, the coding processing order count number of the quantization parameter by the code amount control is deleted and represented by bQP.

  The quantization parameter calculation unit 110 records the average activity in the frame encoded immediately before as avg_act, and calculates the normalized activity Nact of the encoded block by the following equation.

  Here, the coefficient 2 in the above equation is a value representing the dynamic range of the quantization parameter, and a normalized activity Nact having a range of 0.5 to 2.0 is calculated.

  Note that avg_act may be calculated in advance for all blocks in the frame before the encoding process, and the average value may be avg_act. Furthermore, avc_act may be stored in the encoded information storage memory 113, and the quantization parameter calculation unit 110 may acquire avg_act from the encoded information storage memory 113 as necessary.

  The calculated normalization activity Nact is multiplied by the reference quantization parameter bQP as in the following equation to obtain the quantization parameter QP of the coding block.

  Note that bQP is a quantization parameter for each block calculated by code amount control as described above, but may be a quantization parameter representative of a frame or slice including a coding block as a fixed value. Moreover, the average quantization parameter of the frame encoded immediately before may be used, and the calculation method is not particularly limited in the present embodiment.

  The quantization parameter of the coding block calculated in this way is supplied to the coding information storage memory 113 and the differential quantization parameter generation unit 111.

  The encoded information storage memory 113 not only stores the quantization parameters calculated by the quantization parameter calculation unit 110 and the quantization parameters of past encoded blocks that have already been encoded, Encoding information such as a motion vector to be encoded and a prediction mode is also stored, and each unit acquires the encoding information as necessary.

  The predicted quantization parameter derivation unit 114 uses the quantization parameter of the already-encoded neighboring block around the coding block and other coding information from the coding information storage memory 113 to calculate the quantization parameter of the coding block. Predictive quantization parameters for efficient coding and transmission are derived.

  In order to efficiently encode and transmit the quantization parameter, rather than encoding the quantization parameter as it is, the difference (difference quantization parameter) with the quantization parameter of the already coded block is taken, It is more efficient to encode and transmit the differential quantization parameter. From the viewpoint of code amount control, if the quantization parameter of the immediately previous coded block in the coding processing order is the predicted quantization parameter, the value of the differential quantization parameter to be transmitted is small, and the code amount is small. On the other hand, from the viewpoint of adaptive quantization, since the coded block and the neighboring neighboring blocks are close to each other, the same or similar pattern is often obtained. If the quantization parameter of the adjacent block is set as the predictive quantization parameter, the value of the differential quantization parameter to be transmitted becomes small and the code amount becomes small. Therefore, H.H. In H.264, as shown in FIG. 4, the unit for transmitting the quantization parameter is fixed in a macro block (16 × 16 pixel group), and the left adjacent data encoded before or immediately before the encoded block in the raster scan order. A method is adopted in which the quantization parameter of the block adjacent to the block is used as the prediction quantization parameter, the difference between the quantization parameter of the coding block and the prediction quantization parameter is taken, and the difference quantization parameter is encoded and transmitted. That is, H.I. H.264 is optimized for prediction of quantization parameters assuming code amount control. However, H. Since H.264 does not perform hierarchical tree coding, which will be described later, since the immediately preceding block is the left block except for the left end of the image, the quantization parameter of the adjacent block is used as the prediction quantization parameter, and adaptive quantization is performed. It can be said that it is almost optimized for forecasting. Therefore, H.H. When the unit for transmitting the quantization parameter is fixed as in H.264 and the hierarchical tree coding is not performed, it can be said that the immediately preceding coded block is optimal for prediction of the quantization parameter.

  However, when performing hierarchical tree coding, As in the case of H.264, when the quantization parameter of the immediately preceding block is used as the prediction quantization parameter, it is optimized for code amount control. However, when transmitting the quantization parameter using adaptive quantization, In other words, there arises a problem that the code amount of the differential quantization parameter increases.

  Here, hierarchical tree coding will be described. Hierarchical tree coding here refers to determining a depth representing a coding unit in tree block units (here, 64 × 64 blocks), and performing coding in coding block units using the determined depth. As a result, it is possible to determine the optimum depth depending on the definition of the image and perform the encoding, thereby greatly improving the encoding efficiency.

  FIG. 5 shows the encoding processing order of the hierarchical tree encoding structure. As shown in the upper diagram of FIG. 5, the inside of the screen is equally divided in units of square rectangles having a predetermined same size. This unit is called a tree block, and is a basic unit of address management for specifying an encoding / decoding block in an image. The tree block can be divided into four hierarchical blocks as necessary to make the block smaller in size in order to optimize the encoding process according to the texture in the image. Such a hierarchical block structure divided into small blocks is called a tree block structure, and this divided block is called a coding block (CU: Coding Unit) for encoding and decoding. The basic unit of processing. The lower diagram of FIG. 5 shows an example in which three CUs except the lower left are further divided into four CUs obtained by dividing the tree block into four. In this embodiment, it is assumed that the quantization parameter is set for each CU. The tree block is also the maximum size coding block.

  In such hierarchical tree coding, the coding order is H.264 in FIG. Since this is different from the raster scan order (left to right) such as H.264, the quantization parameter may not be equal between the immediately preceding coded block and the left neighboring block. For example, as an example of hierarchical tree coding, as shown in FIG. 6, the upper left coding block (the shaded rectangle in FIG. 6) in the tree block to be coded is a tree block adjacent to the left. The quantization parameter of the lower right encoded block (the gray rectangle in FIG. 6) encoded last is used for prediction. Also, as shown in FIG. 7, the lower left coding block (shaded rectangle in FIG. 7) in the tree block to be coded is divided in the same tree block and coded immediately before. The quantization parameter of the block (the gray rectangle in FIG. 7) is used for prediction. Therefore, even if the prediction optimized for the code amount control can be performed only by predicting the quantization parameter from the previous coded block, adaptive quantization is used to separate the distance between the blocks by division. Therefore, the code amount of the differential quantization parameter increases, and the coding efficiency is reduced.

  H. For example, in the case of the example shown in FIG. 8, since the picture pattern of the encoded block and the adjacent block on the left are different, the quantization parameter of the block on the left adjacent to the left like 264 is a predictive quantization parameter. The difference quantization parameter also becomes a large value, the amount of generated codes increases, and there is a possibility that efficient encoding and transmission cannot be performed.

  As a solution to this, a method is conceivable in which the predicted quantization parameter is not selected from the left neighboring block, and the quantization parameter of the already-encoded neighboring block is used as the predicted quantization parameter.

  However, when the quantization parameter is predicted from the neighboring block above the tree block boundary, the quantization parameter calculated at a considerably earlier time than the coding block is considered in consideration of the calculation of the quantization parameter by the code amount control. Therefore, as shown in FIG. 9, the processing order i of the upper neighboring block with respect to the processing order j of the coding block is i in the coding processing order even if it is close as a block in the picture. Since << j, from the viewpoint of code amount control, it cannot be said that the quantization parameter of the coding block is highly correlated with the quantization parameter of the upper neighboring block.

  Furthermore, when performing parallel processing for each tree block slice to speed up the decoding process, the quantization parameter of the adjacent block above the tree block boundary cannot be used for prediction. By referring to the neighboring block above the tree block boundary, there is a possibility that efficient coding and transmission cannot be performed.

  Therefore, the predictive quantization parameter deriving unit 114 according to the embodiment of the present invention does not use the neighboring blocks of the tree block adjacent on the coding block for the prediction of the quantization parameter, and the surrounding already coded The optimal predictive quantization parameter is derived from this block, and the efficiency of the generated code amount of the differential quantization parameter is improved.

  The predicted quantization parameter deriving unit 114 derives a predicted quantization parameter based on the position of the encoded block and the quantization parameter of the already-encoded neighboring block around the encoded block supplied from the encoded information storage memory 113. To do. Details of the predicted quantization parameter deriving unit 114 will be described in an embodiment described later.

  The differential quantization parameter generation unit 111 subtracts the prediction quantization parameter derived by the prediction quantization parameter deriving unit 114 from the quantization parameter of the coding block calculated by the quantization parameter calculation unit 110. And calculate a differential quantization parameter. Since the predictive quantization parameter is derived from the neighboring neighboring blocks that have already been decoded at the time of decoding as well as at the time of encoding, there is no contradiction in encoding and decoding by making the differential encoding parameter an encoding target, It is possible to reduce the code amount of the quantization parameter. The calculated difference quantization parameter is supplied to the first encoded bit string generation unit 112.

  The first encoded bit string generation unit 112 generates a first encoded bit string by entropy encoding the differential quantization parameter calculated by the differential quantization parameter generation unit 111 according to a specified syntax rule. FIG. 10 shows an example of a coding conversion table used for entropy coding of the differential quantization parameter. This is a table called signed exponential Golomb coding, and a shorter code length is given as the absolute value of the differential quantization parameter is smaller. In general, when an image is divided into blocks, similar images are obtained in adjacent blocks, so that the activity is a close value, and the calculated quantization parameter of the block is also a close value. For this reason, the occurrence frequency of the difference quantization parameter tends to be the highest at 0 and lower as the absolute value becomes larger, and the table in FIG. Assigned a length. If the predicted quantization parameter is predicted with a value close to the quantization parameter of the coding block, a difference quantization parameter close to 0 is calculated, and the generated code amount can be suppressed. The first encoded bit string generation unit 112 extracts a code bit string corresponding to the differential quantization parameter from the table of FIG. 10 and supplies the code bit string to the encoded bit string multiplexing unit 115.

  The operation of each unit of the units 220 surrounded by the thick dotted line in the video decoding device 200 corresponding to the video encoding device 100 of the above-described embodiment will be described.

  In the units 220, the differential quantization parameter first decoded by the first encoded bit string decoding unit 202 is supplied to the quantization parameter generation unit 203. Also, encoded information other than the differential quantization parameter is stored in the encoded information storage memory 204 as necessary.

  The quantization parameter generation unit 203 adds the differential quantization parameter supplied from the first encoded bit string decoding unit 202 and the quantization parameter derived by the prediction quantization parameter deriving unit 205 to obtain the quantization of the decoded block. The quantization parameter is calculated and supplied to the inverse quantization / inverse orthogonal transform unit 207 and the encoded information storage memory 204.

  The encoded information storage memory 204 stores the quantization parameter of the block that has been decoded. Furthermore, not only the block unit encoded information decoded by the first encoded bit string decoding unit 202 but also the encoded information generated in units of pictures and slices are stored as necessary.

  The predicted quantization parameter deriving unit 205 derives a predicted quantization parameter using the quantization parameters and coding information of already decoded blocks that are close to the periphery of the decoded block, and supplies them to the quantization parameter generating unit 203. . The quantization parameter calculated by the quantization parameter generation unit 203 is stored in the encoding information storage memory 204. When the predicted quantization parameter of the next decoding block is derived, the decoded neighboring blocks located around the decoding block are stored. The quantization parameter of the adjacent block is obtained from the encoded information storage memory 204. The quantization parameter of the decoded adjacent block obtained in this way is the same as the quantization parameter acquired from the encoded information storage memory 113 by the prediction quantization parameter deriving unit 114 of the video encoding device 100. Since the predictive quantization parameter deriving unit 205 has the same function as the predictive quantization parameter deriving unit 114 of the video encoding device 100, the quantization parameter of the adjacent block supplied from the encoded information storage memory 204 is If they are the same, the same predictive quantization parameter as that at the time of encoding is derived.

  The predictive quantization parameter deriving unit 205 performs the same processing except that the encoded adjacent block is changed to the decoded adjacent block, and thus description of the quantization parameter prediction is omitted.

  Thus, the predicted quantization parameter derived on the encoding side is derived on the decoding side without any contradiction.

  In the present embodiment, when predictive quantization parameters are derived, the adjacent blocks referred to by the predictive quantization parameter deriving unit 114 of the video encoding device 100 are already encoded blocks, and the video decoding device 200 The adjacent block referred to by the predicted quantization parameter deriving unit 205 is a decoded block. The encoded block that is referred to on the encoding side is a block that is locally decoded for the next encoding within the encoding, and is the same as the decoded block that is referred to on the decoding side. Therefore, the functions of the predictive quantization parameter deriving units 114 and 205 are also common, and the predictive quantization parameters derived by each are the same. In the following embodiments, the derivation of the prediction quantization parameter will be described on the encoding side as a common function without being divided between encoding and decoding.

  Hereinafter, the details of the method for deriving the predicted quantization parameter that is commonly performed by the predicted quantization parameter deriving units 114 and 205 will be described.

[Example 1]
A detailed operation of the predicted quantization parameter deriving unit 114 in the first embodiment will be described. In the first embodiment, when the coding block to be coded is close to the upper tree block, the quantization parameter of the coded block in the upper tree block that is considerably past in the coding order is used for prediction. Although it is prohibited, the quantization parameter of the coded block of the tree block adjacent to the left which is past in the coding order but not as old as the upper tree block is used for the prediction.

  As shown in FIG. 11, encoding is performed in the order of raster scan from the upper left to the lower right of the screen in units of tree blocks. If the encoding target tree block is represented by a hatched rectangle in FIG. 11, the encoded tree block is represented by a gray portion in FIG. Since hierarchical tree coding is performed in the tree block according to the coding conditions, the coding block is divided into a size equal to or smaller than the tree block. Although it is close to the encoded block inside the tree block, it is far away in the encoding processing order. Therefore, since the quantization parameter calculated by the code amount control is calculated in the order of encoding processing, the quantization parameter of the encoding block is close to the quantization parameter of the encoded block in the upper tree block. I can't say. Therefore, in the first embodiment, the upper tree block is not used for the prediction of the quantization parameter, but only the left tree block in the encoding processing order is used.

  Also, as shown in FIG. 12, if the encoding block in the tree block is a hatched rectangle in FIG. 12, the solid thin line represents the encoding processing order, and the blocks encoded up to the encoding block are as shown in FIG. 12 is represented by a gray portion. Within the same tree block, the coding process order of the coded block and the coded block is not separated, and the same or similar pattern is often obtained. It is useful to use parameters for prediction. In the first embodiment, priority is given to using an adjacent encoded block for prediction rather than an encoded block close in the encoding processing order.

  In FIG. 13, the direction of the encoded block referred to by each encoded block in the divided tree block is represented by a thick arrow. The solid thin line in FIG. 13 represents the encoding process order, and the encoded block gives priority to the adjacent encoded block over the encoded block close in the encoding process order. Since BLK0 and BLK1 positioned at the upper end of the tree block in FIG. 13 are in contact with the upper tree block, the quantization parameter of the encoded block adjacent to the upper side is not used for prediction, and is adjacent to the left. Only the quantization parameters of the encoded block are used. Since BLK2 and BLK3 have encoded blocks adjacent to each other in the same tree block, the quantization parameter of the upper encoded block and the quantization parameter of the left encoded block are used for prediction.

  FIG. 14 shows the arrangement of the encoded blocks defined in the present embodiment and the already encoded blocks adjacent to the surroundings. In this embodiment, the size of each block is described as the same for convenience of explanation. However, even when optimal motion prediction is performed by changing the block size by, for example, motion prediction, the upper left of the encoded block This can be realized by selecting a block close to the periphery of the above point as a reference.

  A symbol QPx (x = L, A, AL) shown in FIG. 14 represents a quantization parameter of a neighboring block that has already been encoded. The predicted quantization parameter deriving unit 114 determines the predicted quantization parameter based on the presence / absence of the quantization parameter of the left and upper neighboring blocks shown in FIG.

  The operation of the predicted quantization parameter derivation unit 114 will be described. FIG. 15 is a flowchart illustrating the operation of the predicted quantization parameter deriving unit 114 in the first embodiment.

  First, position information of a coding block to be coded is acquired (S100). As the position information of the encoded block, the upper left position of the tree block including the encoded block is obtained from the upper left corner of the screen, and the position of the encoded block is obtained from the upper left position of the tree block. Next, it is determined whether or not the encoded block is close to the upper tree block (S101).

  If the encoded block is close to the upper tree block (Yes in S101), that is, if the encoded block is located at the upper end of the tree block, the upper adjacent block is included in the upper tree block. Therefore, the tree block boundary is crossed, so the upper neighboring block is not used for the quantization parameter prediction. Here, focusing on the fact that the quantization parameter always takes a positive value, when the upper neighboring block is not used, the quantization parameter QPA of the upper neighboring block is set to 0 (S102).

  On the other hand, if the encoded block is not adjacent to the upper tree block (No in S101), that is, if the upper adjacent block is located in the same tree block as the encoded block, The storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPA of the corresponding upper neighboring block is supplied to the predicted quantization parameter deriving unit 114 (S103).

  Subsequently, it is determined whether there is an encoded block adjacent to the left of the encoded block (S104). When the adjacent block exists on the left (Yes in S104), the storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information of the encoded block, and the quantum of the corresponding left adjacent block is determined. The quantization parameter QPL is supplied to the predicted quantization parameter deriving unit 114 (S105). If the left adjacent block does not exist (No in S104), the quantization parameter QPL of the left adjacent block is set to 0 (S106).

  Next, it is determined whether the quantization parameters of the left and upper neighboring blocks are both positive (S107). If the quantization parameters of the left and upper neighboring blocks are both positive (Yes in S107), since both the left and upper neighboring blocks exist, the average value of the quantization parameters of the left and upper neighboring blocks is estimated quantum. (S111). On the other hand, if the quantization parameter of the left and upper neighboring blocks is not positive (No in S107), that is, the quantization parameter of at least one of the left or upper neighboring blocks is 0, and at least either the left or upper one One of the adjacent blocks does not exist. In this case, the process proceeds to S108.

  Next, it is determined whether the quantization parameters of the left and upper neighboring blocks are both 0 (S108). That is, when the quantization parameters of the left and upper neighboring blocks are both 0, both of them do not exist, so the quantization parameters of the left and upper neighboring blocks cannot be referred to as the prediction quantization parameters. Therefore, the quantization parameter (prevQP) of the block encoded before or immediately before the encoding block to be encoded is set as the predicted quantization parameter. If the block at the upper left corner of the image is an encoded block, there is no block encoded before and immediately before the encoding block to be encoded, and the adjacent block on the left and upper, so a picture or slice Is set as a predicted quantization parameter (S109). When either the left or upper neighboring block exists, one positive quantization parameter is set as a predicted quantization parameter (S110). The predicted quantization parameter calculated in this way is supplied to the differential quantization parameter generation unit 111.

  Further, the predicted quantization parameter deriving unit 114 can also determine the predicted quantization parameter based on the quantization parameters of the left, upper, and upper left neighboring blocks around the encoded block shown in FIG. The difference from the above-described method is that, based on the determination of the predicted quantization parameter, the quantization parameter of the left and upper neighboring blocks is weighted, and the derived value is used as the predicted quantization parameter.

  FIG. 16 is a flowchart showing the operation of the predicted quantization parameter deriving unit 114. The processing steps from S200 to S210 in the flowchart of FIG. 16 are the same as S100 to S110 in the flowchart of FIG. 15 described above, so the description is omitted, and whether or not the quantization parameters of the left and upper neighboring blocks are both positive. In the determination (S207), the description starts from the case where the quantization parameters of the left and upper neighboring blocks are both positive (Yes in S207). If the quantization parameters of the left and top neighboring blocks are both positive, there are both left and top neighboring blocks. At this time, since the upper left neighboring block also exists, the storage area stored in the coding information storage memory 113 is accessed from the upper left reference position information of the coding block, and the quantization parameter of the corresponding upper left neighboring block is obtained. QPAL is supplied to the predictive quantization parameter deriving unit 114 (S211).

  Next, it is determined whether or not the quantization parameter QPL of the left neighboring block and the quantization parameter QPAL of the upper left neighboring block match (S212). When QPL and QPAL match, if the weighting factor FA of the quantization parameter of the upper neighboring block and the weighting factor FL of the quantization parameter of the left neighboring block, the quantization of the upper neighboring block is such that FA> FL. A large weight is set for the parameter (S213). For example, FA is set to 3 and FL is set to 1. In this case, since the arrangement of the quantization parameters shown in FIG. 8 can be considered as an example, it can be said that it is appropriate to set the weights of the quantization parameters of the upper neighboring blocks large. In addition, when QPA matches QPL and QPAL, the quantization parameters of all adjacent blocks are the same, so there is no problem. If QPL and QPAL do not match, the process proceeds to S214, and a match determination between QPA and QPAL is performed (S214). If QPA and QPAL match, weighting is set larger for the quantization parameter of the adjacent block on the left so that FA <FL (S215). For example, FA is set to 1 and FL is set to 3. If QPA and QPAL do not match, FA and FL are set to the same weight, and the weights for the quantization parameters of the adjacent blocks on the left and the top are equalized (S216). In this case, since the quantization parameters of the left, upper, and upper left neighboring blocks are all different, it is not possible to perform sufficient condition determination to set a large weight for either QPL or QPA. Therefore, an average of QPL and QPA is used as a predictive quantization parameter, and an equal determination value is set. For example, FA is set to 2 and FL is set to 2. A predicted quantization parameter predQP is derived from the determined weighting coefficient and each quantization parameter by the following equation (S217).

  Here, the denominator of the above formula is FA + FL, and 2 of the numerator is a value of (FA + FL) / 2 added for rounding off. The predicted quantization parameter derived in this way is supplied to the differential quantization parameter generation unit 111.

  Further, instead of the same determination of QPL and QPAL of S212 and QPA and QPAL of S214 in FIG. 16, the difference absolute value of the quantization parameter of the neighboring block on the left and upper left is ΔL, and the quantization of the neighboring block on the upper and upper left It is also possible to select the left or upper quantization parameter as the predicted quantization parameter based on the comparison between ΔL and ΔA, with the parameter difference absolute value as ΔA.

  In the coded block and the neighboring blocks that have already been coded, ΔL and ΔA represent the absolute value of the difference between the quantization parameters of the left and upper left, and the upper and upper left neighboring blocks, respectively, and are expressed by the following equations.

  When ΔA is larger than ΔL, the difference between QPA and QPAL is large, and the smoothness or complexity of the image differs between the upper and upper left neighboring blocks than between the left and upper left neighboring blocks. It is inferred that there is a large change. Therefore, in the coding block and the neighboring blocks that have already been coded, quantization is performed with the left two blocks (left and upper left neighboring blocks) and the right two blocks (coded block and upper neighboring blocks). Since a parameter difference is considered to occur, it is determined that the quantization parameter of the coding block is close to the quantization parameter of the neighboring block above the quantization parameter of the left neighboring block.

  In the case of decoding processing, the prediction quantization parameter derivation unit is replaced with codes from 114 to 205, the encoded information storage memory is replaced with codes from 113 to 204, and the output destination of the prediction quantization parameter is changed from the difference quantization parameter generation unit 111 to the quantization parameter. By using the generation unit 203, equivalent processing is realized.

[Example 2]
The operation of the predicted quantization parameter derivation units 114 and 205 in the second embodiment will be described. Although the encoding process will be described here, in the decoding process, the encoding is decoding, and the prediction quantization parameter deriving unit 114 to 205 and the encoding information storage memory 113 to 204 are replaced with codes. It is assumed that equivalent processing is realized by changing the output destination of the quantization parameter from the differential quantization parameter generation unit 111 to the quantization parameter generation unit 203. In the second embodiment, as in the first embodiment, the quantization parameters of the left and upper encoded blocks adjacent to the encoding block to be encoded are used for prediction. On the other hand, the difference from the first embodiment is that when the encoded block is close to the upper tree block, the quantization of the encoded block in the left tree block is performed when the encoded block is close to the left tree block. The use of parameters for prediction is prohibited. This is because the quantization parameter of the coding block is calculated based on the coding processing order of the coding control, so that the coding processing order is separated between the coding blocks between the tree blocks as compared to the inside of the tree block. Even if coding blocks are close to each other between the tree blocks, the quantization parameter of the coding block calculated by the code amount control is not necessarily a close value and may not be suitable as a predictive quantization parameter. is there. Therefore, in the second embodiment, when the encoding block to be encoded or decoded is close to the left or upper tree block, the quantization parameter of the encoded block in the left or upper tree block is predicted. Not used, but replaced with the quantization parameter of the block encoded before or immediately before the encoding block to be encoded in the encoding processing order.

  FIG. 17 shows the direction of the encoded block referred to by each encoded block in the divided tree block by a thick arrow. The solid thin line in FIG. 17 represents the encoding processing order, and the encoding block uses in principle the quantization parameters of the encoded blocks that are close within the tree block including the encoding block. Since BLK0 located at the upper end of the tree block in FIG. 18 is in contact with the left and upper tree blocks, the quantization parameter of the block coded before or just before the coding block to be coded is set to the left. And it replaces with the quantization parameter of the coded block which adjoins on the top, and uses it for prediction. Since BLK1 is bordered by the upper tree block, the quantization parameter of the encoded block adjacent to the upper side is not used for prediction, and the block encoded before or immediately before the encoding block to be encoded is used. Is used for prediction together with the quantization parameter of the coded block adjacent to the left. Since BLK2 is in contact with the left tree block, the quantization parameter of the encoded block adjacent to the left is not used for prediction, and the block is encoded before or immediately before the encoding block to be encoded. Is used for prediction together with the quantization parameter of the coded block close to the top. BLK3 uses the quantization parameter of the upper encoded block and the quantization parameter of the left encoded block for prediction since the adjacent encoded blocks on the left and upper sides are inside the same tree block.

  FIG. 18 is a flowchart illustrating the operation of the predicted quantization parameter deriving unit 114 in the second embodiment.

  First, position information of a coding block to be coded is acquired (S300). As the position information of the encoded block, the upper left position of the tree block including the encoded block is obtained from the upper left corner of the screen, and the position of the encoded block is obtained from the upper left position of the tree block. Next, it is determined whether or not the encoded block is close to the upper tree block (S301). If the encoded block is close to the upper tree block (Yes in S301), that is, if the encoded block is located at the upper end of the tree block, the upper adjacent block is included in the upper tree block. Therefore, since the tree block boundary is exceeded, the quantization block prevQP of the coding block coded before or just before the coding block to be coded is used without using the upper neighboring block for the quantization parameter prediction. QPA is set (S302).

  On the other hand, if the encoded block is not close to the upper tree block (No in S301), that is, if the upper adjacent block is located in the same tree block as the encoded block, The storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPA of the corresponding upper neighboring block is supplied to the predicted quantization parameter deriving unit 114 (S303).

  Subsequently, it is determined whether or not the encoded block is close to the left tree block (S304). If the encoded block is close to the left tree block (Yes in S304), that is, if the encoded block is located at the left end of the tree block, the left adjacent block is included in the left tree block. Therefore, the tree block boundary is crossed, so that the left neighboring block is not used for the quantization parameter prediction, and the quantization parameter prevQP of the coding block coded before or just before the coding block to be coded is set. Set to QPL (S305).

  On the other hand, if the encoded block is not adjacent to the left tree block (No in S304), that is, if the left adjacent block is located in the same tree block as the encoded block, the encoded block The storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPL of the corresponding left neighboring block is supplied to the predicted quantization parameter deriving unit 114 (S306). Finally, the average value of the quantization parameters of the adjacent blocks on the left and upper is set as the predicted quantization parameter (S307). The predicted quantization parameter calculated in this way is supplied to the differential quantization parameter generation unit 111.

  In the second embodiment, when the left and upper neighboring blocks exceed the tree block boundary, the quantization parameters of the coding blocks coded before or immediately before the coding block to be coded are encoded. Therefore, it is possible to reduce the determination process of the quantization parameter value as compared with the first embodiment.

[Example 3]
The operation of the predicted quantization parameter derivation units 114 and 205 in the third embodiment will be described. Although the encoding process will be described here, in the decoding process, the encoding is decoding, and the prediction quantization parameter deriving unit 114 to 205 and the encoding information storage memory 113 to 204 are replaced with codes. It is assumed that equivalent processing is realized by changing the output destination of the quantization parameter from the differential quantization parameter generation unit 111 to the quantization parameter generation unit 203. The difference from the first embodiment is that, when the encoding block to be encoded or decoded is close to the upper tree block, the encoding in the left tree block is already performed when it is close to the left tree block. The point is to prohibit the use of block quantization parameters for prediction. That is, the quantization parameter of the encoded block that exceeds the tree block boundary is used for prediction because the first encoding block in the tree block is preceded by the encoding block to be encoded. Or, it is limited only when the quantization parameter of the block coded immediately before is used.

  FIG. 19 shows the direction of the encoded block referred to by each encoded block in the divided tree block by a thick arrow. The solid thin line in FIG. 19 represents the encoding processing order, and the encoding block uses the quantization parameter of the encoded block that is close within the tree block including the encoding block.

  Since BLK0 located at the upper end of the tree block in FIG. 19 borders the left and upper tree blocks, only the quantization parameter of the block encoded before or immediately before the encoding block to be encoded is predicted. Used for. Since BLK1 is bounded by the upper tree block, the quantization parameter of the encoded block adjacent to the upper side is not used for prediction, and only the quantization parameter of the encoded block adjacent to the left is used for prediction. . Since BLK2 is bounded by the left tree block, the quantization parameter of the encoded block adjacent to the left is not used for prediction, and only the quantization parameter of the encoded block adjacent to the left is used for prediction. . BLK3 uses the quantization parameter of the upper encoded block and the quantization parameter of the left encoded block for prediction since the adjacent encoded blocks on the left and upper sides are inside the same tree block.

  FIG. 20 is a flowchart illustrating the operation of the predicted quantization parameter deriving unit 114 in the third embodiment. Since S400 to S403 and S407 to S411 in the flowchart of FIG. 20 are the same as S100 to S103 and S107 to S111 of FIG. Only the difference from S404 after it is determined whether or not it is determined will be described.

  After the proximity determination between the encoded block and the upper tree block, it is determined whether or not the encoded block is adjacent to the left tree block (S404). If the encoded block is close to the left tree block (Yes in S404), that is, if the encoded block is located at the left end of the tree block, the left adjacent block is included in the left tree block. Therefore, since the tree block boundary is exceeded, the left adjacent block is not used for the quantization parameter prediction. Here, focusing on the fact that the quantization parameter always takes a positive value, when the left adjacent block is not used, the quantization parameter QPL of the left adjacent block is set to 0 (S405). On the other hand, if the encoded block is not close to the left tree block (No in S404), that is, if the left adjacent block is located in the same tree block as the encoded block, the encoded block The storage area stored in the encoding information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPL of the corresponding left neighboring block is supplied to the prediction quantization parameter deriving unit 114 (S406). A predicted quantization parameter is derived from the quantization parameters of the left and upper neighboring blocks acquired in this way, and the predicted quantization parameter is supplied to the differential quantization parameter generation unit 111.

[Example 4]
The operation of the predicted quantization parameter derivation units 114 and 205 in the fourth embodiment will be described. Although the encoding process will be described here, in the decoding process, the encoding is decoding, and the prediction quantization parameter deriving unit 114 to 205 and the encoding information storage memory 113 to 204 are replaced with codes. It is assumed that equivalent processing is realized by changing the output destination of the quantization parameter from the differential quantization parameter generation unit 111 to the quantization parameter generation unit 203. In the fourth embodiment, when the encoding block to be encoded or decoded is close to the left or upper tree block, the quantization parameter of the encoded block in the left or upper tree block is used for prediction. Is prohibited. Furthermore, in principle, the quantization parameter of the encoded block adjacent to the left is used for the prediction, and if there is no encoded block adjacent to the left or located beyond the tree block boundary, the encoding is performed. The quantization parameter of the block encoded before or immediately before the target encoded block is used for prediction.

  FIG. 21 shows the direction of the encoded block referred to by each encoded block in the divided tree block by a thick arrow. The solid thin line in FIG. 21 represents the encoding processing order, and the encoding block uses the quantization parameter of the encoded block adjacent to the left inside the tree block including the encoding block in principle for prediction.

  Since BLK0 located at the upper end of the tree block in FIG. 21 is in contact with the left and upper tree blocks, the quantization parameter of the block encoded before or immediately before the encoding block to be encoded is predicted. Used for. BLK1 and BLK3 use the quantization parameter of the left encoded block for prediction because the encoded block adjacent to the left is inside the same tree block. Since BLK2 is in contact with the left tree block, the quantization parameter of the encoded block adjacent to the left is not used for prediction, and the block is encoded before or immediately before the encoding block to be encoded. Are used for prediction.

  FIG. 22 is a flowchart illustrating the operation of the predicted quantization parameter deriving unit 114 in the fourth embodiment. First, position information of a coding block to be coded is acquired (S500). As the position information of the encoded block, the upper left position of the tree block including the encoded block is obtained from the upper left corner of the screen, and the position of the encoded block is obtained from the upper left position of the tree block. Next, it is determined whether or not the encoded block is close to the left tree block (S501). If the encoded block is close to the left tree block (Yes in S501), that is, if the encoded block is located at the left end of the tree block, the left adjacent block is included in the left tree block. Therefore, the tree block boundary is crossed, so that the left neighboring block is not used for the quantization parameter prediction, and the quantization parameter prevQP of the coding block coded before or just before the coding block to be coded is set. The prediction quantization parameter is set (S502). On the other hand, if the encoded block is not close to the left tree block (No in S501), that is, if the left adjacent block is located in the same tree block as the encoded block, the encoded block The storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPL of the corresponding left neighboring block is acquired and set as the predicted quantization parameter (S503). The predicted quantization parameter derived in this way is supplied to the differential quantization parameter generation unit 111.

  In the fourth embodiment, the quantization parameter of the left adjacent block that has been encoded in the encoded block is used in principle for prediction, so that the determination process is simplified and the circuit scale is reduced compared to the previous embodiments. It becomes possible to suppress.

[Example 5]
The operation of the predicted quantization parameter derivation units 114 and 205 in the fifth embodiment will be described. Although the encoding process will be described here, in the decoding process, the encoding is decoding, and the prediction quantization parameter deriving unit 114 to 205 and the encoding information storage memory 113 to 204 are replaced with codes. It is assumed that equivalent processing is realized by changing the output destination of the quantization parameter from the differential quantization parameter generation unit 111 to the quantization parameter generation unit 203. The fifth embodiment is a combination of the first and second embodiments. When the encoding block to be encoded or decoded is close to the left tree block, the quantization parameter of the encoded block of the tree block adjacent to the left is set. Allow use for prediction. If the coded block is close to the upper tree block, it is prohibited to use the quantization parameter of the coded block in the upper tree block for prediction, and the coded block in the upper tree block is used. Instead of the quantization parameter, the quantization parameter of the block coded before or just before the coding block to be coded is used for prediction.

  In FIG. 23, the direction of the encoded block referred to by each encoded block in the divided tree block is represented by a thick arrow. The solid thin line in FIG. 23 represents the encoding process order, and the encoding block to be encoded gives priority to the adjacent encoded block over the encoded block close in the encoding process order.

  Since BLK0 and BLK1 located at the upper end of the tree block in FIG. 23 are bordered by the upper tree block, the quantization parameter of the encoded block adjacent to the upper side is not used for prediction, and encoding is performed instead. The quantization parameter of the block coded before or immediately before the target coding block and the quantization parameter of the coded block adjacent to the left are used for prediction. Since BLK2 and BLK3 have encoded blocks adjacent to each other in the same tree block, the quantization parameter of the upper encoded block and the quantization parameter of the left encoded block are used for prediction.

  The detailed operation of the predicted quantization parameter deriving unit 114 in the fifth embodiment will be described. FIG. 24 is a flowchart illustrating the operation of the predicted quantization parameter deriving unit 114 in the fifth embodiment.

  First, position information of a coding block to be coded is acquired (S600). As the position information of the encoded block, the upper left position of the tree block including the encoded block is obtained from the upper left corner of the screen, and the position of the encoded block is obtained from the upper left position of the tree block. Next, it is determined whether or not the encoded block is close to the upper tree block (S601). If the encoded block is close to the upper tree block (Yes in S601), that is, if the encoded block is located at the upper end of the tree block, the upper adjacent block is included in the upper tree block. Therefore, since the tree block boundary is exceeded, the quantization block prevQP of the coding block coded before or just before the coding block to be coded is used without using the upper neighboring block for the quantization parameter prediction. QPA is set (S602).

  On the other hand, if the encoded block is not close to the upper tree block (No in S601), that is, if the upper adjacent block is located in the same tree block as the encoded block, The storage area stored in the encoded information storage memory 113 is accessed from the upper left reference position information, and the quantization parameter QPA of the corresponding upper neighboring block is supplied to the predicted quantization parameter derivation unit 114 (S603).

  Subsequently, it is determined whether there is an encoded block adjacent to the left of the encoded block (S604). When the adjacent block exists on the left (Yes in S604), the storage area stored in the encoded information storage memory 113 is accessed from the reference position information on the upper left of the encoded block, and the quantum of the corresponding left adjacent block is determined. The quantization parameter QPL is supplied to the predicted quantization parameter deriving unit 114 (S605). If there is no left neighboring block (No in S604), the quantization parameter QPL of the left neighboring block is set to 0 (S606).

  Next, it is determined whether the quantization parameter of the left adjacent block is positive (S607). When the quantization parameter of the left neighboring block is positive (Yes in S607), since the left neighboring block exists, the average value of the quantization parameters of the left and upper neighboring blocks is set as the predicted quantization parameter (S608). . On the other hand, when the quantization parameter of the left neighboring block is not positive (No in S607), that is, the quantization parameter of the left neighboring block is 0, and the left neighboring block does not exist. In this case, QPA is used as a predictive quantization parameter (S609). The predicted quantization parameter calculated in this way is supplied to the differential quantization parameter generation unit 111.

  According to the moving picture coding apparatus of the embodiment, the quantization parameter to be coded for each block to be coded is optimized using the quantization parameter and coding information of the surrounding coded blocks. By predicting and deriving the predictive quantization parameter, and encoding the difference between the quantization parameter and the predictive quantization parameter, the coding amount of the quantization parameter is reduced and the coding is performed without changing the image quality. Efficiency can be improved.

  Further, since the encoding side and the decoding side can be implemented as a common function for predicting the quantization parameter, the circuit scale can be reduced. This is because the encoded neighboring block is a locally decoded block for prediction of the next encoded block on the encoding side and is the same as the decoded block, so there is no contradiction between the encoding side and the decoding side. As described above, the determination of the quantization parameter prediction is realized.

  In the above description, the prediction of the quantization parameter is performed in units of coding blocks. However, when the number of blocks in the tree block is increased and a large number of coding blocks having a small block size are generated, the coding block in the code amount control is used. In some cases, the assigned code amount per hit becomes too small, and the quantization parameter is not appropriately calculated. Further, it is possible to increase the amount of memory of the encoding information storage memories 113 and 204 of the moving image encoding apparatus 100 and the moving image decoding apparatus 200 that store encoding information such as quantization parameters at the time of encoding and decoding. Become. Therefore, a block called a quantization group may be newly set as a unit for encoding and transmitting the quantization parameter, and the quantization parameter may be predicted for this block unit.

  The quantization group is a block determined according to the size of the tree block, and the size is represented by a value obtained by multiplying the length of the block side of the tree block by 1 / 2n times (n is an integer of 0 or more). That is, a value obtained by shifting the length of the side of the block of the tree block to the right by n bits becomes the length of the side of the quantization group. Since this value determines the block size in the same manner as the tree block structure, it has a high affinity with the tree block. Further, since the tree block is divided into equal sizes, management and readout of the quantization parameters stored in the encoded information storage memories 113 and 204 can be simplified.

  FIG. 25 shows an example in which the inside of a tree block is divided by a tree block structure. The block size of the tree block is 64 × 64, the inside of the tree block is hierarchically divided into four, 32 × 32 blocks (dotted rectangle in FIG. 25) in the first division, and 16 × 16 blocks in the second division ( The hatched rectangle in FIG. 25 is divided into 8 × 8 block (white rectangle in FIG. 25) encoded blocks in the third division. Here, if the quantization group is a 16 × 16 rectangular block, the quantization group is represented by a thick dotted line in FIG. 25, and the quantization parameter is predicted for each quantization group.

  When the encoding block to be encoded is larger than the quantization group block size (32 × 32 blocks), for example, the inside of the encoding block represented by the dotted rectangle in FIG. 25 is divided into four by the quantization group. The Although it is divided into four by the quantization group, there is only one quantization parameter for this coding block. Therefore, when the size of the coding block is larger than the quantization group, after the prediction of the quantization parameter of the coding block Are encoded and transmitted, and the same quantization parameter is stored in the memory areas of the encoded information storage memories 113 and 204 corresponding to the respective four quantization groups. Although the quantization parameter overlaps in the memory, it becomes easy to access the quantization parameter of the surrounding encoded block in the prediction of the quantization parameter.

  When the encoding block to be encoded is the same as the block size of the quantization group (16 × 16 blocks), it is the same as the above-described prediction of the quantization parameter in units of encoding blocks.

  When the encoding block to be encoded is smaller than the quantization group block size (8 × 8 blocks), for example, the encoding block is represented by the white rectangle in FIG. 25, and four codes are included in the quantization group. Since the quantization blocks are accommodated, the coding blocks in the quantization group do not have individual quantization parameters, but have one quantization parameter in the quantization group, and each quantization parameter has an individual code. The encoded block is encoded. In addition, as a quantization parameter of the quantization group, there is a method of selecting one of the quantization parameters of the four coding blocks in the quantization group as a representative value and calculating an average value, but there is no particular limitation here.

  FIG. 26 shows an example of quantization parameter prediction when the encoded block is smaller than the quantization group block size. In FIG. 26, the hatched rectangle indicates the encoding block to be encoded, the gray rectangle indicates the encoded block used by the quantization group including the encoding block for the prediction of the quantization parameter, and the thin solid line indicates the encoding processing order. Represents. The prediction of the quantization parameter is performed with reference to the pixel position at the upper left corner of the quantization group to be processed. When the quantization parameter of the encoded block close to the top is used for prediction, the hatched rectangle in FIG. 26 is 1 for the pixel in the upper left corner of the quantization group including the encoding block to be encoded. An encoded block proximity position including pixels adjacent to each other on the pixel is calculated, and a quantization parameter stored at an address corresponding to the position is called from the encoded information storage memories 113 and 204. Similarly, when the quantization parameter of an encoded block close to the left is used for prediction, the pixel located close to the left of the upper left pixel of the quantization group including the encoding block to be encoded The position of the encoded block including the pixel is calculated, and the quantization parameter recorded at the address corresponding to the position is called from the encoded information storage memories 113 and 204. If the encoded block adjacent to the left and top of the pixel in the upper left corner of the quantization group including the encoding block to be encoded exceeds the boundary of the tree block, the encoding block before the encoding block is Since the quantization parameter of the encoded block encoded immediately before is used, the address on the memory stored when the quantization parameter is stored in the encoded information storage memories 113 and 204 by encoding is temporarily stored. Then, the quantization parameter stored at the address corresponding to the position before or immediately before the encoding block to be encoded is called from the encoding information storage memories 113 and 204. In this way, it is possible to predict the quantization parameter of the encoding block to be encoded.

  As described above, the prediction of the quantization parameter for each quantization group can be performed in the same manner as the prediction of the quantization parameter for each coding block.

  Note that the block size of the quantization group may be described directly in the header information of the bitstream, or a bit shift indicating whether to make the block size 1 / 2n times (n is an integer of 0 or more) the tree block size. An amount may be described. For example, in the header information of a picture, a quantization parameter prediction is performed in units of pictures, a flag cu_qp_delta_enable_flag that specifies whether or not to transmit the differential quantization parameter in the bitstream is defined, and the flag cu_qp_delta_enable_flag is enabled Only when it is set (set to “1”), the parameter diff_cu_qp_delta_depth for determining the size of the quantization group is described in the bitstream. The size of the quantization group is represented by a power of 2 with the value obtained by subtracting diff_cu_qp_delta_depth from the index n when the tree block size is represented by 2n. In addition, the quantization group size may be determined implicitly by encoding and decoding without being described in the bitstream.

  The moving image encoded stream output from the moving image encoding apparatus of the embodiment described above has a specific data format so that it can be decoded according to the encoding method used in the embodiment. Therefore, the moving picture decoding apparatus corresponding to the moving picture encoding apparatus can decode the encoded stream of this specific data format.

  When a wired or wireless network is used to exchange an encoded stream between a moving image encoding device and a moving image decoding device, the encoded stream is converted into a data format suitable for the transmission form of the communication path. It may be transmitted. In that case, a video transmission apparatus that converts the encoded stream output from the video encoding apparatus into encoded data in a data format suitable for the transmission form of the communication channel and transmits the encoded data to the network, and receives the encoded data from the network Then, a moving image receiving apparatus that restores the encoded stream and supplies the encoded stream to the moving image decoding apparatus is provided.

  The moving image transmitting apparatus is a memory that buffers the encoded stream output from the moving image encoding apparatus, a packet processing unit that packetizes the encoded stream, and transmission that transmits the packetized encoded data via the network. Part. The moving image receiving apparatus generates a coded stream by packetizing the received data, a receiving unit that receives the packetized coded data via a network, a memory that buffers the received coded data, and packet processing. And a packet processing unit provided to the video decoding device.

  The above processing relating to encoding and decoding can be realized as a transmission, storage, and reception device using hardware, and is stored in a ROM (Read Only Memory), a flash memory, or the like. It can also be realized by firmware or software such as a computer. The firmware program and software program can be recorded on a computer-readable recording medium, provided from a server through a wired or wireless network, or provided as a data broadcast of terrestrial or satellite digital broadcasting Is also possible.

  The present invention has been described based on the embodiments. The embodiments are exemplifications, and it will be understood by those skilled in the art that various modifications can be made to combinations of the respective constituent elements and processing processes, and such modifications are within the scope of the present invention. .

  DESCRIPTION OF SYMBOLS 100 Moving image encoding apparatus, 101 Image memory, 102 Residual signal generation part, 103 Orthogonal transformation / quantization part, 104 2nd encoding bit stream generation part, 105 Inverse quantization / inverse orthogonal transformation part, 106 Decoded image signal Superimposition unit, 107 decoded image memory, 108 predicted image generation unit, 109 activity calculation unit, 110 quantization parameter calculation unit, 111 differential quantization parameter generation unit, 112 first encoded bit string generation unit, 113 encoded information storage memory 114 Predictive quantization parameter deriving unit, 115 Encoded bit stream multiplexing unit, 200 Moving picture decoding device, 201 Bit sequence separating unit, 202 First encoded bit sequence decoding unit, 203 Quantization parameter generating unit, 204 Encoding information storage memory 205 Prediction quantization parameter deriving unit 206 second coded bit stream decoding unit, 207 inverse quantization and inverse orthogonal transform unit, 208 decoded image signal superimposing unit, 209 predicted image generation unit, 210 decoded image memory.

Claims (6)

A moving picture decoding apparatus for decoding a bit stream in which a moving picture is encoded by dividing a first block obtained by dividing each picture of a moving picture into a predetermined size into one or a plurality of second blocks. There,
A decoding unit for decoding the bitstream and extracting a differential quantization parameter of the second block;
Using the quantization parameters of the third block adjacent to the left of the second block and the fourth block adjacent to the second block, the predicted quantization parameter of the second block is derived. A predictive quantization parameter derivation unit;
A quantization parameter generation unit that generates a quantization parameter of the second block by adding the differential quantization parameter of the second block and the predicted quantization parameter;
The predictive quantization parameter derivation unit, when the third block is at a position not exceeding the boundary of the first block, sets the quantization parameter of the third block as the first quantization parameter; When the position is beyond the boundary of the first block, the quantization parameter of the fifth block decoded before the second block is set as the first quantization parameter, and the fourth block is When it is in a position that does not exceed the boundary of the first block, the quantization parameter of the fourth block is set as the second quantization parameter, and when it is in a position beyond the boundary of the first block, , Using the first quantization parameter and the second quantization parameter as the second quantization parameter as the quantization parameter of the fifth block, and the prediction amount of the second block Video decoding apparatus characterized by deriving a parameter.   The moving picture decoding apparatus according to claim 1, wherein the predicted quantization parameter deriving unit uses an average value of the first quantization parameter and the second quantization parameter as a predicted quantization parameter.   3. The moving picture decoding apparatus according to claim 1, wherein the size information of the second block is extracted from a bit stream and set as the size of the second block. 4. A moving picture decoding apparatus that further divides a block obtained by dividing each picture of a moving picture by a predetermined size into one or a plurality of coding blocks and decodes a bit stream in which the moving picture is coded in units of coding blocks. Because
A decoding unit that decodes the bitstream in units of decoding blocks and extracts differential quantization parameters of the decoding blocks;
A predictive quantization parameter deriving unit for deriving a predictive quantization parameter of the decoded block according to a prediction mode of the decoded block using a quantization parameter of a decoded adjacent block adjacent to the decoded block;
A quantization parameter generating unit that generates a quantization parameter of the decoded block by adding the difference quantization parameter of the decoded block and the predicted quantization parameter;
The predictive quantization parameter deriving unit is different from the adjacent block adjacent in the predetermined direction when the adjacent block adjacent to the decoded block in a predetermined direction is located beyond the boundary of the block of the predetermined size A moving picture decoding apparatus characterized by deriving a predicted quantization parameter of the decoded block using a quantization parameter of another decoded block. A moving picture decoding method for decoding a bit stream in which a moving picture is encoded by dividing a first block obtained by dividing each picture of a moving picture by a predetermined size into one or a plurality of second blocks. There,
A decoding step of decoding the bitstream to extract a differential quantization parameter of the second block;
Using the quantization parameters of the third block adjacent to the left of the second block and the fourth block adjacent to the second block, the predicted quantization parameter of the second block is derived. A predictive quantization parameter derivation step;
A quantization parameter generating step of generating a quantization parameter of the second block by adding the differential quantization parameter of the second block and the predicted quantization parameter;
The predictive quantization parameter derivation step uses the quantization parameter of the third block as the first quantization parameter when the third block is in a position not exceeding the boundary of the first block; When the position is beyond the boundary of the first block, the quantization parameter of the fifth block decoded before the second block is set as the first quantization parameter, and the fourth block is When it is in a position that does not exceed the boundary of the first block, the quantization parameter of the fourth block is set as the second quantization parameter, and when it is in a position beyond the boundary of the first block, , The quantization parameter of the fifth block is set as a second quantization parameter, and the first block and the second quantization parameter are used to Video decoding method characterized by deriving a Sokuryoko parameter. A moving picture decoding program for decoding a bit stream in which a moving picture is encoded by dividing a first block obtained by dividing each picture of a moving picture into a predetermined size into one or a plurality of second blocks. There,
A decoding step of decoding the bitstream to extract a differential quantization parameter of the second block;
Using the quantization parameters of the third block adjacent to the left of the second block and the fourth block adjacent to the second block, the predicted quantization parameter of the second block is derived. A predictive quantization parameter derivation step;
Causing the computer to execute a quantization parameter generation step of generating a quantization parameter of the second block by adding the differential quantization parameter of the second block and the predicted quantization parameter;
The predictive quantization parameter derivation step uses the quantization parameter of the third block as the first quantization parameter when the third block is in a position not exceeding the boundary of the first block; When the position is beyond the boundary of the first block, the quantization parameter of the fifth block decoded before the second block is set as the first quantization parameter, and the fourth block is When it is in a position that does not exceed the boundary of the first block, the quantization parameter of the fourth block is set as the second quantization parameter, and when it is in a position beyond the boundary of the first block, , The quantization parameter of the fifth block is set as a second quantization parameter, and the first block and the second quantization parameter are used to To derive the Sokuryoko parameter,
A moving picture decoding program characterized by the above.

Images