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

Abstract

PROBLEM TO BE SOLVED: To provide a video decoding device, a video decoding method, a video decoding program, a receiving device, a receiving method and a receiving program, which reduces an entire coded amount by compression of coded information in an image coding method using motion-compensating prediction.SOLUTION: A video decoding device comprises: a prediction motion vector candidate creation part 220 creates a plurality of prediction motion vector candidates by prediction from a decoded block adjacent to a decoding target block in the same picture with the decoding target block, and any of decoded blocks located at the position the same as and at the position around the decoding target block in a picture different from the picture of the decoding target block. When a prediction motion vector is predicted from a motion vector which crosses the decoding target image from a time direction predicted from the decoded block at the position the same as or around the decoding target block in the picture different from the picture of the decoding target block on a time axis, the priority of the prediction motion vector from the time direction is raised and registered in a prediction motion vector candidate list.

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. A technique for predicting motion by this motion compensation is called inter 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. Note that, for B pictures, a maximum of two reference pictures that have been encoded and decoded can be selected 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 prediction signal is generated. To do. 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.

In a moving picture coding system that performs motion compensation, a prediction process is performed on a motion vector in order to reduce the amount of code of the motion vector generated in each block. MPEG-4 AVC / H
. In H.264, using the fact that the motion vector to be encoded has a strong correlation with the motion vectors of neighboring neighboring blocks, a prediction motion vector is calculated by performing prediction from neighboring neighboring blocks, and the coding target motion vector is calculated. A difference motion vector that is a difference between the motion vector and the predicted motion vector is calculated, and the difference motion vector is encoded to reduce the amount of codes.

Specifically, as shown in FIG. 48 (a), a median value is calculated from the motion vectors of neighboring blocks A, B, and C in the vicinity to obtain a predicted motion vector, and the difference between the motion vector and the predicted motion vector As a result, the amount of code of the motion vector is reduced (Non-Patent Document 1). However,
When the shape of the encoding target block and the adjacent block are different as shown in FIG. 48 (b), when there are a plurality of adjacent blocks on the left side, the top block among them is displayed, and the plurality of adjacent blocks on the top. When there is a block, the leftmost block is a prediction block, and when the encoding target block is divided into 16 × 8 pixels or 8 × 16 pixels as shown in FIGS. 48 (c) and 48 (d), Rather than taking the median of the motion vectors of neighboring neighboring blocks, the reference destination is determined for each of the divided areas as indicated by the white arrows in FIGS. 48 (c) and 48 (d) according to the arrangement of the motion compensation blocks. Prediction blocks are determined, and prediction is performed from the motion vectors of the determined prediction blocks.

ISO / IEC 14496-10 Information technology-Coding of audio-visual objects-Part 10: Advanced Video Coding

However, in the method described in Non-Patent Document 1, since only one prediction vector is obtained, the prediction accuracy of the prediction motion vector may be lowered depending on the image, and the encoding efficiency may not be improved.

Under such circumstances, the present inventors in an image coding scheme using motion compensation prediction,
We have come to recognize the need to further compress the encoded information and reduce the overall code amount.

The present invention has been made in view of such a situation, and an object of the present invention is to provide a moving picture decoding technique for improving the coding efficiency by calculating the prediction motion vector candidates and thereby reducing the code amount of the difference motion vector. Is to provide. Another object is to provide a moving picture decoding technique that improves encoding efficiency by calculating encoding information candidates to reduce the amount of encoded information.

  The present invention is a moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture in block units obtained by dividing each picture of the moving picture, and the decoding target prediction in the same picture as the decoding target prediction block A prediction motion vector candidate generation unit for deriving one or more prediction motion vector candidates from a motion vector of a decoded prediction block adjacent to the block and registering the derived prediction motion vector candidates in a prediction motion vector candidate list; The prediction motion vector candidate generation unit derives a motion vector predictor of which motion vector of which prediction block of the decoded prediction blocks is obtained in order to obtain a set number of motion vector predictor candidates When determining whether or not the motion vector is the next adjacent block group on the left side and the adjacent block group on the upper side For a given order of the prediction block for each block group, condition 1. Condition 2. A motion vector of the same reference picture exists in the same reference list as the reference list of the motion vector predictor to be derived in the decoding target prediction block. Condition 3, in which a motion vector of the same reference picture exists in a reference list different from the reference list of the motion vector predictor to be derived in the decoding target prediction block. Condition 4. A motion vector of a different reference picture exists in the same reference list as the reference list of the motion vector predictor to be derived in the decoding target prediction block. The determination of each condition that a motion vector of a different reference picture exists in a reference list different from the reference list of the motion vector predictor to be derived in the decoding target prediction block is as follows. There is provided a moving picture decoding apparatus characterized in that the processing is performed for each prediction block in the priority order of 2, and then the conditions 3 and 4 are performed for each prediction block in the priority order of the conditions 3 and 4.

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

According to the present invention, a plurality of predicted motion vectors are calculated, an optimal predicted motion vector is selected from the plurality of predicted motion vectors, the generated code amount of the difference motion vector is reduced,
Encoding efficiency can be improved. Further, according to the present invention, a plurality of encoding information candidates are calculated, optimal motion information is selected from the plurality of encoding information, and the generated code amount of the encoded information to be transmitted is reduced, Encoding efficiency can be improved.

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 an encoding block. It is a figure explaining the kind of shape of a prediction block. It is a figure explaining a prediction block group. It is a figure explaining a prediction block group. It is a figure explaining a prediction block group. It is a figure explaining a prediction block group. It is a figure explaining a prediction block group. It is a figure explaining the syntax of the bit stream in the slice level regarding the prediction method of a motion vector. It is a figure explaining the syntax of the bit stream in the prediction block level regarding the prediction method of a motion vector. It is a block diagram which shows the detailed structure of the difference motion vector calculation part of FIG. FIG. 3 is a block diagram illustrating a detailed configuration of a motion vector calculation unit in FIG. 2. It is a flowchart explaining operation | movement of the difference motion vector calculation part of FIG. 3 is a flowchart illustrating an operation of a motion vector calculation unit in FIG. 2. It is a flowchart explaining the prediction method of a motion vector. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the scaling method of a motion vector. It is a figure explaining scaling of a motion vector. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the prediction motion vector candidate calculation method. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a flowchart explaining the registration method of the candidate of a motion vector predictor to a motion vector predictor candidate list. It is a figure explaining the surrounding prediction block in merge mode. It is a block diagram which shows the detailed structure of the inter prediction information estimation part of FIG. It is a block diagram which shows the detailed structure of the inter prediction information estimation part of FIG. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a flowchart explaining operation | movement of merge mode. It is a figure explaining the calculation method of the conventional prediction motion vector.

In the embodiment, with regard to video encoding, in particular, in order to improve encoding efficiency in video encoding in which a picture is divided into rectangular blocks and motion compensation is performed in units of blocks between pictures, A plurality of predicted motion vectors from the motion vector of the block,
The amount of code is reduced by calculating and encoding a difference vector between the motion vector of the block to be encoded and the selected predicted motion vector. Alternatively, the amount of code is reduced by estimating the encoding information of the encoding target block by using the encoding information of the surrounding blocks that have already been encoded. Also, in the case of decoding a moving image, a plurality of predicted motion vectors are calculated from the motion vectors of the peripheral blocks that have been decoded, and a decoding target is calculated from the difference vector decoded from the encoded stream and the selected predicted motion vector. The motion vector of the block is calculated and decoded. Alternatively, the encoding information of the decoding target block is estimated by using the encoding information of the peripheral blocks that have been decoded.

FIG. 1 is a block diagram showing a configuration of a moving picture encoding apparatus according to an embodiment. 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 estimation unit 104, a motion compensation prediction unit 105, a prediction method determination unit 106, a residual signal. Generation unit 107, orthogonal transform / quantization unit 108, first encoded bit string generation unit 109, second encoded bit string generation unit 110, multiplexing unit 111, inverse quantization / inverse orthogonal transform unit 112, decoded image signal A superimposing unit 113, an encoded information storage memory 114, and a decoded image memory 115 are provided.

The image memory 101 temporarily stores image signals to be encoded supplied in the order of shooting / display time. The image memory 101 stores the image signal to be encoded in a predetermined pixel block unit, a motion vector detection unit 102, a prediction method determination unit 106, and a residual signal generation unit 107.
To supply. At this time, the images stored in the order of shooting / display time are rearranged in the encoding order and output from the image memory 101 in units of pixel blocks.

The motion vector detection unit 102 calculates a motion vector for each prediction block size and each prediction mode by block matching or the like between the image signal supplied from the image memory 101 and the decoded image (reference picture) supplied from the decoded image memory 115. Detect for each prediction block,
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 106. Here, the prediction block is a unit for performing motion compensation, and details thereof will be described later.

The difference motion vector calculation unit 103 calculates a plurality of motion vector predictor candidates using the encoded information of the already encoded image signal stored in the encoded information storage memory 114, and puts it in an MVP list to be described later. Registering, selecting an optimal motion vector predictor from a plurality of motion vector predictor candidates registered in the MVP list, calculating a motion vector difference from the motion vector detected by the motion vector detection unit 102 and the motion vector predictor, The calculated difference motion vector is supplied to the prediction method determination unit 106.

In addition to the encoded information, when switching the weighting parameter used for weighted prediction for each prediction block as will be described later, the weighting parameter for weighted prediction of the selected prediction block (weighting to multiply the motion compensation image signal) The coefficient value and the weighting offset value to be added) are also supplied to the prediction method determination unit 106.

Further, the prediction method determination unit 106 is supplied with an MVP index that identifies a prediction motion vector selected from prediction motion vector candidates registered in the MVP list. The detailed configuration and operation of the difference motion vector calculation unit 103 will be described later.

The inter prediction information estimation unit 104 estimates inter prediction information in merge mode. The merge mode is a prediction mode of the prediction block, a reference index (information for specifying a reference image used for motion compensation prediction from a plurality of reference images registered in the reference list),
In this mode, inter prediction information such as a motion vector is not encoded, but inter prediction information of an adjacent inter-predicted prediction block that has been encoded or an inter-predicted prediction block of a different image is used. Using the encoding information of the already encoded prediction block stored in the encoding information storage memory 114, a plurality of merge candidates (inter prediction information candidates) are calculated and registered in a merge candidate list described later, The optimum merge candidate is selected from a plurality of merge candidates registered in the merge candidate list, and the inter prediction information such as the prediction mode, the reference index, and the motion vector of the selected merge candidate is detected by the motion compensation prediction unit 10.
5 and a merge index for specifying the selected merge candidate is supplied to the prediction method determination unit 106. In addition to the encoded information, when switching the weighting parameter for each prediction block as described later, the weighting parameter for the weighted prediction of the selected merge candidate is also supplied to the motion compensation prediction unit 105. Further, a merge index that identifies the selected merge candidate is supplied to the prediction method determination unit 106. In addition to these pieces of coding information, coding information such as quantization parameters for quantization of the selected coded prediction block can also be used as a predicted value. Information is supplied to the prediction method determination unit 106. The detailed configuration and operation of the inter prediction information estimation unit 104 will be described later.

The motion compensation prediction unit 105 includes a motion vector detection unit 102 and an inter prediction information estimation unit 1.
A prediction image signal is generated by motion compensation prediction from the reference picture using the motion vector detected in 04, and the prediction image signal is supplied to the prediction method determination unit 106. In the L0 prediction mainly used as the forward prediction and the L1 prediction mainly used as the backward prediction, the unidirectional prediction is performed. In the case of bi-prediction, bi-directional prediction is performed, and a weighting factor is adaptively applied to each inter-predicted signal of L0 prediction mainly used as forward prediction and L1 prediction mainly used as backward prediction. Are multiplied, offset values are added and superimposed, and a final predicted image signal is generated. Note that the weighting parameters including weighting coefficients and offset values used for weighted prediction may be switched in units of pictures, may be switched in units of slices, or may be switched in units of prediction blocks. When the weighting parameter is switched in units of pictures or slices, a representative value is set and encoded for each reference picture in each list in units of pictures or slices. When switching by prediction block,
Weighting parameters are set for each prediction block and encoded.

The prediction method determination unit 106 evaluates the code amount of the difference motion vector, the amount of distortion between the motion compensated prediction signal and the image signal, and the like, so that an optimum prediction block size (prediction block size) is selected from a plurality of prediction methods. 4 will be described later with reference to FIG. 4), a prediction method such as prediction mode, merge mode or the like is determined, information indicating the determined prediction method, a difference motion vector corresponding to the determined prediction method, and the like Is supplied to the first encoded bit string generation unit 109. It should be noted that the weighted parameter used when performing weighted prediction and the predicted value of the encoded information of the quantization parameter used when performing quantization / inverse quantization are supplied to the first encoded bit string generation unit 109 as necessary. .

Furthermore, the prediction method determination unit 106 stores, in the encoded information storage memory 114, information indicating the determined prediction method and encoded information including a motion vector corresponding to the determined prediction method. Note that the weighting parameter for weighted prediction supplied from the prediction method determination unit 106 is stored in the encoded information storage memory 114 as necessary. The prediction method determination unit 106 provides a motion compensated prediction image signal corresponding to the determined prediction mode to the residual signal generation unit 107 and the decoded image signal superimposition unit 113.

The residual signal generation unit 107 generates a residual signal by subtracting the image signal to be encoded and the prediction signal, and supplies the residual signal to the orthogonal transform / quantization unit 108.
The orthogonal transform / quantization unit 108 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 110 and the inverse quantization / inverse orthogonal transform unit 112. Further, the orthogonal transform / quantization unit 108
Stores the quantization parameter in the encoded information storage memory 114.

The first encoded bit string generation unit 109 encodes encoded information according to the prediction method determined by the prediction method determination unit 106 for each prediction block, in addition to information on a sequence, a picture, a slice, and an encoded block unit. Turn into. Specifically, a parameter for determining whether or not inter prediction is used, a parameter for determining whether or not the mode is merge mode in the case of inter prediction, a merge index in the case of merge mode, a prediction mode, MVP index, and difference motion in the case of not being in merge mode Encoding information such as vector information is encoded in accordance with a prescribed syntax rule described later to generate a first encoded bit string, which is supplied to the multiplexing unit 111.
In the merge mode, when there is one merge candidate registered in the merge candidate list described later, the merge index mergeIdx can be specified as 0, and is not encoded. Similarly, when the mode is not the merge mode, if there is one candidate motion vector registered in the MVP list, which will be described later, the MVP index mergeIdx can be specified as 0, so that it is not encoded.

Here, when encoding the MVP index, the MVP list has a high priority (
In other words, a code having a shorter code length is assigned to the MVP index (which has a smaller index number) and variable length coding is performed. Similarly, when encoding a merge index, a variable index is assigned by assigning a code having a shorter code length to a merge index having a higher priority in the merge list (that is, a smaller index number).

When adaptively switching weighted prediction in units of prediction blocks, the weighting parameter for weighted prediction supplied from the prediction method determination unit 106 when not in the merge mode is also encoded. The difference between the predicted value of the quantization parameter encoding information for quantization and the value actually used is encoded.

The second encoded bit string generation unit 110 generates a second encoded bit string by entropy-encoding the orthogonally transformed and quantized residual signal according to a prescribed syntax rule, and supplies the second encoded bit string to the multiplexing unit 111. The multiplexing unit 111 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 112 calculates a residual signal by performing inverse quantization and inverse orthogonal transform on the orthogonal transform / quantized residual signal supplied from the orthogonal transform / quantization unit 108 to perform decoding. This is supplied to the image signal superimposing unit 113. The decoded image signal superimposing unit 113 superimposes the prediction signal according to the determination by the prediction method determining unit 106 and the residual signal that has been inversely quantized and inverse orthogonal transformed by the inverse quantization / inverse orthogonal transform unit 112 to generate a decoded image. Generated and stored in the decoded image memory 115. The decoded image may be stored in the decoded image memory 115 after filtering processing for reducing distortion such as block distortion due to encoding. In that case, predicted encoded information such as a flag for identifying information of a post filter such as ALF or a deblocking filter is stored in the encoded information storage memory 114 as necessary.

FIG. 2 is a block diagram showing a configuration of a moving picture decoding apparatus according to an embodiment 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 estimation unit 205, and a motion compensation prediction unit 206. , An inverse quantization / inverse orthogonal transform unit 207, a decoded image signal superimposing unit 208, an encoded information storage memory 209, and a decoded image memory 210.

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 207, the decoded image signal superimposing unit 208, the encoded information storage memory 209, and the decoded image memory 210 are the motion compensated prediction unit 105 of the moving image encoding device in FIG.
Each of the configurations of the inverse orthogonal transform unit 112, the decoded image signal superimposing unit 113, the encoded information storage memory 114, and the decoded image memory 115 has a corresponding function.

The bit stream supplied to the separation unit 201 is separated according to a rule of a prescribed syntax, and the separated encoded bit string is supplied to the first encoded bit string decoding unit 202 and the second encoded bit string decoding unit 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, a parameter for determining whether or not inter prediction, a parameter for determining whether or not inter prediction, a merge index in the merge mode, a prediction mode, an MVP index, a difference motion vector, etc. in the non-merge mode The information is decoded according to a prescribed syntax rule to be described later, and the encoded information is supplied to the motion vector calculation unit 204 or the inter prediction information estimation unit 205 and the motion compensation prediction unit 206 and stored in the encoded information storage memory 209. In the merge mode, if there is one merge candidate registered in the merge candidate list, which will be described later, the merge index mergeIdx can be specified as 0, so the encoded bit string is not encoded, and mergeIdx is set to 0. To do. Therefore, in the merge mode, the first encoded bit string decoding unit 202 is supplied with the number of merge candidates registered in the merge candidate list calculated by the inter prediction information estimation unit 205. Similarly, when the mode is not the merge mode, when there is one candidate motion vector registered in the MVP list described later, the MVP index mvpIdx can be specified as 0, so it is not encoded, and mvpIdx is set to 0. Therefore, when not in the merge mode, the first encoded bit string decoding unit 202 uses the MVP calculated by the motion vector calculation unit 204.
The number of motion vector predictor candidates registered in the list is supplied.

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 207.

When the prediction block to be decoded is not in the merge mode, the motion vector calculation unit 204 uses the encoded information of the already decoded image signal stored in the encoded information storage memory 209 to generate a plurality of prediction motion vector candidates. Is calculated and registered in an MVP list, which will be described later, and a first encoded bit string decoding unit 2 is selected from a plurality of motion vector predictor candidates registered in the MVP list.
A prediction motion vector corresponding to the encoded information that is decoded and supplied in 02 is selected, a motion vector is calculated from the difference vector decoded by the first encoded bit string decoding unit 202 and the selected prediction motion vector, and motion compensation is performed. The encoded information storage memory 20 is supplied to the prediction unit 206.
9 is supplied. Furthermore, the number of predicted motion vector candidates registered in the MVP list calculated by the motion vector calculation unit 204 is supplied to the first encoded bit string decoding unit 202. The detailed configuration and operation of the motion vector calculation unit 204 will be described later.

The inter prediction information estimation unit 205 estimates the inter prediction information in the merge mode when the prediction block to be decoded is in the merge mode. A plurality of merge candidates are calculated and registered in a merge candidate list, which will be described later, using the encoded information of the already decoded prediction block stored in the encoded information storage memory 114, and registered in the merge candidate list. A merge candidate corresponding to the merge index decoded and supplied by the first encoded bit string decoding unit 202 is selected from a plurality of merge candidates, and the selected merge candidate prediction mode, reference index, prediction motion vector, etc. are selected. The prediction information is supplied to the motion compensation prediction unit 206 and stored in the encoded information storage memory 209. Further, the number of merge candidates registered in the merge candidate list calculated by the inter prediction information estimation unit 205 is supplied to the first encoded bit string decoding unit 202. In addition to the encoded information, when switching the weighting parameter for each prediction block as described later, the weighting parameter for the weighted prediction of the selected merge candidate is also supplied to the motion compensated prediction unit 206. In addition to the encoded information of the selected encoded prediction block, encoded information other than the inter prediction information of the quantization parameter of quantization can also be used as a prediction value. Coding information to be predicted can also be supplied to the prediction method determination unit 106. The detailed configuration and operation of the inter prediction information estimation unit 205 will be described later.

The motion compensation prediction unit 206 generates a prediction image signal by motion compensation prediction from the reference picture using the motion vector calculated by the motion vector calculation unit 204, and supplies the prediction image signal to the decoded image signal superimposition unit 208. In the case of bi-prediction, a weighted coefficient is adaptively multiplied and superimposed on the two motion compensated prediction image signals of L0 prediction and L1 prediction to generate a final prediction image signal.

The inverse quantization / inverse orthogonal transform unit 207 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 208 superimposes the predicted image signal subjected to motion compensation prediction by the motion compensation prediction unit 206 and the residual signal subjected to inverse orthogonal transform / inverse quantization by the inverse quantization / inverse orthogonal transform unit 207. As a result, the decoded image signal is decoded and stored in the decoded image memory 210. When stored in the decoded image memory 210, the decoded image may be stored in the decoded image memory 210 after filtering processing for reducing block distortion or the like due to encoding is performed on the decoded image.

The motion vector prediction method according to the embodiment is implemented in the difference motion vector calculation unit 103 of the video encoding device in FIG. 1 and the motion vector calculation unit 204 of the video decoding device in FIG.

Before describing an embodiment of a motion vector prediction method, terms used in this embodiment will be defined.

(About coding block)
In the embodiment, as shown in FIG. 3, the inside of the screen is equally divided into square units of any same size. This unit is defined as a tree block, and is used as a basic unit of address management for specifying an encoding / decoding target block (an encoding target block in encoding and a decoding target block in decoding) in an image. The tree block can be divided into four hierarchically in the tree block according to the texture in the screen, and the block can be made smaller in block size if necessary. This block is defined as a coding block, which is a basic unit of processing when performing coding and decoding. The tree block is also the maximum size coding block. An encoded block having a minimum size that cannot be further divided into four is referred to as a minimum encoded block.

(About prediction block)
When motion compensation is performed by dividing the screen into blocks, the smaller the motion compensation block size, the more detailed prediction can be made, so it is optimal among several block shapes and sizes A mechanism is adopted in which motion compensation is performed by selecting an object and dividing the inside of the coding block. A unit for performing this motion compensation is called a prediction block. FIG.
As shown in FIG. 4, the encoded block is regarded as one prediction block without being divided (FIG. 4).
(A)) is divided into 2N × 2N and divided horizontally into two prediction blocks (FIG. 4).
(B)) is divided into 2N × N and vertically divided into two prediction blocks (FIG. 4 (c)
) Into two prediction blocks by N × 2N division and horizontal and vertical equal division (FIG. 4 (
d) is defined as N × N division, respectively.

In order to identify each prediction block within the coding block, a number starting from 0 is assigned to the prediction block existing inside the coding block. This number is defined as the predicted block index puPartIdx. The number described in each prediction block of the encoded block in FIG. 4 is the prediction block index puPart of the prediction block.
Represents Idx.

(About prediction block groups)
A group composed of a plurality of prediction blocks is defined as a prediction block group. FIG. 5 is a diagram illustrating a prediction block group adjacent to a prediction block to be encoded / decoded within the same picture as a prediction block to be encoded / decoded. FIG. 9 illustrates an already encoded / decoded prediction block group that exists at the same position as or near the prediction block to be encoded / decoded in a picture temporally different from the prediction block to be encoded / decoded. It is a figure to do. The prediction block group of the present invention will be described with reference to FIGS. 5, 6, 7, 8, and 9.

A prediction block A1 adjacent to the left side of the prediction block to be encoded / decoded within the same picture as the prediction block to be encoded / decoded, a prediction block A0 adjacent to the lower left of the prediction block to be encoded / decoded, and a code A first prediction block group composed of a prediction block A2 adjacent to the upper left of the prediction block to be encoded / decoded (same as a prediction block B2 described later) is defined as a prediction block group adjacent to the left side.

In addition, as shown in FIG. 6, even when the size of the prediction block adjacent to the left side of the prediction block to be encoded / decoded is larger than the prediction block to be encoded / decoded,
When the prediction block A adjacent to the left side is adjacent to the left side of the prediction block to be encoded / decoded, the prediction block A1 is used. If it is adjacent to the upper left of the prediction block to be encoded / decoded, the prediction block is A2.

In addition, as shown in FIG. 7, when the size of the prediction block adjacent to the left side of the prediction block to be encoded / decoded is smaller than the prediction block to be encoded / decoded, and there are a plurality of prediction blocks, the lowest is among them. Only the prediction block A10 is included in the prediction block group adjacent to the left side as the prediction block A1 adjacent to the left side. However, the highest prediction block A1 among them
2 may be included in the prediction block group adjacent to the left side as the prediction block A1 adjacent to the left side, and the lowest prediction block A10 and the top prediction block A12 are both included in the prediction block group adjacent to the left side. Alternatively, all the prediction blocks A10, A11, A12 adjacent on the left side may be included in the prediction block group adjacent on the left side. A prediction block B1 adjacent to the upper side of the prediction block to be encoded / decoded within the same picture as the prediction block to be encoded / decoded, a prediction block B0 adjacent to the upper right of the prediction block to be encoded / decoded, and a code A second prediction block group composed of a prediction block B2 (same as the prediction block A2) adjacent to the upper left of the prediction block to be coded / decoded is defined as a prediction block group adjacent to the upper side.

As shown in FIG. 8, even when the size of the prediction block adjacent to the upper side of the prediction block to be encoded / decoded is larger than the prediction block to be encoded / decoded,
When the prediction block B adjacent to the upper side is adjacent to the upper side of the prediction block to be encoded / decoded, the prediction block B1 is used. If it is adjacent to the upper left of the prediction block to be encoded / decoded, the prediction block is B2.

In addition, as shown in FIG. 7, when the size of the prediction block adjacent to the upper side of the prediction block to be encoded / decoded is small and there are a plurality of prediction blocks, only the rightmost prediction block B10 is adjacent to the upper side. The prediction block B1 to be included is included in the prediction block group adjacent on the upper side. However, only the leftmost prediction block B12 may be included in the prediction block group adjacent to the upper side as the prediction block B1 adjacent to the upper side, or the rightmost prediction block B10 and the leftmost prediction block B12 may be included. Both may be included in the prediction block group adjacent on the left side, or all prediction blocks adjacent on the upper side may be included in the prediction block group adjacent on the upper side.

Note that the prediction block A2 / B2 adjacent to the upper right is included in both the prediction block group adjacent to the left side and the prediction block group adjacent to the left side. When the prediction block group adjacent to A2 and the upper side is described, it is assumed to be the prediction block B2.

In this method, the prediction block adjacent to the upper left belongs to both the prediction block group adjacent to the left side and the prediction block group adjacent to the upper side, thereby increasing the chance of searching for a motion vector predictor candidate. When performing parallel processing, the maximum processing amount does not increase,
When importance is attached to the reduction of the processing amount in serial processing, the prediction block adjacent to the upper left may belong to only one of the groups.

As shown in FIG. 9, in a picture temporally different from a prediction block to be encoded / decoded, a prediction that has already been encoded / decoded and exists at the same position as or near the prediction block to be encoded / decoded. A third prediction block group composed of block groups T0, T1, T2, T3, and T4 is defined as a prediction block group at different times.

(About reference list)
At the time of encoding and decoding, a reference picture is designated and referred from a reference index for each reference list LX. L0 and L1 are prepared, and X is 0 or 1. Inter prediction that refers to a reference picture registered in the reference list L0 is L0 prediction (Pred_L0).
), And motion compensated prediction that refers to reference pictures registered in the reference list L1 is L1.
This is called prediction (Pred_L1). L0 prediction is mainly used for forward prediction, L1 prediction is used for backward prediction, only L0 prediction is used for P slices, L0 prediction, L1 prediction for B slices,
Both predictions (Pred_BI) for averaging or weighted addition of L0 prediction and L1 prediction can be used. In the subsequent processing, it is assumed that the value with the subscript LX in the output is processed for each L0 prediction and L1 prediction.

(About POC)
POC is a variable associated with an image to be encoded, and a value that increases by 1 in the output order is set. Depending on the POC value, it is possible to determine whether the images are the same, to determine the context in the output order, or to determine the distance between images. For example, when the POC of two images have the same value, it can be determined that they are the same image. 2 images PO
When C has a different value, it can be determined that the image with the smaller POC value is the image output first, and the difference between the POCs of the two images indicates the inter-frame distance.

A motion vector prediction method according to an embodiment will be described with reference to the drawings. The motion vector prediction method is performed in any of the encoding and decoding processes for each prediction block constituting the encoding block. When inter-picture coding by motion compensation (inter prediction) is selected, in the case of coding, an encoded motion vector used when calculating a differential motion vector to be coded from a motion vector to be coded is used. When the prediction motion vector is calculated, in the case of decoding, the prediction motion vector is calculated using the decoded motion vector used when calculating the motion vector to be decoded.

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

FIG. 10 shows a first syntax pattern described in the slice header in units of slices of the bitstream generated according to the present invention. When performing inter-picture prediction (inter prediction) by motion compensation in units of slices, that is, when the slice type is P (unidirectional prediction) or B (bidirectional prediction), in a prediction block that is not in inter prediction merge mode, Whether to perform motion vector prediction using the motion vector of the prediction block at the same position or nearby as the processing target prediction block in the picture that is different in the time direction as well as the motion vector of the neighboring prediction block in In the prediction block in the inter prediction merge mode, not only the coding information of neighboring neighboring prediction blocks in the same picture, but also the same position or the vicinity of the prediction block to be processed in a picture different in the time direction Indicates whether to perform inter prediction using the coding information of the prediction block 1 flag mv_competition_temporal_flag is installed.

Furthermore, when mv_competition_temporal_flag is true (1), motion vector candidates of a prediction block at the same position or in the vicinity of a prediction block to be processed in a picture that is different in the temporal direction have priority in a prediction block that is not in inter prediction merge mode. Indicates whether or not to be registered in the MVP list to be described later, and in the prediction block in the inter prediction merge mode, the merge candidate at the same position or in the vicinity of the prediction block to be processed in the picture that is different in the time direction has priority A second flag mv_temporal_high_ indicating whether or not to be registered in a merge candidate list to be described later
priority_flag is installed. This value may be fixed to true (1) or false (0) in order to simplify the determination process described later, but it is more coded by changing adaptively for each frame in order to improve coding efficiency. Reduce the amount.

When the distance between the encoding / decoding target picture and the nearest reference picture is short, mv_
When temporal_high_priority_flag is set to true (1) and the distance between the encoding / decoding target image and the reference picture is far, by setting it to false (0), the code amount of the MVP index or merge index described later is set. Can be reduced. This is because if this distance is relatively small, it can be determined that MVP candidates or merge candidates from different times are relatively suitable as candidates. For example, when the frame rate is 30 Hz, when the distance between the encoding / decoding target picture and the nearest reference picture is within X frames (X = 1 to 3), mv_temporal_high_priority_f
When lag is true (1) and the distance between the encoding / decoding target image and the reference picture is larger than the X frame, by setting it to false (0), an MVP index or a merge index described later is set. The amount of codes can be reduced. When this distance is small, the inter prediction reliability is higher than when the distance is large, and it is determined that the distance is suitable. By changing this threshold value X according to the contents of the sequence, the code amount can be further reduced. In the case of a complex sequence with large motion, encoding efficiency can be improved by lowering the priority of the MVP candidates and merge candidates in the time direction by reducing the threshold value X. Alternatively, the priority order can be controlled based on statistics in the course of the encoding process. The number of selected selections at the time of the encoding process is counted, and the motion vector candidate or merge candidate of the prediction block at the same position as the processing target prediction block in the picture that is different in the time direction is left or above in the same picture. If there are more motion vectors than neighboring surrounding prediction blocks, mv_temporal_high_priority_flag of the subsequent encoding target image
Is true (1), and in the case where the distance between the encoding / decoding target image and the reference picture is long, by setting false (0), the code of the MVP index or the merge index described later is set. The amount can be reduced.

Further, when the slice type is B, a reference list of L0s of pictures including a prediction block to be processed that includes a picture colPic that is different in the temporal direction used in calculating a temporal motion vector predictor candidate or a merge candidate. A third flag collocated_from_l indicating which of the reference images registered in the L1 reference list is to be used
0_flag is set.

Further, when the slice type is P (one-way prediction) or B (bi-directional prediction), the first indicates whether to change the registration order in the MVP list or merge candidate list described later for each prediction block. Four flags mv_list_adaptive_idx_flag are set.

The above syntax elements may be installed in a picture parameter set describing syntax elements set in units of pictures.

Also, the first flag mv_competition_temporal_flag, the second flag mv_temporal_high_priority_flag, the third flag collocated_from_l0_flag, and the fourth flag mv_list_ad
The independent_idx_flag can be controlled independently by preparing separate flags for motion vector prediction that are not in the merge mode and for merge mode, respectively.

FIG. 11 shows a syntax pattern described in units of prediction blocks. MODE_INT in which the value of the prediction mode PredMode of the prediction block indicates inter-picture prediction (inter prediction)
In the case of ER, merge_flag [x0] [y0] indicating whether or not the merge mode is set. Here, x0 and y0 are indexes indicating the position of the upper left pixel of the prediction block in the screen of the luminance signal, and merge_flag [x0] [y0] is (x0,
This is a flag indicating whether or not the prediction block located at y0) is in merge mode.

Next, when merge_flag [x0] [y0] is 1, it indicates merge mode. When NumMergeCand exceeds 1, syntax of index of merge list that is a list of predicted motion vector candidates to be referred to. Element merge_idx [
x0] [y0] is installed. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the screen, and merge_idx [x0] [y0] is (
This is the merge index of the prediction block located at x0, y0). Function NumMer
geCand represents the number of merge candidates and will be described later. The merge list index syntax element merge_idx [x0] [y0] is the number of merge candidates Num.
Only when MergeCand is larger than 1, if the total number of motion vector predictor candidates is 1, one of them becomes a merge candidate, so merge_idx [x0
This is because the merge candidate to be referred to is determined without transmitting [y0].

On the other hand, when merge_flag [x0] [y0] is 0, it indicates that it is not the merge mode, and when the slice type is B, a syntax element in that identifies the inter prediction mode.
ter_pred_flag [x0] [y0] is installed. For each reference list LX (X = 0 or 1), a reference picture index syntax element ref_idx_lX [x0] [y0] for specifying a reference picture, a motion vector and a prediction of a prediction block obtained by motion vector detection Syntax element mv of difference motion vector with motion vector
d_lX [x0] [y0] [j] is installed. Here, X is 0 or 1, indicating the prediction direction, the array index x0 is the x coordinate of the prediction block, y0 is the y coordinate of the prediction block, j
Represents a differential motion vector component, j = 0 represents an x component, and j = 1 represents a y component. Next, when the total number of motion vector predictor candidates exceeds 1, the syntax element mvp_idx_lX [x of the index of the MVP list that is a list of motion vector predictor candidates to be referred to
0] [y0] are installed. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the screen, and mvp_idx_lX [x0] [y0] is ((
This is the MVP index of the list LX of predicted blocks located at x0, y0). The subscript LX represents a reference list, and two L0 and L1 are prepared, and 0 or 1 is entered in X.
The function NumMVPCand (LX) represents a function for calculating the total number of motion vector predictor candidates for the prediction block in the prediction direction LX (X is 0 or 1), and will be described later. This MV
The index mvp_idx_lX [x0] [y0] of the P list is encoded when the total number of predicted motion vector candidates NumMVPCand (LX) is larger than 1 by the motion vector prediction method. This is because if the total number of prediction motion vector candidates is one, one of them becomes a prediction motion vector, and therefore the reference motion vector candidate to be referred to is determined without transmitting mvp_idx_lX [x0] [y0].

(Prediction of motion vector in encoding)
The operation of the motion vector prediction method according to the embodiment in the video encoding device that encodes a video bitstream based on the above-described syntax will be described. The motion vector prediction method is a case where inter-picture prediction is performed by motion compensation in units of slices, that is, when the slice type is a P slice (unidirectional prediction slice) or a B slice (bidirectional prediction slice). The prediction mode of the prediction block is inter-picture prediction (MODE_INTE
Applied to the prediction block of R).

FIG. 12 is a diagram showing a detailed configuration of the differential motion vector calculation unit 103 of the moving picture encoding device of FIG. A portion surrounded by a thick frame line in FIG. 12 indicates the differential motion vector calculation unit 103.

Further, the part surrounded by a thick dotted line inside thereof shows an operation unit of a motion vector prediction method described later, and is similarly installed in a video decoding device corresponding to the video encoding device of the embodiment, The same determination result that does not contradict between encoding and decoding can be obtained. Hereinafter, a motion vector prediction method in encoding will be described with reference to FIG.

The difference motion vector calculation unit 103 includes a prediction motion vector candidate generation unit 120, a prediction motion vector registration unit 121, a prediction motion vector candidate identity determination unit 122, a prediction motion vector candidate code amount calculation unit 123, a prediction motion vector selection unit 124, and A motion vector subtraction unit 125 is included.
In the difference motion vector calculation process in the difference motion vector calculation unit 103, a difference motion vector of the motion vector used in the inter prediction method selected in the encoding target block is calculated. Specifically, when the encoding target block is L0 prediction, a differential motion vector of the L0 motion vector is calculated, and when the encoding target block is L1 prediction, a differential motion vector of the L1 motion vector is calculated. When the encoding target block is bi-predicted, both L0 prediction and L1 prediction are performed, and a differential motion vector of the L0 motion vector and a differential motion vector of the L1 motion vector are calculated.

For each reference list (L0, L1), the motion vector predictor candidate generation unit 120 has a prediction block group adjacent to the upper side (prediction block group adjacent to the left side of the prediction block in the same picture as the prediction block to be encoded: A0, A1, A2 in FIG. 5), a prediction block group adjacent to the left side (prediction block group adjacent to the upper side of the prediction block in the same picture as the prediction block to be encoded: B0, B1, B2 in FIG. 5) , A prediction block group at a different time (a prediction block group that has already been encoded and exists at the same position as or near the prediction block in a picture temporally different from the prediction block to be encoded: T0 in FIG. One motion for each prediction block group from the three prediction block groups T1, T2, T3) Vector mvLXA, MvLXB, calculated respectively MvLXCol, the predicted motion vector candidates, and supplies the predicted motion vector register unit 121. Hereinafter, mvLXA and mvLXB are called spatial motion vectors, and mvLXCol is called a temporal motion vector. When calculating the predicted motion vector candidates, the encoded information storage memory 1
14, encoding information such as a prediction mode of an encoded prediction block stored in 14, a reference index for each reference list, a POC of a reference picture, and a motion vector are used.

These predicted motion vector candidates mvLXA, mvLXB, and mvLXCol may be calculated by scaling according to the relationship between the POC of the image to be encoded and the POC of the reference picture.

The motion vector predictor candidate generation unit 120 is in a predetermined order for each prediction block group,
For each prediction block in each prediction block group, a condition determination described later is performed, and a motion vector of a prediction block that first matches the condition is selected, and a predicted motion vector candidate mv
Let LXA, mvLXB, mvLXCol.

When calculating a motion vector predictor from the prediction block group adjacent to the left side, the prediction block group adjacent to the left side is adjacent to the upper side in the order from the bottom to the top (order A0 to A0, A1, A2 in FIG. 5). When calculating a prediction motion vector from a prediction block group to be
The order from the right to the left of the prediction block group adjacent to the upper side (B0 to B0, B1, B1 in FIG. 5)
2), when the motion vector predictor is calculated from the prediction block groups at different times, the condition determination described later is performed for each prediction block in the order of T0 to T0, T1, T2, and T3 in FIG. First, the motion vector of the prediction block that matches the condition is selected, and the prediction motion vector candidates are set to mvLXA, mvLXB, and mvLXCol, respectively.

That is, in the left adjacent prediction block group, the lowest prediction block has the highest priority, and the priority is given from the bottom to the top. In the upper adjacent prediction block group, the rightmost prediction block Blocks have the highest priority and are prioritized from right to left. In the prediction block group at different times, the prediction block of T0 has the highest priority, and the priority is given in the order of T0, T1, T2, and T3. The priority order based on the position of this prediction block is defined as priority order A.

(Explanation of loop for condition judgment of spatial prediction block)
The respective condition determinations are applied to the adjacent prediction blocks of the left adjacent prediction block group and the upper adjacent prediction block group in the following priority order of the condition determinations 1, 2, 3, and 4. However, with the exception of method 5 described later, the respective condition determinations are applied in the priority order of condition determinations 1, 3, 2, and 4.
Condition determination 1: Prediction using the same reference index, that is, a reference frame, is performed in the adjacent prediction block with the same reference list as the motion vector of the difference motion vector calculation target of the prediction block of the encoding / decoding target.
Condition determination 2: Although the reference list is different from the motion vector of the difference motion vector calculation target of the prediction block to be encoded / decoded, prediction using the same reference frame is performed in the adjacent prediction block.
Condition determination 3: Prediction using the same reference list as the motion vector of the difference motion vector calculation target of the prediction block of the encoding / decoding target and using a different reference frame is performed in the adjacent prediction block.
Condition determination 4: Prediction using a different reference frame in a reference list that is different from a motion vector that is a difference motion vector calculation target of a prediction block that is an encoding / decoding target is performed in an adjacent prediction block.

This priority order is defined as priority order B. If any of these conditions is met, it is determined that there is a motion vector that matches the condition in the prediction block, and the subsequent condition determination is not performed. Note that when the condition of condition determination 1 or condition determination 2 is met, the motion vector of the corresponding adjacent prediction block corresponds to the same reference frame, so that it is used as a predicted motion vector candidate as it is. If the condition of condition determination 4 is met, the motion vector of the corresponding adjacent prediction block corresponds to a different reference frame. Therefore, the motion vector is calculated by scaling based on the motion vector as a candidate for the motion vector predictor. In addition, when the condition determination of each adjacent prediction block is processed in series instead of in parallel, in the condition determination of the second prediction block group to be performed second (if the condition determination of the left adjacent prediction block group is first, the upper adjacent In the condition determination of the prediction block group), when the motion vector predictor candidate of the prediction block group has the same value as the motion vector predictor candidate determined in the previous prediction block group, the motion vector predictor candidate is not adopted. The next condition determination may be performed. By performing the following condition determination in this way, it is possible to prevent a decrease in predicted motion vector candidates.

As a scanning loop of the spatial prediction block, the following four methods can be set according to the above-described four condition determination methods. The appropriateness of the prediction vector and the maximum processing amount differ depending on each method, and these are selected and set in consideration of them. Only method 1 will be described later in detail with reference to the flowcharts of FIGS. 17 to 21, but for other methods 2 to 4 as well, those skilled in the art will follow the procedure for performing method 1 for the procedure of performing methods 2 to 4. Since this is a matter that can be designed accordingly, detailed description is omitted. In addition, although the loop process of the scan of the spatial prediction block in a moving image encoder is demonstrated here, it cannot be overemphasized that a similar process is also possible in a moving image decoder.

Method 1:
Of the four condition determinations, one condition determination is performed for each prediction block. If the condition is not satisfied, the process proceeds to the condition determination for the adjacent prediction block. The process ends after four rounds of condition determination for each prediction block.
Specifically, the condition determination is performed in the following priority order. (However, N is A or B)
1. Condition determination 1 of the prediction block N0 (same reference list, same reference frame)
2. Condition determination 1 of the prediction block N1 (same reference list, same reference frame)
3. Prediction block N2 condition determination 1 (same reference list, same reference frame)
4). Prediction block N0 condition determination 2 (different reference list, same reference frame)
5. Prediction block N1 condition determination 2 (different reference list, same reference frame)
6). Prediction block N2 condition determination 2 (different reference list, same reference frame)
7). Prediction block N0 condition determination 3 (same reference list, different reference frames)
8). Condition determination 3 of the prediction block N1 (same reference list, different reference frames)
9. Prediction block N2 condition decision 3 (same reference list, different reference frames)
10. Prediction block N0 condition determination 4 (different reference list, different reference frame)
11. Prediction block N1 condition determination 4 (different reference list, different reference frame)
12 Prediction block N2 condition determination 4 (different reference list, different reference frame)
According to the method 1, since an unscaled predicted motion vector using the same reference frame is easily selected, there is an effect that a possibility that the code amount of the difference motion vector becomes small is increased.

Method 2:
Prioritize unscaled motion vector prediction using the same prediction frame
Of the two condition determinations, two condition determinations are performed for each prediction block. If the conditions are not satisfied, the process proceeds to the condition determination for the adjacent prediction block. Condition determination 1 and condition determination 2 are performed in the first round, and condition determination 3 and condition determination 4 are performed in the next round of prediction blocks.
Specifically, the condition determination is performed in the following priority order. (However, N is A or B)
1. Condition determination 1 of the prediction block N0 (same reference list, same reference frame)
2. Prediction block N0 condition determination 2 (different reference list, same reference frame)
3. Condition determination 1 of the prediction block N1 (same reference list, same reference frame)
4). Prediction block N1 condition determination 2 (different reference list, same reference frame)
5. Prediction block N2 condition determination 1 (same reference list, same reference frame)
6). Prediction block N2 condition determination 2 (different reference list, same reference frame)
7). Prediction block N0 condition determination 3 (same reference list, different reference frames)
8). Prediction block N0 condition determination 4 (different reference list, different reference frame)
9. Condition determination 3 of the prediction block N1 (same reference list, different reference frames)
10. Prediction block N1 condition determination 4 (different reference list, different reference frame)
11. Prediction block N2 condition decision 3 (same reference list, different reference frames)
12 Prediction block N2 condition determination 4 (different reference list, different reference frame)
According to the method 2, similarly to the method 1, an unscaled predicted motion vector using the same reference frame is easily selected, so that there is an effect that the possibility that the code amount of the difference motion vector becomes small increases. In addition, since the maximum number of rounds for condition determination is two, the number of memory accesses to the encoded information of the prediction block is smaller than that in Method 1 when considering implementation in hardware, and complexity is reduced. The

Method 3:
In the first round, if the condition determination of condition determination 1 is performed for each prediction block and the condition is not satisfied,
It moves to the condition judgment of the adjacent prediction block. In the next lap, condition determination is performed in order of condition determination 2, condition determination 3 and condition determination 4 for each prediction block, and then the process proceeds to the next.
Specifically, the condition determination is performed in the following priority order. (However, N is A or B)
1. Condition determination 1 of the prediction block N0 (same reference list, same reference frame)
2. Condition determination 1 of the prediction block N1 (same reference list, same reference frame)
3. Prediction block N2 condition determination 1 (same reference list, same reference frame)
4). Prediction block N0 condition determination 2 (different reference list, same reference frame)
5. Prediction block N0 condition determination 3 (same reference list, different reference frames)
6). Prediction block N0 condition determination 4 (different reference list, different reference frame)
7). Prediction block N1 condition determination 2 (different reference list, same reference frame)
8). Condition determination 3 of the prediction block N1 (same reference list, different reference frames)
9. Prediction block N1 condition determination 4 (different reference list, different reference frame)
10. Prediction block N2 condition determination 2 (different reference list, same reference frame)
11. Prediction block N2 condition decision 3 (same reference list, different reference frames)
12 Prediction block N2 condition determination 4 (different reference list, different reference frame)
According to the method 3, since an unscaled predicted motion vector using the same reference frame in the same reference list is easily selected, there is an effect that the possibility that the code amount of the difference motion vector becomes small increases. In addition, since the maximum number of rounds for condition determination is two, the number of memory accesses to the encoded information of the prediction block is smaller than that in Method 1 when considering implementation in hardware, and complexity is reduced. The

Method 4:
Priority is given to condition determination of the same prediction block, and four condition determinations are performed within one prediction block. If all the conditions are not met, it is determined that there is no motion vector matching the condition in the prediction block. The condition of the next prediction block is determined.
Specifically, the condition determination is performed in the following priority order. (However, N is A or B)
1. Condition determination 1 of the prediction block N0 (same reference list, same reference frame)
2. Prediction block N0 condition determination 2 (different reference list, same reference frame)
3. Prediction block N0 condition determination 3 (same reference list, different reference frames)
4). Prediction block N0 condition determination 4 (different reference list, different reference frame)
5. Condition determination 1 of the prediction block N1 (same reference list, same reference frame)
6). Prediction block N1 condition determination 2 (different reference list, same reference frame)
7). Condition determination 3 of the prediction block N1 (same reference list, different reference frames)
8). Prediction block N1 condition determination 4 (different reference list, different reference frame)
9. Prediction block N2 condition determination 1 (same reference list, same reference frame)
10. Prediction block N2 condition determination 2 (different reference list, same reference frame)
11. Prediction block N2 condition decision 3 (same reference list, different reference frames)
12 Prediction block N2 condition determination 4 (different reference list, different reference frame)
According to method 4, the number of rounds for condition determination is at most one, so that the number of memory accesses to the encoded information of the prediction block is considered as method 1, method 2, and method 3 when implementation in hardware is taken into consideration. And complexity is reduced.

Method 5:
As in method 4, prioritizing condition determination for the same prediction block, if four condition determinations are made within one prediction block and all the conditions are not met, there is a motion vector that matches the conditions in the prediction block. It is determined that it does not, and the condition of the next prediction block is determined. However, in the condition determination in the prediction block, method 4 gives priority to the same reference frame, but method 5 gives priority to the same reference list.
Specifically, the condition determination is performed in the following priority order. (However, N is A or B)
1. Condition determination 1 of the prediction block N0 (same reference list, same reference frame)
2. Prediction block N0 condition determination 3 (same reference list, different reference frames)
3. Prediction block N0 condition determination 2 (different reference list, same reference frame)
4). Prediction block N0 condition determination 4 (different reference list, different reference frame)
5. Condition determination 1 of the prediction block N1 (same reference list, same reference frame)
6). Condition determination 3 of the prediction block N1 (same reference list, different reference frames)
7). Prediction block N1 condition determination 2 (different reference list, same reference frame)
8). Prediction block N1 condition determination 4 (different reference list, different reference frame)
9. Prediction block N2 condition determination 1 (same reference list, same reference frame)
10. Prediction block N2 condition decision 3 (same reference list, different reference frames)
11. Prediction block N2 condition determination 2 (different reference list, same reference frame)
12 Prediction block N2 condition determination 4 (different reference list, different reference frame)
According to the method 5, the reference block reference count can be reduced as compared with the method 4, and the complexity can be reduced by reducing the number of times of access to the memory and the amount of processing such as condition determination. Can do. Similarly to method 4, the number of rounds for condition determination is at most 1. Therefore, when considering implementation in hardware, the number of times of memory access to the encoded information of the prediction block is method 1, method 2, Compared to method 3, the complexity is reduced.

Next, the motion vector predictor registration unit 121 predicts motion vector candidates mvLXA and mvLX.
B, evaluate the priority of mvLXCol, and MVP list mvpL in the order according to the priority
Store in istLX. The procedure for storing in the MVP list mvpListLX will be described in detail later.

Next, the motion vector predictor candidate determination unit 122 determines the motion vector predictor candidates having the same motion vector value from the motion vector predictor candidates stored in the MVP list mvpListLX, and determines that they have the same motion vector value. The MVP list mvpListLX is updated by leaving one of the predicted motion vector candidates and deleting the others from the MVP list mvpListLX so that the predicted motion vector candidates do not overlap. The motion vector predictor candidate identity determination unit 122 provides the updated MVP list mvpListLX to the motion vector predictor candidate code amount calculation unit 123 and the motion vector predictor selection unit 124.

On the other hand, the motion vector detection unit 102 in FIG. 1 detects a motion vector mv for each prediction block. The motion vector mv is input to the predicted motion vector candidate code amount calculation unit 123 together with the predicted motion vector candidates of the updated MVP list mvpListLX.

The motion vector predictor candidate code amount calculation unit 123 calculates the motion vector mv and the MVP list mvp.
Each difference motion vector that is a difference from each prediction motion vector candidate mvpListLX [i] stored in ListLX is calculated, and the code amount when the difference motion vector is encoded is calculated for each element of the MVP list mvpListLX. And supplied to the motion vector predictor selection unit 124.

The predicted motion vector selection unit 124, among the elements registered in the MVP list mvpListLX, the predicted motion vector candidate mv that minimizes the code amount for each predicted motion vector candidate.
pListLX [i] is selected as the predicted motion vector mvp, and the MVP list mvpLi
When there are a plurality of motion vector predictor candidates having the smallest generated code amount in stLX, the motion vector candidate mvpListLX [i] represented by a small index i in the MVP list mvpListLX is optimal. Select as the predicted motion vector mvp. The selected predicted motion vector mvp is supplied to the motion vector subtraction unit 125. Further, the index i in the MVP list corresponding to the selected prediction motion vector mvp is output as the MVP index mvp_idx of LX (X = 0 or 1).

Note that the motion vector predictor selection unit 124 selects the MVP indicated by mvp_idx as necessary.
The encoded information used in the prediction block in the list is also output to the prediction method determination unit 106 in FIG. The encoding information output here includes a weighting parameter for weighted prediction, a quantization parameter for quantization, and the like.

Finally, the motion vector subtraction unit 125 calculates the differential motion vector mvd by reducing the production of the predicted motion vector mvp selected from the motion vector mv, and the differential motion vector mvd
d is output.
mvd = mv−mvp

Returning to FIG. 1, the motion compensation prediction unit 105 refers to the decoded image stored in the decoded image memory 115, performs motion compensation according to the motion vector mv supplied from the motion vector detection unit 102, and performs motion compensation prediction. A signal is obtained and supplied to the prediction method determination unit 106.

The prediction method determination unit 106 determines a prediction method. The code amount and the coding distortion are calculated for each prediction mode, and the prediction block size and the prediction mode for the smallest generated code amount and coding distortion are determined. The difference motion vector mvd supplied from the motion vector subtraction unit 125 of the difference motion vector calculation unit 103 and the index mvp_idx representing the prediction motion vector supplied from the prediction motion vector selection unit 124 are encoded, and the code amount of the motion information Is calculated. Furthermore, the motion compensation prediction signal supplied from the motion compensation prediction unit 105 and the image memory 1
The code amount of the prediction residual signal obtained by encoding the prediction residual signal with the image signal to be encoded supplied from 01 is calculated. The total generated code amount obtained by adding the code amount of the motion information and the code amount of the prediction residual signal is calculated and used as the first evaluation value.

Also, after encoding such a difference image, the difference image is decoded for distortion amount evaluation, and the encoding distortion is calculated as a ratio representing an error from the original image generated by the encoding. By comparing the total generated code amount and the coding distortion for each motion compensation, the prediction block size and the prediction mode that generate the least generated code amount and the coding distortion are determined. The motion vector prediction method described above is performed on the motion vector mv corresponding to the prediction mode of the determined prediction block size, and the index representing the prediction motion vector is represented by a second syntax pattern in units of prediction blocks. Is encoded as a flag mvp_idx_lX [i]. The generated code amount calculated here is preferably a simulation of the encoding process, but can be approximated or approximated easily.

(Prediction of motion vector in decoding)
The operation of the motion vector prediction method according to the present invention in the video decoding device that decodes the encoded video bitstream based on the above-described syntax will be described.

First, each flag of the bit stream decoded by the first encoded bit string decoding unit 202 will be described. FIG. 10 shows a first syntax pattern described in the slice header in units of slices of the bit stream generated by the moving picture encoding apparatus of the present invention and decoded by the first encoded bit string decoding unit 202. From the flags described in the slice header of the bitstream, when the slice type is P or B, not only the motion vector of the neighboring prediction block adjacent in the same picture in the prediction block that is not in the inter prediction merge mode. , Indicating whether or not to perform motion vector prediction using the motion vector of the prediction block at the same position or in the vicinity of the prediction block to be processed in different pictures in the time direction, and in the prediction block in the inter prediction merge mode, Inter prediction is performed using not only the encoding information of neighboring prediction blocks in the same picture but also the encoding information of the prediction block at the same position or in the vicinity of the processing target prediction block in a picture that is different in the time direction. First flag mv_competit indicating whether to perform on_
Decode temporal_flag, mv_competition_tempora
When l_flag is true (1), in a prediction block that is not in the inter prediction merge mode, not only the motion vectors of neighboring prediction blocks adjacent in the same picture, but also the same as the prediction block to be processed in a different picture in the time direction Motion vectors are predicted using position or neighboring prediction blocks, and in the prediction block in the inter prediction merge mode, not only the encoding information of neighboring prediction blocks adjacent in the same picture but also the time direction differs. Inter-prediction is also performed using the coding information of a prediction block at the same position or in the vicinity of the prediction block to be processed in the picture. Furthermore, mv_competition_tem
When the portal_flag is true (1), motion vector candidates of the prediction block in the same position as the processing target prediction block in the picture different in time direction in the prediction block that is not in the inter prediction merge mode increase the priority. Second flag mv_temporal_high_priority indicating whether to be registered in a merge candidate list to be described later
_Flag is decoded and determined. If true (1), the motion vector or merge candidate of the prediction block at the same position as the processing target prediction block in the temporally different picture increases the priority, and the MVP list or merge Each is registered in the candidate list.

Further, when the slice type is B, a reference list of L0s of pictures including a prediction block to be processed that includes a picture colPic that is different in the temporal direction used in calculating a temporal motion vector predictor candidate or a merge candidate. A third flag collocated_from_l indicating which of the reference images registered in the L1 reference list is to be used
0_flag is decoded to determine whether to use L0 or L1 in the reference picture list of the picture including the prediction block to be processed.

Further, when the slice type is P or B, the MVP list described later or the fourth flag mv_list_adaptive_idx_flag indicating whether or not the registration order in the merge candidate list is adaptively changed for each prediction block is decoded, and the MVP list Alternatively, it is determined whether the registration order in the merge candidate list is adaptively changed for each prediction block.

The above syntax elements may be installed in a picture parameter set describing syntax elements set in units of pictures.

Also, the first flag mv_competition_temporal_flag, the second flag mv_temporal_high_priority_flag, the third flag collocated_from_l0_flag, and the fourth flag mv_list_ad
The independent_idx_flag can be controlled independently by preparing separate flags for motion vector prediction that are not in the merge mode and for merge mode, respectively.

FIG. 11 shows a first encoded bit string decoding unit 202 generated by the moving image encoding apparatus of the present invention.
This is a second syntax pattern described in units of prediction blocks of the bitstream decoded by the above. The syntax pattern described in a prediction block unit is shown. In the case of inter prediction (when the prediction mode PredMode indicating whether the prediction block is inter prediction is MODE_INTER indicating inter prediction), the mer indicating whether it is a merge mode or not.
ge_flag [x0] [y0] is decoded. Here, x0 and y0 are indexes indicating the position of the upper left pixel of the prediction block in the screen, and merge_flag [x0] [
y0] is a flag indicating whether or not the prediction block is in the merge mode located at (x0, y0) in the screen.

Next, when merge_flag [x0] [y0] is 1, when the total number of merge mode candidates NumMergeCand exceeds 1, the syntax element merge_idx of the index of the merge list that is a list of predicted motion vector candidates to be referred to. [X0]
[Y0] is decoded. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the screen, and merge_idx [x0] [y0] is (x0,
This is the merge index of the prediction block located at y0).

On the other hand, when merge_flag [x0] [y0] is 0, for each reference list LX (X = 0 or 1), the motion vector difference between the motion vector of the predicted block obtained by motion vector detection and the motion vector predictor is calculated. Syntax element mvd_lX [x0] [y0] [j
] Is decrypted. Here, X is 0 or 1, indicating the prediction direction, the array index x0 is the x coordinate of the prediction block, y0 is the y coordinate of the prediction block, j is the component of the differential motion vector, and j = 0 is the x component. , J = 1 represents the y component. Next, when the total number of motion vector predictor candidates exceeds 1, the syntax element mvp_idx_lX [x0] [y0] of the index of the MVP list that is a list of motion vector predictor candidates to be referred to is decoded. Here, x0 and y0 are indices indicating the position of the upper left pixel of the prediction block in the screen, and mvp_idx_lX [x0] [y0] is a list of prediction blocks LX located at (x0, y0) in the screen. This is an MVP index. The subscript LX represents the reference list, L0
And L1 are prepared, and 0 or 1 is entered in X. Function NumMVPCand (L
X) represents a function for calculating the total number of motion vector predictor candidates of the prediction block in the prediction direction LX (X is 0 or 1), and will be described later. Index mvp of this MVP list
_Idx_lX [x0] [y0] is decoded when the total number of predicted motion vector candidates NumMVPCand (LX) is greater than 1 by the motion vector prediction method. If the total number of motion vector predictor candidates is 1, one of them becomes a motion vector predictor, so mvp_i
This is because the candidate motion vector to be referred to is determined without transmitting dx_lX [x0] [y0].

When the motion vector prediction method according to the embodiment is performed, processing is performed by the motion vector calculation unit 204 of the video decoding device in FIG. FIG. 13 is a diagram illustrating a detailed configuration of the motion vector calculation unit 204 of the video decoding device of FIG. 2 corresponding to the video encoding device of the embodiment. A portion surrounded by a thick frame line in FIG. 13 indicates the motion vector calculation unit 204. Furthermore,
The part surrounded by the thick dotted line in the figure shows the operation part of the motion vector prediction method to be described later, and is also installed in the corresponding video encoding device in the same way, and the same determination result that is consistent between encoding and decoding So that you can get Hereinafter, a motion vector prediction method in decoding will be described with reference to FIG.

The motion vector calculation unit 204 includes a predicted motion vector candidate generation unit 220, a predicted motion vector registration unit 221, a predicted motion vector candidate identity determination unit 222, and a predicted motion vector selection unit 223.
And a motion vector adder 224.

The predicted motion vector candidate generation unit 220, the predicted motion vector registration unit 221 and the predicted motion vector candidate identity determination unit 222 in the motion vector calculation unit 204 are the predicted motion vector candidates in the differential motion vector calculation unit 103 on the encoding side. Generation unit 120, predicted motion vector registration unit 1
21 and the predicted motion vector candidate identity determination unit 122 are defined so as to perform the same operation, the same predicted motion vector candidates that are consistent in encoding and decoding can be obtained on the encoding side and the decoding side.

The motion vector predictor candidate generation unit 220 performs the same processing as that of the motion vector predictor candidate generation unit 120 on the encoding side in FIG. The motion vector predictor candidate generation unit 220 decodes and records the decoded prediction block adjacent to the decoding target block in the same picture as the decoding target block and the decoding target in a different picture, which are recorded in the encoded information storage memory 209. A motion vector such as a decoded prediction block existing at the same position as the block or in the vicinity thereof is read from the encoded information storage memory 209. At least one or more motion vector candidates mvLXA, mvLXB, and mvLXCol are generated from the motion vectors of other decoded blocks read from the encoded information storage memory 209 and supplied to the motion vector predictor registration unit 221. These predicted motion vector candidates mvLXA, mvLXB, and mvLXCol may be calculated by scaling according to the reference index. Note that the motion vector predictor candidate generation unit 220 includes the motion vector predictor candidate generation unit 1 on the encoding side in FIG.
20, the condition determination of the methods 1, 2, 3, 4, and 5 for calculating the prediction motion vector described in the prediction-side motion vector candidate generation unit 120 on the encoding side in FIG. The vector candidate generation unit 220 can also be applied, and detailed description thereof is omitted here.

Next, the motion vector predictor registration unit 221 encodes the motion vector predictor registration unit 1 on the encoding side in FIG.
The same processing as 21 is performed. The motion vector predictor registration unit 221 uses the motion vector candidate m
Evaluate the priority order of vLXA, mvLXB, mvLXCol, and M in order according to the priority order
Store in the VP list mvpListLX. The procedure for storing in the MVP list mvpListLX will be described in detail later.

Next, the motion vector predictor candidate identity determination unit 222 performs the same processing as the motion vector predictor candidate identity determination unit 122 on the encoding side in FIG. The predicted motion vector candidate identity determination unit 222 determines the prediction motion vector candidates stored in the MVP list mvpListLX having the same motion vector value, and the prediction determined to have the same motion vector value. MVP list mvpList is used so that the motion vector candidates are deleted from the MVP list mvpListLX while leaving only one motion vector candidate out of the MVP list mvpListLX.
Update LX. The updated MVP list mvpListLX is given to the motion vector predictor selection unit 223.

On the other hand, the differential motion vector mvd decoded by the first encoded bit string decoding unit 202 is input to the motion vector addition unit 224. Mvp_i indicating the index of the predicted motion vector
When dx is encoded, the index mvp_idx of the motion vector predictor decoded by the first encoded bit string decoder 202 is input to the motion vector selector 223.

In this way, the predicted motion vector selection unit 223 receives the MVP list mvpListLX.
Mvp indicating the prediction motion vector candidate remaining in and the index of the prediction motion vector
If _idx has been encoded, the index mvp of the decoded motion vector predictor
_Idx is also input.

The motion vector predictor selection unit 223 first determines whether there is one motion vector predictor candidate remaining in the MVP list mvpListLX. In the case of one motion vector, the MVP list mvp
Predicted motion vector candidates remaining in ListLX are extracted as predicted motion vectors mvp. When more than one candidate motion vector predictor remains in the MVP list mvpListLX, the index mvp_idx of the motion vector predictor decoded by the first encoded bit string decoding unit 202 is read and corresponds to the read index mvp_idx The predicted motion vector candidate to be extracted is extracted from the MVP list mvpListLX. The extracted motion vector predictor candidate is supplied to the motion vector adding unit 224 as a motion vector predictor mvp.

Finally, the motion vector addition unit 224 calculates the motion vector mv by adding the difference motion vector mvd and the prediction motion vector mvp that are decoded and supplied by the first encoded bit string decoding unit 202, and obtains the motion vector mv. Output.
mv = mvp + mvd

As described above, a motion vector is calculated for each prediction block. A prediction image is generated by motion compensation using this motion vector, and a decoded image is generated by adding the prediction image to the residual signal decoded from the bit stream.

Processing procedures of the difference motion vector calculation unit 103 of the moving image encoding device and the motion vector calculation unit 204 of the moving image decoding device will be described with reference to the flowcharts of FIGS. 14 and 15, respectively. FIG. 14 is a flowchart showing a difference motion vector calculation processing procedure by the moving image encoding device, and FIG. 15 is a flowchart showing a motion vector calculation processing procedure by the moving image decoding device.

First, the processing procedure on the encoding side will be described with reference to FIG. On the encoding side, the motion vector predictor candidate generation unit 120 in the motion vector difference calculation unit 103, the motion vector registration unit 1
21 and the predicted motion vector candidate identity determination unit 122 calculate predicted motion vector candidates, add the calculated predicted motion vector candidates to the MVP list, and delete unnecessary predicted motion vector candidates. A list is constructed (S101).

Subsequently, the motion vector mv and MVP are calculated by the prediction motion vector candidate code amount calculation unit 123.
Candidate mvpListL for each predicted motion vector stored in the list mvpListLX
Each differential motion vector that is a difference from X [i] is calculated, a code amount when the differential motion vector is encoded is calculated for each element of the MVP list mvpListLX, and the predicted motion vector selection unit 124 performs MVP Among the elements registered in the list mvpListLX, a prediction motion vector candidate mvp having the smallest code amount for each prediction motion vector candidate
ListLX [i] is selected as the predicted motion vector mvp, and the MVP list mvpLis
When there are a plurality of motion vector predictor candidates that have the smallest generated code amount in tLX,
A predicted motion vector candidate mvpListLX [i] represented by a number with a small index i in the MVP list mvpListLX is selected as the optimum predicted motion vector mvp. The selected predicted motion vector mvp is supplied to the motion vector subtraction unit 125. further,
The index i in the MVP list corresponding to the selected predicted motion vector mvp is set to L
Output as the MVP index mvp_idx of X (X = 0 or 1) (S102)
.

Subsequently, the motion vector subtraction unit 125 calculates a difference motion vector mvd by calculating a difference between the motion vector mv and the predicted motion vector mvp selected, and outputs the difference motion vector mvd (S103).
mvd = mv−mvp

Next, the processing procedure on the decoding side will be described with reference to FIG. As described above, on the decoding side, similarly to the encoding side, the predicted motion vector candidate generation unit 220, the predicted motion vector registration unit 221 and the predicted motion vector candidate identity determination unit 222 in the motion vector calculation unit 204 perform prediction motion prediction. An MVP list is constructed by calculating vector candidates, adding the calculated motion vector candidates to the MVP list, and deleting unnecessary motion vector predictor candidates (S2).
01).

Subsequently, the predicted motion vector selection unit 223 first performs the MVP list mvpListL.
It is determined whether or not there is one candidate motion vector predictor remaining in X.
A candidate motion vector predictor remaining in the list mvpListLX is extracted as a motion vector predictor mvp. When more than one candidate motion vector predictor remains in the MVP list mvpListLX, the index mvp_idx of the motion vector predictor decoded by the first encoded bit string decoding unit 202 is read and corresponds to the read index mvp_idx The predicted motion vector candidate to be extracted is extracted from the MVP list mvpListLX. (S
202).

Subsequently, the motion vector adding unit 224 calculates the motion vector mv by adding the difference motion vector mvd decoded and supplied by the first encoded bit string decoding unit 202 and the predicted motion vector mvp, and the motion vector mv Is output. (S203 in FIG. 15).
mv = mvp + mvd

Calculation of prediction motion vector and MVP common to S101 of FIG. 14 and S201 of FIG.
The processing procedure of the list construction method will be described in detail with reference to the flowchart of FIG.

First, a motion vector prediction method common to the video encoding device and the video decoding device will be described.

(Motion vector prediction method)
The prediction motion vector calculation and MVP list construction method according to the embodiment is performed for each reference list LX (X is 0 or 1) in various processes shown in FIG. The prediction mode PredMode is MODE_INTER (inter prediction), and a flag inter_pred_flag [x0] [y0] indicating an inter prediction method is set to Pred_L0 (L
0 prediction) or Pred_BI (both predictions), predictive motion vector candidates for the reference list L0 are calculated, and an MVP list is constructed. Here, x0 and y0 are indexes indicating the position of the upper left pixel of the prediction block in the screen, and inter_pred_flag [
x0] [y0] is a flag indicating the inter prediction method of the prediction block located at (x0, y0) in the screen. inter_pred_flag [x0] [y0] is Pred_L
When 1 (L1 prediction) or Pred_BI (bi-prediction), prediction motion vector candidates for the reference list L1 are calculated, and an MVP list is constructed. That is, inter_pred_f
When lag [x0] [y0] is Pred_BI (bi-prediction), prediction motion vector candidates for the reference list L0 and the reference list L1 are calculated to construct an MVP list. FIG. 16 shows motion vector predictor candidate generation units 120 and 220 having a function common to the motion vector calculation unit 103 of the video encoding device and the motion vector calculation unit 204 of the video decoding device, motion vector registration units 121 and 22 is a flowchart showing the flow of processing of 221 and predicted motion vector candidate identity determination units 122 and 222. Hereinafter, the processes will be described in order.

Prediction motion vector candidates from the prediction block adjacent on the left side are calculated, and a flag availableFlagLXA indicating whether the motion vector can be used, a motion vector mvLXA, and POCpocLXA of the reference picture are output (S301 in FIG. 16). When L0, X
Is 0, and X is 1 when L1 (the same applies hereinafter). Subsequently, a flag available indicating whether a motion vector predictor candidate from the prediction block adjacent on the upper side can be calculated and used.
The eFlagLXB, the motion vector mvLXB, and the POCpocLXB of the reference picture are calculated (S302 in FIG. 16). The processing of S301 and S302 in FIG. 16 is common, and flag availableFlagLXN indicating whether or not the flag can be used, and motion vector mv
A common calculation processing procedure for calculating LXN and POCpocLXN (N is A or B, the same applies hereinafter) of a reference picture will be described in detail later with reference to flowcharts of FIGS.

Subsequently, a flag a indicating whether or not a candidate for a predicted motion vector of time can be calculated and used.
The availableFlagLXCol, the motion vector mvLXCol, and the flag mvXCrossFlag indicating whether or not crossing are output (S303 in FIG. 16). These calculation processing procedures will be described in detail later with reference to FIGS. 24 to 29 and the flowchart of FIG.

Subsequently, an MVP list mvpListLX is created, and a prediction vector candidate mvLXN (
N adds A, B, or Col (the same applies hereinafter) (S304 in FIG. 16). These calculation processing procedures will be described in detail later using the flowcharts of FIGS.

Subsequently, when a plurality of motion vectors have the same value in the MVP list mvpListLX, the motion vectors are removed except the smallest motion vector (FIG. 1).
6 S305).

Subsequently, returning to FIG. 15, the number of elements in the MVP list mvpListLX NumMVPC
When and (LX) is 1, the final MVP index mvpIdx is set to 0. Otherwise, mvpIdx is set to mvp_idx_LX [xP, yP] (S in FIG. 15).
202) Here, xP and yP are indices indicating the position of the upper left pixel of the prediction block in the screen, and mvp_idx_lX [xP] [yP] is a list of prediction blocks located at (xP, yP) in the screen This is the MVP index of LX (L0 or L1). The subscript LX represents a reference list, and two L0 and L1 are prepared, and 0 or 1 is entered in X.

Subsequently, the mvpIdx-th registered motion vector mv in the LX MVP list
pListLX [mvpIdx] is assigned to the predicted motion vector mvpLX of the final list LX (S203 in FIG. 15).

[Deriving motion vector predictor candidates from one or more adjacent prediction blocks on the left or upper side (S301, S302 in FIG. 16)]
The input in this processing is the coordinates (xP, yP) in the encoding / decoding target image of the upper left pixel that is the head of the prediction block to be encoded / decoding, and the width nPSW of the prediction block to be encoded / decoded. And height nPSH, reference index ref for each reference list of prediction blocks
IdxLX (X is 0 or 1). The subscript LX represents a reference list, and L0 and L1 2
And 0 or 1 is entered in X. The reference lists L0 and L1 are lists for managing a plurality of reference pictures in order to perform motion compensation by referring to an arbitrary picture in block units from a plurality of reference picture candidates, and a reference index refIdxLX is a reference picture. An index assigned to each reference picture for each reference list for designation.

The output in this process is the motion vector mvL of the prediction block adjacent on the left or upper side.
XN and a flag availableFlagLXN indicating whether or not the encoding information of the reference list LX of the prediction block group N is valid. A (left side) or B (upper side)
Enters.

As shown in FIGS. 5, 6, 7, and 8, a prediction block of a prediction block that is defined to compensate for motion within an encoded block in the same picture (a prediction block to be processed in FIG. 12). A motion vector predictor candidate is derived from the surrounding prediction blocks adjacent to.

FIG. 5 shows a prediction block to be processed and a prediction block adjacent thereto. A motion vector predictor candidate is a prediction block Ak (k = 0, 1) adjacent to the left side of the prediction block to be processed.
, 2) and a prediction block Bk (k = 0) adjacent to the prediction block group A.
, 1, 2), predictive motion vector candidates are selected from the predictive block group B consisting of each.

Using the flowchart in FIG. 17, prediction motion vector candidates mvL from the prediction block group N adjacent on the left and upper sides in the processing procedure of S301 and S302 in FIG. 16.
A method for calculating XN will be described. Subscript X contains 0 or 1 representing the reference list, and N represents A (left side) or B (upper side) representing the area of the adjacent prediction block group.

In FIG. 17, prediction motion vector candidates from one or more prediction blocks adjacent to the left side of the prediction block to be encoded / decoded as a variable N = A and one or more predictions adjacent to the upper side as a variable N = B Predicted motion vector candidates are calculated from the blocks according to the following procedure.

First, a prediction block adjacent to a prediction block to be encoded / decoded is specified, and when each prediction block Nk (k = 0, 1, 2) can be used, encoding information is acquired (S11).
01, S1102, S1103). In the case of a prediction block group (N = A) adjacent to the left side of the prediction block to be encoded / decoded, the prediction block A0 adjacent to the lower left, the prediction block A1 adjacent to the left, and the prediction block A2 adjacent to the upper left are specified. In the case of a prediction block group (N = B) adjacent to the upper side of the prediction block to be encoded / decoded, the prediction block B0 adjacent to the upper right, the prediction block B1 adjacent to the upper, and the upper left Encoding information is acquired by specifying the adjacent prediction block B2 (S1101, S1102, S1103).
). It can be used when the adjacent prediction block Nk is located inside the slice including the prediction block to be encoded / decoded, and cannot be used when located outside.

Next, a flag availableFlagLXN indicating whether or not a prediction motion vector is selected from the prediction block group N is 0, a motion vector mvLXN representing the prediction block group N is (0, 0), and a motion representing the prediction block group N A flag MvXNNonScale indicating that the vector is not scaled is set to 0 (S110).
4, S1105, S1106).

Then, the process of the flowchart shown in FIG. 18 is performed (S1107). Search for a prediction block having the same reference index motion vector in the same reference list LX as the current reference list LX in the prediction block to be encoded / decoded among the adjacent prediction blocks N0, N1, and N2 of the prediction block group N. .

FIG. 18 is a flowchart showing the processing procedure of step S1107 of FIG. The following processing is performed on adjacent prediction blocks Nk (k = 0, 1, 2) in the order of k, 0, 1, 2 (S1201 to S1210). When N is A, the following processing is performed in order from bottom to top, and when N is B, the processing is sequentially performed from right to left.

Whether an adjacent prediction block Nk can be used (YES in S1202), and the coding mode PredMode of the prediction block Nk is not intra (MODE_INTRA) (YES in S1203), and whether predFlagLX (LX prediction) of the adjacent prediction block Nk is determined. When the flag shown is 1 (YES in S1204), the reference index refIdxLX [xNk] [yNk] of the adjacent prediction block Nk is compared with the index refIdxLX of the prediction block to be processed (S1205). If both reference indexes are the same (YES in S1205), the flag availableFlagLXN is set to 1 (S
1206), mvLXN is set to the same value as mvLXN [xNk] [yNk] (S120).
7) and refIdxN is set to the same value as refIdxLX [xNk] [yNk] (S1
208), ListN is set to LX (S1209), and a flag MvXNNonScale indicating that scaling is not performed is set to 1 (S1210).

In the present embodiment, a flag MvXNNN indicating that scaling has not been performed.
The scale is 1, that is, the motion vector mvLXN calculated without scaling is a motion vector predicted from the motion vector of the prediction block referring to the same reference picture as the motion vector of the prediction block to be encoded / decoded. Therefore, it is determined that the prediction motion vector candidate of the prediction block to be encoded / decoded is relatively suitable. On the other hand, the flag MvXCr
The motion vector mvLXN calculated by scaling oss is 0, that is,
A motion vector predicted from a motion vector of a prediction block that refers to a reference picture different from the motion vector of the prediction block to be encoded / decoded, and compared as a motion vector candidate of the prediction block to be encoded / decoded Judge that it is not appropriate. That is, the flag MvXNNonScale indicating that the image has not been scaled is used as one of the guidelines for determining whether or not it is suitable as a predicted motion vector candidate.

On the other hand, if these conditions are not met (NO in S1202, NO in S1203, S12
In the case of NO in 04 or NO in S1205), k is incremented by 1, the next adjacent prediction block processing (S1202 to S1209) is performed, and this is repeated until the availableFlagLXN becomes 1 or the processing of N2 ends.

Next, returning to the flowchart of FIG. 17, when availableFlagLXN is 0 (YES in S1108), the process of the flowchart shown in FIG. 19 is performed (S1109).
Among the adjacent prediction blocks N0, N1, and N2 of the prediction block group N, the reference list LY (Y =! X:
When the current reference list is L0, the opposite reference list is L1, and when the current target reference list is L1, the opposite reference list is L0), and a prediction block having the same reference POC motion vector is searched.

FIG. 19 is a flowchart showing the processing procedure of step S1109 of FIG. The following processing is performed on adjacent prediction blocks Nk (k = 0, 1, 2) in the order of k, 0, 1, 2 (S1301 to S1310). When N is A, the following processing is performed in order from bottom to top, and when N is B, the processing is sequentially performed from right to left.

Whether or not the adjacent prediction block Nk is available (YES in S1302), the coding mode PredMode of the prediction block Nk is not intra (MODE_INTRA) (YES in S1303), and predFlagLY (LY prediction) of the adjacent prediction block Nk is determined. Is 1 (YES in S1304), the reference picture RefPicL of the reference list LY opposite to the current reference list LX of the adjacent prediction block Nk
POCRefPicOrderC of istY [refIdxLY [xNk] [yNk]]
nt (currPic, refIdxLY [xNk] [yNk], LY) and the POC of the reference picture RefPicListX [refIdxLX] of the LX of the prediction block to be processed
RefPicOrderCnt (currPic, refIdxLX, LX) is compared (S1305). If both reference pictures have the same POC (YES in S1305), the flag availableFlagLXN is set to 1 (S1306), and mvLXN is mvL.
XN [xNk] [yNk] is set to the same value (S1307), and refIdxN is refI.
It is set to the same value as dxLY [xNk] [yNk] (S1308), ListN is set to LY (S1309), and a flag MvXNNonSca indicating that scaling has not been performed.
le is set to 1 (S1310).

On the other hand, if these conditions are not met (NO in S1302, NO in S1303, S13
In the case of NO in 04 or NO in S1305), k is incremented by 1, the next adjacent prediction block processing (S1302 to S1309) is performed, and this is repeated until the availableFlagLXN becomes 1 or the processing of N2 ends.

Next, returning to the flowchart of FIG. 17, when availableFlagLXN is 0 (YES in S1110), the process of the flowchart shown in FIG. 20 is performed (S1111).
Among adjacent prediction blocks N0, N1, and N2 of the prediction block group N, different reference Ps in the same reference list LX as the reference list LX that is the current target in the prediction block to be encoded / decoded
Look for a prediction block with an OC motion vector.

FIG. 20 is a flowchart showing the processing procedure of step S1111 of FIG. The following processing is performed on the adjacent prediction blocks Nk (k = 0, 1, 2) in the order of k, 0, 1, and 2 (S1401 to S1409). When N is A, the following processing is performed in order from bottom to top, and when N is B, the processing is sequentially performed from right to left.

Whether an adjacent prediction block Nk can be used (YES in S1402), and the coding mode PredMode of the prediction block Nk is not intra (MODE_INTRA) (YES in S1403), and whether or not the predFlagLX (LX prediction) of the adjacent prediction block Nk is determined. Flag is 1 (YES in S1404), the flag availableFl
agLXN is set to 1 (S1405), and mvLXN is mvLXN [xNk] [yNk].
(S1406), refIdxN is set to refIdxLX [xNk] [yN
k] is set to the same value (S1407), and ListN is set to LX (S1408).

On the other hand, if these conditions are not met (NO in S1402, NO in S1403, or NO in S1404), k is incremented by 1 and the next adjacent prediction block is processed (S1402).
Step S1408) is repeated until the availableFlagLXN becomes 1 or the processing of N2 is completed.

Next, returning to the flowchart of FIG. 17, when availableFlagLXN is 0 (YES in S1112), the process of the flowchart shown in FIG. 21 is performed (S1113).
(A reference list LY (Y =! X opposite to the reference list LX currently targeted in the prediction block to be encoded / decoded among the adjacent prediction blocks N0, N1, and N2 of the prediction block group N)
When the current target reference list is L0, the opposite reference list is L1, and when the current target reference list is L1, the opposite reference list is L0), and a prediction block having a different reference POC motion vector is searched. )

FIG. 21 is a flowchart showing the processing procedure of step S1113 of FIG. The following processing is performed on adjacent prediction blocks Nk (k = 0, 1, 2) in the order of k, 0, 1, 2 (S1501 to S1509). When N is A, the following processing is performed in order from bottom to top, and when N is B, the processing is sequentially performed from right to left.

Whether an adjacent prediction block Nk can be used (YES in S1502) and the encoding mode PredMode of the prediction block Nk is not intra (MODE_INTRA) (YES in S1503), and whether predFlagLY (LY prediction) of the adjacent prediction block Nk is determined. Flag is 1 (YES in S1504), flag availableFl
agLXN is set to 1 (S1505), and mvLXN is mvLXN [xNk] [yNk].
(S1506), refIdxN is set to refIdxLY [xNk] [yN
k] is set to the same value (S1507), and ListN is set to LY (S1508).

On the other hand, if these conditions are not met (NO in S1502, NO in S1503, or NO in S1504), k is incremented by 1 and the next adjacent prediction block is processed (S1502).
S1508), and repeats until availableFlagLXN becomes 1 or the processing of N2 ends.

Next, returning to the flowchart of FIG. 17, when availableFlagLXN is 1 (YES in S1114), the mvLXN scaling process shown in FIG. 22 is performed (S11).
15).

FIG. 22 is a flowchart showing the motion vector scaling processing procedure in step S1115 of FIG. FIG. 23 is a diagram illustrating the scaling of the motion vector in the time direction as a specific example. If the reference picture Re of the reference list ListN of the prediction block to be referred to
POC RefPicOrderCnt (c of fPicListN [refIdxLN]
urPic, refIdxN, ListN) is a reference picture RefPicLis of LX
POC RefPicOrderCnt (currPic, tX [refIdxLX]
If it is equal to refIdxLX, LX) (YES in S1601), mvLXN is left as it is (S1602). Otherwise (NO in S1601), scaling processing is performed according to the following equation.
mvLXN = tb / td * mvLXN
Where td is the POC PicOrderCnt (cur of the current encoding / decoding target image
rPic) and the reference picture Ref referenced by the reference list ListN of the adjacent prediction block
POC RefPicOrderCnt (cur of PicListN [refIdxN]
rPic, refIdxN, ListN).
td = PicOrderCnt (currPic) −RefPicOrderCnt
(CurrPic, refIdxN, ListN)
tb is the POC PicOrderCnt (currPic of the current encoding / decoding target image.
) And the POC of the reference picture referenced by the reference list LX of the current encoding / decoding target image.
tb = PicOrderCnt (currPic) −RefPicOrderCnt
(CurrPic, refIdxLX, LX)

[Derivation of predicted motion vector candidates in time direction (S303 in FIG. 16)]
The input in this processing is the coordinates (xP, yP) in the encoding / decoding target image of the upper left pixel that is the head of the prediction block to be encoded / decoding, and the width nPSW of the prediction block to be encoded / decoded. And height nPSH, reference index ref for each reference list of prediction blocks
IdxLX (X is 0 or 1). The subscript LX represents a reference list, and L0 and L1 2
And 0 or 1 is entered in X. The reference lists L0 and L1 are lists for managing a plurality of reference pictures in order to perform motion compensation by referring to an arbitrary picture in block units from a plurality of reference picture candidates, and a reference index refIdxLX is a reference picture. An index assigned to each reference picture for each reference list for designation.

The output in this process is the motion vector mvLXCol of the prediction block of the other picture at the same position as the prediction block of the prediction block, and the reference list L of the prediction block group Col.
This is a flag availableFlagLXCol indicating whether or not the encoded information of X is valid, and the subscript X is set to 0 or 1 representing the reference list.

FIG. 24 is a flowchart for explaining the processing procedure of step S303 in FIG.
First, a reference picture colPic is calculated from slice_type and collocated_from_10_flag (S2101 in FIG. 24).

FIG. 25 is a flowchart for explaining the calculation processing procedure of the reference picture colPic in step S2101 of FIG. The slice_type is B and the third flag col in FIG.
When located_form_10_flag is 0 (YES in S2201 in FIG. 25,
YES in S2202, RefPicList1 [0], ie, reference picture list 1
The picture whose reference index is 0 is colPic (S2203 in FIG. 25). Otherwise (NO in S2201, NO in S2202, NO in S2204 in FIG. 25), Re
fPicList0 [0], that is, the picture with the reference index 0 in the reference picture list 0 is colPic (S2205 in FIG. 25).

Next, returning to the flowchart of FIG. 24, the prediction block colPu is calculated, and encoded information is acquired (S2102 of FIG. 24).

FIG. 26 is a flowchart for explaining the calculation processing procedure of the prediction block colPu in step S2102 of FIG.

First, the prediction block located in the lower right (outside) of the same position as the processing target prediction block in colPic is set to colPu (S2301 in FIG. 26). This prediction block is shown in FIG.
Corresponds to the prediction block T0.

Next, encoding information of the prediction block colPu is acquired. P of prediction block colPu
If redMode is MODE_INTRA or cannot be used (S2303, S2 in FIG. 26)
2304), the prediction block located in the upper left (inside) of the same position as the processing target prediction block in colPic is set to colPu (S2305 in FIG. 26). This prediction block corresponds to the prediction block T1 in FIG. Although not shown, the prediction block colPu
If the PredMode is MODE_INTRA or cannot be used, a prediction block whose PredMode that can be used in the order of the prediction blocks T2 and T3 in FIG. 9 is not MODE_INTRA is searched.

Next, returning to the flowchart of FIG. 24, mvLXCol and availableFlag
LXCol is calculated (S2103 in FIG. 24).

FIG. 27 is a flowchart illustrating the inter prediction information calculation processing in step S2103 of FIG.

If PredMode of the prediction block colPu is MODE_INTRA or cannot be used (NO in S2401 in FIG. 27, NO in S2402), availableFlagL
XCol is set to 0 and mvLXCol is set to (0, 0) (S2403 and S2404 in FIG. 27).
The process ends.

When the prediction block colPu is available and PredMode is not MODE_INTRA (YES in S2401 in FIG. 27, YES in S2402), mvCol and refIdxCol are calculated in the following procedure.

L0 prediction flag PredFlagL0 [xPCol] [yP of prediction block colPu
Col] is 0 (YES in S2405 in FIG. 27), since the prediction mode of the prediction block colPu is Pred_L1, the motion vector mvCol and the reference index refI
dxCol is MvL1 [xPCo which is the motion vector of L1 of the good prediction block colPu
l] [yPCol] and L1 reference index RefIdxL1 [xPCol] [yPC
ol] (S2406 and S2407 in FIG. 27).

Further, it is confirmed whether or not the set motion vector mvCol crosses a picture including a prediction block to be encoded / decoded, and Mv1Cross is set (S2 in FIG. 27).
408).

Next, cross determination of the motion vector MV will be described with reference to FIG.
FIG. 29 is a flowchart for explaining whether or not the motion vector mvCol of colPu points to a reference image across a picture including a prediction block to be encoded / decoded. Reference picture colPic POC PicOrderCnt (colP
ic) is the POC PicOrderCnt (currPic) of the picture to be encoded / decoded
) And the POC RefPicOrder of the reference picture pointed to by mvCol
When Cnt (colPic, RefIdxColLX, LX) is larger than POC PicOrderCnt (currPic) of the picture to be encoded / decoded (S26 in FIG. 27)
01 YES), the reference picture colPic is past in the past of the encoding / decoding target picture,
Since the reference picture is located in the future, it is determined that the motion vector mvCol points to the reference picture across the picture including the prediction block to be encoded / decoded, and MvXCros
s is set to 1 (S2602 in FIG. 27). Otherwise (NO in S2601 in FIG. 27), POC PicOrderCnt (colPic) of the reference picture colPic is encoded /
It is larger than POC PicOrderCnt (currPic) of the picture to be decoded,
POC RefPicOrderCnt (colP of the reference picture pointed to by mvCol
ic, RefIdxColLX, LX) is the POC PicO of the picture to be encoded / decoded.
When smaller than rderCnt (currPic) (YES in S2603 of FIG. 27),
Since the reference picture colPic is located in the future and the reference picture is located in the past across the picture to be encoded / decoded, it is determined that the motion vector mvCol points to the reference picture across the picture including the prediction block to be encoded / decoded. MvXCross is set to 1 (S2602 in FIG. 27). When the above conditions are not met (NO in S2601, S26 in FIG. 27)
03), it is determined that the motion vector mvCol does not point to the reference image across the picture including the prediction block to be encoded / decoded, and MvXCross is set to 0 (FIG. 2).
7 S2604).

Returning again to FIG. 27, MvCross is set to the value of Mv1Cross (S2 in FIG. 27).
409).

In the present embodiment, the flag MvXCross is 1, that is, the reference picture colPi
When the motion vector mvCol of colPu of c points to a reference image across a picture including a prediction block to be encoded / decoded, the motion vector mvCol is a candidate for a predicted motion vector of the prediction block to be encoded / decoded. It is judged that it is relatively appropriate.
On the other hand, when the flag MvXCross is 0, that is, when the motion vector mvCol of colPu of the reference picture colPic does not point to the reference image across the picture including the prediction block to be encoded / decoded, It is determined that the motion vector candidate of the target prediction block is relatively unsuitable. That is, flag M
vXCross is used as one of the guidelines for determining whether or not it is suitable as a predicted motion vector candidate. L1 prediction flag PredFlagL1 [xPC of prediction block colPu
ol] [yPCol] is not 0 (YES in S2410 of FIG. 27), the prediction block c
Since the prediction mode of olPu is Pred_BI, one of the two motion vectors is selected (S2415 in FIG. 27).

FIG. 28 is a flowchart illustrating an inter prediction information acquisition processing method for a prediction block when the prediction mode of the prediction block colPu is Pred_BI.

The motion vector mvCol and the reference index refIdxCol are predicted blocks col
It is set to MvL0 [xPCol] [yPCol] which is the motion vector of Pu's L0 and the reference index RefIdxL0 [xPCol] [yPCol] of L0, respectively (FIG. 27).
S2411, S2412).

First, reference index RefIdxL0 [xPCo of L0 is added to RefIdxColLX.
l] [yPCol] is set (S2502 in FIG. 28), and it is confirmed whether or not the motion vector of L0 crosses the picture including the prediction block to be encoded / decoded, and Mv0Cross is set (S2503 in FIG. 28). Furthermore, the reference index RefIdxL1 [xPCol] [yPCol] of L1 is set in RefIdxColLX (S2502 in FIG. 28),
It is confirmed whether or not the motion vector of L1 crosses a picture including a prediction block to be encoded / decoded, and Mv1Cross is set (S2503 in FIG. 28).

When Mv0Cross is 0 and Mv1Cross is 1 (Y2E in S2505 in FIG. 28)
S), or when Mv0Cross is equal to Mv1Cross and the reference index list is L1 (YES in S2506 of FIG. 28), the L1 inter prediction information is selected,
Motion vector mvCol, reference index refIdxCol, list ListCol
, MvCross is MvL1 [xPCol] [yPCol], RefIdxColL1
And L1 and Mv0Cross, respectively.

Otherwise (NO in S2505 in FIG. 28, NO in S2506), the L0 inter prediction information is selected, and the motion vector mvCol, the reference index refIdxCol,
The lists ListCol and MvCross are MvL0 [xPCol] [yPCol], R
Set to efIdxColL0, L0, and Mv0Cross, respectively.

Returning to FIG. 27, when the inter prediction information is acquired, availableFlagLXCo
l is set to 1 (S2416 in FIG. 27).

Next, returning to the flowchart in FIG. 24, when availableFlagLXCol is 1 (YES in S2104 in FIG. 24), mvLXCol is scaled as necessary. For the scaling of this mvLXCol, a method similar to the method described in FIG. 22 is used (
S2105 in FIG.

[Addition of motion vector predictor candidates to MVP list (S304 in FIG. 16)]
Predicted motion vector candidates m calculated in S301, S302, and S303 in FIG.
Add vLXN (N = A, B, Col) to the MVP list mvpListLX S304
). FIG. 30 is a flowchart showing a process for adding a motion vector predictor candidate to the MVP list. In this method, priorities are assigned, and the MVP list mv is assigned in descending order of priority.
By registering predicted motion vector candidates in pListLX, the MVP index mvp
The code amount of _idx_lX [x0] [y0] is reduced. The code amount is reduced by arranging the element having a higher priority in front of the MVP list. For example, MVP list mvpListL
When there are three elements of X, the index 0 of the MVP list is “0” and the index 1 is “1”.
By setting “0” and index 2 to “11”, the code amount representing index 0 becomes 1 bit, and by registering an element considered to occur frequently in index 0, the code amount is reduced.

The MVP list mvpListLX has a list structure, and is provided with a storage area for storing an index indicating the location in the MVP list and a predicted motion vector candidate corresponding to the index as elements. The index number starts from 0 and the MVP list mvp
Predicted motion vector candidates are stored in the ListLX storage area. In subsequent processing, M
A motion vector predictor candidate of index i registered in the VP list mvpListLX is represented by mvpListLX [i], and is distinguished from the MVP list mvpListLX by array notation.

Flag mv_tempora encoded for each slice, sequence or picture
l_high_priority_flag is 1 and mv_list_adaptive
When _idx_flag is 0 (YES in S3101 and NO in S3102), prediction motion vector candidates from the prediction block adjacent to the left or above mvLXA, mvLXB from the same position of the picture at a time different from the prediction block or its neighboring prediction block The predicted motion vector candidate mvLXCol is prioritized, and the predicted motion vector candidate is registered in the MVP list in the processing procedure of the flowchart shown in FIG. 31 (S3104).

In addition, mv_temporal_high_priority_flag is 0, mv
When _list_adaptive_idx_flag is 0 (NO in S3101, S3
103 NO), predicted motion vector candidates mvLXA and mvLXB from the prediction block adjacent to the left or above the predicted motion vector candidate mvLXCol from the prediction block at or near the same position of the pictures at different times are prioritized. 32 are registered in the MVP list in the processing procedure of the flowchart shown in FIG. 32 (S3105).
.

In addition, mv_temporal_high_priority_flag is 1 and mv
When _list_adaptive_idx_flag is 1 (YES in S3101, S
3102 YES), a motion vector candidate that is determined to be highly reliable is given priority, and a motion vector candidate mvLXA from a prediction block adjacent to the left or above is given.
Predicted motion vector candidates mvLXCol from the prediction block at or near the same position of a picture at a different time than mvLXB are prioritized, and the predicted motion vector candidates are registered in the MVP list by the processing procedure of the flowchart shown in FIG. (S3106).

In addition, mv_temporal_high_priority_flag is 0, mv
When _list_adaptive_idx_flag is 1 (NO in S3101, S3
103), a motion vector candidate that is determined to have high reliability is prioritized, and left or above a motion vector candidate mvLXCol from the prediction block at the same position or its vicinity in a picture at a different time. Predicted motion vector candidates mvLXA and mvLXB from the prediction block adjacent to the image are prioritized, and predicted motion vector candidates are registered in the MVP list by the processing procedure of the flowchart shown in FIG. 34 (S3107).

As described above, the second flag mv_temporal_high_priority_
The flag value is adaptively changed for each frame or slice to improve the encoding efficiency. When the distance between the encoding / decoding target picture and the nearest reference picture is short, mv_temporal_high_priority_flag is set to true (1), and when the distance between the encoding / decoding target picture and the reference picture is far, false ( By setting 0), the code amount of the MVP index can be reduced. If this distance is relatively small, it is determined that MVP candidates from different times are relatively suitable as candidates. For example, when the frame rate is 30 Hz, when the distance between the encoding / decoding target picture and the nearest reference picture is within X frames (X = 1 to 3), mv_temporal_h
When the high_priority_flag is set to true (1) and the distance between the encoding / decoding target image and the reference picture is larger than the X frame, the code amount of the MVP index is reduced by setting it to false (0). By setting this threshold value X according to the contents of the sequence, the code amount can be further reduced. In the case of a complex sequence with large motion, encoding efficiency can be improved by lowering the priority of MVP candidates in the time direction by reducing the threshold.

FIG. 31 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to the MVP list mvpListLX when ptiv_idx_flag is 0 (YES in S3101, NO in S3102).

First, when availableFlagLXCol is 1 (YES in S3201), M
MvLXCol is registered at the head of the VP list mvpListLX (S3202).
Subsequently, when availableFlagLXA is 1 (YES in S3203), MV
The mvLXA is registered at the end of the P list mvpListLX (S3204).
Subsequently, when availableFlagLXB is 1 (YES in S3205), MV
The mvLXB is registered at the end of the P list mvpListLX (S3206).

FIG. 32 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
M when ptiv_idx_flag is 0 (NO in S3101, NO in S3103)
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to VP list mvpListLX.

First, when availableFlagLXA is 1 (YES in S3301), MVP
MvLXA is registered at the head of the list mvpListLX (S3302).
Subsequently, when availableFlagLXB is 1 (YES in S3303), MV
The mvLXB is registered at the end of the P list mvpListLX (S3304).
Subsequently, when availableFlagLXCol is 1 (YES in S3305),
The mvLXCol is registered at the end of the MVP list mvpListLX (S3306).

FIG. 33 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
When ptive_idx_flag is 1 (YES in S3101, YES in S3102)
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to the MVP list mvpListLX.

First, when availableFlagLXCol is 1 and MvCross is 1 (
(YES in S3401, YES in S3402), mvLXCol is registered at the head of the MVP list mvpListLX (S3403).
Subsequently, availableFlagLXA is 1 and MvXANonScale is 1.
In the case of (YES in S3404, YES in S3405), the MVP list mvpListLX
MvLXA is registered at the end of (S3406).
Subsequently, availableFlagLXB is 1 and MvXBNonScale is 1.
In the case of (YES in S3407, YES in S3408), the MVP list mvpListLX
MvLXB is registered at the end of (S3409).
Subsequently, when availableFlagLXCol is 1 and MvCross is 0 (YES in S3410, YES in S3411), mvLXCol is registered at the end of the MVP list mvpListLX (S3412).
Then, availableFlagLXA is 1 and MvXANonScale is 0
In the case of (YES in S3413, YES in S3414), the MVP list mvpListLX
MvLXA is registered at the end of (S3415).
Subsequently, availableFlagLXB is 1 and MvXBNonScale is 0.
In the case of (YES in S3417, YES in S3416), the MVP list mvpListLX
MvLXB is registered at the end of (S3418).

FIG. 34 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 0 and mv_list_ada
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to the MVP list mvpListLX when ptiv_idx_flag is 1 (NO in S3101, YES in S3103).

First, when availableFlagLXA is 1 and MvXANonScale is 1 (YES in S3501, YES in S3502), mvLXA is registered at the head of the MVP list mvpListLX (S3503).
Subsequently, availableFlagLXB is 1 and MvXBNonScale is 1.
In the case of (YES in S3504, YES in S3505), the MVP list mvpListLX
MvLXB is registered at the end of (S3506).
Subsequently, when availableFlagLXCol is 1 and MvCross is 1 (YES in S3507, YES in S3508), mvLXCol is registered at the end of the MVP list mvpListLX (S3509).
Then, availableFlagLXA is 1 and MvXANonScale is 0
In the case of (YES in S3510, YES in S3511), the MVP list mvpListLX
MvLXA is registered at the end of (S3512).
Subsequently, availableFlagLXB is 1 and MvXBNonScale is 0.
In the case of (YES in S3513, YES in S3514), the MVP list mvpListLX
MvLXB is registered at the end of (S3515).
Subsequently, when availableFlagLXCol is 1 and MvCross is 0 (YES in S3516, YES in S3517), mvLXCol is registered at the end of the MVP list mvpListLX (S3518).

In the candidate motion vector candidate registration processing procedure for the MVP list mvpListLX in FIG. 30, when mv_temporal_high_priority_flag is 1, the temporal motion vector mvLXCol is preferentially registered in front of the MVP list, and mv_
When temporal_high_priority_flag is 0, the spatial motion vectors mvLXA and mvLXB are preferentially registered ahead of the MVP list, thereby reducing the code amount.

In the candidate motion vector candidate registration processing procedure in the MVP list mvpListLX in FIGS. 33 and 34, the flag MvCross is 1, that is, colPu pointing to the reference image across the picture including the prediction block to be encoded / decoded. Motion vector mvC
The predicted motion vector candidate calculated from ol indicates that the flag MvCross is 0, that is, indicates the reference image without crossing the picture including the prediction block to be encoded / decoded.
It is determined that the predicted motion vector candidate is often closer to the encoding / decoding target motion vector than the predicted motion vector candidate calculated from the Pu motion vector mvCol, and the difference motion vector value is often smaller. The amount of code is reduced by registering the predicted motion vector of Col in the front of the MVP list with a higher priority. That is, the code amount is reduced by changing the priority order according to the value of the encoding information of the prediction block Col of the image at different time and changing the order of registration in the merge candidate list.

In addition, in the prediction block N (N is A or B), a predicted motion vector candidate predicted from a motion vector whose MvXNNonScale is 1 is encoded / predicted from a predicted motion vector candidate predicted from a motion vector whose MvXNNonScale is 0. It is relatively suitable as a candidate for a motion vector predictor of a prediction block to be decoded, often has a value close to the motion vector to be encoded / decoded, and a difference motion vector value is often small. The code amount is reduced by registering in the MVP list.

In addition, instead of FIG. 33 and FIG. 34, motion vector predictor candidates can be registered by the processing procedures of FIG.

FIG. 35 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
When ptive_idx_flag is 1 (YES in S3101, YES in S3102)
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to the 2nd MVP list mvpListLX.

First, when availableFlagLXCol is 1 and a lower right prediction block is selected in a prediction block group at a different time (YES in S3601, YE in S3602).
S), mvLXCol is registered at the head of the MVP list mvpListLX (S3603).
).
Subsequently, when availableFlagLXA is 1 and the prediction block on the lower left or the left is selected in the prediction block group adjacent to the left (YES in S3604, S3605).
YES), mvLXA is registered at the end of the MVP list mvpListLX (S360).
6).
Subsequently, when the availableFlagLXB is 1 and the upper right or upper prediction block is selected in the prediction block group adjacent on the upper side (YES in S3607, S3608).
YES), mvLXB is registered at the end of the MVP list mvpListLX (S360).
9).
Subsequently, when the availableFlagLXCol is 1 and the central prediction block is selected from the prediction block groups at different times (YES in S3610, Y in S3611)
ES), mvLXCol is registered at the end of the MVP list mvpListLX (S361).
2).
Subsequently, when the availableFlagLXA is 1 and the prediction block on the upper left is selected in the prediction block group adjacent to the left (YES in S3613, YES in S3614)
), MvLXA is registered at the end of the MVP list mvpListLX (S3615).
Subsequently, when the availableFlagLXB is 1 and the upper left prediction block is selected in the prediction block group adjacent on the upper side (YES in S3617, YES in S3616)
), MvLXB is registered at the end of the MVP list mvpListLX (S3618).

FIG. 36 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 0 and mv_list_ada
It is a flowchart which shows the candidate registration process procedure of the motion vector predictor to the 2nd MVP list mvpListLX when ptiv_idx_flag is 1 (NO in S3101, YES in S3103).

First, when availableFlagLXA is 1 and the lower left or left prediction block is selected in the prediction block group adjacent to the left (YES in S3701 and YES in S3702), mvLXA is registered at the head of the MVP list mvpListLX (S3703).
).
Subsequently, when availableFlagLXB is 1 and the upper right or upper prediction block is selected in the upper adjacent prediction block group (YES in S3704, S3705).
YES), mvLXB is registered at the end of the MVP list mvpListLX (S370).
6).
Subsequently, when the availableFlagLXCol is 1 and a lower right prediction block is selected in a prediction block group at different times (YES in S3707, Y in S3708)
ES), mvLXCol is registered at the end of the MVP list mvpListLX (S370).
9).
Subsequently, when availableFlagLXA is 1 and the upper left prediction block is selected in the prediction block group adjacent to the left (YES in S3710, YES in S3711)
), MvLXA is registered at the end of the MVP list mvpListLX (S3712).
Subsequently, when the availableFlagLXB is 1 and the upper left prediction block is selected in the prediction block group adjacent on the upper side (YES in S3713, YES in S3714)
), MvLXB is registered at the end of the MVP list mvpListLX (S3715).
Subsequently, when availableFlagLXCol is 1 and a central prediction block is selected in a prediction block group at a different time (YES in S3716, Y in S3717).
ES), mvLXCol is registered at the end of the MVP list mvpListLX (S371).
8).

In the prediction motion vector candidate registration processing procedure to the MVP list mvpListLX in FIG. 35 and FIG. 36, the prediction motion vector candidates predicted from the motion vector of the lower right prediction block are different in the prediction block groups at different times. In a temporal prediction block group, the motion vector is often closer to the encoding target motion vector than the predicted motion vector candidate predicted from the motion vector of the central prediction block, and the difference motion vector value is often smaller. The amount of code is reduced by preferentially registering it in the MVP list.
In the prediction block group adjacent to the left, the predicted motion vector candidate predicted from the motion vector of the lower left or left predicted block is encoded more than the predicted motion vector candidate predicted from the motion vector of the upper left predicted block. It is determined that the value is often close to the motion vector and the value of the difference motion vector is often small, and the code amount is reduced by preferentially registering it in the MVP list. In the prediction block group adjacent to the top, the motion vector candidate predicted from the motion vector of the upper right or upper prediction block is encoded more than the motion vector candidate predicted from the motion vector of the upper left prediction block. It is determined that the value is often close to the motion vector and the value of the difference motion vector is often small, and the code amount is reduced by preferentially registering it in the MVP list.

[Delete candidate motion vector having the same value in MVP list (S30 in FIG. 16)
5)]
If there are prediction motion vector candidates having the same motion vector value in the predicted motion vector candidate MVP list mvpListLX, all except the prediction motion vector candidate having the smallest index in the MVP list mvpListLX Deleted. After completion of the deletion process, the MVP list mvpListLX has a storage area for the deleted motion vector predictor candidates deleted, so that the index 0 is used as a reference and the motion vector motion vector candidates with smaller indexes are packed in order. Go. For example, when the motion vector predictor candidates at indexes 1 and 4 are deleted and the indexes 0, 2 and 3 remain, the motion vector predictor candidates at index 2 are moved to the storage area for index 1 while index 0 remains unchanged. Then, the motion vector candidate of index 3 is moved to the storage area of index 2 and the contents of the MVP list mvpListLX are updated.

In addition, regarding steps S301, S302, and S303, the processing order can be changed and the processing can be performed in parallel.

Next, the merge mode will be described.
So far, the motion vector calculation unit 103 of the video encoding device and the motion vector calculation method 204 and the motion vector calculation method of the motion vector calculation unit 204 of the video decoding device have been described. The same processing is performed in the merge mode of the inter prediction information estimation unit 104 of the encoding device and the inter prediction information estimation unit 205 of the video decoding device.

As described above, the merge mode does not encode / decode inter prediction information such as a prediction mode, a reference list index, and a motion vector of the prediction block, but encodes adjacent inter-predicted prediction blocks, Or it is the mode which uses the inter prediction information of the prediction block by which the inter prediction of the different image was carried out.

FIG. 37 is a diagram for explaining the positions of adjacent prediction blocks in the merge mode. In addition to the prediction block A adjacent to the left, the prediction block B adjacent to the upper right, the prediction block C adjacent to the upper right, and the prediction block D adjacent to the lower left, the merge mode is the same at different times described with reference to FIG. Five prediction blocks of the prediction block Col (any one of T0 to T3) at or near the position are candidates. The inter prediction information estimation unit 104 of the moving image encoding device and the inter prediction information estimation unit 205 of the moving image decoding device register these five candidates in the merge candidate list in a common order on the encoding side and the decoding side. Then, the inter prediction information estimation unit 104 of the moving image 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 The inter prediction information estimation 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,
Motion compensation prediction is performed using inter prediction information such as a prediction mode, a reference index, and a motion vector of the selected prediction block.

FIG. 38 is a diagram illustrating a detailed configuration of the inter prediction information estimation unit 104 of the video encoding device in FIG. FIG. 39 is a diagram illustrating a detailed configuration of the inter prediction information estimation unit 205 of the video decoding device in FIG.

The portions surrounded by the thick frame lines in FIGS. 38 and 39 are respectively the inter prediction information estimation unit 104.
And the inter prediction information estimation part 205 is shown.

Furthermore, the part enclosed by the thick dotted line inside shows the operation | movement part of the inter prediction information estimation method mentioned later, and is similarly installed in the moving image decoding apparatus corresponding to the moving image encoding apparatus of embodiment. Thus, the same determination result consistent with encoding and decoding can be obtained.

The inter prediction information estimation unit 104 includes a merge candidate generation unit 130 and a merge candidate registration unit 131.
, A merge candidate identity determination unit 132, and an encoding information selection unit 133.

The inter prediction information estimation unit 205 includes a merge candidate generation unit 230 and a merge candidate registration unit 231.
, A merge candidate identity determination unit 232, and an encoded information selection unit 233.

FIG. 40 is a flowchart showing the flow of merge candidate derivation and merge candidate list construction processing having functions common to the inter prediction information estimation unit 104 of the video encoding device and the inter prediction information estimation unit 205 of the video decoding device. It is. Hereinafter, the processes will be described in order.

In the merge candidate generation unit 130 of the inter prediction information estimation unit 104 of the video encoding device and the merge candidate generation unit 230 of the inter prediction information estimation unit 205 of the video decoding device, the neighboring prediction blocks A, B, C, A prediction block that is a merge candidate from D is calculated for each list, and a flag availableFlagN indicating whether or not it can be used, a motion vector mvLXN, a reference index refIdxLXN, and an LN prediction flag predFlagLXN indicating whether or not LN prediction is performed are output. (N = A, B, C, D) (S in FIG.
401). Note that X is 0 when L0 and X is 1 when L1 (the same applies hereinafter). A flag availableFlagLXN indicating whether or not it can be used, and a motion vector mvLXN
A common calculation processing procedure for calculating the reference index refIdxLXN and the LN prediction flag predFlagLXN (N is A, B, C, D, and so on) will be described in detail later with reference to the flowchart of FIG.

Subsequently, merge candidates at different times are calculated. When performing inter prediction using coding information of merge candidates at different times, two pieces of coding information of L0 and L1 are calculated in order to perform bi-prediction. First, in the merge candidate generation unit 130 of the inter prediction information estimation unit 104 of the video encoding device and the merge candidate generation unit 230 of the inter prediction information estimation unit 205 of the video decoding device, reference indexes refIdxLXCol of merge candidates at different times are set. Determine and output (S402 in FIG. 40). Here, in each of L0 and L1, the encoding information of the encoded surrounding prediction blocks is examined, and the most frequently generated reference index value is set as the value of the reference index refIdxLXCol. When there are the same number of reference indexes that occur most frequently, the smaller reference index value is set as the value of the reference index refIdxLXCol, and when there is no reference index (the surrounding prediction block cannot be used or intra prediction is performed) Mode), reference index r
The value of efIdxLXCol is set to 0.

Subsequently, the merge candidate generation unit 130 of the inter prediction information estimation unit 104 of the video encoding device.
In addition, the merge candidate generation unit 230 of the inter prediction information estimation unit 205 of the moving image decoding apparatus calculates prediction motion vector candidates from images at different times and can use the flag availableFlagCol indicating whether or not it can be used. Indicating flag mvCro
ssFlag and the motion vector mvLXCol are output (S403 in FIG. 40). These calculation processing procedures are the same methods as described with reference to the flowcharts of FIGS. However, in the MV scaling in FIG. 22 in the merge mode, the calculation is performed according to the reference index refIdxLXCol calculated in step S402.

Subsequently, the merge candidate registration unit 131 of the inter prediction information estimation unit 104 of the video encoding device.
The merge candidate registration unit 231 of the inter prediction information estimation unit 205 of the video decoding device creates a merge candidate list mergeCandList, and generates a prediction vector candidate mvLXN (
N adds A, B, C, D, or Col (the same applies hereinafter) (S404 in FIG. 40). These registration processing procedures will be described in detail later using the flowcharts of FIGS.

Subsequently, the merge candidate identity determination unit 1 of the inter prediction information estimation unit 104 of the video encoding device.
32 and the merge candidate identity determination unit 232 of the inter prediction information estimation unit 205 of the video decoding device.
Then, in the merge candidate list mergeCandList, when the motion vectors of the same reference index as the merge candidate have the same value, the motion vector is removed except for the smallest merge candidate (S405 in FIG. 40).

[Deriving merge candidates from neighboring prediction blocks (S401 in FIG. 40)]
With reference to the flowchart of FIG. 41, the calculation method of the prediction block N from the prediction block group N adjacent to the periphery, which is the processing procedure of S401 of FIG. 40, will be described. The subscript X is 0 or 1 representing the reference list, and N is the A representing the area of the adjacent prediction block group.
(Left side), B (upper side), C (upper right) or D (lower left).

In FIG. 40, the prediction block adjacent to the left side of the prediction block to be encoded / decoded as variable N = A, the prediction block adjacent to the upper side as variable N = B, and the prediction adjacent to the upper right side as variable N = C The prediction block adjacent to the lower left side is examined with N = D, and the motion vector predictor candidates are calculated in the following procedure (S4101 to S4110).

First, a prediction block adjacent to a prediction block to be encoded / decoded is specified, and when each prediction block N can be used, encoding information is acquired (S4102).

If the adjacent prediction block N cannot be used (YES in S4103), or the encoding mode PredMode of the prediction block N is intra (MODE_INTRA) (S41)
04 YES), the flag availableFlagN is set to 0 (S4105), m
vLXN is set to (0, 0) (S4106).

On the other hand, when the adjacent prediction block N can be used (NO in S4103) and the encoding mode PredMode of the prediction block N is not intra (MODE_INTRA) (S410).
4), the flag availableFlagN is set to 1 (S4107), and the inter prediction information of the prediction block N is acquired. That is, the motion vector mv of the prediction block N
LXN, reference index refIdxLX [xN, yN], and flag predFlagLX [xN, yN] indicating whether to perform prediction from LX are mvLXN, refIdxLX
N and predFlagLXN (S4108, S4109, S4)
110). Here, X is 0 and 1, and inter prediction information of L0 and L1 is acquired. In addition, when weighted prediction is performed and a weighting coefficient is set for each prediction block, the weighting coefficient is also acquired. Furthermore, interlace coding is performed, and in units of prediction blocks,
When the frame mode and the field mode are switched, the frame / field switching mode is also acquired. Furthermore, quantization parameters other than the inter prediction information can be acquired.
The processes in steps S4102 to S4110 are repeated for N = A, B, C, and D (
S4101 to S4111).

[Add prediction block candidate to merge candidate list (S404 in FIG. 40)]
A method of adding the prediction block candidates to be merge candidates described with reference to FIGS. 37 and 9 to the merge candidate list will be described. FIG. 42 is a flowchart of a process procedure for adding prediction block candidates that are merge candidates to the merge candidate list. In this method, priorities are assigned and the motion vector candidates are registered in the merge candidate list mergeCandList in descending order of priority so that the merge index merge_idx [x0].
The code amount of [y0] is reduced. The amount of codes is reduced by placing elements with higher priorities in front of the merge candidate list. For example, if there are five elements in the merge candidate list mergeCandList, index 0 of the merge candidate list is “0” and index 1 is “10”.
", Index 2 is" 110 ", index 3 is" 1110 ", index 4 is"
By setting “11110”, the code amount indicating 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 storage area for storing, as elements, a merge index indicating a location in the merge candidate list and a predicted motion vector candidate corresponding to the index. The merge index number is 0
The motion vector candidates are stored in the storage area of the merge candidate list mergeCandList. In subsequent processing, the merge candidate list mergeCandLi
The prediction block that is a merge candidate of the merge index i registered in st is merg
eCandList [i] and merge candidate list mergeCandLis
It is distinguished from t by array notation.

Flag mv_tempora encoded for each slice, sequence or picture
l_high_priority_flag is 1 and mv_list_adaptive
When _idx_flag is 0 (YES in S4201 and NO in S4202), the prediction block Col at the same position or in the vicinity of the picture at a different time is prioritized over the prediction blocks C and D adjacent in the upper right or lower left, and is shown in FIG. In the processing procedure of the flowchart, a prediction block that becomes a merge candidate is registered in the merge candidate list (S4204).

In addition, mv_temporal_high_priority_flag is 0, mv
When _list_adaptive_idx_flag is 0 (NO in S4201, S4
203 NO), the prediction block C adjacent to the upper right or lower left of the prediction block Col that becomes a merge candidate from the prediction block at or near the same position of pictures at different times.
, D is prioritized, and prediction blocks that are merge candidates are registered in the merge candidate list in the processing procedure of the flowchart shown in FIG. 44 (S4205).

Also, when mmv_list_adaptive_idx_flag is 1 (S420)
2 YES, YES in S4203), the prediction block that becomes a merge candidate determined to have high reliability is given priority, and the prediction block that becomes a merge candidate is registered in the merge candidate list in the processing procedure of the flowchart shown in FIG. (S4206).

As described above, the second flag mv_temporal_high_priority_
The flag value is adaptively changed for each frame or slice to improve the encoding efficiency. When the distance between the encoding / decoding target picture and the nearest reference picture is short, mv_temporal_high_priority_flag is set to true (1), and when the distance between the encoding / decoding target picture and the reference picture is far, false ( By setting 0), the code amount of the merge index can be reduced. If this distance is relatively small, it is determined that merge candidates from different times are relatively suitable as candidates. For example, when the frame rate is 30 Hz, when the distance between the encoding / decoding target picture and the nearest reference picture is within X frames (X = 1 to 3), mv_temporal_h
When the high_priority_flag is set to true (1) and the distance between the encoding / decoding target image and the reference picture is larger than the X frame, the code amount of the merge index is reduced by setting it to false (0). . By setting this threshold value X according to the contents of the sequence, the code amount can be further reduced. In the case of a complex sequence with a large motion, encoding efficiency can be improved by lowering the priority of merge candidates in the time direction by reducing the threshold.

FIG. 43 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
It is a flowchart which shows the registration process procedure of the prediction block used as the merge candidate to merge candidate list mergeCandList when ptiv_idx_flag is 0 (YES of S4201 and NO of S4202).

First, when availableFlagA is 1 (YES in S4301), the prediction block A is registered as a merge candidate at the head of the merge candidate list mergeCandList (S4302).
Subsequently, when availableFlagB is 1 (YES in S4303), the prediction block B is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4304).
Subsequently, when availableFlagCol is 1 (YES in S4305), the prediction block Col is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4306).
Subsequently, when availableFlagC is 1 (YES in S4307), the prediction block C is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4308).
Subsequently, when availableFlagD is 1 (YES in S4309), the prediction block D is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4310).

FIG. 44 shows a flag mv_te encoded for each slice, sequence, or picture.
mporal_high_priority_flag is 1 and mv_list_ada
It is a flowchart which shows the registration processing procedure of the prediction block used as the merge candidate to merge candidate list mergeCandList when ptiv_idx_flag is 0 (NO of S4201 and NO of S4203).

First, when availableFlagA is 1 (YES in S4401), the prediction block A is registered as a merge candidate at the head of the merge candidate list mergeCandList (S4402).
Subsequently, when availableFlagB is 1 (YES in S4403), the prediction block B is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4404).
Subsequently, when availableFlagC is 1 (YES in S4405), the prediction block C is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4406).
Subsequently, when availableFlagD is 1 (YES in S4407), the prediction block D is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4408).
Subsequently, when availableFlagCol is 1 (YES in S4409), the prediction block Col is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4410).

FIG. 45 shows a flag mv_te encoded for each slice, sequence, or picture.
mpral_high_priority_flag is 0 or 1, and mv_list
It is a flowchart which shows the registration processing procedure of the prediction block used as a merge candidate to merge candidate list mergeCandList when _adaptive_idx_flag is 1 (YES of S4201 and YES of S4202).

First, when availableFlagA is 1 (YES in S4501), the prediction block A is registered as a merge candidate at the head of the merge candidate list mergeCandList (S4502).
Subsequently, when availableFlagB is 1 (YES in S4503), the prediction block B is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4504).
Subsequently, when availableFlagCol is 1 and MvXCross is 1 (
YES in S4505, YES in S4506), merge candidate list mergeCandLi
The prediction block Col is registered as a merge candidate at the end of st (S4507).
Subsequently, when availableFlagC is 1 (YES in S4508), the prediction block C is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4509).
Subsequently, when availableFlagD is 1 (YES in S4510), the prediction block D is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4511).
Subsequently, when availableFlagCol is 1 and MvXCross is 0 (
YES in S4511, YES in S4513), merge candidate list mergeCandLi
The prediction block Col is registered as a merge candidate at the end of st (S4514).

In the candidate motion vector candidate registration processing procedure to the merge candidate list mergeCandList in FIG. 42, mv_temporal_high_priority_fla
When g is 1, the temporal prediction block Col is preferentially registered ahead of the merge candidate list over the prediction blocks C and D adjacent to the upper right or lower left, and mv_temporal_high
When h_priority_flag is 0, the prediction blocks C and D adjacent to the upper right or lower left of the temporal prediction block Col are preferentially registered ahead of the merge candidate list, thereby reducing the code amount of the merge index.

In the prediction block candidate registration procedure to the merge candidate list mergeCandList in FIG. 45, the flag MvCross is 1, that is, the motion vector mvCol of colPu pointing to the reference image across the picture including the prediction block to be encoded / decoded.
The merge candidate using the motion vector calculated from the above indicates that the flag MvCross is 0, that is, indicates the reference image without crossing the picture including the prediction block to be encoded / decoded.
It is determined that it is more suitable as a merge candidate than a merge candidate using a motion vector calculated from the motion vector mvCol of olPu. When MvCross is 0, the code amount is reduced by lowering the priority of the temporal prediction block Col and registering it behind the merge candidate list. That is, the code amount is reduced by changing the priority order according to the value of the encoding information of the prediction block Col of the image at different time and changing the order of registration in the merge candidate list.

In the merge mode, the prediction block A adjacent to the left and the prediction block B adjacent to the upper side often move together with the prediction block to be encoded / decoded, so that inter prediction information can be acquired. Is registered ahead of the merge candidate list in preference to the other prediction blocks C, D, and Col.

  Instead of FIG. 45, merge candidates can be registered by the processing procedure of FIG.

FIG. 46 shows a flag mv_te encoded for each slice, sequence, or picture.
mpral_high_priority_flag is 0 or 1, and mv_list
It is a flowchart which shows the registration process procedure of the prediction block used as a merge candidate to merge candidate list mergeCandList when _adaptive_idx_flag is 1 (YES of S4202, YES of S4203).

First, availableFlagA is 1, predFlagL0A and predFl.
When both agL1A are 1 (YES in S4601 and YES in S4602), the bi-predictive prediction block A is registered as a merge candidate at the head of the merge candidate list mergeCandList (S4603).
Subsequently, availableFlagB is 1, predFlagL0B and predF
If both lagL1B are 1 (YES in S4604, YES in S4605), the bi-predictive prediction block B is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4606).
Then, availableFlagA is 1, predFlagL0A and predF
If either one of lagL1A is 0 (YES in S4607, YES in S4608), a prediction block A that is not bi-predicted is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4609).
Subsequently, availableFlagB is 1, predFlagL0B and predF
If either one of lagL1B is 0 (YES in S4610, YES in S4611), a prediction block B that is not bi-predicted is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4612).
Then, availableFlagC is 1, predFlagL0C and predF
If both lagL1C are 1 (YES in S4613, YES in S4614), the bi-predictive prediction block C is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4615).
Subsequently, availableFlagD is 1, predFlagL0D and predF
If both lagL1D are 1 (YES in S4616, YES in S4617), the bi-predictive prediction block D is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4618).
Subsequently, when availableFlagCol is 1 (YES in S4619), the prediction block Col is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4620).
Then, availableFlagC is 1, predFlagL0C and predF
If either one of lagL1C is 0 (YES in S4621 and YES in S4622), a prediction block C that is not bi-predicted is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4623).
Subsequently, availableFlagD is 1, predFlagL0D and predF
If either one of lagL1D is 0 (YES in S4624, YES in S4625), a prediction block C that is not bi-predicted is registered as a merge candidate at the end of the merge candidate list mergeCandList (S4626).

46, the prediction flags predFlagL0N and predFlagL1N of the prediction blocks N (N are A, B, C, and D) adjacent to each other, that is, bi-prediction, are included in the merge candidate list mergeCandList. Merge candidates for which motion compensation has been performed using the prediction blocks N (N is A, B, C, D) adjacent to each other.
The prediction flag predFlagL0N or predFlagL1N is 0, that is, it is determined to be more suitable as a merge candidate than a merge candidate for which motion compensation is performed using one-way prediction such as L0 prediction or L1 prediction that is not bi-prediction. The code amount is reduced by increasing the priority of merge candidates that are performed and registering them ahead of the merge candidate list, and decreasing the priority of merge candidates that are not subjected to bi-prediction and registering them behind the merge candidate list. . That is, the code amount is reduced by changing the order of registration in the merge candidate list by changing the priority order according to the encoding information value of the prediction block N adjacent to the surrounding.

Instead of FIGS. 45 and 46, the merge candidates can be registered with priorities according to the distance between the encoding / decoding target image and the merge candidate reference image according to the processing procedure of FIG.

FIG. 47 shows a flag mv_te encoded for each slice, sequence, or picture.
mpral_high_priority_flag is 0 or 1, and mv_list
It is a flowchart which shows the registration process procedure of the prediction block used as a merge candidate to merge candidate list mergeCandList when _adaptive_idx_flag is 1 (YES of S4202, YES of S4203).

First, the absolute value of the difference between the POC of the encoding / decoding target picture and the POC of the reference picture used in the inter prediction of the prediction block A is calculated and set as the inter-predicted picture distance distA (S4701). Similarly, the POC of the encoding / decoding target image and the prediction blocks B, C, D,
The absolute values of the difference from the POC of the reference picture used in the inter prediction of Col are calculated, and are set as inter predicted image distances distB, distC, distD, distCol (S4701 to S4705). Predicted block N (N = A, B, C, D or Col)
Is a bi-prediction, the inter-prediction image distance for L0 and the inter-prediction image distance for L1 are calculated, the smaller one is selected, and the inter-prediction image distance distN (N = A, B, C,
D or Col). When the prediction block N (N = A, B, C, D or Col) is L0 prediction or L1 prediction, the inter-prediction image distance for L0 or the inter-prediction image distance for L1 used is calculated, Select the smaller one, and the inter-predicted image distance dist
N (N = A, B, C, D or Col).

In addition, when the prediction block N (N = A, B, C, D, or Col) cannot be used and in the case of intra prediction, the inter-prediction image distance distN (N = A, B, C, D, or Col) Is set to the maximum value that can be taken by distN.

Subsequently, the inter-prediction image distance di of the calculated prediction blocks A, B, C, D, and Col.
Merge candidates A, B, C, D, and Col are added to the merge candidate list mergeCandList according to the values of stA, distB, distC, distD, and distCol (
S4706 to S4720).

First, the inter prediction image distances distA and distB of the calculated prediction blocks A and B
Merge candidates A and B are sequentially added to the merge candidate list mergeCandList from a prediction block with a small value (S4706 to S4708).

The inter-prediction image distance distA value of the prediction block A is compared with the inter-prediction image distance distance distB of the prediction block B (S4706). They are added in order (S4707). That is, after adding the prediction block A, the prediction block B is added behind it.
Add When the value of distB is smaller than the value of distA, the merge candidate list mer
The prediction blocks B and A are added to the geCandList in the order (S4708).

Subsequently, the inter-predicted image distance distC of the calculated prediction blocks C, D, and Col
The merge candidate list mergeCa sequentially from the prediction block with the smaller values of distD and Col
Merge candidates C, D, and Col are added to ndList (S4709 to S4720).

In the candidate registration process procedure of the prediction block to the merge candidate list mergeCandList in FIG. 47, the merge candidate having a small distance between the picture including the prediction block to be encoded / decoded and the reference picture of the merge candidate is encoded / decoded. The merge candidate is judged to be more suitable as a merge candidate than the merge candidate having a large distance between the picture including the prediction block and the reference picture of the merge candidate, and the priority of the merge candidate having a small distance is set higher than that of the merge candidate having the large distance By registering in front of the candidate list, the code amount is reduced. That is, the code amount is reduced by changing the order of registration in the merge candidate list by changing the priority order according to the encoding information value of the prediction block N adjacent to the surrounding.

In the merge mode, confirm the encoding information of the prediction block that is a merge candidate,
You can also prioritize the order from the most.
In the merge mode, the size of a prediction block that is a merge candidate can be confirmed, and priorities can be assigned in order from the largest.

Returning to FIG. 38, the encoding information selection unit 133 of the inter prediction information estimation unit 104 of the moving image encoding apparatus selects an optimal candidate from the merge candidates registered in the merge candidate list, and merge index is selected. And encoding information corresponding to the merge index is output.

In selecting the optimum candidate, a method similar to that of the prediction method determination unit 106 can be used. A code amount and coding distortion are calculated for each merge candidate, and coding information that produces the least generated code amount and coding distortion is determined. The merge index merge_idx is encoded for each merge candidate, and the code amount of the encoded information is calculated. Furthermore, for each merge candidate, a motion compensated prediction signal that has been motion compensated according to the coding information of each merge candidate in the same manner as the motion compensation prediction unit 105, and an encoding target image signal supplied from the image memory 101 The code amount of the prediction residual signal obtained by encoding the prediction residual signal is calculated. A total generated code amount obtained by adding the code amount of the encoded information (merge index) and the code amount of the prediction residual signal is calculated and used as the first evaluation value.

Also, after encoding such a difference image, the difference image is decoded for distortion amount evaluation, and the encoding distortion is calculated as a ratio representing an error from the original image generated by the encoding. By comparing the total generated code amount and the encoding distortion for each merge candidate, the encoding information that produces the least generated code amount and the encoding distortion is determined. The merge index corresponding to the determined encoding information is encoded as the flag merge_idx represented by the 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. 39, the encoding information selection unit 233 of the inter prediction information estimation unit 205 of the moving image encoding device selects a code corresponding to the supplied merge index from the merge candidates registered in the merge candidate list. Encoding information is selected and supplied to the motion compensation prediction unit 206 and stored in the encoding information storage memory 209.

As described above, according to the motion vector prediction method of the embodiment, the motion vector coding efficiency in moving picture coding in which a picture is divided into rectangular blocks, and motion estimation and compensation are performed in units of blocks between pictures. In order to improve this, it is possible to reduce the amount of code by performing prediction from the motion vector of an already-encoded prediction block and encoding the difference vector between the motion vector of the block to be processed and its predicted value . At that time, the plurality of obtained motion vector predictors are registered with a priority order in the motion vector predictor list. However, as described in the present embodiment, the registration order may be changed according to the priority order. Alternatively, after registration in a predetermined order, the list may be rearranged according to the priority order, and is included in the present invention. For example, a predicted motion vector calculated from the first predicted block group A adjacent to the left side of the index 0 of the predicted motion vector list, a predicted motion vector calculated from the second predicted block group B adjacent to the upper side of the index 1, and an index The motion vector predictors calculated from the third prediction block group C at different times are temporarily registered in 2 and then rearranged according to the priority order as necessary.

Furthermore, according to the motion vector prediction method of the embodiment, the picture is divided into rectangular blocks, and the coding efficiency of coding information in moving picture coding in which motion estimation and compensation are performed in units of blocks between pictures is improved. Therefore, the code amount can be reduced by using the encoding information of the already encoded block. At that time, the prediction blocks to be obtained as a plurality of merge candidates are registered with priorities added to the merge candidate list, but as described in the present embodiment, the registration order is changed according to the priorities. Or after registering in the default order,
The list may be rearranged according to the priority order, and is included in the invention. For example, the merge candidate list is index 0 with merge candidate A, index 1 with merge candidate B, index 2 with merge candidate Col, index 3 with merge candidate C, index 4 The merge candidates D are once registered at the positions, and then rearranged according to the priority order as necessary. Further, the merge candidate information registered in the merge candidate list may specifically be all the encoding information itself of the merge candidate, or may be a memory pointer or address information to which the merge candidate encoding information can be referred. There may be.

  Still another aspect of the moving picture encoding apparatus of the present invention is as follows.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block A prediction motion vector candidate generation unit that generates a plurality of prediction motion vector candidates by predicting from any of the blocks,
The motion vector predictor candidate generating unit, when registering each motion vector predictor candidate in the motion vector predictor candidate list, changes the priority in units of pictures or slices and registers it in the motion vector predictor candidate list. A video encoding device.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block A prediction motion vector candidate generation unit that generates a plurality of prediction motion vector candidates by predicting from any of the blocks,
The predicted motion vector candidate generation unit is characterized in that when registering each predicted motion vector candidate in the predicted motion vector candidate list, the priority order is changed and registered in the predicted motion vector candidate list in units of blocks. Video encoding device.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block An inter prediction information generation unit that generates a merge candidate that is encoding information including a plurality of inter prediction information from encoding information including inter prediction information of any of the blocks of
The inter-prediction information generating unit, when registering each merge candidate in the prediction merge candidate list, changes the priority in units of pictures or slices and registers the merge candidates in the merge candidate list. apparatus.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block An inter prediction information generation unit that generates a merge candidate that is encoding information including a plurality of inter prediction information from encoding information including inter prediction information of any of the blocks of
The inter prediction information generation unit, when registering each merge candidate in the prediction merge candidate list, changes the priority in block units and registers the merge candidates in the merge candidate list.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block An inter prediction information generation unit that generates a merge candidate that is encoding information including a plurality of inter prediction information from encoding information including inter prediction information of any of the blocks of
When the inter prediction information generation unit registers each merge candidate in the merge candidate list,
An apparatus for encoding a moving picture, wherein when a merge candidate from the spatial direction is inter-predicted by bi-prediction, the priority of the merge candidate from the spatial direction is increased and registered in a merge candidate list.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block An inter prediction information generation unit that generates a merge candidate that is encoding information including a plurality of inter prediction information from encoding information including inter prediction information of any of the blocks of
When the inter prediction information generation unit registers each merge candidate in the merge candidate list,
A moving picture encoding apparatus, wherein a merge candidate having a short distance between an encoding target image and a reference image is registered in a merge candidate list with a higher priority than other merge candidates.

A moving image encoding device that encodes the moving image using motion compensation in blocks obtained by dividing each picture of the moving image,
A coded block adjacent to the coding target block in the same picture as the coding target block, and a coded block at the same or a peripheral position as the coding target block in a picture different from the coding target block A prediction motion vector candidate generation unit that generates a plurality of prediction motion vector candidates by predicting from any of the blocks,
When the prediction motion vector candidate generation unit scans a prediction block in a spatial direction, for each adjacent prediction block of the left adjacent prediction block group and the upper adjacent prediction block group,
1. Whether a motion vector of the same reference frame exists in the same reference list as the encoding mode selected in the prediction block to be encoded,
2. Whether a motion vector of the same reference frame exists in a reference list different from the encoding mode selected in the prediction block to be encoded,
3. 3. whether or not there is a motion vector of a different reference frame in the same reference list as the encoding mode selected in the prediction block to be encoded; Whether a motion vector of a different reference frame exists in a reference list different from the encoding mode selected in the prediction block to be encoded,
A moving picture coding apparatus characterized in that condition determination is performed in the priority order.

In the scan of the prediction block in the spatial direction, when the first condition determination is completed for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block.
A moving picture coding apparatus that performs the same condition determination while sequentially proceeding with the prediction block for each of the third and fourth condition determinations.

In the scan of the prediction block in the spatial direction, when the first and second condition determinations of the four condition determinations are finished for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block. When the third and fourth condition determinations are finished for the first prediction block, the moving picture coding apparatus is configured to sequentially advance to the next prediction block and perform the same condition determination.

In the scan of the prediction block in the spatial direction, among the four condition determinations, when the first condition determination is completed for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block, and then the second When the third and fourth condition determinations are finished for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block.

In the scan of the prediction block in the spatial direction, if none of the four condition determinations is satisfied for the first prediction block, it is determined that there is no motion vector that satisfies the condition in the prediction block, and the adjacent prediction A moving picture encoding apparatus characterized by proceeding sequentially to a block and determining whether or not any of four condition determinations is met.

  Still another aspect of the moving picture decoding apparatus of the present invention is as follows.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
From a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block A prediction motion vector candidate generation unit that predicts and generates a plurality of prediction motion vector candidates;
The motion vector predictor candidate generating unit, when registering each motion vector predictor candidate in the motion vector predictor candidate list, changes the priority in units of pictures or slices and registers it in the motion vector predictor candidate list. A video decoding device.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
From a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block A prediction motion vector candidate generation unit that predicts and generates a plurality of prediction motion vector candidates;
The predicted motion vector candidate generation unit is characterized in that when registering each predicted motion vector candidate in the predicted motion vector candidate list, the priority order is changed and registered in the predicted motion vector candidate list in units of blocks. Video decoding device.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
Any of a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block An inter prediction information generation unit that generates a merge candidate that is encoded information including a plurality of inter prediction information from encoded information including inter prediction information,
The inter-prediction information generating unit, when registering each merge candidate in the prediction merge candidate list, changes the priority in units of pictures or slices and registers the merge candidate list in the merge candidate list .

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
Any of a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a neighboring decoded block in the same or a peripheral position as the decoding target block in a picture different from the decoding target block An inter prediction information generating unit that generates a merge candidate that is encoded information including a plurality of inter prediction information from the encoded information including the inter prediction information;
The inter-prediction information generating unit, when registering each merge candidate in the prediction merge candidate list, changes the priority in block units and registers the merge candidates in the merge candidate list.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
Any of a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block An inter prediction information generation unit that generates a merge candidate that is encoded information including a plurality of inter prediction information from encoded information including inter prediction information,
When the inter prediction information generation unit registers each merge candidate in the merge candidate list,
A moving picture decoding apparatus, wherein when a merge candidate from a spatial direction is inter-predicted by bi-prediction, the priority of the merge candidate from the spatial direction is increased and registered in a merge candidate list.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
Any of a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block An inter prediction information generation unit that generates a merge candidate that is encoded information including a plurality of inter prediction information from encoded information including inter prediction information,
When the inter prediction information generation unit registers each merge candidate in the merge candidate list,
A moving picture decoding apparatus characterized by increasing a priority of a merge candidate having a short distance between an encoding target image and a reference image and registering it in a merge candidate list.

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture using motion compensation in units of blocks obtained by dividing each picture of the moving picture,
From a decoded block adjacent to the decoding target block in the same picture as the decoding target block, and a decoded block at the same or a peripheral position as the decoding target block in a picture different from the decoding target block A prediction motion vector candidate generation unit that predicts and generates a plurality of prediction motion vector candidates;
When the prediction motion vector candidate generation unit scans a prediction block in a spatial direction, for each adjacent prediction block of the left adjacent prediction block group and the upper adjacent prediction block group,
1. Whether a motion vector of the same reference frame exists in the same reference list as the encoding mode selected in the prediction block to be decoded,
2. Whether there is a motion vector of the same reference frame in a reference list different from the encoding mode selected in the prediction block to be decoded,
3. 3. whether there is a motion vector of a different reference frame in the same reference list as the encoding mode selected in the prediction block to be decoded; and Whether a motion vector of a different reference frame exists in a reference list different from the encoding mode selected in the prediction block to be decoded,
A moving picture decoding apparatus characterized in that condition determination is performed in the order of priority.

In the scan of the prediction block in the spatial direction, when the first condition determination is completed for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block.
A moving picture decoding apparatus characterized by performing the same condition determination while sequentially advancing a prediction block for each of the third and fourth condition determinations.

In the scan of the prediction block in the spatial direction, when the first and second condition determinations of the four condition determinations are finished for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block. When the third and fourth condition determinations are finished for the first prediction block, the moving picture decoding apparatus is configured to sequentially advance to the next prediction block and perform the same condition determination.

In the scan of the prediction block in the spatial direction, among the four condition determinations, when the first condition determination is completed for the first prediction block, the same condition determination is performed by sequentially proceeding to the next prediction block, and then the second When the third and fourth condition determinations are finished for the first prediction block, the moving picture decoding apparatus is characterized by sequentially proceeding to the next prediction block and performing the same condition determination.

In the scan of the prediction block in the spatial direction, if none of the four condition determinations is satisfied for the first prediction block, it is determined that there is no motion vector that satisfies the condition in the prediction block, and the adjacent prediction A moving picture decoding apparatus characterized by proceeding sequentially to a block and determining whether or not any of four condition determinations is met.

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

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

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

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

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

DESCRIPTION OF SYMBOLS 101 Image memory, 102 Motion vector detection part, 103 Difference motion vector calculation part, 104 Inter prediction information estimation part, 105 Motion compensation prediction part, 106 Prediction method determination part, 107 Residual signal generation part, 108 Orthogonal transformation and quantization part 109 first encoded bit string generation unit, 110 second encoded bit string generation unit, 111 multiplexing unit, 112 inverse quantization / inverse orthogonal transform unit, 113 decoded image signal superimposing unit, 114 encoded information storage memory, 115 decoded image memory, 120 prediction motion vector candidate generation unit, 121 prediction motion vector registration unit, 122 prediction motion vector candidate identity determination unit,
123 prediction motion vector candidate code amount calculation unit, 124 prediction motion vector selection unit,
125 motion vector subtraction unit, 130 merge candidate generation unit, 131 merge candidate registration unit, 132 merge candidate identity determination unit, 133 encoded information selection unit, 201 separation unit, 202 first encoded bit string decoding unit, 203 second encoding Bit string decoding unit, 20
4 motion vector calculation unit, 205 inter prediction information estimation unit, 206 compensation prediction unit,
207 inverse quantization / inverse orthogonal transform unit, 208 decoded image signal superimposing unit, 209 encoded information storage memory, 210 decoded image memory, 220 prediction motion vector candidate generation unit,
221 predicted motion vector registration unit, 222 predicted motion vector candidate identity determination unit, 2
23 prediction motion vector selection unit, 224 motion vector addition unit, 230 merge candidate generation unit, 231 merge candidate registration unit, 232 merge candidate identity determination unit, 233 encoding information selection unit.

Claims (1)

A moving picture decoding apparatus for decoding a coded bit string obtained by coding the moving picture in block units obtained by dividing each picture of the moving picture,
One or more motion vector predictor candidates are derived from the motion vector of a decoded prediction block adjacent to the current prediction block to be decoded in the same picture as the current prediction block to be decoded, and the predicted motion vector candidate thus derived is predicted motion. A motion vector predictor candidate generation unit to be registered in the vector candidate list;
The motion vector predictor candidate generation unit is configured to derive motion vector predictor motion vectors from among the decoded prediction blocks to obtain motion vector predictor candidates in order to obtain a set number of motion vector predictor candidates. When determining whether to be a motion vector, for each prediction block in a predetermined order for each adjacent block group of the left adjacent block group and the upper adjacent block group,
Condition 1. A motion vector of the same reference picture exists in the same reference list as the reference list of the motion vector predictor to be derived in the prediction block to be decoded,
Condition 2. The motion vector of the same reference picture exists in a reference list different from the reference list of the motion vector predictor to be derived in the prediction block to be decoded,
Condition 3. There are motion vectors of different reference pictures in the same reference list as the reference list of the motion vector predictor to be derived in the decoding target prediction block.
Condition 4. A motion vector of a different reference picture exists in a reference list different from the reference list of the motion vector predictor to be derived in the decoding target prediction block,
First, the conditions 1 and 2 are determined for each prediction block in the priority order of the conditions 1 and 2, and then the conditions 3 and 4 are predicted in the priority order of the conditions 3 and 4. The moving picture decoding apparatus characterized by performing with respect to this.

Images