JP6229806B2 - Moving picture decoding apparatus, moving picture decoding method, moving picture decoding program, receiving apparatus, receiving method, and receiving program - Google Patents

Description

The present invention relates to a moving picture decoding technique, and more particularly to a moving picture decoding technique using motion compensated prediction.

As a typical moving image compression encoding method, MPEG-4 AVC / H. There are H.264 standards. MPEG-4 AVC / H. In H.264, motion compensation is used in which a picture is divided into a plurality of rectangular blocks, a picture that has already been encoded / decoded is used as a reference picture, and motion from the reference picture is predicted. This method of predicting motion by motion compensation is called inter prediction or motion compensated prediction. MPEG-4 AVC / H. In the inter prediction in H.264, a plurality of pictures can be used as reference pictures, and the most suitable reference picture is selected for each block from the plurality of reference pictures to perform motion compensation. Therefore, a reference index is assigned to each reference picture, and the reference picture is specified by this reference index. For B pictures, a maximum of two pictures can be selected from decoded reference pictures and used for inter prediction. The predictions from these two reference pictures are distinguished as L0 prediction (list 0 prediction) mainly used as forward prediction and L1 prediction (list 1 prediction) mainly used as backward prediction.

Furthermore, bi-prediction using two inter predictions of L0 prediction and L1 prediction at the same time is also defined. In the case of bi-prediction, bi-directional prediction is performed, the inter-predicted signals of L0 prediction and L1 prediction are multiplied by a weighting coefficient, an offset value is added and superimposed, and a final inter-predicted image signal is obtained. Generate. As weighting coefficients and offset values used for weighted prediction, representative values are set for each reference picture in each list and encoded. The encoding information related to inter prediction includes, for each block, a prediction mode for distinguishing between L0 prediction and L1 prediction and bi-prediction, a reference index for specifying a reference picture for each reference list for each block, and a moving direction and a moving amount of the block. There is a motion vector that expresses and encodes and decodes the encoded information.

Furthermore, MPEG-4 AVC / H. H.264 defines a direct mode for generating inter prediction information of a block to be encoded or decoded from inter prediction information of a decoded block. Since direct mode does not require encoding of inter prediction information,
Encoding efficiency is improved.

The temporal direct mode using the correlation of inter prediction information in the time direction will be described with reference to FIG. A picture whose reference index of L1 is registered as 0 is a standard picture
colPic. A block in the same position as the block to be encoded or decoded in the reference picture colPic is set as a reference block.

If the reference block is encoded using the L0 prediction, the L0 motion vector of the reference block is the reference motion vector mvCol, the reference block is not encoded using the L0 prediction, and is encoded using the L1 prediction. If this is the case, the L1 motion vector of the reference block is set as the reference motion vector mvCol. The picture referred to by the reference motion vector mvCol is the L0 reference picture in the temporal direct mode, and the reference picture colPic is the L1 reference picture in the temporal direct mode.

Time direct mode L0 by scaling operation from reference motion vector mvCol
Motion vector mvL0 and motion vector mvL1 of L1 are derived.

From the POC of the reference picture colPic, the PO of the reference picture of L0 in the temporal direct mode
The inter-picture distance td is derived by subtracting C. Note that POC is a variable associated with the picture to be encoded, and is set to a value that increases by 1 in the picture output order. The difference in POC between two pictures indicates the inter-picture distance in the time axis direction.
td = POC of base picture colPic-P of L0 reference picture in temporal direct mode
OC

The inter-picture distance tb is derived by subtracting the POC of the L0 reference picture in the temporal direct mode from the POC of the picture to be encoded or decoded.
tb = POC of picture to be encoded or decoded-POC of reference picture of L0 in temporal direct mode

Time direct mode L0 by scaling operation from reference motion vector mvCol
The motion vector mvL0 is derived.
mvL0 = tb / td * mvCol

The motion vector mvL1 of L1 is derived by subtracting the reference motion vector mvCol from the motion vector mvL0 of L0 in the temporal direct mode.
mvL1 = mvL0-mvCol

JP 2004-129191 A

However, in the conventional method, for the block to be encoded and decoded, the prediction accuracy is reduced and the encoding efficiency may not be improved in the time direct.

Under such circumstances, the present inventors have come to recognize the necessity of further compressing the encoded information and reducing the overall code amount in the moving image encoding method using motion compensation prediction.

The present invention has been made in view of such a situation, and an object of the present invention is to obtain a moving picture decoding technique that improves encoding efficiency by reducing the amount of encoded information by calculating encoding information candidates. Is to provide.

A moving picture decoding apparatus for decoding a coded bit string in which a coded block obtained by dividing each picture into divided one or a plurality of prediction blocks and coding a moving picture by intra prediction or inter prediction in units of the prediction blocks. First prediction information for performing derivation processing of one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded. Derivation unit and derivation of second inter prediction information candidate from inter prediction information of second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded A second prediction information deriving unit that performs processing; and when the first inter prediction information candidate is derived, the derived first first When the second inter prediction information candidate is derived from the second inter prediction information candidate, a prediction information candidate list is constructed that includes the second inter prediction information candidate thus derived and the predetermined prediction information candidates. The encoded block is a block in which a tree block obtained by dividing each picture in units of rectangles is divided into one or four hierarchically, and the first prediction information deriving unit includes: The second inter prediction information candidate derivation process is performed without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded, and the second The prediction information deriving unit is a division mode in which the encoded block is divided into 1: 1, 1: 3, or 3: 1 vertically by the upper block and the lower block. The reference index is set with the reference index value of the second inter prediction information candidate as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block to be decoded. Based on the above, the second inter prediction information candidate derivation process is performed, and the coding block is divided into 1: 1, 1: 3, or 3: 1 left and right by the left block and the right block Then, without referring to the encoding information of the fifth block included in the encoded block including the prediction block to be decoded, the reference index value of the second inter prediction information candidate is set as a default value, and There is provided a moving picture decoding apparatus characterized in that the second inter prediction information candidate derivation process is performed based on a reference index.
A moving picture decoding method for decoding a coded bit string in which a coded block in which each picture is divided is divided into one or a plurality of prediction blocks and a moving picture is coded by intra prediction or inter prediction in units of the prediction blocks. First prediction information for performing derivation processing of one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded. Derivation step and derivation of second inter prediction information candidate from inter prediction information of second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded A second prediction information deriving step for performing processing, and when the first inter prediction information candidate is derived, In addition, when the second inter prediction information candidate is derived from the first inter prediction information candidate, the prediction information includes predetermined prediction information candidates obtained by adding the derived second inter prediction information candidate. A candidate list construction step of constructing a candidate list, wherein the encoded block is a block obtained by dividing each picture into one or two hierarchically divided tree blocks, and the first prediction information In the derivation step, the first inter prediction information candidate derivation process is performed without referring to the coding information of the third block included in the same coding block as the coding block including the prediction block to be decoded. In addition, the second prediction information derivation step includes 1: 1, 1: 3, and up and down of the encoded block in the upper block and the lower block. The reference index of the second inter prediction information candidate without referring to the encoding information of the fourth block included in the encoded block including the prediction block to be decoded in the division mode of 3: 1 division As a default value, the second inter prediction information candidate derivation process is performed based on the reference index, and the coding block is 1: 1 left and right in the left block and the right block, 1: In the division mode dividing into 3 or 3: 1, without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be decoded, the second inter prediction information candidate A derivation process of the second inter prediction information candidate is performed based on the reference index with a reference index value as a default value. An image decoding method is provided.
A moving picture decoding program for decoding a coded bit string in which a coded block in which each picture is divided is divided into one or a plurality of prediction blocks and a moving picture is coded by intra prediction or inter prediction in units of the prediction blocks. First prediction information for performing derivation processing of one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded. Derivation step and derivation of second inter prediction information candidate from inter prediction information of second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded A second prediction information deriving step for performing processing, and when the first inter prediction information candidate is derived, When the second inter prediction information candidate is derived from the first inter prediction information candidate that has been issued, the second inter prediction information candidate is composed of predetermined prediction information candidates added to the second inter prediction information candidate. A candidate list construction step of constructing a prediction information candidate list, and the encoding block is a block obtained by dividing a tree block obtained by dividing each picture into units of rectangles into one or four hierarchically, and In the first prediction information derivation step, the first inter prediction information candidate is determined without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded. In addition to performing a derivation process, the second prediction information derivation step includes dividing the encoded block into an upper block and a lower block. Without referring to the encoding information of the fourth block included in the encoded block including the prediction block to be decoded in the division mode in which it is divided into 1: 1, 1: 3 or 3: 1 below, Based on the reference index, the second inter prediction information candidate derivation process is performed using the reference index value of the second inter prediction information candidate as a default value, and the coding block is divided into a left block and a right block. In the division mode in which the left and right are 1: 1, 1: 3, or 3: 1, the encoding information of the fifth block included in the encoding block including the prediction block to be decoded is not referred to. In addition, the second inter prediction information candidate derivation process based on the reference index using the value of the reference index of the second inter prediction information candidate as a default value. A moving picture decoding program is provided.
Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. A received signal, a packet processor that processes the received encoded data to generate an encoded stream, and a prediction block that is a decoding target in a picture that is a decoding target in the encoded stream. A first prediction information deriving unit that performs a process of deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to each other; and the picture in a picture different from the picture to be decoded, From the inter prediction information of the second block existing at or near the same position as the prediction block to be decoded. A second prediction information deriving unit that performs a process of deriving an inter prediction information candidate; and when the first inter prediction information candidate is derived, the derived first inter prediction information candidate is converted to the second inter prediction information candidate. A candidate list constructing unit that constructs a prediction information candidate list including predetermined prediction information candidates obtained by adding the derived second inter prediction information candidates when the information candidates are derived; The coded block is a block obtained by dividing a tree block obtained by dividing each picture into rectangular units into one or hierarchically divided into four, and the first prediction information deriving unit includes the prediction block including the prediction block to be decoded The derivation process of the first inter prediction information candidate is performed without referring to the coding information of the third block included in the same coding block as the block, and 2 Prediction information deriving unit is a prediction block to be decoded in a division mode in which the encoded block is vertically divided into 1: 1, 1: 3, or 3: 1 by an upper block and a lower block. The reference value of the second inter prediction information candidate is set as a default value without referring to the encoded information of the fourth block included in the encoded block including the second block, based on the reference index, the second Inter prediction information candidate derivation processing is performed, and the coding block is the decoding target in the division mode in which the left block and the right block are divided 1: 1, 1: 3, or 3: 1 left and right. The reference index value of the second inter prediction information candidate is set to the default value without referring to the encoding information of the fifth block included in the encoding block including the prediction block. As a receiving device, the second inter prediction information candidate derivation process is performed based on the reference index.
Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. Receiving step, packet processing step for processing the received encoded data to generate an encoded stream, and a prediction block to be decoded in a picture to be decoded in the encoded stream. A first prediction information derivation step for deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to each other; and the picture in a picture different from the picture to be decoded, In the second block existing at or near the same position as the prediction block to be decoded A second prediction information derivation step for deriving a second inter prediction information candidate from the prediction information; and when the first inter prediction information candidate is derived, the derived first inter prediction information candidate is When the second inter prediction information candidate is derived, a candidate list construction step of constructing a prediction information candidate list made up of predetermined prediction information candidates obtained by adding the derived second inter prediction information candidates, respectively. The encoded block is a block obtained by dividing a tree block obtained by dividing each picture into units of rectangles into one or hierarchically four blocks, and the first prediction information derivation step is the decoding target. The first inter prediction information without referring to the coding information of the third block included in the same coding block as the coding block including the prediction block. In addition to performing candidate derivation processing, the second prediction information derivation step is a division in which the encoded block is vertically divided into 1: 1, 1: 3, or 3: 1 by an upper block and a lower block. In mode, without referring to the encoding information of the fourth block included in the encoded block including the prediction block to be decoded, the reference index value of the second inter prediction information candidate as a default value, The second inter prediction information candidate derivation process is performed based on the reference index, and the coding block is divided into 1: 1, 1: 3, or 3: 1 left and right by the left block and the right block. The second inter prediction information without referring to the encoding information of the fifth block included in the encoded block including the prediction block to be decoded. There is provided a receiving method characterized in that a second inter prediction information candidate derivation process is performed based on a reference index value of a report candidate as a default value based on the reference index.
Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. Receiving step, packet processing step for processing the received encoded data to generate an encoded stream, and a prediction block to be decoded in a picture to be decoded in the encoded stream. A first prediction information derivation step for deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to each other; and the picture in a picture different from the picture to be decoded, In the second block existing at or near the same position as the prediction block to be decoded A second prediction information derivation step for deriving a second inter prediction information candidate from the prediction information; and when the first inter prediction information candidate is derived, the derived first inter prediction information candidate is When the second inter prediction information candidate is derived, a candidate list construction step of constructing a prediction information candidate list made up of predetermined prediction information candidates obtained by adding the derived second inter prediction information candidates, respectively. And the encoded block is a block obtained by dividing a tree block obtained by dividing each picture into units of rectangles into one or hierarchically four blocks, and the first prediction information derivation step includes the decoding target Without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be In addition to performing a process of deriving one inter prediction information candidate, the second prediction information deriving step includes 1: 1, 1: 3, or 3: 1 in the upper and lower blocks of the encoded block. The reference index value of the second inter prediction information candidate is determined without referring to the encoding information of the fourth block included in the encoded block including the prediction block to be decoded. Based on the reference index, the second inter prediction information candidate derivation process is performed as a default value, and the coding block is 1: 1, 1: 3, or 3 left and right in the left block and the right block. In the division mode of dividing into 1: without referring to the encoding information of the fifth block included in the encoded block including the prediction block to be decoded, There is provided a receiving program characterized in that the second inter prediction information candidate derivation process is performed based on the reference index with a reference index value of a second inter prediction information candidate as a default value.

It should be noted that any combination of the above-described constituent elements and the expression of the present invention converted 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 reduce the amount of generated code of encoded information to be transmitted and improve the encoding efficiency.

It is a block diagram which shows the structure of the moving image encoder which performs the motion vector prediction method which concerns on embodiment. It is a block diagram which shows the structure of the moving image decoding apparatus which performs the motion vector prediction method which concerns on embodiment. It is a figure explaining a tree block and an encoding block. It is a figure explaining the division mode of a prediction block. It is a figure explaining the prediction block which adjoins to the prediction block of the process target by the spatial merge candidate in merge mode. It is a figure explaining the prediction block which adjoins to the prediction block of the process target by the spatial merge candidate in merge mode. It is a figure explaining the prediction block which adjoins to the prediction block of the process target by the spatial merge candidate in merge mode. It is a figure explaining the prediction block which adjoins to the prediction block of the process target by the spatial merge candidate in merge mode. It is a figure explaining the prediction block referred in the time of derivation | leading-out of the time merge candidate in merge mode. It is a figure explaining the syntax of the bit stream in the slice level regarding merge mode. It is a figure explaining the syntax of the bit stream in the prediction block level regarding merge mode. It is a figure explaining an example of the entropy code | symbol of the syntax element of a merge index. It is a block diagram which shows the detailed structure of the inter prediction information derivation | leading-out part of the moving image encoder of FIG. It is a block diagram which shows the detailed structure of the inter prediction information derivation | leading-out part of the moving image decoding apparatus of FIG. It is a figure explaining the prediction block adjacent to the prediction block of the process target in merge mode. It is a flowchart explaining the process sequence of the sequential process of merge candidate derivation | leading-out and the merge candidate list construction process. It is a flowchart explaining the processing procedure of the parallel processing of merge candidate derivation | leading-out and the merge candidate list construction processing. It is a flowchart explaining a merge candidate derivation process in merge mode and a merge candidate list construction process. It is a flowchart explaining the space merge candidate derivation | leading-out process of merge mode. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 1 of this Embodiment. 10 is a flowchart for explaining a reference index derivation processing procedure for temporal merge candidates in the merge mode according to the method of the first embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 2 of this Embodiment. 12 is a flowchart for explaining a reference index derivation processing procedure of a temporal merge candidate in a merge mode according to the method of the second embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 3 of this Embodiment. 10 is a flowchart for explaining a reference index derivation processing procedure for temporal merge candidates in a merge mode according to the method of the third embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 4 of this Embodiment. 15 is a flowchart for describing a reference index derivation processing procedure for temporal merge candidates in the merge mode according to the method of the fourth embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 5 of this Embodiment. FIG. 10 is a flowchart for describing a reference index derivation processing procedure for a merged time temporal merge candidate according to the method of the fifth embodiment. 22 is a flowchart for describing a reference index derivation processing procedure for temporal merge candidates in the merge mode according to the method of the sixth embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 7 of this Embodiment. FIG. 25 is a flowchart for describing a procedure for deriving a reference index of a merge mode temporal merge candidate according to the method of the seventh embodiment. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the encoding block of a NxN division | segmentation. It is a flowchart explaining the time merge candidate derivation | leading-out process procedure of merge mode. It is a flowchart explaining the derivation | leading-out process procedure of the picture of the time from which merge mode differs. It is a flowchart explaining the derivation | leading-out process procedure of the prediction block of the picture of the time from which merge mode differs. It is a flowchart explaining the time merge candidate derivation | leading-out process procedure of merge mode. It is a flowchart explaining the time merge candidate derivation | leading-out process procedure of merge mode. It is a flowchart explaining the scaling calculation processing procedure of a motion vector. It is a flowchart explaining the scaling calculation processing procedure of a motion vector. It is a flowchart explaining the construction process procedure of the merge candidate list | wrist of merge mode. Conventional MPEG-4 AVC / H. It is a figure explaining the H.264 time direct mode. It is a figure explaining the adjacent block referred in the derivation | leading-out process of the reference index of the time merge candidate in Example 8 of this Embodiment. FIG. 30 is a flowchart for describing a reference index derivation process procedure for a temporal merge candidate in the merge mode according to the method of the eighth embodiment.

In the present embodiment, with regard to moving picture coding, in particular, to improve coding efficiency in moving picture coding in which a picture is divided into rectangular blocks of an arbitrary size and shape and motion compensation is performed in units of blocks between pictures. In addition, a plurality of predicted motion vectors are derived from the motion vectors of a block adjacent to the encoding target block or a block of an encoded picture, and a difference vector between the motion vector of the encoding target block and the selected prediction motion vector The amount of code is reduced by calculating and encoding. Alternatively, the coding amount is reduced by deriving the coding information of the coding target block by using the coding information of the block adjacent to the coding target block or the block of the coded picture. Also, in the case of decoding a moving image, a plurality of predicted motion vectors are calculated from the motion vectors of a block adjacent to the decoding target block or a block of a decoded picture, and selected from the difference vector decoded from the encoded stream The motion vector of the decoding target block is calculated from the predicted motion vector and decoded. Alternatively, the encoding information of the decoding target block is derived by using the encoding information of the block adjacent to the decoding target block or the block of the decoded picture.

  First, techniques used in the present embodiment and technical terms are defined.

(About tree blocks and coding blocks)
In the embodiment, as shown in FIG. 3, the picture is equally divided into square units of any same size. This unit is defined as a tree block, and is a block to be encoded or decoded in a picture (a block to be encoded in the encoding process and a block to be decoded in the decoding process. Hereinafter, unless otherwise noted, It is used as a basic unit of address management for specifying. Except for monochrome, the tree block is composed of one luminance signal and two color difference signals. The size of the tree block can be freely set to a power of 2 depending on the picture size and the texture in the picture. In order to optimize the encoding process according to the texture in the picture, the tree block divides the luminance signal and chrominance signal in the tree block hierarchically into four parts (two parts vertically and horizontally) as necessary,
The block can be made smaller in block size. Each block is defined as a coding block, and is a basic unit of processing when performing coding and decoding. Except for monochrome, the coding block is also composed of one luminance signal and two color difference signals. The maximum size of the coding block is the same as the size of the tree block. An encoded block having the minimum size of the encoded block is called a minimum encoded block, and can be freely set to a power of 2.

In FIG. 3, the encoding block A is a single encoding block without dividing the tree block. The encoding block B is an encoding block formed by dividing a tree block into four. The coding block C is a coding block obtained by further dividing the block obtained by dividing the tree block into four. Encoding block D is a tree block of 4
It is an encoded block that is obtained by further dividing the block obtained by dividing into four hierarchically twice.
It is a coding block of the minimum size.

(About prediction mode)
Encoded or decoded within the picture to be encoded or decoded in units of coding blocks (in the encoding process, the encoded signal is used for a decoded picture, a prediction block, an image signal, etc., and the decoded picture in the decoding process) Used for prediction blocks, image signals, etc.
Unless otherwise noted, it is used in this sense. ) Intra prediction that predicts from surrounding image signals (
MODE_INTRA) and inter prediction (MODE_INTER) for performing prediction based on an encoded or decoded picture signal. This intra prediction (MODE_INTRA) and inter prediction (MO
A mode for identifying (DE_INTER) is defined as a prediction mode (PredMode). Prediction mode (PredMo
de) has intra prediction (MODE_INTRA) or inter prediction (MODE_INTER) as a value, and can be selected and encoded.

(About split mode, prediction block, prediction unit)
Intra-prediction (MODE_INTRA) and inter-prediction (MODE)
When performing (_INTER), in order to reduce the unit for switching between the intra prediction method and the inter prediction method, prediction is performed by dividing the coded block as necessary. A mode for identifying the division method of the luminance signal and the color difference signal of the coding block is defined as a division mode (PartMode). Furthermore, this divided block is defined as a prediction block. As shown in FIG. 4, eight types of partition modes (PartMode) are defined according to the method of dividing the luminance signal of the coding block.

A division mode (PartMode) that is regarded as one prediction block without dividing the luminance signal of the encoded block shown in FIG. 4A is defined as 2N × 2N division (PART_2Nx2N). 4 (b) and (c
) And (d) are divided into 2N × N divisions (PART_2NxN) and 2N × nU divisions (PART_), respectively, for dividing the luminance signal of the coding block shown in FIG.
2NxnU) and 2N × nD division (PART_2NxnD). However, 2N × N division (PART_2NxN
) Is a split mode divided up and down at a ratio of 1: 1, 2N x nU split (PART_2NxnU) is a split mode split up and down at a ratio of 1: 3, and 2N x nD split (PART_2NxnD) is This is a division mode divided at a ratio of 3: 1. Partition mode (PartMode) for dividing the luminance signal of the coding block shown in FIGS. 4E, 4F, and 4G into two prediction blocks arranged on the left and right
Are defined as N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), respectively. However, N × 2N division (PART_Nx2N) is a division mode in which left and right are divided at a ratio of 1: 1, and nL × 2N division (PART_nLx2N) is a division mode in which division is performed at a ratio of 1: 3 in the left and right, and nR × 2N division (PART_nRx2N) is a division mode in which the image is divided in the ratio of 3: 1 to the left and right. The division mode (PartMode) in which the luminance signal of the coding block shown in FIG. 4 (h) is divided into four parts in the vertical and horizontal directions and defined as four prediction blocks is defined as N × N division (PART_NxN).

Note that the color difference signal is also divided in the same manner as the vertical and horizontal division ratios of the luminance signal for each division mode (PartMode).

In order to specify each prediction block within the coding block, a number starting from 0 is assigned to the prediction block existing inside the coding block in the coding order. This number is defined as a split index PartIdx. A number described in each prediction block of the encoded block in FIG. 4 represents a partition index PartIdx of the prediction block. FIG.
), (C), (d) 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU)
In 2N × nD partition (PART_2NxnD), the partition index PartIdx of the upper prediction block is set to 0
And the division index PartIdx of the lower prediction block is set to 1. 4 (e), (f),
N × 2N division (PART_Nx2N), nL × 2N division (PART_nLx2N), nR × 2N shown in (g)
In the division (PART_nRx2N), the division index PartIdx of the left prediction block is set to 0, and the division index PartIdx of the right prediction block is set to 1. N × N division (PART_) shown in FIG.
NxN), the partition index PartIdx of the upper left prediction block is set to 0, the partition index PartIdx of the upper right prediction block is set to 1, and the partition index PartIdx of the lower left prediction block is set to 1.
Is set to 2, and the division index PartIdx of the prediction block on the lower right is set to 3.

When the prediction mode (PredMode) is inter prediction (MODE_INTER), the split mode (PartMode)
Is 2N x 2N split (PART_2Nx2N), 2N x N split (PART_2NxN), 2N x nU split (PART_
2NxnU), 2N × nD partition (PART_2NxnD), N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N). Only coding block D, which is the smallest coding block, has a partition mode (PartMode) of 2N × 2N (PART_2Nx2N)
2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), 2N × nD partition (PART_
2NxnD), N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N
Although N × N division (PART_NxN) can be defined in addition to division (PART_nRx2N), in this embodiment, it is assumed that the division mode (PartMode) does not define N × N division (PART_NxN).

When the prediction mode (PredMode) is intra prediction (MODE_INTRA), the partition mode (PartMode) is 2N × 2N partition (PART_2Nx2N) except for the coding block D which is the smallest coding block.
Only encoding block D, which is the smallest encoding block,
Mode) defines N × N division (PART_NxN) in addition to 2N × 2N division (PART_2Nx2N). The reason why N × N division (PART_NxN) is not defined other than the smallest coding block is that, except for the smallest coding block, the coding block can be divided into four to represent a small coding block.

(Position of tree block, coding block, prediction block, transform block)
The position of each block including the tree block, the encoding block, the prediction block, and the conversion block of the present embodiment is the origin (
0,0), and the pixel position of the upper left luminance signal included in each block area is represented by two-dimensional coordinates (x, y). The direction of the coordinate axis is a right direction in the horizontal direction and a downward direction in the vertical direction, respectively, and the unit is one pixel unit of the luminance signal. Of course, the luminance signal and the color difference signal have the same image size (number of pixels) and the color difference format is 4: 4: 4. Of course, the luminance signal and the color difference signal have a different color size format of 4: 4. 2:
Even in the case of 0, 4: 2: 2, the position of each block of the color difference signal is represented by the coordinates of the pixel of the luminance signal included in the block area, and the unit is one pixel of the luminance signal. In this way, not only can the position of each block of the color difference signal be specified, but also the relationship between the positions of the luminance signal block and the color difference signal block can be clarified only by comparing the coordinate values.

(Inter prediction mode, reference list)
In the embodiment of the present invention, in inter prediction in which prediction is performed from an image signal of a decoded picture, a plurality of decoded pictures can be used as reference pictures. In order to identify a reference picture selected from a plurality of reference pictures, a reference index is attached to each prediction block. In B slice, any two reference pictures can be selected for each prediction block, and inter prediction can be performed. As inter prediction modes, L0 prediction (Pred_L0), L
There are 1 prediction (Pred_L1) and bi-prediction (Pred_BI). The reference picture is managed by L0 (reference list 0) and L1 (reference list 1) of the list structure, and the reference picture can be specified by specifying the reference index of L0 or L1. L0 prediction (Pred_L0) is inter prediction that refers to a reference picture managed in L0, and L1 prediction (Pred_L1) is L
Inter prediction that refers to a reference picture managed in 1, and bi-prediction (Pred_BI) is performed both in L0 prediction and L1 prediction, and refers to one reference picture managed in each of L0 and L1. Inter prediction. Only L0 prediction can be used in inter prediction of P slice, and L0 prediction, L1 prediction, and bi-prediction (Pred_BI) that averages or weights and adds L0 prediction and L1 prediction can be used in inter prediction of B slice. In the subsequent processing, it is assumed that the constants and variables with the subscript LX in the output are processed for each of L0 and L1.

(Merge mode, merge candidate)
In the merge mode, the prediction mode of the prediction block to be encoded or decoded, the inter prediction information such as the reference index and the motion vector is not encoded or decoded, but within the same picture as the prediction block to be encoded or decoded. Prediction block close to the prediction block to be encoded or decoded, or the same position as or near the prediction block to be encoded or decoded of a decoded picture that is temporally different from the prediction block to be encoded or decoded (neighboring In this mode, the inter prediction is performed by deriving the inter prediction information of the prediction block to be encoded or decoded from the inter prediction information of the prediction block existing at the position. A prediction block close to the prediction block to be encoded or decoded in the same picture as the prediction block to be encoded or decoded and inter prediction information of the prediction block are spatial merge candidates, a prediction block to be encoded or decoded, and time Prediction information derived from a prediction block existing at the same position as or near (previously near) a prediction block to be encoded or decoded of a differently encoded or decoded picture and inter prediction information of the prediction block Are time merge candidates. Each merge candidate is registered in the merge candidate list, and the merge candidate used in the inter prediction is specified by the merge index.

(About adjacent prediction blocks)
5, 6, 7, and 8 illustrate the encoding or decoding within the same picture as the prediction block to be encoded or decoded that is referenced when the spatial merge candidate is derived and the reference index of the temporal merge candidate is derived. It is a figure explaining the prediction block adjacent to the prediction block of object.
FIG. 9 illustrates the same position as the prediction block to be encoded or decoded in a picture that has been encoded or decoded that is temporally different from the prediction block to be encoded or decoded that is referred to when the reference index of the temporal merge candidate is derived It is a figure explaining the prediction block already encoded or decoded which exists in the vicinity. A prediction block that is close in the spatial direction of a prediction block to be encoded or decoded and a prediction block at the same position at different times will be described with reference to FIGS. 5, 6, 7, 8, and 9. FIG.

As shown in FIG. 5, a prediction block A close to the left side of the prediction block to be encoded or decoded in the same picture as the prediction block to be encoded or decoded, a prediction block B close to the upper side, A prediction block C that is close to the upper right vertex, a prediction block D that is close to the lower left vertex, and a prediction block E that is close to the upper left vertex are defined as prediction blocks close to the spatial direction.

In addition, as shown in FIG. 6, when the size of the prediction block adjacent to the left side of the prediction block to be encoded or decoded is smaller than the prediction block to be encoded or decoded and there are a plurality of prediction blocks, this embodiment In the embodiment, the lowest prediction block A10 among the prediction blocks close to the left side is assumed to be the prediction block A close to the left side.

Similarly, when the size of the prediction block adjacent to the upper side of the prediction block to be encoded or decoded is smaller than the prediction block to be encoded or decoded and there are a plurality of prediction blocks, the left side in the present embodiment The rightmost prediction block B10 among the prediction blocks adjacent to is assumed to be the prediction block B1 adjacent to the upper side.

In addition, as shown in FIG. 7, even when the size of the prediction block F adjacent to the left side of the prediction block to be encoded or decoded is larger than the prediction block to be encoded or decoded, it is close to the left side according to the above condition. If the prediction block A is close to the left side of the prediction block to be encoded or decoded, the prediction block A is determined. If the prediction block A is close to the lower left vertex of the prediction block to be encoded or decoded, the prediction block D is determined. If it is close to the top left vertex of the prediction block to be encoded or decoded, the prediction block E is determined. In the example of FIG. 6, the prediction block A,
The prediction block E and the prediction block E are the same prediction block.

In addition, as shown in FIG. 8, even when the size of the prediction block G adjacent to the upper side of the prediction block to be encoded or decoded is larger than the prediction block to be encoded or decoded, the size is close to the upper side according to the above condition. When the prediction block G is close to the upper side of the prediction block to be encoded or decoded, the prediction block B is used. When the prediction block G is close to the upper right vertex of the prediction block to be encoded or decoded, the prediction block C is set. If it is close to the top left vertex of the prediction block to be encoded or decoded, the prediction block E is determined. In the example of FIG. 8, the prediction block B,
The prediction block C and the prediction block E are the same prediction block.

As shown in FIG. 9, in a decoded picture that is temporally different from a prediction block to be encoded or decoded, an already encoded or decoded image that exists at or near the same position as the prediction block to be encoded or decoded Prediction blocks T0 and T1 are defined as prediction blocks at the same position at different times.

(About POC)
POC is a variable associated with the picture to be encoded, and is set to a value that increases by 1 in the picture output order. Depending on the POC value, it can be determined whether they are the same picture
It is possible to determine the front-to-back relationship between pictures in the output order and to derive the distance between pictures. For example, if the POCs of two pictures have the same value, it can be determined that they are the same picture. When the POCs of two pictures have different values, it can be determined that the picture with the smaller POC value is the picture output first, and the difference between the POCs of the two pictures indicates the inter-picture distance in the time axis direction. Show.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a moving picture coding apparatus according to an embodiment of the present invention. The moving image encoding apparatus according to the embodiment includes an image memory 101, a motion vector detection unit 102, a difference motion vector calculation unit 103, an inter prediction information derivation unit 104, a motion compensation prediction unit 105, an intra prediction unit 106, and a prediction method determination unit. 1
07, residual signal generation unit 108, orthogonal transform / quantization unit 109, first encoded bit sequence generation unit 110, second encoded bit sequence generation unit 111, multiplexing unit 112, inverse quantization / inverse orthogonal transform unit 113, a decoded image signal superimposing unit 114, an encoded information storage memory 115, and a decoded image memory 116.

The image memory 101 temporarily stores the image signal of the encoding target picture supplied in the order of shooting / display time. The image memory 101 stores the stored image signal of the picture to be encoded.
The data is supplied to the motion vector detection unit 102, the prediction method determination unit 107, and the residual signal generation unit 108 in predetermined pixel block units. At this time, the image signals of the pictures 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 motion vector detection unit 102 uses the motion vector for each prediction block size and each prediction mode by block matching between the image signal supplied from the image memory 101 and the reference picture supplied from the decoded image memory 116 for each prediction block. Detection is performed in units, and the detected motion vector is supplied to the motion compensation prediction unit 105, the difference motion vector calculation unit 103, and the prediction method determination unit 107.

The difference motion vector calculation unit 103 calculates a plurality of motion vector predictor candidates by using the encoded information of the already encoded image signal stored in the encoded information storage memory 115, and generates a prediction motion vector list. The optimum motion vector predictor is selected from a plurality of motion vector predictor candidates registered and registered in the motion vector predictor list, and a motion vector difference is calculated from the motion vector detected by the motion vector detector 102 and the motion vector predictor. Then, the calculated difference motion vector is supplied to the prediction method determination unit 107. Furthermore, a prediction motion vector index that identifies a prediction motion vector selected from prediction motion vector candidates registered in the prediction motion vector list is supplied to the prediction method determination unit 107.

The inter prediction information deriving unit 104 derives merge candidates in the merge mode. A plurality of merge candidates are derived using the encoding information of the already encoded prediction block stored in the encoding information storage memory 115 and registered in a merge candidate list described later, and registered in the merge candidate list A flag predFlag indicating whether a suitable merge candidate is selected from a plurality of merge candidates and L0 prediction and L1 prediction of each prediction block of the selected merge candidate are used.
L0 [xP] [yP], predFlagL1 [xP] [yP], reference index refIdxL0 [xP] [yP], refIdxL1 [xP] [y
P], motion vectors mvL0 [xP] [yP], mvL1 [xP] [yP] and other inter prediction information are used as motion compensated prediction unit 1
And a merge index that identifies the selected merge candidate is supplied to the prediction method determination unit 107. Here, xP and yP are indexes indicating the position of the upper left pixel of the prediction block in the picture. The detailed configuration and operation of the inter prediction information deriving unit 104 will be described later.

The motion compensation prediction unit 105 includes a motion vector detection unit 102 and an inter prediction information derivation unit 1.
A predicted image signal is generated by inter prediction (motion compensated prediction) from the reference picture using the motion vector detected in 04, and the predicted image signal is supplied to the prediction method determination unit 107. In L0 prediction and L1 prediction, one-way prediction is performed. For bi-prediction (Pred_BI)
Bidirectional prediction is performed, the inter-predicted signals of L0 prediction and L1 prediction are adaptively multiplied by a weighting factor, an offset value is added and superimposed, and a final predicted image signal is generated.

The intra prediction unit 106 performs intra prediction for each intra prediction mode. A prediction image signal is generated by intra prediction from the decoded image signal stored in the decoded image memory 211, a suitable intra prediction mode is selected from a plurality of intra prediction modes, the selected intra prediction mode, and A prediction image signal corresponding to the selected intra prediction mode is supplied to the prediction method determination unit 107.

The prediction method determination unit 107 evaluates the encoding information and the code amount of the residual signal for each prediction method, the distortion amount between the prediction image signal and the image signal, and the like from among a plurality of prediction methods.
Inter prediction (PRED_INTER) or intra prediction (PRED_INTRA) for each optimal coding block
Prediction mode PredMode and split mode PartMode are determined, and inter prediction (PRED_I
NTER) determines whether or not the mode is the merge mode in units of prediction blocks. If the mode is the merge mode, the merge index is used. If the mode is not the merge mode, the inter prediction mode, the prediction motion vector index, the L0 and L1 reference indexes, the difference motion vector, The encoded information corresponding to the determination is supplied to the first encoded bit string generation unit 110.

Furthermore, the prediction method determination unit 107 stores information indicating the determined prediction method and encoded information including a motion vector corresponding to the determined prediction method in the encoded information storage memory 115. The encoding information stored here includes the prediction mode PredMode and the division mode of each encoding block.
Flag indicating whether to use PartMode, L0 prediction of each prediction block, and L1 prediction
edFlagL0 [xP] [yP], predFlagL1 [xP] [yP], L0, L1 reference indices refIdxL0 [xP] [y
P], refIdxL1 [xP] [yP], L0, L1 motion vectors mvL0 [xP] [yP], mvL1 [xP] [yP], and the like. Here, xP and yP are indexes indicating the position of the upper left pixel of the prediction block in the picture. When the prediction mode PredMode is intra prediction (MODE_INTRA), a flag predFlagL0 [xP] [yP] indicating whether to use L0 prediction and a flag predFlagL1 [xP] [yP] indicating whether to use L1 prediction are Both are zero. On the other hand, the prediction mode PredMode is inter prediction (MO
DE_INTER) and when the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xP] [yP] indicating whether to use L0 prediction is 1, and the flag predFlagL1 [xP] indicating whether to use L1 prediction [yP] is 0. When the inter prediction mode is L1 prediction (Pred_L1)
The flag predFlagL0 [xP] [yP] indicating whether to use L0 prediction is 0, and the flag predFlagL1 [xP] [yP] indicating whether to use L1 prediction is 1. Inter prediction mode is bi-prediction (Pr
ed_BI), a flag predFlagL0 [xP] [yP] indicating whether to use L0 prediction and a flag predFlagL1 [xP] [yP] indicating whether to use L1 prediction are both 1. The prediction method determination unit 107 supplies a prediction image signal corresponding to the determined prediction mode to the residual signal generation unit 108 and the decoded image signal superimposition unit 114.

The residual signal generation unit 108 generates a residual signal by performing subtraction between the image signal to be encoded and the predicted image signal, and supplies the residual signal to the orthogonal transform / quantization unit 109.
The orthogonal transform / quantization unit 109 performs orthogonal transform and quantization on the residual signal in accordance with the quantization parameter to generate an orthogonal transform / quantized residual signal, and a second encoded bit string generation unit 111 and the inverse quantization / inverse orthogonal transform unit 113. Further, the orthogonal transform / quantization unit 109
Stores the quantization parameter in the encoded information storage memory 115.

The first encoded bit string generation unit 110, in addition to information in units of sequences, pictures, slices, and encoded blocks, codes corresponding to the prediction method determined by the prediction method determination unit 107 for each encoded block and predicted block Encoding information is encoded. Specifically, in the case of prediction mode PredMode, partition mode PartMode, and inter prediction (PRED_INTER) for each coding block,
Flag for determining whether or not the mode is merge mode, merge index in the case of merge mode, encoding information such as inter prediction mode, prediction motion vector index, and information on difference motion vector in the case of not merge mode, according to a prescribed syntax rule described later The first encoded bit string is generated by encoding and supplied to the multiplexing unit 112.

The second encoded bit string generation unit 111 generates a second encoded bit string by entropy-encoding the orthogonally transformed and quantized residual signal according to a specified syntax rule, and supplies the second encoded bit string to the multiplexing unit 112. The multiplexing unit 112 multiplexes the first encoded bit string and the second encoded bit string in accordance with a prescribed syntax rule, and outputs a bit stream.

The inverse quantization / inverse orthogonal transform unit 113 performs inverse quantization and inverse orthogonal transform on the orthogonal transform / quantized residual signal supplied from the orthogonal transform / quantization unit 109 to calculate a residual signal, and performs decoding. This is supplied to the image signal superimposing unit 114. The decoded image signal superimposing unit 114 superimposes the predicted image signal according to the determination by the prediction method determining unit 107 and the residual signal subjected to inverse quantization and inverse orthogonal transform by the inverse quantization / inverse orthogonal transform unit 113 to decode the decoded image. Is generated and stored in the decoded image memory 116. In addition, a filtering process for reducing distortion such as block distortion due to encoding is performed on the decoded image,
It may be stored in the decoded image memory 116.

FIG. 2 is a block diagram showing the configuration of the moving picture decoding apparatus according to the embodiment of the present invention corresponding to the moving picture encoding apparatus of FIG. The moving picture decoding apparatus according to the embodiment includes a separation unit 201, a first encoded bit string decoding unit 202, a second encoded bit string decoding unit 203, a motion vector calculation unit 204,
An inter prediction information deriving unit 205, a motion compensation prediction unit 206, an intra prediction unit 207, an inverse quantization / inverse orthogonal transform unit 208, a decoded image signal superimposing unit 209, an encoded information storage memory 210, and a decoded image memory 211 are provided.

The decoding process of the moving picture decoding apparatus in FIG. 2 corresponds to the decoding process provided in the moving picture encoding apparatus in FIG. 1, so the motion compensation prediction unit 206 in FIG. The configurations of the inverse orthogonal transform unit 208, the decoded image signal superimposing unit 209, the encoded information storage memory 210, and the decoded image memory 211 are the motion compensation prediction unit 105 of the moving image encoding device in FIG.
Each of the configurations of the inverse orthogonal transform unit 113, the decoded image signal superimposing unit 114, the encoded information storage memory 115, and the decoded image memory 116 has a corresponding function.

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

The first encoded bit string decoding unit 202 decodes the supplied encoded bit string to obtain sequence, picture, slice, encoded block unit information, and predicted block unit encoded information. Specifically, in the case of prediction mode PredMode, split mode PartMode, and inter prediction (PRED_INTER) for determining whether the prediction is inter prediction (PRED_INTER) or intra prediction (PRED_INTRA) in units of coding blocks, a flag for determining whether the mode is merge mode, When the merge mode is selected, the merge index is decoded. When the merge mode is not selected, the encoded information related to the inter prediction mode, the predicted motion vector index, the difference motion vector, and the like is decoded according to a predetermined syntax rule to be described later, and the encoded information is a motion vector calculation unit. 204, supplied to the inter prediction information deriving unit 205 or the intra prediction unit 207.

The second encoded bit string decoding unit 203 decodes the supplied encoded bit string to perform orthogonal transform /
The quantized residual signal is calculated, and the orthogonal transform / quantized residual signal is supplied to the inverse quantization / inverse orthogonal transform unit 208.

When the prediction mode PredMode of the prediction block to be decoded is inter prediction (PRED_INTER) and not the merge mode, the motion vector calculation unit 204 stores the encoded information of the already decoded image signal stored in the encoded information storage memory 210. A plurality of motion vector predictor candidates that are derived and registered in a motion vector predictor list to be described later, and a first encoded bit string decoding unit is selected from the motion vector predictor candidates registered in the motion vector predictor list A prediction motion vector corresponding to the prediction motion vector index decoded and supplied in 202 is selected, a motion vector is calculated from the difference vector decoded in the first encoded bit string decoding unit 202 and the selected prediction motion vector, The encoded information is supplied to the motion compensation prediction unit 206 and stored in the encoded information storage memory 210. To. The encoding information of the prediction block supplied / stored here is a flag predFlagL0 [xP] [yP], predFlagL1 [xP] [yP indicating whether to use the prediction mode PredMode, the partition mode PartMode, the L0 prediction, and the L1 prediction. ], L0, L1 reference indices refIdxL0 [xP] [yP], refIdxL1 [xP] [yP], L0, L1 motion vectors mvL0 [xP] [y
P], mvL1 [xP] [yP], etc. Here, xP and yP are indexes indicating the position of the upper left pixel of the prediction block in the picture. When the prediction mode PredMode is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 indicating whether to use the L0 prediction is 1, and the flag predFlagL1 indicating whether to use the L1 prediction is 0. It is. When the inter prediction mode is L1 prediction (Pred_L1), the flag predFlagL0 indicating whether to use L0 prediction is 0, and the flag predFlagL1 indicating whether to use L1 prediction is 1. When the inter prediction mode is bi-prediction (Pred_BI), a flag predFlagL0 indicating whether to use L0 prediction and a flag predFlagL1 indicating whether to use L1 prediction are both 1.

The inter prediction information deriving unit 205 derives merge candidates when the prediction mode PredMode of the prediction block to be decoded is inter prediction (PRED_INTER) and in the merge mode. A plurality of merge candidates are derived and registered in a merge candidate list, which will be described later, using the encoded information of already decoded prediction blocks stored in the encoded information storage memory 115, and registered in the merge candidate list Whether a merge candidate corresponding to the merge index decoded and supplied by the first encoded bit string decoding unit 202 is selected from among a plurality of merge candidates, and whether to use the L0 prediction and the L1 prediction of the selected merge candidate PredFlagL0 [xP] [yP], predFlagL1 [xP] [y
Inter prediction of reference indices refIdxL0 [xP] [yP], refIdxL1 [xP] [yP] of P], L0, and L1, and motion vectors mvL0 [xP] [yP] and mvL1 [xP] [yP] of L0 and L1 The information is motion compensated prediction unit 206.
And stored in the encoded information storage memory 210. Here, xP and yP are indexes indicating the position of the upper left pixel of the prediction block in the picture. The detailed configuration and operation of the inter prediction information deriving unit 205 will be described later.

The motion compensated prediction unit 206 is a motion vector calculation unit 204 or an inter prediction information deriving unit 2.
A predicted image signal is generated by inter prediction (motion compensation prediction) from a reference picture stored in the decoded image memory 211 using the inter prediction information calculated in 05, and the predicted image signal is supplied to the decoded image signal superimposing unit 209. To do. In the case of bi-prediction (Pred_BI), a weighted coefficient is adaptively multiplied and superimposed on the two motion-compensated predicted image signals of L0 prediction and L1 prediction to generate a final predicted image signal.

The intra prediction unit 207 performs intra prediction when the prediction mode PredMode of the prediction block to be decoded is intra prediction (PRED_INTRA). The encoded information decoded by the first encoded bit string decoding unit includes an intra prediction mode, and by intra prediction from a decoded image signal stored in the decoded image memory 211 according to the intra prediction mode. A predicted image signal is generated, and the predicted image signal is supplied to the decoded image signal superimposing unit 209. L0 prediction and L
Flags predFlagL0 [xP] [yP] and predFlagL1 [xP] [yP] indicating whether to use 1 prediction are both set to 0 and stored in the encoded information storage memory 210. Here, xP and yP are indexes indicating the position of the upper left pixel of the prediction block in the picture.

The inverse quantization / inverse orthogonal transform unit 208 performs inverse orthogonal transform and inverse quantization on the orthogonal transform / quantized residual signal decoded by the first encoded bit string decoding unit 202, and performs inverse orthogonal transform / An inverse quantized residual signal is obtained.

The decoded image signal superimposing unit 209 performs the prediction image signal inter-predicted by the motion compensation prediction unit 206 or the prediction image signal intra-predicted by the intra prediction unit 207 and the inverse orthogonal transform by the inverse quantization / inverse orthogonal transform unit 208. The decoded image signal is decoded by superimposing the dequantized residual signal, and stored in the decoded image memory 211. When stored in the decoded image memory 211, the decoded image may be stored in the decoded image memory 211 by performing a filtering process that reduces block distortion or the like due to encoding.

(About syntax)
Next, a syntax that is a common rule for encoding and decoding a bit stream of a moving image that is encoded by a moving image encoding device including the motion vector prediction method according to the present embodiment and decoded by the decoding device explain.

FIG. 10 shows a first syntax structure described in the slice header in units of slices of the bitstream generated according to the present embodiment. However, only syntax elements relevant to the present embodiment are shown. When the slice type is a B slice, pictures at different times used for deriving temporal motion vector predictor candidates or merge candidates
Flag collocated_f indicating whether a reference picture registered in the L0 reference list or the L1 reference list of a picture including a prediction block to be processed is used by colPic
rom_l0_flag is set. Details of the flag collocated_from_l0_flag will be described later.

Note that the above syntax elements may be placed in a picture parameter set describing syntax elements set in units of pictures.

FIG. 11 shows a syntax pattern described in units of prediction blocks. When the value of the prediction mode PredMode of the prediction block is inter prediction (MODE_INTER), merge_flag [x0] [y0] indicating whether the mode is the merge mode is set. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the picture of the luminance signal, and merge_flag [x0] [y0] is the prediction block located at (x0, y0) in the picture It is a flag indicating whether or not merge mode.

Next, when merge_flag [x0] [y0] is 1, it indicates merge mode, and the merge list index syntax element merge_idx [x0] [y0, which is a list of merge candidates to be referred to
] Is installed. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the picture, and merge_idx [x0] [y0] is the merge index of the prediction block located at (x0, y0) in the picture. is there. Figure 12 shows the merge index syntax element merg
It is an example of an entropy code of e_idx [x0] [y0]. In the present embodiment of the present invention, the number of merge candidates is set to five. When the merge index is 0, 1, 2, 3, 4, the signs of the merge index syntax elements merge_idx [x0] [y0] are '0', '10', '110', '
1110 'and' 1111 '.

On the other hand, when merge_flag [x0] [y0] is 0, it indicates that the mode is not merge mode. When the slice type is B slice, a syntax element that identifies the inter prediction mode inter_pred_fla
g [x0] [y0] is installed, and L0 prediction (Pred_L0) and L1 prediction (Pred_L) using this syntax element
1) Identify bi-prediction (Pred_BI). For each of L0 and L1, syntax elements ref_idx_l0 [x0] [y0] and ref_idx_l1 [x0] [y0] of the reference index for specifying the reference picture, the motion vector and prediction of the prediction block obtained by motion vector detection The differential motion vector syntax elements mvd_l0 [x0] [y0] [j] and mvd_l1 [x0] [y0] [j], which are the differences from the motion vector, are provided. Here, x0 and y0 are indexes indicating the position of the upper left pixel of the prediction block in the picture, and ref_idx_l0 [x0] [y0] and mvd_l0 [x0] [y0] [j] are respectively (x0 , y0)
L0 reference index of the prediction block located at, and the differential motion vector, ref_
idx_l1 [x0] [y0] and mvd_l1 [x0] [y0] [j] are the L1 reference index and the differential motion vector of the prediction block located at (x0, y0) in the picture, respectively. Further, j represents a differential motion vector component, j represents 0 as an x component, and j represents 1 as a y component. Next, syntax elements mvp_idx_l0 [x0] [y0] and mvp_idx_l1 [x0] [y0] of an index of a predicted motion vector list that is a list of predicted motion vector candidates to be referred to are set. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the picture, and mvp_idx_l0 [x0] [y0]
, Mvp_idx_l1 [x0] [y0] are prediction motion vector indexes of L0 and L1 of the prediction block located at (x0, y0) in the picture. In the present embodiment of the present invention, the value of the number of candidates is set to 2.

The inter prediction information deriving method according to the embodiment is implemented in the inter prediction information deriving unit 104 of the video encoding device in FIG. 1 and the inter prediction information deriving unit 205 of the video decoding device in FIG.

Next, the inter prediction information derivation method according to the embodiment will be described with reference to the drawings. The inter prediction information derivation method is performed in any of the encoding and decoding processes for each prediction block constituting the encoding block. The prediction mode PredMode of the prediction block is inter prediction (MODE_I
NTER), in the merge mode, in the case of encoding, the prediction mode, reference index, and motion vector of the prediction block to be encoded are calculated using the prediction mode, reference index, and motion vector of the encoded prediction block. When deriving, decoding is performed when the prediction mode, reference index, and motion vector of the prediction block to be decoded are derived using the prediction mode, reference index, and motion vector of the decoded prediction block.

The merge mode is the prediction block A that is close to the left, the prediction block B that is close to the top, the prediction block C that is close to the top right, and the prediction block D that is close to the bottom left as described with reference to FIGS. 5, 6, 7, and 8. In addition to the five prediction blocks of the prediction block E adjacent to the upper left, the prediction block Col (T0) existing at or near the same position at different times described with reference to FIG.
, T1)) from the prediction block. The inter prediction information deriving unit 104 of the moving image encoding device and the inter prediction information deriving unit 205 of the moving image decoding device register these merge candidates in the merge candidate list in a common order on the encoding side and the decoding side. The inter prediction information deriving unit 104 of the video encoding device determines a merge index for specifying an element of the merge candidate list, encodes it via the first encoded bit string generation unit, and performs inter prediction of the video decoding device. The information deriving unit 205 is supplied with the merge index decoded by the first encoded bit string decoding unit 202, selects a prediction block corresponding to the merge index from the merge candidate list, and selects the prediction mode of the selected merge candidate, Reference index,
Motion compensation prediction is performed using inter prediction information such as a motion vector.

FIG. 13 is a diagram illustrating a detailed configuration of the inter prediction information deriving unit 104 of the video encoding device in FIG. FIG. 14 is a diagram illustrating a detailed configuration of the inter prediction information deriving unit 205 of the video decoding device in FIG.

13 and FIG. 14 indicate the inter prediction information deriving unit 104 of the moving picture coding apparatus and the inter prediction information deriving unit 205 of the moving picture decoding apparatus, respectively.

Furthermore, the portions surrounded by the thick dotted lines inside them are the merge candidate list construction unit 120 of the moving picture coding apparatus that derives the respective merge candidates and constructs the merge candidate list, and the merge candidate list of the moving picture decoding apparatus. A construction unit 220 is shown, which is similarly installed in a moving picture decoding apparatus corresponding to the moving picture encoding apparatus of the embodiment, so that the same derivation result consistent with encoding and decoding can be obtained.

In the inter prediction information derivation method according to the embodiment, merge candidate derivation and merge candidate list construction processing in the merge candidate list construction unit 120 of the video encoding device and the merge candidate list construction unit 220 of the video decoding device , Merging candidate derivation and merge candidate list construction processing of the prediction block to be processed are performed without referring to a prediction block included in the same encoding block as the encoding block including the prediction block to be processed. In this way, the coding block division mode (PartMode) is 2N × 2N division (PART_2Nx
2N), that is, when there are multiple prediction blocks in the encoded block,
On the encoding side, the merge candidate derivation of each prediction block and the merge candidate list construction process can be performed in parallel within the encoded block.

The parallel processing for constructing the merge candidate list of each prediction block in the coding block will be described for each partition mode (PartMode) with reference to FIG. FIG. 15 is a diagram illustrating a prediction block that is close to a processing target prediction block for each division mode (PartMode) of the processing target coding block. In FIG. 15, A0, B0, C0, D0, and E0 are a prediction block A that is close to the left side of the prediction block to be processed whose partition index PartIdx is 0, a prediction block B that is close to the upper side, and a vertex at the upper right. Shows a prediction block C close to A, a prediction block D close to the bottom left vertex, and a prediction block E close to the top left vertex, A
1, B 1, C 1, D 1, and E 1 are prediction blocks A that are close to the left side of the prediction block to be processed with a partition index PartIdx of 1, a prediction block B that is close to the upper side, and a prediction that is close to the top right vertex. A block C, a prediction block D adjacent to the lower left vertex, and a prediction block E adjacent to the upper left vertex are shown. A2, B2, C2, D2, and E2 are the left sides of the prediction blocks to be processed whose partition index PartIdx is 2, respectively. A prediction block A near the upper side, a prediction block B near the upper side, a prediction block C near the upper right vertex, a prediction block D near the lower left vertex, and a prediction block E near the upper left vertex. A
3, B3, C3, D3, and E3 are prediction blocks A that are close to the left side, prediction block B that is close to the upper side, and prediction that is close to the upper right vertex of the processing target prediction block whose partition index PartIdx is 3, respectively. A block C, a prediction block D close to the lower left vertex, and a prediction block E close to the upper left vertex are shown.

FIGS. 15B, 15C, and 15D show that the partition mode (PartMode) for dividing the encoded block to be processed into two prediction blocks arranged vertically is 2N × N partition (PART_2NxN), 2N × nU partition ( It is a figure which shows the prediction block which adjoins in PART_2NxnU) and 2NxnD division | segmentation (PART_2NxnD). Prediction block B1 close to the processing target prediction block with PartIdx of 1 has PartIdx of 0
Is a prediction block. Therefore, with reference to the prediction block B1, in order to perform merge candidate derivation and merge candidate list construction processing for a prediction block whose PartIdx is 1, the prediction block B1
After the merge candidate derivation and merge candidate list construction process for the prediction block with PartIdx of 0 belonging to the same encoded block is completed and the merge candidates to be used are specified, the process cannot be performed. Therefore, in the inter prediction information derivation method according to the embodiment, the partition mode (PartMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU)
) In 2N × nD partitioning (PART_2NxnD), when PartIdx of the prediction block to be processed is 1, it is close to the upper side of the prediction block to be processed and included in the same encoding block as the encoding block including the prediction block to be processed Prediction block A1, C1, D1, or E1 that is not included in the same encoding block as the encoding block that includes the prediction block to be processed without referring to the encoding information of the prediction block B1 that is the prediction block whose PartIdx is 0 Refer to the encoding information of Part
By performing merge candidate derivation and merge candidate list construction processing for a prediction block whose Idx is 1, merge candidate derivation and merge candidate list construction processing for two prediction blocks in an encoded block can be performed in parallel. It becomes.

15 (e), (f), and (g) are N × 2N division (PART_Nx2N) in which a division mode (PartMode) indicating a mode in which a coding block to be processed is divided into two prediction blocks arranged on the left and right.
It is a figure which shows the prediction block which adjoins in nLx2N division | segmentation (PART_nLx2N) and nRx2N division | segmentation (PART_nRx2N). Prediction block A1 that is close to the prediction block to be processed whose PartIdx is 1
Is a prediction block whose PartIdx is 0. Therefore, referring to prediction block A1, PartI
In order to perform merge candidate derivation and merge candidate list construction processing for a prediction block with dx = 1, merge candidate derivation and merge candidate list construction processing for a prediction block with PartIdx 0 belonging to the same coding block that is the prediction block A1 are completed. However, the process cannot be performed unless the merge candidates to be used are specified. Therefore, in the inter prediction information deriving method according to the embodiment, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), Block PartIdx
Is 1, it is close to the left side of the prediction block to be processed, and refers to the encoding information of the prediction block A1 that is a prediction block in which the PartIdx is 0 included in the same encoding block as the encoding block including the prediction block to be processed Without reference to the encoding information of the prediction block B1, C1, D1, or E1 not included in the same encoding block as the encoding block including the prediction block to be processed, the merge candidate derivation of the prediction block of PartIdx = 1 By performing the merge candidate list construction process, the merge candidate derivation and merge candidate list construction process of each prediction block in the encoded block can be performed in parallel.

Here, parallel processing of merge candidate derivation and merge candidate list construction processing will be described. FIG. 16 is a flowchart for explaining merge candidate derivation and merge candidate list construction processing by sequential processing, and FIG. 17 is a flowchart for explaining merge candidate derivation and merge candidate list construction processing by parallel processing.

In the sequential processing of merge candidate derivation and merge candidate list construction processing shown in FIG. 16, derivation of merge candidates of a prediction block whose partition index PartIdx of a coding block to be processed is 0 and construction of a merge candidate list (steps) S101). Subsequently, when the division mode (PartMode) is 2N × 2N division (PART_2Nx2N) (NO in step S102),
The merge candidate derivation and merge candidate list construction processing ends. Split mode (PartMode)
Is not 2N × 2N division (PART_2Nx2N) (NO in step S102), that is, the division mode (PartMode) is 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU),
2N × nD partition (PART_2NxnD), N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nL)
x2N), nR × 2N partition (PART_nRx2N), a merge candidate derivation of a prediction block whose partition index PartIdx of the coding block to be processed is 1 and a merge candidate list are constructed (step S103). The derivation and merge candidate list construction process ends.

In the parallel processing of merge candidate derivation and merge candidate list construction processing shown in FIG. 17, the merge candidate derivation of the prediction block whose partition index PartIdx of the coding block to be processed is 0 and the merge candidate list are constructed (step) S101). In parallel with step S101, when the division mode (PartMode) is not 2N × 2N division (PART_2Nx2N) (NO in step S102), that is, the division mode (PartMode) is 2N × N division (PART_2NxN).
2N × nU partition (PART_2NxnU), 2N × nD partition (PART_2NxnD), N × 2N partition (PART
_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), derivation of merge candidates of a prediction block whose partition index PartIdx is 1 and a merge candidate list are constructed (Step S103).

In the parallel processing of merge candidate derivation and merge candidate list construction processing shown in FIG.
Partition mode (PartMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU)
2N × nD partition (PART_2NxnD), N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
In the case of nLx2N) or nR × 2N partition (PART_nRx2N), the merge candidate derivation and merge candidate list construction processing of the prediction block with PartIdx of 1 is performed without referring to the prediction block with PartIdx of 0 in the same encoded block As a result, it is possible to simultaneously start merge candidate derivation and merge candidate list construction processing of two prediction blocks whose partition index PartIdx is 0 and 1.

Also in the sequential processing of merge candidate derivation and merge candidate list construction processing shown in FIG.
It is possible to perform merge candidate derivation and merge candidate list construction processing for a prediction block with PartIdx 1 without referring to a prediction block with PartIdx 0.

In this embodiment, the division mode (PartMode) does not define N × N division (PART_NxN), but N × N division (PART_NxN) can also be defined. FIG.
(H) is a diagram showing adjacent prediction blocks in which the division mode (PartMode) is divided into four prediction blocks by dividing the luminance signal of the coding block to be processed into four prediction blocks by N × N division (PART_NxN). is there. Prediction block A1 close to the processing target prediction block whose PartIdx is 1 is Par
This is a prediction block whose tIdx is 0. Therefore, with reference to the prediction block A1, PartIdx is 1
In order to perform the merge candidate derivation and merge candidate list construction processing of the prediction block, the merge candidate derivation and merge candidate list construction processing of the prediction block whose PartIdx is 0 belonging to the same coding block which is the prediction block A1 are completed and used. The process cannot be performed unless the merge candidate to be specified is specified. Therefore, in the inter prediction information derivation method according to the embodiment, the prediction mode is a prediction block in which the partition mode (PartMode) is N × N partition (PART_NxN), the processing target prediction block PartIdx is 1, and PartIdx is 0 Without referring to block A1,
By performing merge candidate derivation and merge candidate list construction processing for a prediction block whose PartIdx is 1, merge candidate derivation and merge candidate list construction processing for each prediction block in an encoded block can be performed in parallel. It becomes. A prediction block B2 adjacent to a processing target prediction block with PartIdx of 2 is a prediction block with PartIdx of 0, and a prediction block C2 is a prediction block of PartIdx with 1. Therefore, in order to perform merge candidate derivation and merge candidate list construction processing for a prediction block whose PartIdx is 2 with reference to the prediction blocks B2 and C2, the PartIdx belonging to the same coding block that is the prediction blocks B2 and C2 is 0 and 1 After the prediction block merge candidate derivation and merge candidate list construction processing are completed and the merge candidates to be used are specified, the processing cannot be performed. Therefore, in the inter prediction information derivation method according to the embodiment, the partition mode (PartMode) is N × N partition (PART
_NxN), when the processing target prediction block has PartIdx of 2, the prediction block B2 and C2 that are prediction blocks of PartIdx of 0 and 1 are not referred to, and merge candidate derivation and merge candidate list of prediction blocks of PartIdx of 2 are performed. By performing this construction processing, it is possible to perform in parallel the merge candidate derivation and merge candidate list construction processing for each prediction block in the encoded block. The prediction block E3 adjacent to the processing target prediction block whose PartIdx is 3 is P
ArtIdx is a prediction block with 0, prediction block B3 is a prediction block with PartIdx of 1, and prediction block A3 is a prediction block with PartIdx of 2. Accordingly, in order to perform merge candidate derivation and merge candidate list construction processing for a prediction block with PartIdx of 3 with reference to the prediction blocks E3, B3, and A3, PartIdx belonging to the same encoded block that is the prediction blocks E3, B3, and A3 If the merge candidate derivation and merge candidate list construction process for the prediction blocks of 0, 1, and 2 are completed and the merge candidates to be used are specified, the process cannot be performed. Therefore, in the inter prediction information derivation method according to the embodiment, when the partition mode (PartMode) is N × N partition (PART_NxN), and the PartIdx of the prediction block to be processed is 3, the prediction of PartIdx is 0, 1 and 2 By performing the merge candidate derivation of the prediction block with PartIdx of 3 and the construction of the merge candidate list without referring to the prediction blocks E3, B3, and A3 that are blocks, the merge candidate of each prediction block in the encoded block The derivation and merge candidate list construction processes can be processed in parallel.

The inter prediction information deriving unit 104 of the video encoding device in FIG. 13 includes a spatial merge candidate generating unit 130, a temporal merge candidate reference index deriving unit 131, and a temporal merge candidate generating unit 132.
, A merge candidate registration unit 133, a merge candidate identity determination unit 134, a merge candidate supplementation unit 135, and an encoding information selection unit 136.

The inter prediction information deriving unit 205 of the video decoding device in FIG.
30, a time merge candidate reference index deriving unit 231, a time merge candidate generating unit 232,
A merge candidate registration unit 233, a merge candidate identity determination unit 234, a merge candidate supplement unit 235, and an encoding information selection unit 236 are included.

FIG. 18 shows an inter prediction information deriving unit 104 of the video encoding apparatus according to the embodiment of the present invention.
4 is a flowchart for explaining a procedure of merge candidate derivation processing and merge candidate list construction processing having functions common to the inter prediction information deriving unit 205 of the video decoding device.
Hereinafter, the processes will be described in order. In the following description, a case where the slice type slice_type is a B slice will be described unless otherwise specified, but the present invention can also be applied to a P slice. However, when the slice type slice_type is a P slice, there are only L0 prediction (Pred_L0) as an inter prediction mode, and there are no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), so the processing related to L1 can be omitted.

In the spatial merge candidate generation unit 130 of the inter prediction information deriving unit 104 of the moving image encoding device and the spatial merge candidate generation unit 230 of the inter prediction information deriving unit 205 of the moving image decoding device, each of them close to the encoding or decoding target block. Spatial merge candidates A, B, C, D, E from the prediction blocks A, B, C, D, E are derived and output. Where A, B, C, D, E
Alternatively, N indicating any of the time merge candidates Col is defined. A flag availableFlagN indicating whether or not the inter prediction information of the prediction block N can be used as a spatial merge candidate N, a reference index refIdxL0N of L0 of the spatial merge candidate N, and a reference index refIdxL of L1
The L0 prediction flag predFlagL0N indicating whether 1N and L0 prediction is performed, the L1 prediction flag predFlagL1N indicating whether L1 prediction is performed, the L0 motion vector mvL0N, and the L1 motion vector mvL1N are output (step S201). However, in the present embodiment, the merge candidate is derived without referring to the prediction block included in the same encoding block as the encoding block including the prediction block to be processed, so that the code including the prediction block to be processed Spatial merge candidates included in the same coding block as the coding block are not derived. Step S20
The detailed processing procedure of 1 will be described later in detail using the flowchart of FIG.

Subsequently, the temporal merge candidate reference index deriving unit 131 of the inter prediction information deriving unit 104 of the video encoding device and the temporal merge candidate reference index deriving unit 231 of the inter prediction information deriving unit 205 of the video decoding device A reference index of a temporal merge candidate is derived and output from a prediction block close to a block to be converted or decoded (step S2).
02). However, in the present embodiment, the reference index of the temporal merge candidate is derived without referring to the prediction block included in the same encoded block as the encoded block including the prediction block to be processed. When the inter prediction is performed using the inter prediction information of the temporal merge candidate when the slice type slice_type is P slice, only the L0 reference index is derived in order to perform the L0 prediction (Pred_L0), and the slice type slice_type is the B slice. Bi-prediction (Pred_BI) when performing inter prediction using inter prediction information of temporal merge candidates
In order to perform the above, the respective reference indexes of L0 and L1 are derived. Step S202
21, FIG. 23, FIG. 25, FIG. 27, FIG. 29, FIG. 30, and FIG.
This will be described in detail later using the flowchart.

Subsequently, the temporal merge candidate generating unit 1 of the inter prediction information deriving unit 104 of the video encoding device.
32 and the temporal merge candidate generating unit 232 of the inter prediction information deriving unit 205 of the video decoding device.
Then, temporal merge candidates are derived from pictures at different times, and temporal merge candidates are output. A flag availableFlagCol indicating whether a temporal merge candidate is available, an L0 prediction flag predFlagL0Col indicating whether L0 prediction of the temporal merge candidate is performed, an L1 prediction flag predFlagL1Col indicating whether L1 prediction is performed, and a motion vector of L0 mvL0N, L
1 motion vector mvL1N is output (step S203). The detailed processing procedure of step S203 will be described later in detail using the flowchart of FIG.

Subsequently, the merge candidate registration unit 133 of the inter prediction information deriving unit 104 of the video encoding device.
The merge candidate registration unit 233 of the inter prediction information deriving unit 205 of the moving picture decoding apparatus creates a merge candidate list mergeCandList, and spatial merge candidates A, B, C, D, E, and temporal merge candidates in the merge candidate list mergeCandList By adding Col, a merge candidate list mergeCandList is constructed and a merge candidate list mergeCandList is output (step S20).
4). The detailed processing procedure of step S204 will be described later in detail using the flowchart of FIG.

Subsequently, the merge candidate identity determining unit 1 of the inter prediction information deriving unit 104 of the video encoding device.
34 and the merge candidate identity determination unit 234 of the inter prediction information deriving unit 205 of the video decoding device.
Then, in the merge candidate list mergeCandList, when the motion vectors of the same reference index have the same value, the merge candidates are removed except for the smallest merge candidate and the merge candidate list mergeCandList is output. (Step S205).

Subsequently, the merge candidate supplementing unit 135 of the inter prediction information deriving unit 104 of the video encoding device.
The merge candidate supplementing unit 235 of the inter prediction information deriving unit 205 of the video decoding device supplements the merge candidates so that the number of merge candidates registered in the merge candidate list mergeCandList becomes the specified number, and the merge candidate list output mergeCandList (step S206)
. In the present embodiment, the number of merge candidates is defined as five. Merge candidate list mergeCandL
The prediction mode in which the combination of L0 prediction and L1 prediction between already registered merge candidates is changed up to 5 as the maximum number of merge candidates registered in ist is a bi-predictive (Pred_BI) merge candidate or a different reference index Then, a merge candidate in which the prediction mode having a motion vector value of (0, 0) is bi-prediction (Pred_BI) is added.

Next, a method for deriving the merge candidate N from the prediction block N adjacent to the encoding or decoding target block, which is the processing procedure of step S201 in FIG. 18, will be described in detail. FIG. 19 is a flowchart for describing the spatial merge candidate derivation processing procedure in step S201 of FIG.
In N, A (left side), B (upper side), C (upper right), D (lower left), or E (upper left) representing the region of the adjacent prediction block is entered. In this embodiment, a maximum of four spatial merge candidates are derived from five adjacent prediction blocks.

In FIG. 18, the encoding information of the prediction block A adjacent to the left side of the prediction block to be encoded or decoded is determined with the variable N as A to derive the merge candidate A, and the prediction block adjacent to the upper side with the variable N as B The encoding information of B is examined to derive the merge candidate B, the encoding information of the prediction block C adjacent to the upper right side is determined with the variable N as C, the merge candidate C is derived, and the variable N is set as D to the lower left side. The encoding information of the adjacent prediction block D is checked to derive the merge candidate D, and the variable N is set as E to check the encoding information of the prediction block E adjacent to the upper left side to derive the merge candidate E (step S1101 to step S1101). S1114).

First, the variable N is E, and the flags availableFlagA, availableFlagB, availableFlagC, avai
When the value of lableFlagD is added and the total is 4 (YES in step S1102), that is, 4
When two spatial merge candidates are derived, the flag availableFlagE of the merge candidate E is set to 0 (step S1107), and the motion vectors mvL0E and mvL1E of the merge candidate E are both set to (0,
0) (step S1108) and flags predFlagL0E and predFlagL1E of merge candidate E
Both are set to 0 (step S1109), and the space merge candidate derivation process is terminated.
In this embodiment, four merge candidates are derived from adjacent prediction blocks.
When four spatial merge candidates have already been derived, it is not necessary to perform further spatial merge candidate derivation processing.

On the other hand, the variable N is not E or the flags availableFlagA, availableFlagB, availableFlagC
, availableFlagD is added and the total is not 4 (NO in step S1102), the process proceeds to step S1103. When the adjacent prediction block N is included in the same encoding block as the encoding block including the prediction block to be derived (YES in step S1103), the value of the flag availableFlagN of the merge candidate N is set to 0 (step S1107). The values of the motion vectors mvL0N and mvL1N of the merge candidate N are both set to (0, 0) (step S1108)
The values of the merge candidate N flags predFlagL0N and predFlagL1N are both set to 0 (step S1).
109). When the adjacent prediction block N is included in the same encoding block as the encoding block including the prediction block to be derived (YES in step S1103), the encoding information of the adjacent prediction block N is not referred to, and the merge candidate N By setting the value of the flag availableFlagN to 0 and not making it a spatial merge candidate, parallel processing of merge candidate derivation and merge candidate list construction processing for each prediction block in the same coding block is enabled.

Specifically, when the partition mode (PartMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), or 2N × nD partition (PART_2NxnD), the part of the prediction block to be processed
A case where the prediction block B is Idx = 1 and is close to the upper side of the prediction block to be derived is a case where the adjacent prediction block N is included in the same encoding block as the encoding block including the prediction block to be derived. In this case, the prediction block B close to the upper side of the prediction block to be derived is included in the same encoding block as the encoding block including the prediction block to be derived.
Since the rtIdx is a prediction block of 0, the encoding information of the adjacent prediction block B is not referred to, and the value of the flag availableFlagB of the merge candidate B is set to 0 so that it does not become a spatial merge candidate. It is possible to perform parallel processing of merge candidate derivation and merge candidate list construction processing of each prediction block.

Furthermore, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PAR
T_nLx2N) or nR × 2N partition (PART_nRx2N), where the prediction block PartIdx of the processing target is 1 and the prediction block A adjacent to the left side of the prediction block to be derived is also the prediction block N to be derived This is a case where it is included in the same encoded block as the encoded block including the block. Also in this case, the prediction block A adjacent to the left side of the prediction block to be derived
Is the PartId included in the same coding block as the coding block containing the prediction block to be derived
Since x is a prediction block of 0, the encoding information of the adjacent prediction block A is not referred to, and the value of the flag availableFlagA of the merge candidate A is set to 0 so as not to be a spatial merge candidate.
It is possible to perform parallel processing of merge candidate derivation and merge candidate list construction processing for each prediction block in the same encoded block.

Furthermore, although not defined in the present embodiment, the partition mode (PartMode) is N × N partition (PART
_NxN), and when the PartIdx of the prediction block to be processed is 1, 2 or 3, the adjacent prediction block N may be included in the same encoding block as the encoding block including the prediction block to be derived.

On the other hand, when the adjacent prediction block N is not included in the same encoding block as the encoding block including the processing target prediction block (NO in step S1103), the prediction block N adjacent to the prediction block to be encoded or decoded is determined. If each prediction block N is specified, the encoding information of the prediction block N is acquired from the encoding information storage memory 115 or 210 (step S1104).

If the adjacent prediction block N cannot be used (NO in step S1105), or the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA) (step S110).
6), the value of the flag availableFlagN of the merge candidate N is set to 0 (step S110).
7) The values of the motion vectors mvL0N and mvL1N of the merge candidate N are both set to (0, 0) (step S1108), and the values of the flags predFlagL0N and predFlagL1N of the merge candidate N are both set to 0 (step S1109). Here, the case where the adjacent prediction block N cannot be used is
Specifically, the case where the adjacent prediction block N is located outside the slice to be encoded or decoded, or the case where the encoding or decoding process has not been completed because it is later in the encoding or decoding process order, etc. To do.

On the other hand, whether the adjacent prediction block N is outside the same encoding block as the encoding block of the prediction block to be derived (YES in step S1104), or the adjacent prediction block N can be used (
YES in step S1105), the prediction mode PredMode of the prediction block N is intra prediction (
If it is not (MODE_INTRA) (YES in step S1106), the inter prediction information of the prediction block N is set as the inter prediction information of the merge candidate N. Merge candidate N flag availableFlagN
Is set to 1 (step S1110), and the motion vectors mvL0N and mvL1N of the merge candidate N are set to the same values as the motion vectors mvL0N [xN] [yN] and mvL1N [xN] [yN] of the prediction block N, respectively. (Step S1111), the reference indexes refIdxL0N and refIdxL1N of the merge candidate N are set to the same values as the reference indexes refIdxL0 [xN] [yN] and refIdxL1 [xN] [yN] of the prediction block N, respectively (Step S1112). N flags predFlagL0N and predFlagL1N are set to flags predFlagL0 [xN] [yN] and predFlagL1 [xN] [yN] of the prediction block N, respectively (step S1113). Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture.

The processes in steps S1102 to S1113 are repeated for N = A, B, C, D, and E (steps S1101 to S1114).

Next, a method for deriving the reference index of the time merge candidate in S202 of FIG. 18 will be described in detail. The reference indices of L0 and L1 as temporal merge candidates are derived.

In the present embodiment, the reference index of the temporal merge candidate is derived using the reference index of the spatial merge candidate, that is, the reference index used in the prediction block adjacent to the encoding or decoding target block. This is because when the temporal merge candidate is selected, the reference index of the prediction block to be encoded or decoded has a high correlation with the reference index of the prediction block adjacent to the encoding or decoding target block to be the spatial merge candidate. It is. In particular, in the present embodiment, except for Example 6 and Example 7 described later, reference is made to the prediction block A that is close to the left side of the prediction block to be derived or the prediction block B that is close to the upper side. Use only the index. This is because the prediction blocks A and B that are in contact with the sides of the prediction block to be encoded or decoded among the adjacent prediction blocks A, B, C, D, and E that are also spatial merge candidates are predicted to be encoded or decoded. This is because the correlation is higher than prediction blocks C, D, and E that are in contact with only the vertices of the block. The prediction blocks to be used are the prediction blocks A and B without using the prediction blocks C, D and E having relatively low correlation.
By limiting to the above, it is possible to obtain an effect of improving the coding efficiency by deriving the reference index of the temporal merge candidate, and to reduce the amount of calculation and the memory access amount regarding the reference index deriving process of the temporal merge candidate.

Example 1
Hereinafter, this embodiment will be described by dividing it into several examples. First, Example 1 of the present embodiment will be described. FIG. 20 is a diagram illustrating adjacent blocks referred to in the time merge candidate reference index derivation process according to the first embodiment of the present embodiment. In Example 1 of the present embodiment, either the prediction block adjacent to the left side of the prediction block to be derived or the prediction block adjacent to the upper side is switched according to the division mode (PartMode). Reference is made to a prediction block close to a side outside the coding block. Split mode (PartMode
) Is 2N × 2N division (PART_2Nx2N), as shown in FIG. 20A, the prediction block A0 adjacent to the left of the prediction block to be derived is referred to, and the LX reference index of the temporal merge candidate is used as the prediction block A0. Set to the value of the LX reference index.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
When (rtMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), and 2N × nD partition (PART_2NxnD), as shown in FIGS. The prediction block adjacent to the left side of the block is referred to, and the reference index of the LX of each temporal merge candidate is used as the LX of the prediction block adjacent to the left side of each prediction target prediction block.
Set to the reference index value of. In a prediction block whose partition index PartIdx to be derived is 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In a prediction block whose division index PartIdx to be derived is 1, the prediction block A1 that is adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A1. Since the prediction blocks A0 and A1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

A split mode (Pa
rtMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), as shown in FIGS. 20 (e), (f), and (g) The prediction block adjacent to the upper side of the block is referred to, and the reference index of the LX of each temporal merge candidate is used as the LX of the prediction block adjacent to the upper side of each prediction target prediction block.
Set to the reference index value of. In a prediction block whose partition index PartIdx to be derived is 0, the prediction block B0 that is close to the top is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction blocks B0 and B1. In a prediction block whose partition index PartIdx to be derived is 1, the prediction block B1 that is close to the top is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block B1. Since the prediction blocks B0 and B1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A and prediction block B do not perform LX prediction, the reference index value of the LX that is a temporal merge candidate is set to 0 as the default value. When the adjacent prediction block A and prediction block B do not perform LX prediction, the default value of the reference index of the temporal merge candidate LX is set to 0 because the value of the reference index is 0 in inter prediction.
This is because the probability that the reference picture corresponding to is most selected is high. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

FIG. 21 is a flow chart for explaining the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 by the method of Example 1 of the present embodiment. First, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), nR
When it is not × 2N division (PART_nRx2N) (NO in step S2101), that is, 2N × 2N division (PART_2Nx2N), 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU), 2N
In the case of × nD division (PART_2NxnD), the encoding information of the prediction block A adjacent to the left is acquired from the encoding information storage memory 115 or 210 (step S2111).

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
nLx2N), nR × 2N division (PART_nRx2N) (YES in step S2101), obtains the coding information of the prediction block B adjacent to the prediction block to be derived from the coding information storage memory 115 or 210 (step S2117).

The subsequent processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

If the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is not 0 (YES in step S2119), the LX reference index refIdx of the temporal merge candidate
LXCol is set to the same value as the reference index refIdxLX [xB] [yB] of the LX of the prediction block B (step S2120). Here, xB and yB are indexes indicating the position of the upper left pixel of the prediction block B in the picture.

When the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is 0 (NO in step S2119), the LX reference index refIdxLX of the temporal merge candidate
Col is set to a default value of 0 (step S2121).

The processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122), and this reference index derivation processing is terminated.

Example 2
Next, Example 2 of the present embodiment will be described. FIG. 22 is a diagram illustrating neighboring blocks referred to in the time merge candidate reference index derivation process according to the second example of the present embodiment. In Example 2 of the present embodiment, the prediction block close to the left side of the prediction block to be derived or the prediction block close to the upper side is determined according to the partition mode (PartMode) of the encoded block and the partition index PartIdx of the prediction block. Switch which one to reference. Reference is made to a prediction block close to a side outside the coding block. Split mode (PartMo
When de) is 2N × 2N division (PART_2Nx2N), as shown in FIG. 22A, the prediction block A0 adjacent to the left of the prediction block to be derived is referred to, and the LX reference index of the temporal merge candidate is used as the prediction block. Set to the value of the LX reference index of A0.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
When (rtMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), and 2N × nD partition (PART_2NxnD), as shown in FIGS. The prediction block adjacent to the left side of the block is referred to, and the reference index of the LX of each temporal merge candidate is used as the LX of the prediction block adjacent to the left side of each prediction target prediction block.
Set to the reference index value of. In a prediction block whose partition index PartIdx to be derived is 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In a prediction block whose division index PartIdx to be derived is 1, the prediction block A1 that is adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A1. Since the prediction blocks A0 and A1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

A split mode (Pa
rtMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), as shown in FIGS. 22 (e), (f), and (g) In a prediction block with an index PartIdx of 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In a prediction block whose partition index PartIdx to be derived is 1, the prediction block B1 that is close to the top is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block B1. Since the prediction blocks A0 and B1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks having the division indexes PartIdx of 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A and prediction block B do not perform LX prediction, the reference index value of the LX that is a temporal merge candidate is set to 0 as the default value. When the adjacent prediction block A and prediction block B do not perform LX prediction, the default value of the reference index of the temporal merge candidate LX is set to 0 because the value of the reference index is 0 in inter prediction.
This is because the probability that the reference picture corresponding to is most selected is high. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

FIG. 23 is a flow chart for explaining the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 by the method of Example 2 of this embodiment. First, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), nR
When × 2N partition (PART_nRx2N) and partition index PartIdx is not 1 (step S21)
02 NO), that is, 2N × 2N division (PART_2Nx2N), 2N × N division (PART_2NxN), 2N
× nU partition (PART_2NxnU), 2N × nD partition (PART_2NxnD) or N × 2N partition (PA
RT_Nx2N), nL × 2N partition (PART_nLx2N), nR × 2N partition (PART_nRx2N), and when the partition index PartIdx is 0, the prediction block A close to the left of the prediction block to be derived from the encoded information storage memory 115 or 210 Is obtained (step S2).
111).

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
nLx2N), nR × 2N partition (PART_nRx2N), and when the partition index PartIdx is 1 (YES in step S2102), the code of the prediction block B adjacent to the prediction block to be derived from the encoded information storage memory 115 or 210 Information is acquired (step S211).
7).

The subsequent processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

If the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is not 0 (YES in step S2119), the LX reference index refIdx of the temporal merge candidate
LXCol is set to the same value as the reference index refIdxLX [xB] [yB] of the LX of the prediction block B (step S2120). Here, xB and yB are indexes indicating the position of the upper left pixel of the prediction block B in the picture.

When the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is 0 (NO in step S2119), the LX reference index refIdxLX of the temporal merge candidate
Col is set to a default value of 0 (step S2121).

The processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122), and this reference index derivation processing is terminated.

Example 3
Next, Example 3 of the present embodiment will be described. FIG. 24 is a diagram illustrating neighboring blocks referred to in the time merge candidate reference index derivation process according to the third example of the present embodiment. In Example 3 of the present embodiment, the prediction block close to the left side of the prediction block to be derived or the prediction block close to the upper side is determined according to the partition mode (PartMode) of the encoded block and the partition index PartIdx of the prediction block. Switch which one to reference. For a prediction block with a partition index PartIdx of 0, refer to a prediction block close to a long side having higher correlation, and for a prediction block with a partition index PartIdx of 1, refer to a prediction block close to a side outside the coding block To do. Split mode (PartMode) is 2
In the N × 2N division (PART_2Nx2N), as shown in FIG. 24A, the prediction block A0 adjacent to the left of the prediction block to be derived is referred to, and the LX reference index of the prediction block A0 is used as the reference index of the temporal merge candidate LX. Set to the reference index value of.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
When (rtMode) is 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU), and 2N × nD division (PART_2NxnD), as shown in FIGS. 24B, 24C, 24D, the derivation target division Prediction block B close to the upper side, which is a long side, in the prediction block whose index PartIdx is 0
With reference to 0, the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block B0. In the prediction block whose partition index PartIdx is 1 to be derived, the prediction block A1 close to the left side outside the coding block is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A1. To do. Since the prediction blocks B0 and A1 to be referred to are both outside the encoded block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

A split mode (Pa
rtMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), as shown in FIGS. 24 (e), (f), and (g) Prediction block A close to the left side, which is the long side, in the prediction block with index PartIdx of 0
With reference to 0, the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In the prediction block whose partition index PartIdx is 1 to be derived, the prediction block B1 close to the upper side outside the coding block is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block B1. To do. Since the prediction blocks A0 and B1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks having the division indexes PartIdx of 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A and prediction block B do not perform LX prediction, the reference index value of the LX that is a temporal merge candidate is set to 0 as the default value. When the adjacent prediction block A and prediction block B do not perform LX prediction, the default value of the reference index of the temporal merge candidate LX is set to 0 because the value of the reference index is 0 in inter prediction.
This is because the probability that the reference picture corresponding to is most selected is high. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

FIG. 25 is a flow chart for explaining the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 according to the method of Example 3 of the present embodiment. First, the partition mode (PartMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), 2N
× nD partition (PART_2NxnD) and partition index PartIdx is not 0, but N × 2N partition (PART_
Nx2N), nL × 2N partition (PART_nLx2N), nR × 2N partition (PART_nRx2N) and the partition index PartIdx is not 1 (NO in step S2103), that is, 2N × 2N partition (PART_
2N × 2N) or 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), 2N ×
In nD partition (PART_2NxnD), the partition index PartIdx is 0 or N × 2N partition (PART_
Nx2N), nL × 2N partition (PART_nLx2N), nR × 2N partition (PART_nRx2N), and when the partition index PartIdx is 0, the prediction block A close to the left of the prediction block to be derived from the encoded information storage memory 115 or 210 Is obtained (step S211).
1).

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
nLx2N), nR × 2N partition (PART_nRx2N), and when the partition index PartIdx is 1 (YES in step S2102), the code of the prediction block B adjacent to the prediction block to be derived from the encoded information storage memory 115 or 210 Information is acquired (step S211).
7).

The subsequent processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

If the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is not 0 (YES in step S2119), the LX reference index refIdx of the temporal merge candidate
LXCol is set to the same value as the reference index refIdxLX [xB] [yB] of the LX of the prediction block B (step S2120). Here, xB and yB are indexes indicating the position of the upper left pixel of the prediction block B in the picture.

When the flag predFlagLX [xB] [yB] indicating whether to perform LX prediction of the prediction block B is 0 (NO in step S2119), the LX reference index refIdxLX of the temporal merge candidate
Col is set to a default value of 0 (step S2121).

The processing from step S2119 to step S2121 is performed in each of L0 and L1 (steps S2118 to S2122), and this reference index derivation processing is terminated.

Example 4
Next, Example 4 of the present embodiment will be described. FIG. 26 is a diagram illustrating adjacent blocks referred to in the time merge candidate reference index derivation process according to the fourth example of the present embodiment. In Example 4 of the present embodiment, whether to refer to the prediction block adjacent to the left side of the prediction block to be derived is switched according to the partition mode (PartMode) of the encoded block and the partition index PartIdx of the prediction block. Reference is made when the prediction block close to the left side is outside the coding block, and when it is inside the coding block, it is not referred to and is set as a default value. When the division mode (PartMode) is 2N × 2N division (PART_2Nx2N), FIG.
), The prediction block A0 adjacent to the left of the prediction block to be derived is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
When (rtMode) is 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU), and 2N × nD division (PART_2NxnD), as shown in FIGS. 26 (b), (c), and (d), the division to be derived In a prediction block with an index PartIdx of 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In a prediction block whose division index PartIdx to be derived is 1, the prediction block A1 that is adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A1. Since the prediction blocks A0 and A1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

A split mode (Pa
rtMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), as shown in FIGS. 26 (e), (f), and (g) In a prediction block with an index PartIdx of 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In the prediction block whose partition index PartIdx to be derived is 1, the adjacent prediction block is not referred to, and the LX reference index of the temporal merge candidate is set to the default value 0. Since the prediction block A0 to be referenced is outside the coding block, the division index
Reference indices of temporal merge candidates of two prediction blocks with PartIdx of 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A does not perform LX prediction, the value of the reference index of the LX that is a temporal merge candidate is set to 0 as the default value. The reason why the default value of the LX reference index of the temporal merge candidate is 0 when the adjacent prediction block A does not perform LX prediction or when the partition index PartIdx of the prediction block to be derived is 1 is referred to in inter prediction This is because the reference picture corresponding to the index value 0 is most likely to be selected. However, the present invention is not limited to this, and the default value of the reference index is a value other than 0 (
1 or 2), or a syntax element indicating a default value of a reference index can be installed and transmitted in the encoded stream at the sequence level, picture level, or slice level, and can be selected on the encoding side. You may do it.

FIG. 27 is a flowchart for explaining the reference process for deriving the reference index of the time merge candidate in step S202 of FIG. 18 according to the method of Example 4 of the present embodiment. First, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), nR
When × 2N partition (PART_nRx2N) and partition index PartIdx is not 1 (step S21)
02 NO), that is, 2N × 2N division (PART_2Nx2N), 2N × N division (PART_2NxN), 2N
× nU partition (PART_2NxnU), 2N × nD partition (PART_2NxnD) or N × 2N partition (PA
RT_Nx2N), nL × 2N partition (PART_nLx2N), nR × 2N partition (PART_nRx2N), and when the partition index PartIdx is 0, the prediction block A close to the left of the prediction block to be derived from the encoded information storage memory 115 or 210 Is obtained (step S2).
111).

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
nLx2N), nR × 2N division (PART_nRx2N), and when the division index PartIdx is 1 (YES in step S2102), the processing in the subsequent step S2121 is performed in each of L0 and L1 (steps S2118 to S2122). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

The LX reference index refIdxLXCol of the time merge candidate is set to a default value of 0 (step S2121).

The processing up to step S2121 is performed in each of L0 and L1 (step S211).
8-S2122), this reference index derivation process is terminated.

Example 5
Next, Example 5 of the present embodiment will be described. FIG. 28 is a diagram illustrating adjacent blocks that are referred to in the time merge candidate reference index derivation process according to the fifth example of the present embodiment. In Example 5 of the present embodiment, whether to refer to a prediction block adjacent to the left side of the prediction block to be derived is switched according to the division mode (PartMode). Reference is made to a prediction block close to a side outside the coding block. Reference is made when the prediction block close to the left side is outside the coding block, and when it is inside the coding block, it is not referred to and is set as a default value. When the partition mode (PartMode) is 2N × 2N partition (PART_2Nx2N), FIG.
As shown in a), referring to the prediction block A0 adjacent to the left of the prediction block to be derived,
The LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
When (rtMode) is 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU), and 2N × nD division (PART_2NxnD), as shown in FIGS. 28B, 28C, and 28D, the division to be derived In a prediction block with an index PartIdx of 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0. In a prediction block whose division index PartIdx to be derived is 1, the prediction block A1 that is adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A1. Since the prediction blocks A0 and A1 to be referred to are both outside the coding block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

A split mode (Pa
rtMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), and nR × 2N partition (PART_nRx2N), refer to the prediction blocks that are close to each other in the prediction blocks whose partition index PartIdx is 0 and 1 First, the reference index of the LX as a time merge candidate is set to the default value of 0. Since the prediction block adjacent to the prediction block to be processed is not referred to, the division index is not referred to without referring to the prediction block in the encoded block.
Reference indices of temporal merge candidates of two prediction blocks with PartIdx of 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A does not perform LX prediction, the value of the reference index of the LX that is a temporal merge candidate is set to 0 as the default value. When the adjacent prediction block A does not perform LX prediction, or the partition mode (PartMode) of the coding block including the prediction block to be derived
Is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), nR × 2N partition (PART_
In the case of nRx2N), the reason why the default value of the reference index of the LX as a temporal merge candidate is set to 0 is that there is a high probability that a reference picture corresponding to a reference index value of 0 is most selected in inter prediction. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

FIG. 29 is a flow chart for explaining the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 according to the method of the fifth embodiment of the present embodiment. First, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_nLx2N), nR
When it is not × 2N division (PART_nRx2N) (NO in step S2101), that is, 2N × 2N division (PART_2Nx2N), 2N × N division (PART_2NxN), 2N × nU division (PART_2NxnU), 2N
In the case of × nD division (PART_2NxnD), the encoding information of the prediction block A adjacent to the left of the prediction block to be derived is acquired from the encoding information storage memory 115 or 210 (step S2111).

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, the partition mode (PartMode) is N × 2N partition (PART_Nx2N), nL × 2N partition (PART_
nLx2N), nR × 2N division (PART_nRx2N) (YES in step S2101),
The subsequent processing in step S2121 is performed in each of L0 and L1 (step S2118).
~ S2122). When deriving the reference index of L0 as a temporal merge candidate, LX
Is set to L0, and LX is set to L1 when deriving the reference index of L1.
However, when the slice type slice_type is P slice, the inter prediction mode is L0.
Since there is only prediction (Pred_L0) and there is no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), L
1 can be omitted.

The LX reference index refIdxLXCol of the time merge candidate is set to a default value of 0 (step S2121).

The processing up to step S2121 is performed in each of L0 and L1 (step S211).
8-S2122), this reference index derivation process is terminated.

Example 6
Next, Example 6 of the present embodiment will be described. In Example 6 of the present embodiment, a partition mode (Pa) of a coding block (processing target coding block) including a prediction mode to be derived.
rtMode) and the value of the partition index PartIdx of the prediction mode to be derived, the adjacent prediction block is not referenced, and the LX reference index of the temporal merge candidate is a default value of 0.
Set to. Since the prediction block adjacent to the prediction block to be processed is not referred to, the prediction block in the encoded block is not referred to, and the time of two prediction blocks whose division indexes PartIdx are 0 and 1 included in the same encoded block Merge candidates can be derived in parallel.

The reason why the default value of the LX reference index of the temporal merge candidate is set to 0 is that there is a high probability that the reference picture corresponding to the reference index value of 0 is most selected in inter prediction. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

Further, in the sixth embodiment, the reference index refIdxLXCol of the time merge candidate LX is set to the default value of 0 without referring to the adjacent block, so the first, second, third, fourth, fifth, and later-described seventh embodiment. The derivation process can be simplified compared to.

FIG. 30 is a flowchart for describing the reference process for deriving the reference index of the time merge candidate in step S202 of FIG. 18 according to the method of Example 6 of the present embodiment.

The process of step S2115 is performed in each of L0 and L1 (steps S2112 to S2112).
S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, when the slice type slice_type is P slice, there is only L0 prediction (Pred_L0) as the inter prediction mode, and there is no L1 prediction (Pred_L1) and bi-prediction (Pred_BI).
Can be omitted.

The LX reference index refIdxLXCol of the time merge candidate is set to a default value of 0 (step S2115).

The process of step S2115 is performed in each of L0 and L1 (steps S2112 to S2112).
S2116), this reference index deriving process is terminated.

Example 7
Next, Example 7 of the present embodiment will be described. FIG. 31 is a diagram illustrating adjacent blocks that are referred to in the time merge candidate reference index derivation process according to the seventh embodiment of the present embodiment. In Example 7 of the present embodiment, regardless of the value of the partition mode (PartMode) of the encoding block (the processing target encoding block) including the prediction mode to be derived and the value of the partition index PartIdx of the prediction mode to be derived, As illustrated in FIGS. 31A to 31G, the prediction block A adjacent to the left of the processing target encoding block is referred to, and the LX reference index of the prediction block A is used as the LX reference index of the prediction block A. Set to value. Since the prediction block A to be referred to is outside the encoded block, the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1 can be derived in parallel.

However, when the adjacent prediction block A does not perform LX prediction, the value of the reference index of the LX that is a temporal merge candidate is set to 0 as the default value. When the adjacent prediction block A does not perform LX prediction, the reason why the default value of the reference index of the temporal merge candidate LX is set to 0 is that the reference picture corresponding to the reference index value of 0 is most selected in inter prediction. This is because the probability is high. However, the present invention is not limited to this, and the default value of the reference index may be a value other than 0 (1, 2, etc.). The syntax element shown may be installed and transmitted so that it can be selected on the encoding side.

In the seventh embodiment, since the reference index of the temporal merge candidate of each prediction block in the encoded block is set to a common value, the reference index of the temporal merge candidate is derived for each prediction block in the encoded block. There is no need, and the derivation process can be simplified.

FIG. 32 is a flow chart for explaining the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 by the method of Example 7 of the present embodiment. First, the coding information of the prediction block A adjacent to the left of the coding block to be processed is acquired from the coding information storage memory 115 or 210 (step S2131).

The subsequent processing from step S2133 to step S2135 is performed in each of L0 and L1 (steps S2132 to S2136). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A adjacent to the left of the processing target coding block is not 0 (YES in step S2133), the LX reference index of the temporal merge candidate refIdxLXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2134). Where xA, yA
Is an index indicating the position of the upper left pixel of the prediction block A adjacent to the left of the coding block to be processed in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is 0 (NO in step S2133), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2135).

The processing from step S2133 to step S2135 is performed in each of L0 and L1 (steps S2132 to S2136), and this reference index derivation processing is terminated.

In the seventh embodiment, whether to refer to the prediction block adjacent to the left side of the encoded block including the prediction block to be derived is switched. However, instead of the prediction block adjacent to the left side, the prediction block close to the upper side is changed. You may switch whether to refer.

Example 8
Next, Example 8 of the present embodiment will be described. FIG. 43 is a diagram illustrating neighboring blocks referred to in the time merge candidate reference index derivation process according to the eighth embodiment of the present embodiment. In Example 8 of the present embodiment, whether to refer to a prediction block adjacent to the left side of the prediction block to be derived, according to the prediction index PartIdx of the prediction block, regardless of the encoding block partition mode (PartMode) Switch. When the partition index PartIdx of the prediction block is 0, the prediction block adjacent to the left side is referred to, and when the partition index PartIdx is other than 0, the adjacent prediction block is not referred to and is set as a default value. When the partition index PartIdx of the prediction block is 0, in any partition mode (PartMode), the prediction block close to the left side is always outside the encoded block, but when the partition index PartIdx of the prediction block is other than 0, the partition mode ( PartMode) depending on the coding block. As illustrated in FIG. 43A, the prediction block A0 adjacent to the left of the prediction block to be derived is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A0.

A division mode (Pa) that divides a coding block to be processed into two prediction blocks arranged vertically.
rtMode) is 2N × N partition (PART_2NxN), 2N × nU partition (PART_2NxnU), 2N × nD partition (PART_2NxnD), and a partition mode that divides a coding block to be processed into two prediction blocks arranged side by side (PartMode) Is Nx2N split (PART_Nx2N), nLx2N split (PART_
nLx2N) and nR × 2N division (PART_nRx2N), FIG. 43 (b), (c), (d), (e)
, (F), (g), the prediction block A0 that is adjacent to the left is referred to in the prediction block whose partitioning index PartIdx to be derived is 0, and the LX reference index of the temporal merge candidate is the LX of the prediction block A0. Set to the reference index value of. In the prediction block whose partition index PartIdx to be derived is 1, the adjacent prediction block is not referred to, and the LX reference index of the temporal merge candidate is set to the default value 0. Predicted block A0 to be referenced
Is outside the coding block, it is possible to derive in parallel the reference indexes of the temporal merge candidates of the two prediction blocks whose division indexes PartIdx are 0 and 1.

However, when the adjacent prediction block A does not perform LX prediction, the value of the reference index of the LX that is a temporal merge candidate is set to 0 as the default value. The reason why the default value of the LX reference index of the temporal merge candidate is 0 when the adjacent prediction block A does not perform LX prediction or when the partition index PartIdx of the prediction block to be derived is 1 is referred to in inter prediction This is because the reference picture corresponding to the index value 0 is most likely to be selected. However, the present invention is not limited to this, and the default value of the reference index is a value other than 0 (
1 or 2), or a syntax element indicating a default value of a reference index can be installed and transmitted in the encoded stream at the sequence level, picture level, or slice level, and can be selected on the encoding side. You may do it.

FIG. 44 is a flowchart for describing the procedure for deriving the reference index of the time merge candidate in step S202 of FIG. 18 according to the method of Example 8 of the present embodiment. First, when the division index PartIdx is 0 (YES in step S2104), the encoding information of the prediction block A adjacent to the left of the prediction block to be derived is acquired from the encoding information storage memory 115 or 210 (step S2111). .

The subsequent processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116). Note that LX is set to L0 when deriving the L0 reference index of the temporal merge candidate, and LX is set to L1 when deriving the L1 reference index. However, if the slice type slice_type is P slice,
Since there is only L0 prediction (Pred_L0) as the inter prediction mode and no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), the processing associated with L1 can be omitted.

When the flag predFlagLX [xA] [yA] indicating whether to perform LX prediction of the prediction block A is not 0 (YES in step S2113), the reference index refIdx of the LX as a temporal merge candidate
LXCol is set to the same value as the value of the reference index refIdxLX [xA] [yA] of the LX of the prediction block A (step S2114). Here, xA and yA are indexes indicating the position of the upper left pixel of the prediction block A in the picture.

In the present embodiment, in the prediction block N (N = A, B), when the prediction block N cannot be used outside the slice to be encoded or decoded, the prediction block N is encoded or encoded in the decoding order. Alternatively, a flag indicating whether or not to use L0 prediction when the encoding block is not encoded or decoded after the decoding target prediction block and cannot be used, or when the prediction mode PredMode of the prediction block N is intra prediction (MODE_INTRA). predFlagL0 [xN] [yN],
Flags predFlagL1 [xN] [yN] indicating whether to use the L1 prediction of the prediction block N are both 0
It is. Here, xN and yN are indexes indicating the position of the upper left pixel of the prediction block N in the picture. When the prediction mode PredMode of the prediction block N is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0), the flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N is 1 , Flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is zero. When the inter prediction mode of the prediction block N is L1 prediction (Pred_L1), a flag predFla indicating whether to use the L0 prediction of the prediction block N
gL0 [xN] [yN] is 0, and flag predFlagL1 [xN] [yN] indicating whether to use L1 prediction is 1. When the inter prediction mode of the prediction block N is bi-prediction (Pred_BI), a flag predFlagL0 [xN] [yN] indicating whether to use the L0 prediction of the prediction block N, and a flag predFlagL1 [indicating whether to use the L1 prediction xN] [yN] are both 1.

When the flag predFlagLX [xA] [yA] indicating whether or not to perform LX prediction of the prediction block A is 0 (NO in step S2113), the reference index refIdxLX of the LX as a temporal merge candidate
Col is set to a default value of 0 (step S2115).

The processing from step S2113 to step S2115 is performed in each of L0 and L1 (steps S2112 to S2116), and this reference index derivation processing is terminated.

On the other hand, when the division index PartIdx is not 0 (NO in step S2104), the subsequent processing in step S2121 is performed in each of L0 and L1 (steps S2118 to S2).
2122). Note that LX is L when deriving the reference index of L0 as a temporal merge candidate.
LX is set to L1 when the L1 reference index is derived. However, when the slice type slice_type is a P slice, there are only L0 prediction (Pred_L0) as an inter prediction mode, and there are no L1 prediction (Pred_L1) and bi-prediction (Pred_BI), so the processing related to L1 can be omitted.

The LX reference index refIdxLXCol of the time merge candidate is set to a default value of 0 (step S2121).

The processing up to step S2121 is performed in each of L0 and L1 (step S211).
8-S2122), this reference index derivation process is terminated.

In the eighth embodiment, whether or not to refer to the prediction block close to the left side of the prediction block to be derived is switched, but whether or not to refer to the prediction block close to the upper side instead of the prediction block close to the left side is determined. You may switch.

In the present embodiment, the partition mode (PartMode) of the encoded block does not define N × N partition (PART_NxN), but N × N partition (PART_NxN) can also be defined. Even when the coding block partition mode (PartMode) is N × N partition (PART_NxN), when deriving the reference index of the prediction block temporal merge candidate included in the processing target coding block, the processing target prediction block By deriving without referring to adjacent prediction blocks included in the same encoding block as the encoding block included in the reference block, reference to temporal merge candidates of four prediction blocks whose partition index PartIdx is 0, 1, 2, 3 Each index can be derived in parallel.

For example, in N × N division (PART_NxN), adjacent reference blocks are not referenced, and the LX reference index of the temporal merge candidate is set to a default value of 0. Since the prediction block adjacent to the prediction block to be derived is not referenced, the partition index PartIdx is 0, 1, 2, 3
The reference indexes of the temporal merge candidates of the four prediction blocks can be derived in parallel.

Alternatively, the reference index of the temporal merge candidate can be derived by referring to the reference index of the neighboring block. FIG. 33 is a diagram for explaining adjacent blocks to be referred to in the process of deriving the reference index of the temporal merge candidate of the N × N division (PART_NxN) encoded block.

As shown in FIG. 33 (a), in the prediction block whose partitioning index PartIdx to be derived is 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the prediction block A0 is used as the LX reference index of the temporal merge candidate. Set to the value of. In a prediction block whose partition index PartIdx to be derived is 1, the prediction block B1 that is close to the top is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block B1. In a prediction block with a partition index PartIdx of 2 to be derived, the prediction block A2 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A2. In a prediction block whose partitioning index PartIdx to be derived is 3, the adjacent prediction block is not referred to, and the LX reference index of the temporal merge candidate is set to a default value of 0. Since the prediction blocks A0 and A2 adjacent to the left of the prediction block to be processed and the prediction block B1 adjacent above are both outside the coding block, the four prediction blocks whose division index PartIdx is 0, 1, 2, 3 Reference indices for temporal merge candidates can be derived in parallel.

Alternatively, as shown in FIG. 33 (b), in the prediction block whose partitioning index PartIdx to be derived is 0, the prediction block A0 adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the LX of the prediction block A0. Set to the value of the reference index. In a prediction block whose partition index PartIdx to be derived is 2, refer to the prediction block A2 adjacent to the left,
The LX reference index of the temporal merge candidate is set to the value of the LX reference index of the prediction block A2. In the prediction block whose partition index PartIdx to be derived is 1 or 3, the adjacent prediction block is not referred to, and the reference index of the LX that is the temporal merge candidate is set to 0 as a default value. Since both the prediction blocks A0 and A2 adjacent to the left of the prediction block to be processed are outside the encoding block, the reference indexes of the temporal merge candidates of the four prediction blocks whose division indexes PartIdx are 0, 1, 2, and 3 are respectively set. It can be derived in parallel.

Alternatively, as illustrated in FIG. 33C, the prediction block A adjacent to the left of the processing target coding block is referred to, and the LX reference index of the temporal merge candidate is changed to the value of the LX reference index of the prediction block A. Set. Since the prediction block A adjacent to the left of the coding block to be processed is outside the coding block, the reference indexes of the temporal merge candidates of the four prediction blocks whose division indexes PartIdx are 0, 1, 2, and 3 are respectively parallel. Can be derived.

Alternatively, as shown in FIG. 33 (d), in the prediction block whose partitioning index PartIdx to be derived is 0, the prediction block A0 that is adjacent to the left is referred to, and the LX reference index of the temporal merge candidate is set to the LX of the prediction block A0. Set to the value of the reference index. In the prediction block whose partitioning index PartIdx to be derived is other than 0 (PartIdx is 1, 2 or 3), the adjacent prediction block is not referred to, and the LX reference index of the temporal merge candidate is the default value of 0.
Set to. Since it is outside the prediction block A0 coding block adjacent to the left of the prediction block to be processed, the reference indexes of the temporal merge candidates of the four prediction blocks whose division indexes PartIdx are 0, 1, 2, and 3 are respectively derived in parallel. be able to.

Next, the merge candidate derivation method using inter prediction information of pictures at different times in step S203 in FIG. 18 will be described in detail. FIG. 34 is a flowchart for explaining the time merge candidate derivation processing procedure in step S203 of FIG.

First, a picture colPic at a different time is derived from the slice type slice_type and the above-described flag collocated_from_l0_flag (step S3101).

FIG. 35 is a flowchart for explaining the procedure for deriving the picture colPic at different times in step S3101 of FIG. When the slice type slice_type is a B slice and the aforementioned flag collocated_from_l0_flag is 0 (YES in step S3201, step S32)
02)), RefPicList1 [0], that is, the picture colPic of the reference list L1 whose reference index is 0 becomes a different time picture colPic (step S3203). If not,
That is, the slice type slice_type is B slice and the aforementioned flag collocated_from_l0_fla
If g is 1 (YES in step S3201, NO in step S3202), or if the slice type slice_type is a P slice (NO in step S3201, Y in S3204)
ES), RefPicList0 [0], that is, the picture colPic of the reference list L0 with the reference index 0 is a different time (step S3205).

Next, returning to the flowchart of FIG. 34, a prediction block colPU at a different time is derived, and encoded information is acquired (step S3102).

FIG. 36 shows a prediction block co of a picture colPic at different times in step S3102 of FIG.
It is a flowchart explaining the derivation | leading-out process procedure of lPU.

First, a prediction block located at the lower right (outside) of the same position as a processing target prediction block in a picture colPic at a different time is set as a prediction block colPU at a different time (step S33).
01). This prediction block corresponds to the prediction block T0 in FIG.

Next, the encoding information of the prediction block colPU at different times is acquired (step S3302).
). When PredMode of a prediction block colPU at a different time cannot be used, or when the prediction mode PredMode of a prediction block colPU at a different time is intra prediction (MODE_INTRA) (YES in step S3303, YES in step S3304), the picture colPic in a different time The prediction block located in the upper left center of the same position as the processing target prediction block is set as a prediction block colPU at a different time (step S3305). This prediction block corresponds to the prediction block T1 in FIG.

Next, returning to the flowchart of FIG. 34, a flag indicating whether the prediction motion vector mvL0Col of L0 derived from the prediction block of another picture at the same position as the prediction block to be encoded or decoded and the temporal merge candidate Col are valid. In addition to deriving availableFlagL0Col (step S3103), a flag availableFlagL1Col indicating whether the prediction motion vector mvL1Col of L1 and the temporal merge candidate Col are valid is derived. Further, when the flag availableFlagL0Col or the flag availableFlagL1Col is 1, a flag availableFlagCol indicating whether the time merge candidate Col is valid is set to 1.

FIG. 37 is a flowchart for explaining the procedure for deriving inter prediction information of the temporal merge candidate in steps S3103 and S3104 in FIG. In L0 or L1, the list of time merge candidate derivation targets is LX, and the prediction using LX is LX prediction. Hereinafter, unless otherwise noted, this meaning is used. Step S3 which is a process for deriving L0 as a time merge candidate
LX becomes L0 when called as 103, and LX becomes L1 when called as step S3104, which is a process for deriving L1 as a time merge candidate.

PredMode PredMode of prediction block colPU at different time is intra prediction (MODE_INTRA)
If not available (NO in step S3401 and NO in step S3402), both the flag availableFlagLXCol and the flag predFlagLXCol are set to 0 (step S3403), the motion vector mvLXCol is set to (0, 0) (step S3404), and this time merge candidate This completes the inter prediction information derivation process.

When the prediction block colPU can be used and the prediction mode PredMode is not intra prediction (MODE_INTRA) (YES in step S3401 and YES in step S3402), the following procedure is performed.
Derives mvCol, refIdxCol, and availableFlagCol.

Flag PredFlagL0 [xPCo indicating whether L0 prediction of prediction block colPU is used
When l] [yPCol] is 0 (YES in step S3405), since the prediction mode of the prediction block colPU is Pred_L1, the motion vector mvCol is MvL1 [xPCol] [yPCol], which is the L1 motion vector of the prediction block colPU. Set to the same value (step S3406), reference index
refIdxCol is set to the same value as the reference index RefIdxL1 [xPCol] [yPCol] of L1 (step S3407), and the list ListCol is set to L1 (step S3408). Here, xPCol and yPCol are indexes indicating the position of the upper left pixel of the prediction block colPU in the picture colPic at different times.

On the other hand, when the L0 prediction flag PredFlagL0 [xPCol] [yPCol] of the prediction block colPU is not 0 (NO in step S3405 in FIG. 37), the L1 prediction flag PredFlagL of the prediction block colPU.
Determine whether 1 [xPCol] [yPCol] is 0 or not. L1 prediction flag PredFlag of prediction block colPU
When L1 [xPCol] [yPCol] is 0 (YES in step S3409), the motion vector mvCol is set to the same value as MvL0 [xPCol] [yPCol], which is the L0 motion vector of the prediction block colPU (
Step S3410), the reference index RefIdxL0 [
xPCol] [yPCol] is set to the same value (step S3411), and the list ListCol is set to L0 (step S3412).

When both the L0 prediction flag PredFlagL0 [xPCol] [yPCol] of the prediction block colPU and the L1 prediction flag PredFlagL1 [xPCol] [yPCol] of the prediction block colPU are not 0 (N in step S3405)
O, NO in step S3409), the inter prediction mode of the prediction block colPU is bi-prediction (P
red_BI), one of the two motion vectors L0 and L1 is selected (step S3413).

FIG. 38 is a flowchart illustrating a procedure for deriving inter prediction information of temporal merge candidates when the inter prediction mode of the prediction block colPU is bi-prediction (Pred_BI).

First, it is determined whether the POC of all pictures registered in all reference lists is smaller than the POC of the current encoding or decoding target picture (step S3501).
When the POC of all pictures registered in all reference lists L0 and L1 of the prediction block colPU is smaller than the POC of the current encoding or decoding target picture (YES in step S3501), LX is L0, When the prediction vector candidate of the L0 motion vector of the picture to be encoded or decoded is derived (YES in step S3502),
When the inter prediction information of L0 of the prediction block colPU is selected and LX is L1, that is, the prediction vector candidate of the motion vector of L1 of the picture to be encoded or decoded is derived (NO in step S3502), the prediction block Inter prediction information for L1 of colPU is selected. On the other hand, when at least one of the POCs of pictures registered in all the reference lists L0 and L1 of the prediction block colPU is larger than the POC of the current encoding or decoding target picture (NO in step S3501), the flag collocated_from_l0_flag is 0. in the case of(
In step S3503, the inter prediction information for L0 of the prediction block colPU is selected. When the flag collocated_from_l0_flag is 1 (NO in step S3503), the inter prediction information for L1 of the prediction block colPU is selected.

When selecting inter prediction information for L0 of the prediction block colPU (YES in step)
In step S3503, YES, the motion vector mvCol is set to the same value as MvL0 [xPCol] [yPCol] (step S3504), and the reference index refIdxCol is set to RefIdxL0 [xPCol] [yPCol.
] Is set to the same value (step S3505), and the list ListCol is set to L0 (step S3506).

When selecting inter prediction information of L1 of the prediction block colPU (step S250)
2 NO, step S3503 NO), the motion vector mvCol is set to the same value as MvL1 [xPCol] [yPCol] (step S3507), and the reference index refIdxCol is RefIdxL1 [xPCol].
The value is set to the same value as [yPCol] (step S3508), and the list ListCol is set to L1 (step S3509).

Returning to FIG. 37, if inter prediction information can be acquired from the prediction block colPU, the flag availab
Both leFlagLXCol and flag predFlagLXCol are set to 1 (step S3414).

Subsequently, the motion vector mvCol is scaled so that the time merge candidate LX motion vector m
It is set as vLXCol (step S3415). The motion vector scaling calculation processing procedure will be described with reference to FIGS. 39 and 40. FIG.

FIG. 39 is a flowchart showing the motion vector scaling calculation processing procedure in step S3105 of FIG.

The inter-picture distance td is derived by subtracting the POC of the reference picture corresponding to the reference index refIdxCol referenced in the list ListCol of the prediction block colPU from the POC of the picture colPic at different times (step S3601). Note that when the POC of the reference picture referenced in the list Col of the prediction block colPU is earlier in the display order than the picture colPic at a different time, the inter-picture distance td is a positive value, and the prediction is more accurate than the picture colPic at a different time. When the POC of the reference picture referenced in the list ListCol of the block colPU is later in the display order, the inter-picture distance td is a negative value.
td = POC of picture colPic at different time-POC of reference picture referenced by list ListCol of prediction block colPU

The inter-picture distance tb is derived by subtracting the POC of the reference picture corresponding to the reference index of the temporal merge candidate LX derived in step S202 of FIG. 18 from the POC of the current encoding or decoding target picture (step S3602). . If the reference picture referenced in the list LX of the current encoding or decoding target picture is earlier than the current encoding or decoding target picture in the display order, the inter-picture distance tb is a positive value. When the reference picture referred to in the encoding or decoding target picture list LX is later in the display order, the inter-picture distance tb is a negative value.
tb = POC of current encoding or decoding target picture—POC of reference picture corresponding to LX reference index of temporal merge candidate

Subsequently, the inter-picture distances td and tb are compared (step S3603). If the inter-picture distances td and tb are equal (YES in step S3603), the LX motion vector mvLXCol as a temporal merge candidate is set to the same value as the motion vector mvCol. After setting (step S3604), the scaling calculation process is terminated.
mvLXCol = mvCol

On the other hand, if the inter-picture distances td and tb are not equal (NO in step S3603), scaling calculation processing is performed by multiplying mvCol by the scale factor tb or td according to the following equation (step S3605), and the scaled temporal merge candidate LX motion vector mv
Get LXCol.
mvLXCol = tb or td * mvCol

In addition, an example in which the scaling operation in step S3605 is performed with integer precision operation is shown in FIG.
0. The processing in steps S3606 to S3608 in FIG. 40 corresponds to the processing in step S3605 in FIG.

First, similarly to the flowchart of FIG. 39, the inter-picture distance td and the inter-picture distance tb are derived (steps S3601 and S3602).

Subsequently, the inter-picture distances td and tb are compared (step S3603). If the inter-picture distances td and tb are equal (YES in step S3603), the LX motion vector mvLXCol that is the temporal merge candidate is similar to the flowchart of FIG. Is set to the same value as the motion vector mvCol (step S3604), and this scaling calculation process is terminated.
mvLXCol = mvCol

On the other hand, if the inter-picture distances td and tb are not equal (NO in step S3603), a variable tx is derived from the following equation (step S3606).
tx = (16384 + Abs (td or 2)) or td

Subsequently, the scale coefficient DistScaleFactor is derived from the following equation (step S3607).
.
DistScaleFactor = (tb * tx + 32) >> 6

Subsequently, the LX motion vector mvLXCo of the scaled temporal merge candidate by the following equation:
l is obtained (step S3608).
mvLXCol = ClipMv (Sign (DistScaleFactor * mvCol) * ((Abs (DistScaleFactor *
mvCol) + 127) >> 8))

Next, a method for registering the merge candidates in step S204 of FIG. 18 in the merge candidate list and constructing the merge candidate list will be described in detail. FIG. 41 is a flowchart showing a merge candidate list construction processing procedure. In this method, priorities are assigned, and merge candidates are registered in the merge candidate list mergeCandList in descending order of priority, thereby reducing the code amount of the merge index merge_idx [x0] [y0]. The amount of codes is reduced by placing elements with higher priorities in front of the merge candidate list. For example, when there are five elements in the merge candidate list mergeCandList, the index 0 of the merge candidate list is “0” and the index 1 is “10”.
", Index 2 is" 110 ", index 3 is" 1110 ", index 4 is"
By setting “11110”, the code amount representing the index 0 becomes 1 bit, and the code amount is reduced by registering an element considered to have a high occurrence frequency in the index 0.

The merge candidate list mergeCandList has a list structure, and is provided with a merge index indicating the location within the merge candidate list and a storage area for storing merge candidates corresponding to the index as elements. The number of the merge index starts from 0, and merge candidates are stored in the storage area of the merge candidate list mergeCandList. In the subsequent processing, a prediction block that is a merge candidate of the merge index i registered in the merge candidate list mergeCandList is represented by mergeCandList [i], and is distinguished from the merge candidate list mergeCandList by array notation. To do.

First, when availableFlagA is 1 (YES in step S4101), a merge candidate list
Merge candidate A is registered at the head of mergeCandList (step S4102).
Subsequently, when availableFlagB is 1 (YES in step S4103), merge candidate B is registered at the end of the merge candidate list mergeCandList (step S4104).
Subsequently, when availableFlagC is 1 (YES in step S4105), the merge candidate C is registered at the end of the merge candidate list mergeCandList (step S4106).
Subsequently, when availableFlagD is 1 (YES in step S4107), the merge candidate D is registered at the end of the merge candidate list mergeCandList (step S4108).
Subsequently, when availableFlagE is 1 (YES in step S4109), the merge candidate E is registered at the end of the merge candidate list mergeCandList (step S4110).
Subsequently, when availableFlagCol is 1 (YES in step S4109), the merge candidate Col is registered at the end of the merge candidate list mergeCandList (step S4110).

In the merge mode, the prediction block A adjacent to the left and the prediction block B adjacent to the top often move together with the prediction block to be encoded or decoded.
When the inter prediction information of the prediction blocks A and B can be acquired, the merge candidates A and B are registered ahead of the merge candidate list in preference to the other merge candidates C, D, E, and Col.

In FIG. 13, the encoding information selection unit 136 of the inter prediction information deriving unit 104 of the video encoding device selects a merge candidate from the merge candidates registered in the merge candidate list, and merge index and merge index are selected. The inter prediction information of the merge candidate corresponding to is supplied to the motion compensation prediction unit 105.

In selecting a merge candidate, the same method as the prediction method determination unit 107 can be used. For each merge candidate, the coding information and the coding amount of the residual signal and the coding distortion between the predicted image signal and the image signal are derived, and the merge candidate that produces the least generated code amount and coding distortion is determined. The For each merge candidate, entropy coding is performed on the merge index syntax element merge_idx, which is coding information in the merge mode, and the code amount of the coding information is calculated. Further, for each merge candidate, a predicted image signal motion-compensated according to the inter prediction information of each merge candidate by the same method as the motion compensation prediction unit 105, and an encoding target image signal supplied from the image memory 101, The amount of code of the prediction residual signal obtained by encoding the prediction residual signal is calculated. Coding information, that is, the total generated code amount obtained by adding the code amount of the merge index and the code amount of the prediction residual signal is calculated as an evaluation value.

Further, after encoding such a prediction residual signal, it is decoded for distortion amount evaluation, and the encoding distortion is calculated as a ratio representing an error from the original image signal caused by the encoding. By comparing the total generated code amount and the encoding distortion for each merge candidate, encoding information with a small generated code amount and encoding distortion is determined. A merge index corresponding to the determined encoding information is encoded as a flag merge_idx represented by a second syntax pattern in units of prediction blocks.
The generated code amount calculated here is preferably a simulation of the encoding process, but can be approximated or approximated easily.

On the other hand, in FIG. 14, the encoding information selection unit 236 of the inter prediction information deriving unit 205 of the moving image encoding device performs a merge corresponding to the supplied merge index from among the merge candidates registered in the merge candidate list. A candidate is selected, and the inter prediction information of the merge candidate is supplied to the motion compensation prediction unit 206 and stored in the encoded information storage memory 210.

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 moving image transmitting apparatus that converts the encoded stream output from the moving image 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 101 Image memory, 102 Motion vector detection part, 103 Difference motion vector calculation part, 104 Inter prediction information derivation part, 105 Motion compensation prediction part, 106 Intra prediction part, 107 Prediction method determination part, 108 Residual signal generation part, 109 Orthogonal Transform / quantization unit, 110 first encoded bit string generation unit, 111 second encoded bit string generation unit, 112 multiplexing unit, 130 spatial merge candidate generation unit, 131 time merge candidate reference index deriving unit, 132 time Merge candidate generation unit, 133 merge candidate registration unit, 134 merge candidate identity determination unit, 135 merge candidate supplement unit, 136
Encoding information selection unit, 201 separation unit, 202 first encoded bit string decoding unit, 20
3 second encoded bit stream decoding unit, 204 motion vector calculation unit, 205 inter prediction information derivation unit, 206 motion compensation prediction unit, 207 intra prediction unit, 208 inverse quantization / inverse orthogonal transform unit, 209 decoded image signal superimposition unit, 210 Coding information storage memory, 211 Decoded image memory, 230 Spatial merge candidate generation unit, 231 Time merge candidate reference index deriving unit, 232 Time merge candidate generation unit, 233 Merge candidate registration unit, 234 Merge candidate identity determination unit, 235 Merge candidate supplement section, 236
Encoding information selection unit.

Claims (6)

A moving picture decoding apparatus for decoding a coded bit string in which a coded block obtained by dividing each picture into divided one or a plurality of prediction blocks and coding a moving picture by intra prediction or inter prediction in units of the prediction blocks. There,
A first prediction information deriving unit for deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to the prediction block to be decoded in a picture to be decoded; ,
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving unit;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction unit for constructing a prediction information candidate list composed of predetermined prediction information candidates added with inter prediction information candidates,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
The first prediction information deriving unit refers to the first inter prediction information candidate without referring to the coding information of the third block included in the same coding block as the coding block including the prediction block to be decoded. And derivation of
The second prediction information deriving unit is the decoding target in a division mode in which the encoded block is vertically divided into 1: 1, 1: 3, or 3: 1 by an upper block and a lower block. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. The reference index value of the second inter-prediction information candidate is changed to the default without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be As bets value, based on said reference index, the moving picture decoding apparatus characterized by performing a process of deriving the second inter prediction information candidate. A moving picture decoding method for decoding a coded bit string in which a coded block in which each picture is divided is divided into one or a plurality of prediction blocks and a moving picture is coded by intra prediction or inter prediction in units of the prediction blocks. There,
A first prediction information derivation step for deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to the prediction block to be decoded in a picture to be decoded; ,
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving step;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction step of constructing a prediction information candidate list composed of predetermined prediction information candidates added with inter prediction information candidates,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
In the first prediction information derivation step, the first inter prediction information candidate is referred to without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded. And derivation of
The second prediction information deriving step is a division mode in which the encoded block is divided into 1: 1, 1: 3, or 3: 1 vertically by the upper block and the lower block, and becomes the decoding target. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. Without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be the reference index value of the second inter prediction information candidate. As default values, based on the reference index, the moving picture decoding method and performing derivation process of the second inter prediction information candidate. A moving picture decoding program for decoding a coded bit string in which a coded block in which each picture is divided is divided into one or a plurality of prediction blocks and a moving picture is coded by intra prediction or inter prediction in units of the prediction blocks. There,
A first prediction information derivation step for deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to the prediction block to be decoded in a picture to be decoded; ,
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving step;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction step of constructing a prediction information candidate list composed of predetermined prediction information candidates added to each of inter prediction information candidates is executed by a computer,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
In the first prediction information derivation step, the first inter prediction information candidate is referred to without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded. And derivation of
The second prediction information deriving step is a division mode in which the encoded block is divided into 1: 1, 1: 3, or 3: 1 vertically by the upper block and the lower block, and becomes the decoding target. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. Without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be the reference index value of the second inter prediction information candidate. As default values, based on the reference index, the moving picture decoding program and performs the process of deriving the second inter prediction information candidate. Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. A receiving unit for receiving
A packet processing unit that packet-processes the received encoded data to generate an encoded stream;
A first process of deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded in the encoded stream. A prediction information deriving unit;
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving unit;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction unit for constructing a prediction information candidate list composed of predetermined prediction information candidates added with inter prediction information candidates,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
The first prediction information deriving unit refers to the first inter prediction information candidate without referring to the coding information of the third block included in the same coding block as the coding block including the prediction block to be decoded. And derivation of
The second prediction information deriving unit is the decoding target in a division mode in which the encoded block is vertically divided into 1: 1, 1: 3, or 3: 1 by an upper block and a lower block. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. The reference index value of the second inter-prediction information candidate is changed to the default without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be As bets value, based on said reference index, the receiving apparatus characterized by performing derivation process of the second inter prediction information candidate. Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. Receiving step for receiving,
A packet processing step of packet-processing the received encoded data to generate an encoded stream;
A first process of deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded in the encoded stream. A prediction information deriving step;
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving step;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction step of constructing a prediction information candidate list composed of predetermined prediction information candidates added with inter prediction information candidates,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
In the first prediction information derivation step, the first inter prediction information candidate is referred to without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded. And derivation of
The second prediction information deriving step is a division mode in which the encoded block is divided into 1: 1, 1: 3, or 3: 1 vertically by the upper block and the lower block, and becomes the decoding target. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. Without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be the reference index value of the second inter prediction information candidate. As default values, based on the reference index,
A receiving method, wherein the second inter prediction information candidate derivation process is performed. Encoded data obtained by dividing a coded block obtained by dividing each picture into one or a plurality of prediction blocks and packetizing a coded bit sequence in which a moving image is coded by intra prediction or inter prediction for each prediction block. Receiving step for receiving,
A packet processing step of packet-processing the received encoded data to generate an encoded stream;
A first process of deriving one or more first inter prediction information candidates from inter prediction information of one or more first blocks adjacent to a prediction block to be decoded in a picture to be decoded in the encoded stream. A prediction information deriving step;
A second inter prediction information candidate derivation process is performed from inter prediction information of a second block existing in the same position as or near the prediction block to be decoded in a picture different from the picture to be decoded. 2 prediction information deriving step;
When the first inter prediction information candidate is derived, the derived first inter prediction information candidate is obtained. When the second inter prediction information candidate is derived, the derived second inter prediction information candidate is derived. A candidate list construction step of constructing a prediction information candidate list composed of predetermined prediction information candidates added to each of inter prediction information candidates is executed by a computer,
The coding block is a block obtained by dividing a picture block by a rectangular unit into one or hierarchically divided into four,
In the first prediction information derivation step, the first inter prediction information candidate is referred to without referring to the encoding information of the third block included in the same encoding block as the encoding block including the prediction block to be decoded. And derivation of
The second prediction information deriving step is a division mode in which the encoded block is divided into 1: 1, 1: 3, or 3: 1 vertically by the upper block and the lower block, and becomes the decoding target. Based on the reference index, the reference index value of the second inter prediction information candidate is set as a default value without referring to the encoding information of the fourth block included in the encoding block including the prediction block. In a division mode in which a second inter prediction information candidate derivation process is performed, and the coding block is divided into left, right, and right and left blocks by 1: 1, 1: 3, or 3: 1. Without referring to the encoding information of the fifth block included in the encoding block including the prediction block to be the reference index value of the second inter prediction information candidate. As default values, based on the reference index, the receiving program and performs the process of deriving the second inter prediction information candidate.

Images