TW201342930A - Moving-image encoding device, method, program, transmitter, transmission method and program, and moving-image decoding device, method, program, receiver, method and program - Google Patents

Abstract

To realize motion compensation prediction highly efficiently without transmitting an encoded vector. ; SOLUTION: In generating a candidate list, a connection motion information candidate list generating unit 140 selects an encoded prediction block whose motion information including information on a motion vector and information on a reference image is effective from among plural prediction blocks adjacent to a prediction block to be encoded and makes the motion information of the selected encoded prediction block as a selection candidate, and does not make as the selection candidate the motion information of the specific prediction block in the plural prediction blocks adjacent to the prediction block to be encoded on the basis of a division type of the prediction block to be encoded and a position in the encoded block of the prediction block to be encoded. A connection motion information selecting unit 141 determines motion information used for motion compensation prediction of the prediction block to be encoded from the candidate list. A code string generating unit 104 encodes information for specifying the determined motion information in the candidate list.

Description

Motion picture coding device, motion picture coding method, motion picture coding program, transmission device, transmission method and transmission program, and motion picture decoding device, motion picture decoding method, motion picture decoding program, receiving device, and receiving method And receiving program

The present invention relates to a motion picture coding and decoding technique using motion compensation prediction, and more particularly to a motion picture coding and decoding technique for encoding and decoding motion information used in motion compensation prediction.

In general dynamic image compression coding, motion compensation prediction is utilized. The motion compensation prediction divides the target image into small blocks, and uses the decoded image as a reference image to move from the processing target block of the target image to the reference block of the reference image based on the motion amount indicated by the motion vector. The signal of the position is generated as a predictive signal. The motion compensation prediction is performed by one prediction using one motion vector and by two predictions using two motion vectors.

Regarding the motion vector, the motion vector of the coded block adjacent to the processing target block is regarded as a prediction motion vector (also referred to as a "prediction vector", and the difference between the motion vector and the prediction vector of the processing target block is obtained. It is transmitted by using a difference vector as an encoding vector to improve compression efficiency.

In motion picture compression coding such as MPEG-4 AVC/H.264 (hereinafter referred to as MPEG-4 AVC), high-precision motion compensation can be performed by cutting the block size for motion compensation prediction into detailed and diversified. prediction. On the other hand, reducing the block size causes a problem that the code amount of the code vector becomes large.

Therefore, in MPEG-4 AVC, focusing on the continuity of the motion in the time direction, the motion vector owned by the block of the reference image located at the same position as the processing target block is used as the motion vector of the processing target block. The motion compensation prediction that realizes motion compensation prediction without transmitting the coding vector is the direct motion compensation prediction using such time.

Further, in Patent Document 1, it is disclosed that, considering the continuity of the motion in the spatial direction, the motion vector possessed by the processed block adjacent to the processing target block is used as the motion vector of the processing target block. A method of implementing motion compensation prediction without transmitting a coding vector.

[Previous Technical Literature] [Patent Literature]

[Patent Document 1] Japanese Patent Laid-Open No. Hei 10-276439

In the method described in Patent Document 1, when the block size for performing motion compensation prediction is variable, based on the smallest block size, it is suitable for a motion picture such as MPEG-AVC that defines a plurality of block sizes in advance. When compression coding, there is a problem that cannot be directly applied.

The present invention has been developed in view of such circumstances, and an object thereof is to provide a motion picture encoding and decoding technique capable of efficiently performing motion compensation prediction without transmitting an encoding vector.

In order to solve the above problem, a dynamic image coding apparatus according to a certain aspect of the present invention belongs to dividing a coding block into 1 or a complex based on a division type. A motion picture coding apparatus that performs motion compensation prediction by a plurality of prediction blocks to encode a motion picture, and includes a candidate derivation unit (140) that is a complex prediction area adjacent to a prediction block to be coded. In the block, the motion information including the information of the motion vector and the information of the reference image is selected as a valid coded prediction block, and the motion information of the coded prediction block selected by the pre-record is regarded as a selection candidate; The unit (140) is based on the division type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block, and the complex prediction area adjacent to the prediction block of the pre-coded object The motion information of the specific prediction block in the block is not regarded as a pre-selection candidate; the candidate list generation unit (140) generates a candidate list including the pre-selection candidate; and the additional unit (140), which has a predetermined order The motion information of the predetermined motion vector is added to the pre-recorded candidate list as a new selection candidate; and the decision unit (141) determines the pre-record from the pre-recorded candidate list. The motion information used in the motion compensation prediction of the prediction block of the coding target; and the coding unit (104) is used to encode the information required to specify the motion information that has been determined in the pre-recorded candidate list.

Another aspect of the invention is also a motion picture encoding device. The apparatus is a motion picture coding apparatus that performs motion compensation prediction by dividing a coding block into one or a plurality of prediction blocks based on a division type, and is characterized in that it includes a combined motion information candidate list generation unit (140). The motion information of the encoded complex adjacent blocks adjacent to the prediction block of the coding target is regarded as the combined motion information candidate required for the prediction block of the coding target, and is added to the combined motion information candidate list to generate Combination of foreword The motion information candidate list; and the combined motion information candidate ranking unit (162, 168) select a pre-record based on the segmentation type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block. In combination with the specific combined motion information candidate included in the motion information candidate list, the combination of the specific combined motion information candidate in the pre-recording combined with the position in the motion information candidate list; and the combined sports information selection unit (141) are combined with the movement from the foregoing. In the information candidate list, one combined motion information candidate is selected, which is regarded as the motion information of the prediction block of the pre-recorded object; and the coding unit (104) is used to specify the pre-record in the pre-recorded combined motion information candidate list. The index required to combine the motion information candidates is selected and encoded.

Another aspect of the present invention is a motion picture coding method. The method belongs to a motion picture coding method for performing motion compensation prediction to encode a motion picture by dividing a coding block into one or a plurality of prediction blocks based on a division type, and is characterized in that: a candidate extraction step is performed In the complex prediction block adjacent to the prediction block of the coding object, the motion information including the information of the motion vector and the information of the reference image is selected as a valid coded prediction block, and the encoded prediction of the pre-selection is selected. The motion information of the block is regarded as a selection candidate; and the invalidation step is based on the division type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block, and the pre-coded object is The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block is not regarded as a pre-selection candidate; and the candidate list generation step is to generate a candidate list including the pre-selection candidate; and an additional step Will have a pre-defined The motion information of the determined motion vector is added to the pre-recorded candidate list as a new selection candidate; and the decision step is to determine the motion used in the motion compensation prediction of the prediction block of the pre-coded object from the pre-recorded candidate list. The information; and coding steps are used to encode the information required to prioritize the motion information that has been determined in the predecessor list.

Still another aspect of the present invention is a transmitting device. The apparatus includes a packet processing unit that encapsulates a coded stream to obtain coded data by dividing the coded block into one or a plurality of prediction blocks based on the type of division and performing motion. The compensation prediction is encoded by a motion picture coding method for encoding a motion picture; and the transmission unit transmits the coded data before being encapsulated. The pre-recorded video encoding method has a candidate derivation step of selecting a motion information including information of a motion vector and information of a reference image from a plurality of prediction blocks adjacent to a prediction block to be encoded. The coded prediction block is regarded as a selection candidate by the motion information of the coded prediction block selected by the foregoing; and the invalidation step is based on the segmentation type of the prediction block of the preamble coding object and the prediction block of the preamble coding object. In the position in the pre-coded block, the motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and the candidate list generation step is Generating a candidate list including a pre-selection candidate; and adding a step of adding the motion information having the predetermined motion vector as a new selection candidate to the pre-recorded candidate list; and determining the step from the pre-recorded candidate list Determining the motion information used in the motion compensation prediction of the prediction block of the preamble encoding object; and encoding The step is to encode the information required to specify the motion information that has been determined in the pre-recorded candidate list.

Another aspect of the present invention is a method of transmitting. The method includes: a packet processing step of packetizing a coded stream to obtain coded data, wherein the coded stream is divided into one or a plurality of prediction blocks based on a segmentation type to perform motion The compensation prediction is encoded by a motion picture coding method for encoding a motion picture; and the transmission step is to transmit the coded data before being encapsulated. The pre-recorded video encoding method has a candidate derivation step of selecting a motion information including information of a motion vector and information of a reference image from a plurality of prediction blocks adjacent to a prediction block to be encoded. The coded prediction block is regarded as a selection candidate by the motion information of the coded prediction block selected by the foregoing; and the invalidation step is based on the segmentation type of the prediction block of the preamble coding object and the prediction block of the preamble coding object. In the position in the pre-coded block, the motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and the candidate list generation step is Generating a candidate list including a pre-selection candidate; and adding a step of adding the motion information having the predetermined motion vector as a new selection candidate to the pre-recorded candidate list; and determining the step from the pre-recorded candidate list Determining the motion information used in the motion compensation prediction of the prediction block of the preamble encoding object; and the encoding step, The former will be used to record the information required record has been decided before the candidate list of the specific motion information to be encoded.

A dynamic image decoding device of a certain aspect of the present invention is based on A motion picture decoding device that divides a decoding block into one or a plurality of prediction blocks and performs motion compensation prediction, and decodes the encoded stream of the motion picture, and includes a candidate derivation unit (230). Selecting, from the complex prediction block adjacent to the prediction block of the decoding target, the motion information including the information of the motion vector and the information of the reference image is a valid decoded prediction block, and the previously selected decoding is decoded. The motion information of the prediction block is regarded as a selection candidate; and the invalidation unit (230) is based on the division type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block. The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decode target is not regarded as a pre-selection candidate; and the candidate list generation unit (230) generates a candidate with a pre-selection candidate. a candidate list; and an additional unit (230) that adds the motion information having the predetermined motion vector as a new selection candidate to the predecessor list; and The code string analysis unit (201) decodes the information indicating the position in the predecessor list, and the selection unit (231) selects the pre-record from the pre-record list based on the information indicating the position before decoding. The motion information used in the motion compensation prediction of the prediction block of the decoding object.

Another aspect of the present invention is also a motion picture decoding device. The apparatus is a motion picture decoding apparatus that performs motion compensation prediction by dividing a decoding block into one or a plurality of prediction blocks based on a division type, and is characterized in that it includes a decoding unit (201) for combining a coding column in which a sequence required for combining motion information candidates is encoded in a motion information candidate list, and a pre-recorded index is decoded; and a motion information candidate list is combined The generating unit (230) is configured to add the motion information of the decoded complex adjacent blocks adjacent to the prediction block to be decoded to the combined motion information candidate required for the prediction block to be decoded, and to add Combining the motion information candidate list, generating a pre-recorded motion information candidate list; and combining the motion information candidate sorting unit (162, 168), based on the segmentation type of the prediction block of the pre-decoded object and the prediction block of the pre-decoded object in the pre-decoding The location within the block is selected from the combination of the specific combined motion information candidates included in the motion information candidate list, and the specific combined motion information candidate in the pre-recording combined with the position in the motion information candidate list; and the combined motion information selection unit (231), based on the pre-recorded index, one combined motion information candidate is selected from the pre-combined motion information candidate list, and is regarded as motion information of the prediction block of the pre-recording target.

Another aspect of the present invention is a motion picture decoding method. The method belongs to a dynamic image decoding method for performing motion compensation prediction by dividing a decoding block into one or a plurality of prediction blocks based on a division type, and decoding the encoded stream of the motion image, and is characterized in that: The step of selecting, from the complex prediction block adjacent to the prediction block of the decoding target, the motion information including the information of the motion vector and the information of the reference image is a valid decoded prediction block, and selecting the pre-recording block The motion information of the decoded prediction block is regarded as a selection candidate; and the invalidation step is based on the division type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block. The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decoded object is not regarded as a pre-selection candidate; and the candidate list generation step, a candidate list including a pre-selection candidate; and an appending step of adding a motion information having a predetermined motion vector as a new selection candidate to the pre-pick list; and a coding column parsing step, The information of the position in the candidate list is decoded, and the selection step is based on the information of the position indicated before decoding, and the motion used in the motion compensation prediction of the prediction block of the pre-decoded object is selected from the pre-recorded list. News.

Another aspect of the invention is a receiving device. The device belongs to a receiving device that divides a decoding block into one or a plurality of prediction blocks and performs motion compensation prediction for decoding processing in the encoded stream of the received moving image, and is characterized in that: The receiving unit is a coded data obtained by packetizing a coded stream of a moving image encoded by motion compensation prediction by dividing a coded block into one or a plurality of prediction blocks based on a division type. And a restoring unit that performs packet processing on the received preamble encoded data to restore the original encoded stream; and the candidate deriving unit (230) is a plural number adjacent to the predicted block of the decoding target In the prediction block, the motion information including the information of the motion vector and the information of the reference image is selected as a valid decoded prediction block, and the motion information of the decoded prediction block selected by the pre-record is regarded as a selection candidate; And the invalidation unit (230), based on the division type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block, the pre-decode pair Motion prediction information of a plurality of prediction blocks within a particular block of the prediction block adjacent thereto, is not considered before selecting candidate referred to; and the candidate list generating unit (230), comprising prior to generating a note based candidate selection a candidate list; and an additional unit (230) that adds motion information having a predetermined motion vector as a new selection candidate to the predecessor list; and the code column analysis unit (201) is restored The encoded stream decodes the information indicating the position in the pre-recorded list; and the selecting unit (231) selects the predicted block of the pre-decoded object from the pre-recorded list based on the information indicating the position before decoding. The motion information used in the motion compensation prediction.

Another aspect of the present invention is a receiving method. The method belongs to a receiving method for dividing a decoding block into one or a plurality of prediction blocks and performing motion compensation prediction for decoding processing in the encoded stream of the received moving image, and is characterized in that: The receiving step is to encode the encoded stream of the moving image encoded by the motion compensation prediction by dividing the coding block into one or a plurality of prediction blocks based on the division type, and And the recovering step is: performing packet processing on the received pre-coded data to recover the original encoded stream; and the candidate deriving step is from the complex predictive block adjacent to the predicted block of the decoding target The motion information including the information of the motion vector and the information of the reference image is selected as a valid decoded prediction block, and the motion information of the decoded prediction block selected by the pre-record is regarded as a selection candidate; and invalidation The step is to decode the preamble based on the partition type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block. Motion prediction information such as the prediction block within a particular block of a plurality of the adjacent prediction block is not considered before selecting candidate referred to; and a candidate list generating step of generating a candidate list containing system prior to remember to select candidate; and recovery In the adding step, the motion information having the predetermined motion vector specified in advance is added to the pre-recorded candidate list as a new selection candidate; and the coding column analysis step is performed from the reconstructed encoded stream, and the decoded representation is recorded in the pre-recorded The information of the position in the candidate list; and the selecting step is to select the motion information used in the motion compensation prediction of the prediction block of the pre-decoded object from the previous candidate list based on the information indicating the position before decoding.

Further, even if any combination of the above constituent elements and the expression of the present invention are converted between a method, an apparatus, a system, a recording medium, a computer program, etc., it is effective for the aspect of the present invention.

According to the present invention, motion compensation prediction can be efficiently performed without transmitting an encoding vector.

First, the technique proposed as an embodiment of the present invention will be described.

At present, devices and systems based on encoding methods such as MPEG (Moving Picture Experts Group) have become widespread. In this type of coding, a continuous plurality of images on the time axis are treated as information of digital signals. In this case, for the purpose of efficient information transmission, transmission, or accumulation, the video is divided into complex blocks, and the motion compensation prediction using the verbosity of the time direction and the discrete cosine transform using the redundancy of the spatial direction are used. This type of orthogonal conversion is compression-encoded.

In 2003, the Joint Technical Committee (ISO/IEC) of the International Organization for Standardization (ISO) and the International Conference on Electrical Standards (IEC), and the International Telecommunications Standardization Sector (ITU-T), An encoding method called MPEG-4 AVC/H.264 (referred to as 14496-10 in ISO/IEC, and a standard number numbered H.264 in ITU-T. Hereinafter referred to as MPEG-4 AVC) is Formulated to become an international standard. In MPEG-4 AVC, basically, the median value of the motion vector of the complex adjacent block of the processing target block is regarded as a prediction vector. When the prediction block size is not a square and the reference index of the specific adjacent block of the processing target block coincides with the reference index of the processing target block, the motion vector of the specific adjacent block is regarded as a prediction. vector.

Currently, the Joint Technical Committee (ISO/IEC) of the International Organization for Standardization (ISO) and the International Conference on Electrical Standards (IEC), and the International Telecommunications Standardization Sector (ITU-T), a joint operation, called HEVC The standardization of coding methods is under discussion.

In the standardization of HEVC, it is studied that a plurality of adjacent blocks and a block of another decoded image are regarded as candidate block groups, and one candidate block is selected from the candidate block groups, and The merge mode in which the information of the candidate block is selected for encoding and decoding.

[Embodiment 1] (code block)

In the present embodiment, the image signal that has been input is divided into maximum coding block units, and the largest coded block that has been divided is processed in a line-by-line scanning order. The coding block exhibits a hierarchical structure, and is equally divided into four in order to consider coding efficiency and the like, thereby becoming a smaller coding block. In addition, the coded block that has been divided by 4 is scanned by zigzag. (Zig Zag Scan) is encoded in order. It is impossible to become a smaller coding block, called a minimum coding block. The coding block is a coding unit, and the maximum coding block is also regarded as a coding block if the number of divisions is zero. In the present embodiment, it is assumed that the maximum coding block is 64 pixels × 64 pixels, and the minimum coding block is 8 pixels × 8 pixels.

1(a) and 1(b) are explanatory diagrams of coding blocks. In the example of Fig. 1(a), the coding block is divided into ten. CU0, CU1 and CU9 are 32-pixel×32-pixel coding blocks, CU2, CU3 and CU8 are 16-pixel×16-pixel coding blocks, and CU4, CU5, CU6 and CU7 are 8 pixels×8 pixels. Encoding block. In the example of Fig. 1(b), the coding block is divided into one.

(predicted block)

In this embodiment, the coding block is further divided into prediction blocks. The coding block is divided into one or more prediction blocks by predicting the block size type (also referred to as "segmentation type"). 2(a) to (d) are explanatory diagrams of predicted block size types. 2(a) shows 2N×2N of the undivided coded block, FIG. 2(b) shows 2N×N of horizontal 2 division, and FIG. 2(c) shows N×2N of vertical 2 division, and FIG. 2 (d) is N x N which is divided into horizontal and vertical divisions. 2N×2N is formed by one prediction block 0, 2N×N and N×2N are formed by two prediction blocks 0 and prediction block 1, and N×N is composed of four prediction blocks. , prediction block 1, prediction block 2, prediction block 3 are formed.

Figure 3 is the result of the number of divisions of the coding block and the type of the prediction block size. An explanatory diagram of the predicted block size. In the prediction block size in this embodiment, there are 64 pixels × 64 pixels whose number of divisions from the CU is 0 and the prediction block size type is 2N × 2N, and the number of CU divisions is 3 and the prediction block size type N × 13 prediction block sizes up to 4 pixels × 4 pixels of N.

In the present embodiment, although the maximum coding block is assumed to be 64 pixels × 64 pixels, and the minimum coding block is 8 pixels × 8 pixels, it is not limited to this combination. In addition, although the division mode of the prediction block is shown in FIGS. 2(a) to 2(d), it is not limited thereto as long as it is divided into one or more combinations.

(predictive coding mode)

In this embodiment, the motion compensation prediction or the number of coding vectors can be switched for each block of the prediction block. Here, an example of a predictive coding mode in which the motion compensation prediction is associated with the number of coding vectors is briefly described using FIG. 4 is an explanatory diagram of a prediction encoding mode.

In the prediction coding mode shown in FIG. 4, the prediction direction of the motion compensation prediction is single prediction (L0 prediction) and the number of coding vectors is 1 for PredL0, and the prediction direction for motion compensation prediction is single prediction (L1 prediction) and coding. PredL1 with vector number 1 and prediction direction for motion compensation prediction are double prediction (BI prediction) and PredBI with coding vector number 2, and the prediction direction of motion compensation prediction is single prediction (L0 prediction/L1 prediction) or double prediction ( BI prediction) and the merge mode (MERGE) where the number of coding vectors is zero. Also, there is a predictive coding mode that does not implement motion compensation prediction. The mode is also the intra mode (Intra). Here, PredL0, PredL1, and PredBI are prediction vector modes.

In the merge mode, the prediction direction may be any of L0 prediction/L1 prediction/BI prediction, but this is because the prediction direction of the merge mode is the direct inheritance of the prediction of the candidate block selected from the candidate block group. Direction, or the reason derived from the decoded information. Also, in the merge mode, the code vector is not encoded. This is because the coding vector of the merge mode directly inherits the motion vector of the candidate block selected from the candidate block group or is derived from the decoded information.

(reference index)

In the present embodiment, in order to improve the accuracy of the motion compensation prediction, an optimum reference image can be selected from the plurality of reference images during motion compensation prediction. Therefore, the reference image used in the motion compensation prediction is taken as a reference image index and encoded together with the code vector. The reference image index used for motion compensation prediction is a value of 0 or more. If the motion compensation prediction is a single prediction, one reference index is used, and if the motion compensation prediction is double prediction, two reference indices are used (Fig. 4).

In merge mode, the reference index is not encoded. This is because the reference index of the merge mode directly inherits the reference index of the candidate block selected from the candidate block group or is derived from the decoded information.

(refer to the index list)

In the present embodiment, the reference video that can be used in the motion compensation prediction is registered in the reference index list in advance, and the reference image that has been registered in the reference index list is indicated by the reference index, and the reference image can be determined. It is used in the prediction of motion compensation. In the reference index list, there is a reference index list L0 and a reference index list L1. When the motion compensation prediction is a single prediction, either the L0 prediction using the reference image in the reference index list L0 or the L1 prediction using the reference image in the reference index list L1 is used. The double prediction time is utilized, and the BI prediction of the reference index list L0 and the reference index list L1 is utilized. The maximum number of reference images that can be registered in each reference index list is 16.

(consolidated index)

In the present embodiment, in the merge mode, the plurality of adjacent blocks in the image to be processed and the blocks in the other image that are encoded in the same position as the processing target block are regarded as candidate regions. The block group selects a candidate block having the best prediction coding mode, motion vector, and reference index from among the candidate block groups, and uses the combined index of the selected candidate block to encode and decode. Only one merge index is used in the merge mode (Figure 4). The maximum number of merged indexes (also known as the maximum number of merge candidates) is 5, and the combined index is an integer from 0 to 4. Here, although the maximum number of merged indexes is set to 5, it is only required to be 2 or more, and is not limited thereto.

In the future, the motion information of the candidate block of the object to be merged will be called The combined motion information candidate is referred to as a combined motion information candidate list. Hereinafter, the motion information includes a prediction direction, a motion vector, and a reference index.

In addition, the relationship between the merge index and the code column is illustrated using a graph. Figure 5 is an explanatory diagram of the relationship between a merged index and a coded column. The coded column with the merge index of 0 is '0', the coded column with the merge index of 1 is '10', the coded column with the merge index of 2 is '110', and the coded column with the merge index of 3 The code column is '1110', and the code column when the merge index is 4 is '11110'. The larger the merge index, the longer the code column is set. Therefore, coding efficiency can be improved by assigning a smaller merge index to candidate blocks with a high selectivity.

(predictive vector index)

In the present embodiment, in order to improve the accuracy of the prediction vector, a plurality of adjacent blocks and another block of the encoded other image located at the same position as the processing target block are regarded as candidate block groups, and candidates are candidates. The block group selects the candidate block having the best motion vector as the prediction vector, and uses the prediction vector index used to represent the selected candidate block to be encoded and decoded. If the motion compensation prediction is a single prediction, the prediction vector index is used one. If the motion compensation prediction is bi-prediction, two prediction vector indexes are used (Fig. 4). The maximum number of prediction vector indices (also referred to as the maximum number of prediction vector candidates) is 2, and the prediction vector index is an integer of 0 or 1. Here, although the maximum number of prediction vector candidates is set to 2, it is only required to be 2 or more, and is not limited thereto.

Hereinafter, the motion vector of the candidate block of the target of the prediction vector index is referred to as a prediction vector candidate, and the aggregate of the prediction vector candidates is referred to as a prediction vector candidate list.

(grammar)

An example of the syntax of the prediction block described in the present embodiment will be described with reference to FIG. 6. Whether the prediction block is intra-picture or inter-picture is specified by the upper coding block, and FIG. 6 illustrates the syntax of the prediction block when the prediction block is between pictures. Also, the prediction block size type is also specified by the coding block.

In the prediction block (PU of FIG. 6), a merge flag (merge_flag), a merge index (merge_idx), an inter-picture prediction type (inter_pred_type), a L0 prediction reference index (ref_idx_l0), and a L0 predicted difference vector are configured. (mvd_l0[0], mvd_l0[1]), L0 predicted prediction vector index (mvp_idx_l0), L1 predicted reference index (ref_idx_l1), L1 predicted difference vector (mvd_l1[0], mvd_l1[1]), and L1 The predicted prediction vector index (mvp_idx_l1). The [0] of the difference vector represents a horizontal component, and [1] represents a vertical component.

Here, inter_pred_type indicates the prediction direction of motion compensation prediction (also called inter-picture prediction type), which is Pred_L0 (single prediction of L0 prediction), Pred_L1 (single prediction of L1 prediction), and Pred_BI (bi prediction of BI prediction). These 3 categories. When inter_pred_type is Pred_L0 or Pred_BI, it is set with information about L0 prediction. When inter_pred_type is Pred_L1 or Pred_BI, information about L1 prediction is set.

Further, although the syntax of the prediction block described in the present embodiment is set as shown in FIG. 6, it is not limited thereto.

The details of the motion picture coding apparatus, the motion picture coding method, the motion picture coding program, and the motion picture decoding apparatus, the motion picture decoding method, and the motion picture decoding program according to the preferred embodiment of the present invention will be described below with reference to the drawings. In the description of the drawings, the same reference numerals will be given to the same elements, and overlapping description will be omitted.

(Configuration of Motion Picture Coding Apparatus 100)

FIG. 7 is a view showing the configuration of the motion picture coding apparatus 100 according to the first embodiment. The motion picture coding apparatus 100 is a apparatus for coding a motion picture signal by performing prediction unit blocks of motion compensation prediction. The division of the coding block, the determination of the prediction block size type, the prediction of the block size, the determination of the position of the prediction block in the coding block (the position information of the prediction block), and whether the prediction coding mode is a decision within the picture, This is determined by a higher-level coding control unit (not shown). In the first embodiment, the case where the prediction coding mode is not in the picture will be described. Further, in the first embodiment, the B image corresponding to the bi-prediction is described. However, for the P image that is not corresponding to the bi-prediction, the L1 prediction may be omitted.

The motion image coding device 100 is realized by a hardware such as an information processing device including a CPU (Central Processing Unit), a frame memory, and a hard disk. The motion picture coding apparatus 100 is constructed by the above Actuate the elements to achieve the functional components described below. Further, the position information of the prediction block to be processed, the prediction block size, and the prediction direction of the motion compensation prediction are shared in the motion picture coding apparatus 100, and are not shown.

The motion picture coding apparatus 100 according to the first embodiment includes a prediction block video acquisition unit 101, a subtraction unit 102, a prediction error coding unit 103, a code sequence generation unit 104, a prediction error decoding unit 105, a motion compensation unit 106, and an addition unit 107. The motion vector detecting unit 108, the motion information generating unit 109, the frame memory 110, and the motion information memory 111.

(Function and action of motion picture coding device 100)

Hereinafter, the functions and operations of the respective units will be described. The prediction block image acquisition unit 101 acquires the video signal of the prediction block to be processed from the video signal supplied from the terminal 10 based on the position information of the prediction block and the prediction block size, and predicts the video signal of the block. It is supplied to the subtraction unit 102, the motion vector detecting unit 108, and the motion information generating unit 109.

The motion vector detecting unit 108 detects the motion vector and the reference vector of the L0 prediction and the L1 prediction from the video signal supplied from the prediction block image acquisition unit 101 and the video signal corresponding to the complex reference image stored therein. The reference image index of the image. The motion vector of the L0 prediction and the L1 prediction, and the reference index of the L0 prediction and the L1 prediction are supplied to the motion information generating unit 109. Here, although the motion vector detecting unit 108 uses the image signal corresponding to the plurality of reference images stored therein as the reference image, the reference image stored in the frame memory 110 may be used. image.

The general motion vector detection method is to calculate an error evaluation value for a prediction signal of a reference image that has been moved by a predetermined amount of movement from the same position as the image signal of the target image, and to minimize the error evaluation value. Make a motion vector. When the reference image is a complex number, a motion vector is detected for each reference image, and the reference image having the smallest error evaluation value is selected. As the error evaluation value, an SAD (Sum of Absolute Difference) indicating an absolute difference sum or an MSE (Mean Square Error) indicating a squared error average or the like can be used. Alternatively, the motion vector coding amount may be added to the error evaluation value for evaluation.

The motion information generating unit 109 is a reference index based on the L0 prediction and the L1 prediction and the L0 prediction and L1 prediction referenced by the motion vector detecting unit 108, and the candidate block group and the reference index supplied from the motion information memory 111. The reference video in the illustrated tile memory 110 and the video signal supplied from the predicted tile image acquisition unit 101 determine the prediction coding mode.

Based on the predicted prediction coding mode, the combined flag, the combined index, the prediction direction of the motion compensation prediction, the reference index of the L0 prediction and the L1 prediction, the difference vector of the L0 prediction and the L1 prediction, and the prediction of the L0 prediction and the L1 prediction The vector index is supplied to the code column generating unit 104 as needed. The prediction direction of the motion compensation prediction, the reference index of the L0 prediction and the L1 prediction, and the motion vector of the L0 prediction and the L1 prediction are supplied to the motion compensation unit 106 and the motion information memory 111. The details of the motion information generating unit 109 will be described later.

When the prediction direction of the motion compensation prediction supplied from the motion information generating unit 109 is the LN prediction, the motion compensation unit 106 sets the intra-frame memory 110 indicated by the reference index of the LN prediction supplied from the motion information generating unit 109. The reference image is subjected to motion compensation based on the motion vector of the LN prediction supplied from the motion information generating unit 109, and a prediction signal of the LN prediction is generated. The N system is 0 or 1. Here, if the prediction direction of the motion compensation prediction is bi-prediction, the average value of the prediction signals of the L0 prediction and the L1 prediction becomes a prediction signal. In addition, the L0 prediction and the prediction signal of the L1 prediction can also be weighted. The motion compensation unit 106 supplies the prediction signal to the subtraction unit 102.

The subtraction unit 102 subtracts the video signal supplied from the predicted block video acquisition unit 101 and the prediction signal supplied from the motion compensation unit 106 to calculate a prediction error signal, and supplies the prediction error signal to the prediction error coding unit 103. .

The prediction error coding unit 103 performs processing such as orthogonal conversion or quantization on the prediction error signal supplied from the subtraction unit 102 to generate prediction error coded data, and supplies the prediction error coded data to the code column generation unit 104 and the prediction error. Decoding unit 105.

The coded column generation unit 104 is a prediction error coded data supplied from the prediction error coding unit 103, and a prediction direction (inter-picture prediction type) of the combined flag, the combined index, and the motion compensation prediction supplied from the motion information generation unit 109, The L0 prediction and the reference index of the L1 prediction, the difference vector of the L0 prediction and the L1 prediction, and the prediction vector index of the L0 prediction and the L1 prediction are entropy encoded in the order of the syntax shown in FIG. 6 to generate the coding. The column supplies the code column to the terminal 11. Entropy coding is implemented by a method including variable length coding such as arithmetic coding or Huffman coding.

The prediction error decoding unit 105 performs processing such as inverse quantization or inverse orthogonal conversion on the prediction error coded data supplied from the prediction error coding unit 103 to generate a prediction error signal, and supplies the prediction error signal to the addition unit 107. The adding unit 107 adds the prediction error signal supplied from the prediction error decoding unit 105 and the prediction signal supplied from the motion compensation unit 106 to generate a decoded video signal, and supplies the decoded video signal to the frame memory 110. .

The frame memory 110 stores the decoded video signal supplied from the adding unit 107. Further, the decoded image in which the decoding of the entire image has been completed is regarded as a reference image, and the number of predetermined images of one or more is memorized. The frame memory 110 supplies the stored reference image signal to the motion compensation unit 106 and the motion information generating unit 109. The memory area of the memory reference image is controlled by the FIFO (First In First Out) method.

The motion information memory 111 stores the motion information supplied from the motion information generating unit 109 in a minimum prediction block size unit and memorizes the predetermined number of images. The motion information of the adjacent blocks of the prediction block of the processing object is regarded as a space candidate block group.

Further, the motion information memory 111 regards the motion information of the block on the ColPic and the peripheral block at the same position as the prediction block of the processing target as the time candidate block group. The motion information memory 111 supplies the space candidate block group and the time candidate block group to the motion information generating unit 109 as a candidate block group. Sports information memory 111, system and frame The memory 110 is synchronized and controlled in a FIFO (First In First Out) manner.

Here, the term "ColPic" refers to another decoded image that is different from the prediction block of the processing target, and is stored as a reference image in the frame memory 110. In the first embodiment, the ColPic is the previous decoded reference image of the processing target image. Further, in the first embodiment, the ColPic system is the previous decoded reference image of the processing target image, but may be the decoded image, for example, the previous reference image or the display order in the display order. The last reference image can also be specified in the encoded stream.

Here, a method of managing motion information in the motion information memory 111 will be described. The motion information is memorized in each memory area in units of minimum prediction blocks. At least the prediction direction, the motion vector of the L0 prediction, the reference index of the L0 prediction, the motion vector of the L1 prediction, and the reference index of the L1 prediction are stored in each memory area.

Further, when the prediction coding mode is the intra-picture mode, the motion vector as the L0 prediction and the L1 prediction is stored (0, 0), and the reference index as the L0 prediction and the L1 prediction is "-1". Hereinafter, the motion vector (H, V) is such that H is a horizontal component and V is a vertical component. Further, the "-1" of the reference index may be any value as long as it can be determined that the motion compensation prediction is not performed. In the following description, when it is simply expressed as a block, if it is not specifically stated, it represents the smallest prediction block unit. Moreover, even in the case of a block outside the field, the motion direction of the L0 prediction and the L1 prediction is the same as the intra-picture mode. The quantity is memorized (0,0), and the reference index of the L0 prediction and the L1 prediction is "-1". When the LX direction (X is 0 or 1) is valid, the reference index in the LX direction is 0 or more, and if the LX direction is invalid (not valid), the reference index in the LX direction is "-1". Further, the term "outside the field" refers to a field other than the image to which the prediction block of the object is to be processed or a field other than the slice.

(Configuration of the motion information generating unit 109)

Next, the detailed configuration of the motion information generating unit 109 will be described. FIG. 8 is a diagram showing the configuration of the motion information generating unit 109. The motion information generating unit 109 includes a prediction vector mode determining unit 120, a merge mode determining unit 121, and a predictive encoding mode determining unit 122. The terminal 12 is connected to the motion information memory 111, the terminal 13 is connected to the motion vector detecting unit 108, the terminal 14 is connected to the frame memory 110, the terminal 15 is connected to the predicted block image obtaining unit 101, and the terminal 16 is connected. The terminal 50 is connected to the code column generating unit 104, the terminal 50 is connected to the motion compensating unit 106, and the terminal 51 is connected to the motion information memory 111.

(Function and action of the motion information generating unit 109)

Hereinafter, the functions and operations of the respective units will be described. The prediction vector mode determination unit 120 is based on the candidate vector group supplied from the terminal 12, the L0 prediction and the L1 prediction motion vector supplied by the terminal 13, the reference index of the L0 prediction and the L1 prediction, and the reference index supplied from the terminal 14. The reference image and the image signal supplied from the terminal 15 are used to determine the inter-picture prediction class. For the type, the difference vector between the L0 prediction and the L1 prediction is calculated by selecting the prediction vector index of the L0 prediction and the L1 prediction, and the prediction error is calculated, and the bit rate distortion evaluation value is calculated. Then, the motion information, the difference vector, the prediction vector index, and the bit rate distortion evaluation value based on the inter-picture prediction type are supplied to the predictive coding mode determining unit 122.

The merge mode determining unit 121 generates a combined motion information candidate list based on the candidate block group supplied from the terminal 12, the reference image supplied from the terminal 14, and the video signal supplied from the terminal 15, and the combined motion information candidate list is selected from the combined motion information candidate list. Among them, one combined motion information candidate is selected and the combined index is determined, and the bit rate distortion evaluation value is calculated. Then, the motion information combined with the motion information candidate, the combined index, and the bit rate distortion evaluation value are supplied to the predictive coding mode determining unit 122. Details of the merge mode determining unit 121 will be described later.

The prediction coding mode determination unit 122 compares the bit rate distortion evaluation value supplied from the prediction vector mode determination unit 120 with the bit rate distortion evaluation value supplied from the merge mode determination unit 121, and then determines the merge flag.

If the prediction vector mode bit rate distortion evaluation value is less than the merge mode bit rate distortion evaluation value, the merge flag is set to "0". The prediction coding mode determining unit 122 supplies the inter-picture prediction type, the reference index, the difference vector, and the prediction vector index supplied from the merge flag and prediction vector mode determining unit 120 to the terminal 16, and the prediction vector mode determining unit 120 The supplied motion information is supplied to the terminal 50 and the terminal 51.

If the merge mode bit rate distortion evaluation value is the prediction vector mode bit rate Below the distortion evaluation value, the merge flag is set to "1". The prediction encoding mode determining unit 122 supplies the combined index supplied from the merge flag and the merge mode determining unit 121 to the terminal 16, and supplies the motion information supplied from the merge mode determining unit 121 to the terminal 50 and the terminal 51. In addition, the specific calculation method of the bit rate distortion evaluation value is not the focus of the present invention, and thus detailed description is omitted. However, the prediction error amount for each code amount is calculated from the prediction error and the code amount, and the bit rate distortion evaluation value is smaller. Then, the evaluation value with the characteristics of higher coding efficiency. Therefore, by selecting a predictive coding mode with a small bit rate distortion evaluation value, the coding efficiency can be improved.

(Configuration of the merge mode determining unit 121)

Next, the detailed configuration of the merge mode determining unit 121 will be described. FIG. 9 is a diagram for explaining the configuration of the merge mode determining unit 121. The merge mode determination unit 121 includes a combined motion information candidate list generation unit 140 and a combined motion information selection unit 141. The motion information candidate list generating unit 140 is also provided similarly to the motion picture decoding device 200 that decodes the code sequence generated by the motion picture coding device 100 according to the first embodiment, and the motion picture coding apparatus 100 and the dynamic picture coding apparatus 100 The same combined motion information list is generated in the video decoding device 200.

(Function and action of the merge mode determining unit 121)

Hereinafter, the functions and operations of the respective units will be described. The combined motion information candidate list generating unit 140 generates combined motion information including combined motion information candidates having the maximum number of combined candidates based on the candidate block group supplied from the terminal 12. The candidate list is supplied to the combined exercise information selection unit 141 in conjunction with the exercise information candidate list. The detailed configuration of the combined motion information candidate list generating unit 140 will be described later.

The combined motion information selection unit 141 selects the best combined motion information candidate from the combined motion information candidate list supplied from the combined motion information candidate list generating unit 140, and determines the information indicating the combined combined motion information candidate. That is, the index is merged, and the merge index is supplied to the terminal 17.

Here, the selection method of the optimal combined motion information candidate will be described. The prediction error amount is calculated based on the reference image supplied from the terminal 14 and the video signal supplied from the terminal 15 obtained by the motion compensation prediction based on the prediction direction, the motion vector, and the reference index of the motion information candidate. The combination of the coding amount of the combined index and the prediction error amount to calculate the bit rate distortion evaluation value, and the bit rate distortion evaluation value which is the smallest combined motion information candidate is selected as the best combined motion information candidate.

(Supply block group supplied to the combined motion information candidate list generating unit 140)

Next, the candidate block group supplied to the combined motion information candidate list generating unit 140 will be described with reference to FIGS. 10 and 11 . The candidate block group includes a space candidate block group and a time candidate block group.

FIG. 10 is a diagram showing adjacent blocks of a prediction block of a processing target when a prediction block size of a processing object is 16 pixels×16 pixels. In the first embodiment, the space candidate block group is assumed to be the block shown in FIG. A block of block A1, block C, block D, block B1 and block E. Although the space candidate block group is assumed to be five blocks of block A1, block C, block D, block B1, and block E, the space candidate block group is adjacent to the processing. At least one or more processed blocks of the prediction block of the object may be used, and are not limited thereto. For example, block A1, block A2, block A3, block A4, block B1, block B2, block B3, block B4, block C, block D, and block E can all be considered as spaces. Alternate block.

Next, the time candidate block group will be described using FIG. 11 is a block diagram showing a block in a prediction block on a ColPic located at the same position as a prediction block of a processing target when the prediction block size of the processing object is 16 pixels×16 pixels, and a peripheral block thereof. In the first embodiment, the time candidate block group is assumed to be two blocks of the block H and the block I6 shown in FIG. Although the time candidate block group is assumed to be the two blocks of the block H and the block I6 on the ColPic, the time candidate block group is only another one that is different from the predicted block of the processing target. It is sufficient to decode at least one or more blocks on the image, and is not limited thereto. For example, there may be only block H. Thereafter, block A4 is represented as block A, block B4 is represented as block B, block I6 is represented as block I, and block H and block I6 are represented as time blocks.

(Combination of the motion information candidate list generating unit 140)

Next, the detailed configuration of the motion information candidate list generating unit 140 will be described. FIG. 12 is a combination of the motion information candidate list generating unit 140. Illustration of the diagram. The terminal 19 is connected to the combined motion information selection section 141. The combined motion information candidate list generating unit 140 includes a spatial combined motion information candidate generating unit 160, a temporal combined motion information candidate generating unit 161, an implicit combined motion information candidate sorting unit 162, a redundant combined motion information candidate deleting unit 163, and a first The motion information candidate supplementing unit 164 and the second combined motion information candidate complementing unit 165 are combined.

(Combination of functions and actions of the motion information candidate list generating unit 140)

Hereinafter, the functions and operations of the respective units will be described. FIG. 13 is a flowchart for explaining the operation of the combined motion information candidate list generating unit 140. First, the combined motion information candidate list generating unit 140 initializes the combined motion information candidate list (S100). There is no combined motion information candidate in the list of combined sports information candidates that has been initialized.

Next, the spatial combined motion information candidate generation unit 160 generates a spatial combined motion information candidate based on the candidate block group supplied from the terminal 12, and adds it to the combined motion information candidate list (S101), and combines the motion information candidate list and the candidate. The block group is supplied to the time combined motion information candidate generation unit 161. The detailed operation of the space combined motion information candidate generation unit 160 will be described later.

Then, the time-integrated motion information candidate generation unit 161 generates a time-combined motion information candidate based on the candidate block group supplied from the space-combined motion information candidate generation unit 160, and adds the combination to the space-combined motion information candidate generation unit 160. a motion information candidate list (S102), which is combined with the motion information candidate list to the implicit combined motion information The candidate sorting unit 162. The detailed operation of the time combined motion information candidate generation unit 161 will be described later.

Then, the implicit combined motion information candidate ranking unit 162 changes the order in the combined motion information candidate list for the implicit combined motion information candidate registered in the combined motion information candidate list supplied from the time combined motion information candidate generating unit 161. (S103), the combined motion information candidate list is supplied to the redundant combined motion information candidate deletion unit 163. The detailed operation of the implicit combined motion information candidate ranking unit 162 will be described later. Further, the details of the implicit combined motion information candidate will be described later.

Then, the redundant combined motion information candidate deleting unit 163 checks the combined motion information candidate registered in the combined motion information candidate list supplied from the implicit combined motion information candidate sorting unit 162, and the combined motion information candidate having the same motion information. When there is a plurality of combined motion information candidates, the other combined motion information candidates are deleted (S104), and the combined motion information candidate list is supplied to the first combined motion information candidate supplementing unit 164. Therefore, the combined motion information candidates registered in the combined motion information candidate list are all combined motion information candidates.

Then, the first combined motion information candidate supplementing unit 164 generates the first supplementary combined motion information candidate based on the combined motion information candidate registered in the combined motion information candidate list supplied from the redundant combined motion information candidate deleting unit 163, and then adds the first supplementary combined motion information candidate. In the combined motion information candidate list (S105), the combined motion information candidate list is supplied to the second combined motion information candidate complementing unit 165. The first combined sports information candidate supplement The detailed operation of the unit 164 will be described later.

Then, the second combined motion information candidate supplementing unit 165 generates a second supplementary combined motion information candidate that does not depend on the combined motion information candidate list supplied from the first combined motion information candidate supplementing unit 164, and then adds the first combined motion information candidate to the first combined motion. The combined motion information candidate list supplied by the information candidate supplementing unit 164 (S106) supplies the combined motion information candidate list to the terminal 19. The detailed operation of the second combined motion information candidate supplementing unit 165 will be described later.

(Detailed operation of the space combined motion information candidate generation unit 160)

Next, the detailed operation of the space combined motion information candidate generation unit 160 will be described. FIG. 14 is a flowchart for explaining the operation of the space combined motion information candidate generating unit 160. The spatial combined motion information candidate generating unit 160 is a candidate block included in the space candidate block group of the candidate block group, that is, block A, block B, block C, block E, and block D. In the order, the following processing is repeated (S110 to S114).

First, it is checked whether the candidate block is valid (S111). The candidate block is valid, and at least one of the L0 prediction and the L1 prediction reference index of the candidate block is 0 or more. If the candidate block is valid (Y of S111), the motion information of the candidate block is added to the combined motion information candidate list as a space combined with the motion information candidate (S112). If the candidate block is not valid (N of S111), the next candidate block is checked by skipping steps S112 and S113 (S114). After step S112, the space combined with the motion information candidate added in the combined motion information candidate list is checked. Whether the number is the maximum number of spatial combined motion information candidates (S113). Here, it is assumed that the maximum number of spatial combined motion information candidates is four. If the number of spatial combined motion information candidates added to the combined motion information candidate list is not the maximum number of spatial combined motion information candidates (N of S113), the next candidate block is checked (S114). When the number of spatial combined motion information candidates added to the combined motion information candidate list is the maximum number of spatial combined motion information candidates (Y of S113), the processing ends.

Here, in order to make the block A and the block B which are generally considered to have a high correlation with the processing target block, the connection to the processing target block can be preferentially registered to the combined motion information candidate list. The order of processing is designed as block A, block B, block C, block E, block D, but as long as the combined motion information candidates can be registered to the combined motion information candidate list in a higher correlation order. Yes, it is not limited to this. In addition, the maximum number of spatial combined motion information candidates is set to four, but the maximum number of spatial combined motion information candidates is not less than 1 or more and is equal to or less than the number of candidate blocks included in the spatial candidate block group. this.

(Detailed operation of the time combined motion information candidate generation unit 161)

Next, the detailed operation of the time combined motion information candidate generation unit 161 will be described. FIG. 15 is a flowchart for explaining the operation of the time combined motion information candidate generation unit 161. The following processing is repeated for each prediction direction LX of the L0 prediction and the L1 prediction (S120 to S127). Here, the X system is 0 or 1. Moreover, the order of the candidate block included in the time candidate block group of the candidate block group, that is, the block H and the block I, is repeatedly processed as follows. (S121 to S126).

The time combined motion information candidate generation unit 161 checks whether or not the LN prediction of the candidate block is valid (S122). Here, the N system is 0 or 1. Here N is the same as X. The LN prediction of the candidate block is valid, and the reference index of the LN prediction of the candidate block is 0 or more. If the LN prediction of the candidate block is valid (Y of S122), the motion vector of the LN prediction of the candidate block is taken as the reference motion vector (S123). If the LN prediction of the candidate block is not valid (N of S122), the next candidate block is checked by skipping steps S123 to S126 (S126).

After the step S123, the LX predicted reference image of the motion information candidate is determined (S124). Here, the reference image of the LX prediction of the temporal combined motion information candidate is the reference video that is used most as the reference image of the LX prediction in the candidate block included in the spatial candidate block group. Then, the reference motion vector is scaled so that the processing target image matches the distance of the LX predicted reference image of the time combined with the motion information candidate, and the scaling vector is calculated, and the scaling vector is regarded as the LX prediction of the time combined motion information candidate. The motion vector (S125) processes the next prediction direction (S127). Here, the calculation formula of the scaling vector is the same as the calculation formula of the scaling vector of the temporal direct motion compensation prediction in MPEG-4 AVC. After step S127 for the L0 prediction and L1 prediction end processing, it is checked whether or not the prediction of at least one of the L0 prediction and the L1 prediction of the time combined motion information candidate is valid (S128). The LN prediction of the time-integrated motion information candidate is valid, and the reference image of the LN prediction that is time-combined with the motion information candidate is determined. think. When the prediction of at least one of the L0 prediction and the L1 prediction of the time-integrated motion information candidate is valid (Y of S128), the inter-screen prediction type of the time-integrated motion information candidate is determined, and the time-integrated motion information candidate is added to the combined motion. Information candidate list (S129). Here, the determination of the inter-picture prediction type is such that if only the L0 prediction is valid, the inter-picture prediction type of the temporal combined motion information candidate is set to Pred_L0, and if only the L1 prediction is valid, the inter-picture prediction of the temporal combined motion information candidate is performed. The type is set to Pred_L1, and if both the L0 prediction and the L1 prediction are valid, the inter-picture prediction type of the time combined with the motion information candidate is set to Pred_BI.

Here, although the N system and the X are the same, N may be different from X, and is not limited thereto. In addition, although the reference video of the LX prediction of the temporal information combined with the motion information candidate is the reference video that is the most used reference image for the LX prediction in the candidate block included in the spatial candidate block group, the present invention is not limited thereto. It is also possible to determine a reference image or the like which is referred to as index 0. Further, although the inter-picture prediction type is set to any of Pred_L0, Pred_L1, and Pred_BI, it may be only Pred_BI, and is not limited thereto.

(Detailed action of the implicit combined motion information candidate sorting unit 162)

Next, the detailed operation of the implicit combined motion information candidate ranking unit 162 will be described. FIG. 16 is a flowchart for explaining the operation of the implicit combined motion information candidate sorting unit 162. First, it is checked whether the candidate block A is a recessive combined motion information candidate (S140). The details of the implicit combined motion information candidate will be described later. If candidate block A is an implicit combined motion information candidate (Y of S140), the combined motion information candidate corresponding to the candidate block A, which is the implicit combined motion information candidate, is moved to the end of the combined motion information candidate list (S141), and the processing ends. If the candidate block A is not a recessive combined motion information candidate (N of S140), it is checked whether the candidate block B is a recessive combined motion information candidate (S142). If the candidate block B is a recessive combined motion information candidate (Y of S142), the implicit combined motion information candidate, that is, the combined motion information candidate corresponding to the candidate block B, is moved to the end of the combined motion information candidate list. (S143). If the candidate block B is not a recessive combined motion information candidate (N of S142), the processing ends.

(About implicit combined sports information candidates)

The following describes the implicit combined motion information candidates. 17(a) to (d) are diagrams for explaining implicit binding motion information candidates. The coding block, which has been described above, can be divided into 1 or 2 or 4 prediction blocks. Fig. 17 is a diagram showing an example in which the coding block is 16 × 16. The prediction error involving the coding block can be minimized by dividing the coding block into a plurality of prediction blocks, but on the other hand, the load of the syntax related to the prediction block shown in FIG. 6 will follow the prediction block. Increase in number. Therefore, for a complex prediction block whose motion information is the same and the prediction error is the same, it is summarized into one prediction block, and the number of divisions of the prediction block is suppressed, so that the coding efficiency can be improved.

Fig. 17 (a) is a diagram for explaining an example 1 in which the candidate block A is a recessive combined motion information candidate. It is shown that the coding block is in the merge mode, and the prediction block size type is N×2N and is encoded when the prediction block 1 is empty. The position of the motion information candidate. Here, if the motion information of the prediction block 0 is the same as the motion information of the prediction block 1, the prediction block 0 and the prediction block 1 are summarized into 2N×2N for encoding, thereby reducing the prediction block involved. The grammatical load can improve coding efficiency. In other words, when the prediction block size type is N×2N and the processing target block is the prediction block 1, the candidate block A corresponding to the candidate block when 2N×2N is encoded is selected as The possibility of combining sports information candidates is lower. Therefore, when the prediction block size type is N×2N and the processing target block is the prediction block 1, the candidate block A is regarded as a recessive combined motion information candidate.

Fig. 17 (b) is a diagram for explaining an example 2 in which the candidate block A is a recessive combined motion information candidate. The position where the coding block is the merge mode and the prediction block size type is N×N and the space of the prediction block 3 is combined with the motion information candidate is illustrated. Here, if the motion information of the prediction block 0 is the same as the motion information of the prediction block 1, and the motion information of the prediction block 2 is the same as the motion information of the prediction block 3, the prediction block 0 and the prediction area will be predicted. Block 1 is summarized, and the prediction block 2 and the prediction block 3 are also summarized into 2N×N for encoding, whereby the load of the syntax involving the prediction block can be reduced, and the coding efficiency can be improved. Therefore, if the prediction block size type is N×N and the motion information of the prediction block 0 is the same as the motion information of the prediction block 1 and is the prediction block 3, the candidate block A is regarded as implicit combination. Sports information candidates.

Fig. 17 (c) is a diagram for explaining an example 1 in which the candidate block B is a recessive combined motion information candidate. It is shown that the coding block is in merge mode, and The prediction block size type is set to 2N×N for encoding. Here, if the motion information of the prediction block 0 is the same as the motion information of the prediction block 1, the prediction block 0 and the prediction block 1 are summarized into 2N×2N for encoding, thereby reducing the prediction block involved. The grammatical load can improve coding efficiency. Therefore, when the prediction block size type is 2N×N and the processing target block is the prediction block 1, the candidate block B is regarded as a recessive combined motion information candidate.

Fig. 17 (d) is a diagram for explaining an example 2 in which the candidate block B is a recessive combined motion information candidate. The position where the coding block is the merge mode and the prediction block size type is N×N and the space of the prediction block 3 is combined with the motion information candidate is illustrated. Here, the motion information of the prediction block 0 is the same as the motion information of the prediction block 2, and the motion information of the prediction block 1 is the same as the motion information of the prediction block 3, and the prediction block 0 and the prediction block 2 are In summary, the prediction block 1 and the prediction block 3 are also summarized into N×2N for encoding, thereby reducing the load of the syntax involving the prediction block and improving the coding efficiency. Therefore, if the prediction block size type is N×N and the motion information of the prediction block 0 is the same as the motion information of the prediction block 2 and is the prediction block 3, the candidate block B is regarded as a recessive combination. Sports information candidates.

In this way, the implicit combined motion information candidate ranking unit 162 is based on the partition type of the prediction block of the encoding target and the position of the prediction block of the encoding target in the encoding block, which is larger than the size of the prediction block of the encoding target. The prediction block of the size is used for motion compensation prediction, and the combination of motion information candidates can be selected as a recessive knot from the viewpoint of coding efficiency. Sports information candidate. As described above, the implicit combined motion information candidate is a combined motion information candidate in which the coding efficiency is improved when combined into a larger prediction block size.

Fig. 18 is a flowchart for explaining the process of determining the implicit combined motion information candidate.

First, it is checked whether the predicted block size type is 2N × 2N (S150). If the predicted block size type is 2N × 2N (Y of S150), the processing is ended. If the predicted block size type is not 2N × 2N (N of S150), the predicted block size type is checked (S151). If the prediction block size type is N × 2N (N × 2N of S151), it is checked whether it is prediction block 1 (S152). If the prediction block size type is 2N×N (2N×N of S151), it is checked whether it is the prediction block 1 (S154). If the prediction block size type is N × N (N × N of S151), it is checked whether it is the prediction block 3 (S156). If the predicted block size type is N × 2N and is predicted block 1 (Y of S152), block A is regarded as a recessive combined motion information candidate (S153). If the predicted block size type is N × 2N and is not predicted block 1 (N of S152), the processing is ended. If the predicted block size type is 2N×N and is predicted block 1 (Y of S154), block B is regarded as a recessive combined motion information candidate (S155). If the predicted block size type is 2N×N and is not predicted block 1 (N of S154), the processing is ended.

If the predicted block size type is N×N and is predicted block 3 (Y of S156), it is checked whether the predicted block 0 and the predicted block 2 are identical (S157). If the predicted block size type is N×N and is not predicted block 3 (N of S156), the processing ends. If prediction block 0 and prediction block If the motion information of 2 is the same (Y of S157), the block A is regarded as a recessive combined motion information candidate (S158). If the motion information of the prediction block 0 and the prediction block 2 are not the same (N of S157), it is checked whether the motion information of the prediction block 0 and the prediction block 1 are the same (S159). If the motion information of the prediction block 0 and the prediction block 1 are the same (Y of S159), the block B is regarded as a recessive combined motion information candidate (S160). If the motion information of the prediction block 0 and the prediction block 1 are not the same (N of S159), the processing ends.

18 is an example of the determination process of the implicit combined motion information candidate, as long as at least two or one of the number of divisions of the coding block to the prediction block and the position of the prediction block in the coding block can be used to determine the implicit combination. The sports information candidate can be used, and is not limited to this.

For example, in order to simplify the conditional decision when the prediction block type is N×N, the motion information identity determination of the prediction block 0 and the prediction block 1 may be omitted (step S159) or the prediction block 0 and the prediction block 2 ( The motion information identity determination of step S157), in the prediction block 3, always considers blocks A and B as implicit combined motion information candidates. Then, block A can always be regarded as a recessive combined motion information candidate in prediction block 1, and block B is always regarded as a recessive combined motion information candidate in prediction block 2.

Further, as another method of simplifying the conditional determination when the prediction block type is N × N, when the prediction block type is N × N, the ordering of the implicit combined motion information candidates may not be performed. This becomes, based on the number of divisions of the coding block to the prediction block, the ordering of the implicit combined motion information candidates is performed. control.

In general, the candidate block A or the candidate block B is a combined motion information candidate having a relatively high selection rate compared to other blocks, and thus is assigned a merged index having a shorter coding length. However, as described above, the candidate block A or the candidate block B is a prediction block which is larger than the candidate block A or the candidate block B when the condition is implicitly combined with the motion information candidate, and the coding efficiency is high. It is better, so it is less likely to be selected as a candidate for combining sports information. Therefore, in the implicit combined motion information candidate sorting unit 162, the implicit combined motion information candidate is moved to the end of the combined motion information candidate list, and candidates other than the recessive combined motion information candidate having a relatively high selection rate are selected. The block allocates a merged index with a short code length, thereby improving coding efficiency.

(Detailed operation of the first combined motion information candidate supplementing unit 164)

Next, the detailed operation of the first combined motion information candidate supplementing unit 164 will be described. FIG. 19 is a flowchart for explaining the operation of the first combined motion information candidate supplementing unit 164. First, the first supplementary combined motion information is generated based on the number of combined motion information candidates (NumCandList) and the maximum number of combined candidates (MaxNumMergeCand) registered in the combined motion information candidate list supplied from the redundant combined motion information candidate deleting unit 163. The maximum number of candidates, MaxNumGenCand, is calculated by Equation 1 (S170).

MaxNumGenCand=MaxNumMergeCand-NumCandList;(NumCandList>0) MaxNumGenCand=0;(NumCamdList==0) Equation 1

Next, it is checked whether MaxNumGenCand is greater than 0 (S171). If MaxNumGenCand is not greater than 0 (N of S171), the process ends. If MaxNumGenCand is greater than 0 (Y of S171), the following processing is performed. First, decide the number of combined check loopTimes. The loopTimes is set to NumCandList×NumCandList. However, when loopTimes exceeds 8, the loopTimes is limited to 8 (S172). Here, loopTimes is an integer from 0 to 7. The following processing loopTimes is repeated (S172 to S180). A combination of the motion information candidate M and the combined motion information candidate N is determined (S173). Here, the relationship between the number of combined inspections and the combined motion information candidate M and the combined motion information candidate N will be described. Fig. 43 is a view for explaining the relationship between the number of combined inspections and the combined motion information candidate M and the combined motion information candidate N. As shown in Fig. 43, M and N are different values, and the total values of M and N are set to be small and large. It is checked whether or not the L0 prediction combined with the motion information candidate M is valid and the L1 prediction combined with the motion information candidate N is valid (S174). If the L0 prediction combined with the motion information candidate M is valid and the L1 prediction combined with the motion information candidate N is valid (N of S174), check whether the reference image and the motion vector of the L0 prediction combined with the motion information candidate M are combined with the motion information. The reference image of the L1 prediction of the candidate N is different from the motion vector (S175). If the L0 prediction that is not combined with the motion information candidate M is valid and the L1 prediction combined with the motion information candidate N is valid (N of S174), the next combination is processed. If the reference image of the L0 prediction combined with the motion information candidate M is different from the reference image of the L1 prediction combined with the motion information candidate N (Y of S175), the motion information candidate M will be combined. The L0 predicted motion vector and the reference image and the L1 predicted motion vector combined with the motion information candidate N are combined with the reference image to generate a double combined motion information candidate of the inter prediction type Pred_BI (S176). Here, as the first supplementary combined motion information candidate, the L0 prediction of the combined motion information candidate and the L1 predicted motion information of the combined motion information candidate are combined to generate the double combined motion information. If the reference image of the L0 prediction combined with the motion information candidate M is the same as the reference image of the L1 prediction combined with the motion information candidate N (N of S175), the next combination is processed. After step S176, it is checked whether the double combined motion information candidate exists in the combined motion information candidate list (S177). If the double combined motion information candidate does not exist in the combined motion information candidate list (Y of S177), the double combined motion information candidate is added to the combined motion information candidate list (S178). If the double combined motion information candidate exists in the combined motion information candidate list (N of S177), step S178 is skipped. After step S177 or step S178, it is checked whether the number of generated double combined motion information is MaxNumGenCand (S179). If the number of double combined motion information that has been generated is MaxNumGenCand (Y of S179), the processing ends. If the number of double combined motion information that has been generated is not MaxNumGenCand (N of S179), the next combination is processed.

Here, the first supplementary combined motion information candidate is designed such that the L0 predicted motion vector and the reference image that have been registered to one of the combined motion information candidates in the combined motion information candidate list are combined with the other reference motion information. The candidate L1 predicted motion vector is combined with the reference image to become a bi-joined motion information candidate in the direction of motion compensation prediction. However, it is not limited to this. For example, it may be a motion compensation prediction that adds a +1 offset value to the L0 predicted motion vector and the L1 predicted motion vector that have been registered to a certain combined motion information candidate in the combined motion information candidate list. The direction is a bidirectional combined motion information candidate, and the motion vector of the L0 prediction or the motion vector of the L1 prediction that has been registered to a combined motion information candidate in the combined motion information candidate list is added with an offset value of +1. The direction of motion compensation prediction is a one-way combined motion information candidate, and they can be combined in any combination.

Here, the first supplementary combined motion information candidate is registered when the motion information of the combined motion information candidate registered in the combined motion information candidate list and the motion information candidate motion of the processing target are subtly deviated. The motion information combined with the motion information candidate in the motion information candidate list is corrected to generate an effective combined motion information candidate, thereby improving coding efficiency.

As described above, even if the motion information selected as the implicit combined motion information candidate having a low probability of combining the motion information candidates is selected, either the L0 prediction or the L1 prediction is the same as the motion information of the processing target block. The situation, or the motion information of the processing target block, may be slightly different from the motion information of the implicit combined motion information candidate. Therefore, instead of deleting the sports information of the implicit combined motion information candidate, the motion information of the implicit combined motion information candidate is combined with other sports information combined with the motion information candidate, or the motion information of the implicit combined motion information candidate is corrected. For example, the first supplementary combined motion information candidate having a relatively higher selection rate than the implicit combined motion information candidate is generated, whereby the coding efficiency can be improved. especially In the case of using the double combined motion information candidate, at least two combined motion information candidates are required. Therefore, when the combined motion information candidate other than the implicit combined motion information candidate is registered in the combined motion information candidate list, only one is registered. In addition, the motion information of the implicit combined motion information candidate is not deleted, but the motion information of the implicit combined motion information candidate is combined with other motion information combined with the motion information candidate, thereby improving the coding efficiency. Further, the combination of the combined motion information candidate M and the combined motion information candidate N required to generate the double combined motion information candidate is set so that the total value of M and N is small and large, whereby the recessive property can be used. The combined motion information candidates other than the motion information candidates are combined with each other to generate a dual combined motion information candidate.

(Detailed operation of the second combined motion information candidate supplementing unit 165)

Next, the detailed operation of the second combined motion information candidate complementing unit 165 will be described. FIG. 20 is a flowchart for explaining the operation of the second combined motion information candidate complementing unit 165. First, based on the number of combined motion information candidates (NumCandList) and the maximum number of merge candidates (MaxNumMergeCand) registered in the combined motion information candidate list supplied from the first combined motion information candidate supplementing unit 164, a second supplementary combined motion is generated. The maximum number of information candidates, MaxNumGenCand, is calculated by Equation 2 (S190).

MaxNumGenCand=MaxNumMergeCand-NumCandList;(NumCandList>0) MaxNumGenCand=2;(NumCandList==0) Equation 2

Next, the following processing is repeated for i MaxNumGenCand times (S191 to S195). Here, i is an integer of 0 to MaxNumGenCand-1. The second complementary combined motion information candidate that generates the motion vector of the L0 prediction is (0, 0), the reference index is i, and the motion vector of the L1 prediction is (0, 0), and the inter prediction type of the reference index is i is Pred_BI. (S192). It is checked whether the second supplementary combined motion information candidate exists in the combined motion information candidate list (S193). When the second supplementary combined motion information candidate does not exist in the combined exercise information candidate list (Y in S193), the second supplementary combined exercise information candidate is added to the combined exercise information candidate list (S194). When the second supplementary combined motion information candidate exists in the combined motion information candidate list (N in S193), processing is performed for the next i (S195).

Here, the second supplementary combined motion information candidate is set such that the motion vector of the L0 prediction is (0, 0), the reference index is i, and the motion vector of the L1 prediction is (0, 0), and the reference index is i. The combined prediction type is Pred_BI combined motion information candidate. This is because, in a general motion picture, the frequency of occurrence of the combined motion information candidate of the L0 predicted motion vector and the L1 predicted motion vector of (0, 0) is statistically higher. The motion information that does not depend on the combined motion information candidate that has been registered in the combined motion information candidate list is not limited thereto as long as it is a combined motion information candidate having a high statistical frequency. For example, the motion vector system of the L0 prediction or the L1 prediction may also be a vector value other than (0, 0), or may be set such that the L0 prediction is different from the reference index of the L1 prediction. Further, the second supplementary combined motion information candidate may be set as the motion information having a higher frequency of occurrence of the encoded image or one of the encoded images.

Here, by setting the combined motion information candidate that is not registered in the combined motion information candidate in the combined motion information candidate list, which is regarded as the second supplementary combined motion information candidate, has been registered in the combined motion information candidate list. When the combined motion information candidate is 0, the merge mode can be utilized to improve the coding efficiency. Further, when the motion information of the combined motion information candidate registered in the combined motion information candidate list and the motion information candidate motion of the processing target are different, the combined use of the combined motion information candidate list is relatively high. The new combination of motion information candidates to expand the selection range, thereby improving coding efficiency.

(Configuration of Motion Picture Decoding Device 200)

Next, a motion picture decoding device according to the first embodiment will be described. Fig. 21 is a diagram showing the configuration of a video decoding device 200 according to the first embodiment. The motion picture decoding device 200 is a device that decodes a code sequence encoded by the motion picture coding device 100 to generate a reproduced picture.

The motion picture decoding device 200 is realized by a hardware such as an information processing device including a CPU (Central Processing Unit), a frame memory, and a hard disk. The motion picture decoding device 200 realizes the functional components described below by the operation of the above-described constituent elements. The division of the coding block, the determination of the prediction block size type, the prediction of the block size, the determination of the position of the prediction block in the coding block (the position information of the prediction block), and whether the prediction coding mode is a decision within the picture, This is determined by a higher-level control unit (not shown). Here, the case where the prediction encoding mode is not in the screen will be described. In addition, the bits of the prediction block of the decoding object The information and the prediction block size are shared by the motion picture decoding device 200, and are not shown.

The motion picture decoding device 200 according to the first embodiment includes a code line analysis unit 201, a prediction error decoding unit 202, an addition unit 203, a motion information reproduction unit 204, a motion compensation unit 205, a frame memory 206, and a motion information memory 207. .

(Operation of Motion Picture Decoding Device 200)

Hereinafter, the functions and operations of the respective units will be described. The coded column analysis unit 201 analyzes the coded column supplied from the terminal 30, and predicts the error coded data, the merged flag, the merged index, and the motion compensation prediction (inter-picture prediction type), the reference index, and the difference vector. And predictive vector index, entropy decoding according to the syntax. Entropy decoding is implemented by a method including variable length coding such as arithmetic coding or Huffman coding. Then, the prediction error coded data is supplied to the prediction error decoding unit 202, and the integration flag, the merging index, the inter-picture prediction type, the reference reference index, the difference vector, and the prediction vector index are supplied to the motion information. Reproduction unit 204.

The motion information reproducing unit 204 is based on the merge flag, the merge index, the inter-picture prediction type, the reference index, the difference vector, and the prediction vector index supplied from the code column analyzing unit 201, and the candidate region supplied from the motion information memory 207. The block group reproduces the motion information, and supplies the motion information to the motion compensation unit 205 and the motion information memory 207. The detailed configuration of the motion information reproducing unit 204 will be described later.

The motion compensating unit 205 performs motion compensation based on the motion vector based on the motion information supplied from the motion information reproducing unit 204, based on the motion index vector, to generate a prediction signal. When the prediction direction is bi-predicted, the signal obtained by averaging the L0 prediction and the prediction signal of the L1 prediction is generated as a prediction signal, and the prediction signal is supplied to the addition unit 203.

The prediction error decoding unit 202 performs processing such as inverse quantization or inverse orthogonal conversion on the prediction error coded data supplied from the code column analysis unit 201 to generate a prediction error signal, and supplies the prediction error signal to the addition unit 203.

The adding unit 203 adds the prediction error signal supplied from the prediction error decoding unit 202 and the prediction signal supplied from the motion compensation unit 205 to generate a decoded video signal, and supplies the decoded video signal to the frame memory 206. And terminal 31.

The frame memory 206 and the motion information memory 207 have the same functions as the frame memory 110 and the motion information memory 111 of the motion picture coding apparatus 100. The frame memory 206 stores the decoded video signal supplied from the adding unit 203. The motion information memory 207 stores the motion information supplied from the motion information reproducing unit 204 in units of minimum prediction block sizes.

(Detailed configuration of the motion information reproducing unit 204)

Next, the detailed configuration of the motion information reproducing unit 204 will be described. FIG. 22 shows the configuration of the motion information reproducing unit 204. Sports information regeneration department 204 The coding mode determination unit 210, the motion vector reproduction unit 211, and the combined motion information reproduction unit 212 are included. The terminal 32 is connected to the code column analysis unit 201, the terminal 33 is connected to the motion information memory 207, the terminal 34 is connected to the motion compensation unit 205, and the terminal 36 is connected to the motion information memory 207.

(Detailed operation of the motion information reproducing unit 204)

Hereinafter, the functions and operations of the respective units will be described. The coding mode determination unit 210 determines whether the merge flag system supplied from the code column analysis unit 201 is "0" or "1". When the merge flag is "0", the inter-picture prediction type, the reference index, the difference vector, and the prediction vector index supplied from the code column analysis unit 201 are supplied to the motion vector reproduction unit 211. When the merge flag is "1", the merge index supplied from the code column analysis unit 201 is supplied to the combined motion information reproducing unit 212.

The motion vector reproduction unit 211 generates motion by reproducing a motion vector based on the inter prediction type, the reference index, the difference vector, and the prediction vector index supplied from the coding mode determination unit 210, and the candidate block group supplied from the terminal 33. Information is supplied to terminal 34 and terminal 36.

The combined motion information reproducing unit 212 reproduces motion information based on the merge index supplied from the encoding mode determining unit 210 and the candidate block group supplied from the terminal 33, and supplies the motion information to the terminal 34 and the terminal 36.

(Detailed configuration of the combined motion information reproducing unit 212)

Next, the detailed configuration of the combined motion information reproducing unit 212 will be described. Figure 23 The configuration is combined with the configuration of the motion information reproducing unit 212. The combined motion information reproducing unit 212 includes a combined motion information candidate list generating unit 230 and a combined motion information selecting unit 231. The terminal 35 is connected to the encoding mode determination unit 210.

(Detailed operation of the combined motion information reproducing unit 212)

Hereinafter, the functions and operations of the respective units will be described. The combined motion information candidate list generating unit 230 has the same function as the combined motion information candidate list generating unit 140 of the video encoding device 100, and is operated in the same manner as the combined motion information candidate list generating unit 140 of the video encoding device 100. The combined motion information candidate list is generated, and the combined motion information candidate list is supplied to the combined motion information selection unit 231.

The combined motion information selection unit 231 determines the combined motion information from the combined motion information candidate indicated by the merge index supplied from the terminal 35 from the combined motion information candidate list supplied from the combined motion information candidate list generating unit 230. The motion information combined with the motion information is supplied to the terminal 34 and the terminal 36.

(effect description)

The effects of the motion picture coding apparatus and the motion picture decoding apparatus according to the first embodiment of the present invention will be described. Fig. 24 is an explanatory view showing an effect of the first embodiment of the present invention. Fig. 24 is a diagram showing the effect of the ordering of the combined motion information candidates when the candidate block A is implicitly combined with the motion information candidate. Here, it is assumed that there is a registration in the combined motion information candidate list: And index 0 (candidate block A), merge index 1 (candidate block B), merge index 2 (candidate block C), merge index 3 (candidate block E), merge index 4 (candidate block T). Strictly speaking, the probability of selection of merged indexes will change before and after sorting, but here to simplify the explanation, it is assumed that the probability of selection of merged indexes before and after sorting has not changed. This is also the case in the example of the effect description that follows. It is assumed that the selection probability of the candidate block A, the candidate block B, the candidate block C, the candidate block E, and the candidate block T is 2%, 60%, 14%, 12%, and 12%, respectively. At this time, the expected value of the code length of the merge index before sorting is 2.6 bits (Expression 3). On the other hand, the expected value of the code length of the sorted merge index is 1.8 bits (Equation 4). Therefore, the expected value of the coded length of the sorted merge index is 0.8 bits shorter, and it is known that the coding efficiency is improved.

0.02x1+0.6x2+0.14x3+0.12x4+0.12x4=2.6 Equation 3

0.6x1+0.14x2+0.12x3+0.12x4+0.02x4=1.8 Equation 4

As described above, the implicit combined motion information candidate is moved to the end of the combined motion information candidate list, and the candidate coding block other than the recessive combined motion information candidate having a relatively high selection rate is allocated with a shorter coding length. Combine indexes to improve coding efficiency.

(Modification 1 of Embodiment 1)

The configuration of the combined motion information candidate list generating unit 140 of the first embodiment is as shown in FIG. 12, but the recessive combined motion information candidate sorting unit 162 may not be placed after the time combined motion information candidate generating unit 161, but may be set in the The space is combined with the motion information candidate generation unit 160.

In this case, in the combined motion information candidate list, although the implicit combined motion information candidate cannot be registered after the time combined with the motion information candidate, the sorting process of the implicit combined motion information candidate may be configured in the space. Since the combination is completed in the motion information candidate generation unit 160, the independence of the space combined motion information candidate generation unit 160 and the time combined motion information candidate generation unit 161 can be improved, and the circuit design or the software design can be facilitated.

(Modification 2 of Embodiment 1)

The operation of the recessive combined motion information candidate ranking unit 162 of the first embodiment is shown in Fig. 16, but the steps S141 and S143 may be changed as follows to become the same result as the first modification of the first embodiment.

The implicit combined motion information candidate is equivalent to the combined motion information candidate of the candidate block A, and moved to the time combined with the motion information candidate list in combination with the previous one of the motion information candidates or if the time combined with the motion information candidate does not exist, then moved to The last (S141). The implicit combined motion information candidate is equivalent to the combined motion information candidate of the candidate block B, and moved to the time combined with the motion information candidate list in combination with the previous one of the motion information candidates or if the time combined with the motion information candidate does not exist, then moved to The last (S143).

(Modification 3 of Embodiment 1)

The configuration of the combined motion information candidate list generating unit 140 of the first embodiment is as shown in FIG. 12, but the first combined motion information candidate supplementing unit 164 is provided. The second combined motion information candidate supplementing unit 165 may be deleted by either or both of them.

[Embodiment 2]

Hereinafter, the second embodiment will be described. The configuration and operation of the combined motion information candidate list generating unit 140 differs from that of the first embodiment. Fig. 25 is an explanatory diagram showing the configuration of the combined motion information candidate list generating unit 140 of the second embodiment. The combined motion information candidate list generating unit 140 of the first embodiment of FIG. 12 is configured such that the recessive combined motion information candidate sorting unit 162 is disposed after the time combined with the motion information candidate generating unit 161, but is provided in the first combined motion. This is different after the information candidate supplementation unit 164.

Fig. 26 is an explanatory diagram showing the operation of the combined motion information candidate list generating unit 140 of the second embodiment. The operation of the combined motion information candidate list generating unit 140 according to the first embodiment of FIG. 13 is such that step S103 is not after step S102 but is set after step S105.

The first supplemental combined with the motion information candidate system can be generated by using the combined motion information candidate with a relatively high probability of selection of the motion information candidates (the reliability is higher), so the probability of selection is compared with the general recessive combined motion information candidate system. Relatively high. Therefore, the coding efficiency can be improved by assigning a combined index whose coding length is shorter than the implicit combined motion information candidate to the first supplementary combined motion information candidate.

(effect description)

The effects of the motion picture coding device and the motion picture decoding device according to the second embodiment of the present invention will be described. Fig. 27 is an explanatory view showing an effect of the second embodiment of the present invention. Here, it is assumed that only the candidate block A and the candidate block B are valid among the candidate block groups, and the direction of the motion compensation prediction of the candidate block A and the candidate block B are both bidirectional. Further, it is assumed that the combined motion information candidate list is registered with the candidate block A and the candidate block B, the two double combined motion information candidates BD0 and BD1, and one second supplementary combined motion information candidate AD. Assume that merge index 0 (candidate block A), merge index 1 (candidate block B), merge index 2 (double combined motion information candidate BD0), merge index 3 (double combined motion information candidate BD1), merge index 4 (first 2 The combined chances of supplementing sports information candidate AD) are 4%, 70%, 12%, 12%, and 2%, respectively. Although the calculation formula is omitted, in the second embodiment, the expected value of the code length of the merge index before sorting is 2.36 bits. On the other hand, the expected value of the coded length of the sorted merge index is 1.54 bits. Therefore, the expected value of the coded length of the sorted merge index is 0.82 bits shorter, and it is known that the coding efficiency is improved.

(Modification of Embodiment 2)

The configuration of the combined motion information candidate list generating unit 140 of the second embodiment is as shown in FIG. 25, but the recessive combined motion information candidate sorting unit 162 may not be placed after the first combined motion information candidate complementing unit 164, but may be set. After the second combined motion information candidate complementing unit 165.

In this case, the second supplementary combined motion information candidate is set by using the encoded image or the motion information having a higher frequency in one of the encoded images, and the second supplementary combined motion information candidate is selected. The probability of selection is relatively higher than that of the implicitly combined motion information candidate, and the coding efficiency can be improved by assigning a combined index whose coding length is shorter than the implicit combined motion information candidate for the second supplementary combined motion information candidate.

[Embodiment 3]

Hereinafter, the third embodiment will be described. The configuration and operation of the combined motion information candidate list generating unit 140 and the operation of the spatial combined motion information candidate generating unit 160 differ from those of the first embodiment.

First, the configuration of the motion information candidate list generating unit 140 will be described. Fig. 28 is an explanatory diagram showing the configuration of the combined motion information candidate list generating unit 140 of the third embodiment. The combined motion information candidate list generating unit 140 of the first embodiment of FIG. 12 is different from the implicit combined motion information candidate sorting unit 162 instead of the implicit combined motion information candidate adding unit 166.

Next, the operation of the motion information candidate list generating unit 140 will be described. Fig. 29 is an explanatory diagram showing the operation of the combined motion information candidate list generating unit 140 of the third embodiment. The operation of the combined motion information candidate list generating unit 140 of the first embodiment of Fig. 13 is different from the step S107 instead of the step S107. Hereinafter, the operation of the combined motion information candidate list generating unit 140 according to the third embodiment will be described as a difference from the first embodiment.

The implicit combined motion information candidate adding unit 166 adds the implicit combined motion information candidate to the combined motion information candidate list supplied from the time combined motion information candidate generating unit 161 (S107), and supplies the combined motion information candidate list to the combined motion information candidate list. The lengthy combined motion information candidate deletion unit 163.

Next, the operation of the space combined motion information candidate generation unit 160 will be described. Fig. 30 is an explanatory diagram showing the operation of the space combined motion information candidate generation unit 160 of the third embodiment. The operation of the space-combined motion information candidate generation unit 160 of the first embodiment of FIG. 14 is different in that steps S115 and S116 are added. Hereinafter, the operation of the spatial combined motion information candidate generation unit 160 of the third embodiment will be described as a difference from the first embodiment.

First, the temporary memory that memorizes the implicit combination of motion information candidates is initialized. If the candidate block is valid (Y of S111), it is checked whether the candidate block is a recessive combined motion information candidate (S115). Here, the determination process of the implicit combined motion information candidate is shown in FIG. 18, but it may be designed as a simple process. If the candidate block is a recessive combined motion information candidate (Y of S115), the candidate block is stored as a recessive combined motion information candidate and stored in the temporary memory (S116), and the next candidate block is checked (S114). If the candidate block is not a recessive combined motion information candidate (N of S115), the motion information of the candidate block is added to the combined motion information candidate list as a spatial combined motion information candidate (S112). Further, it is assumed that the temporary memory is shared by the spatial combined motion information candidate generating unit 160.

Next, the movement of the implicit combined motion information candidate adding unit 166 will be described. Work. FIG. 31 is an explanatory diagram of the operation of the implicit combined motion information candidate adding unit 166. First, it is checked whether or not the implicit combined motion information candidate is memorized in the temporary memory (S200). If the implicit combined motion information candidate is stored (Y of S200), it is checked whether the number of spatial combined motion information candidates registered in the combined motion information candidate list is smaller than the maximum number of spatial combined motion information candidates (S201). If the implicit combined motion information candidate is not remembered (N of S200), the processing ends. If the number of spatial combined motion information candidates registered in the combined motion information candidate list is smaller than the combined candidate maximum number (Y of S201), the implicit combined motion information candidate is added to the end of the combined motion information candidate list (S202). ), end processing. If the number of spatial combined motion information candidates registered in the combined motion information candidate list is not smaller than the maximum number of spatial combined motion information candidates (N of S201), the processing ends.

In the third embodiment, if the number of spatial candidate blocks is larger than the maximum number of spatial combined motion information candidates, and all the space candidate blocks are valid, the recessive combined motion information candidates can be replaced instead of In order to utilize the space candidate block (in the present embodiment, it is the candidate block D). Therefore, the coding efficiency can be improved by using other spatial candidate blocks instead of using the implicit combination of the motion information candidates with the selectivity ratio and the recessive combined motion information candidates.

(effect description)

The effects of the motion picture coding apparatus and the motion picture decoding apparatus according to the third embodiment of the present invention will be described. Figure 32 is a third embodiment of the present invention An explanatory diagram of the effect caused. Here, it is assumed that the candidate block A, the candidate block B, the candidate block C, the candidate block E, the candidate block D, and the candidate block T are all valid, and are assumed to be the same as Fig. 24 for explaining the effect of the first embodiment. The conditions are preconditions. Therefore, the expected value of the code length of the merged index before sorting is 2.6 bits. On the other hand, although the calculation formula is omitted, the expected value of the code length of the merge index after the process of the implicit combined motion information candidate addition unit 166 of the third embodiment is 1.9 bits. Therefore, the expected value of the coded length of the sorted merged index is 0.7 bits shorter, and it is known that the coding efficiency is improved.

(Modification of Embodiment 3)

The configuration of the combined motion information candidate list generating unit 140 of the third embodiment is as shown in FIG. 28, but the recessive combined motion information candidate adding unit 166 may be placed after the time combined motion information candidate generating unit 161, instead of As in the second embodiment, it is provided after the first combined motion information candidate supplementing unit 164 or after the second combined motion information candidate complementing unit 165.

[Embodiment 4]

Hereinafter, the fourth embodiment will be described. The configuration and operation of the combined motion information candidate list generating unit 140 differs from that of the first embodiment.

First, the configuration of the motion information candidate list generating unit 140 will be described. Fig. 33 is an explanatory diagram showing the configuration of the combined motion information candidate list generating unit 140 of the fourth embodiment. Combined with the movement of the first embodiment of Fig. 12 The queuing list generating unit 140 is different in that the implicit combined motion information candidate deleting unit 167 is added to the first combined motion information candidate complementing unit 164.

Next, the operation of the motion information candidate list generating unit 140 will be described. Fig. 34 is an explanatory diagram showing the operation of the combined motion information candidate list generating unit 140 of the fourth embodiment. The operation of the combined motion information candidate list generating unit 140 of the first embodiment of FIG. 13 is such that after the step S105, the implicit combined motion information candidate deleting unit 167 deletes the implicit combination from the combined motion information candidate list. This is different in the step of the motion information candidate (S108).

Next, the operation of the implicitly combined motion information candidate deletion unit 167 will be described. FIG. 35 is an explanatory diagram of the operation of the implicit combined motion information candidate deletion unit 167. The following processing is repeated for the combined motion information candidate M of the number of combined motion information candidates (NumCandList) registered in the combined motion information candidate list supplied from the first combined motion information candidate complementing unit 164 (S210 to S213). Here, M is an integer of 0 to NumCandList-1. It is checked whether the candidate block M is implicitly combined with motion information (S211). If the candidate block M is the implicit combined motion information (Y of S211), the implicit combined motion information candidate is deleted from the combined motion information candidate list (S212), and the processing ends. If the candidate block M is not implicitly combined with motion information (N of S211), the next combined motion information candidate is processed (S213).

(effect description)

The effects of the motion picture coding apparatus and the motion picture decoding apparatus according to the fourth embodiment of the present invention will be described. For example, the second supplemental combined motion information candidate is set by using the encoded image or the motion information with a higher frequency occurring in one of the encoded images. If the second supplementary combined motion information candidate is more selective than the recessive When the probability of selecting the motion information candidate is relatively high, the implicit combined motion information candidate is deleted from the combined motion information candidate list, and the second supplementary combined motion information candidate is added to the combined motion information candidate list, thereby combining the motion information selection unit. 141, the best combined motion information candidate can be selected from the combined motion information candidate list without the implicit combined motion information candidate, which can improve the coding efficiency. In addition, although the implicit combined motion information candidate is deleted from the combined motion information candidate list, the implicit combined motion information candidate may be set to be invalid, so that the combined motion information selecting unit 141 does not select the implicit combined motion. Information candidate. In other words, it is sufficient to assign a combined index to the combined motion information candidates other than the implicit combined motion information candidates.

(Modification of Embodiment 4)

As shown in FIG. 35, the implicit combined motion information candidate deletion unit 167 of the fourth embodiment simply deletes the implicit combined motion information candidate registered in the combined motion information candidate list, but by determining The implicit combined motion information candidate, that is, whether the combined motion information of the predicted block is a repeated combined motion information candidate, may also determine whether to delete the implicit combined motion information candidate that has been registered in the combined motion information candidate list.

The following describes the implementation form of the determination of the repeated combined motion information candidate. An extension of state 4. Fig. 36 is an explanatory diagram showing the operation of the recessive combined motion information candidate deletion unit 167 in the modification of the fourth embodiment. The difference from FIG. 35 is that step S213 is added. It is checked whether the combined motion information of the prediction block including the implicit combined motion information candidate is a repeated combined motion information candidate (step S213). If the combined motion information candidate of the prediction block including the implicit combined motion information candidate is the repeated combined motion information candidate (Y in step S213), the implicit combined motion information candidate is deleted from the combined motion information candidate list (S212), and the process ends. deal with. If the combined motion information of the prediction block including the implicit combined motion information candidate is not the repeated combined motion information candidate (N of step S213), the processing ends.

Next, the repeated combined motion information candidates will be described. Figure 37 is a diagram for explaining the repeated combined motion information candidates. Fig. 37 is a diagram showing an example in which the coding block is 16 × 16. 37(a) is an explanatory diagram of the repeated combined motion information candidate when the prediction block size type is N×2N, and illustrates the implicit combined motion of the prediction block 1 when the prediction block size type is N×2N. The information candidate, that is, the spatial combined motion information candidate of the prediction block 0, that is, the candidate block A, the candidate block B, the candidate block C, the candidate block D, and the candidate block E. 37(b) is a diagram showing spatial combined motion information candidates when the prediction block size type is 2N×2N prediction block 0, that is, candidate block A, candidate block B, candidate block C, and candidate block. D, and candidate block E. In FIGS. 37(a) and 37(b), it can be seen that the positions of the candidate block A, the candidate block D, and the candidate block E are repeated. These candidate blocks that overlap with the positions of the candidate blocks of the larger prediction block size type under a certain prediction block size type are called repeated combined motion information candidates.

Here, in the prediction block 0 of the prediction block 1 when the prediction block size type is N×2N, that is, in the prediction block 0, when these repeated combined motion information candidates are selected as the combined motion information candidates In the case where the repeated combined motion information candidate is selected on the prediction block 1, it is equivalent to the case where the repeated combined motion information candidate is selected to be 2N×2N, and thus the coding efficiency is necessarily reduced. On the other hand, in the implicit combined motion information candidate of the prediction block 1 when the prediction block size type is N×2N, that is, in the prediction block 0, when these non-repetitive combined motion information candidates are candidate blocks B or candidates When the block C is selected as the combined motion information candidate, since it is not selected as 2N×2N, the coding efficiency may be improved by selecting the candidate block B or the candidate block C in the prediction block 1. . 37(c) is a diagram showing the repeated combined motion information candidates when the prediction block size type is 2N×N prediction block 0 is the candidate block B, the candidate block C, and the candidate block D. 37(d) is a diagram showing the repeated combined motion information candidates when the prediction block size type is the N×N prediction block 2, which is the candidate block A, the candidate block D, and the candidate block E. 37(e) is a diagram showing the repeated combined motion information candidates when the prediction block size type is N×N prediction block 1 is the candidate block B, the candidate block C, and the candidate block D.

As described above, by determining whether the implicit combined motion information candidate, that is, the combined motion information of the predicted block is a repeated combined motion information candidate, whether to delete the implicit combined motion information that has been registered in the combined motion information candidate list is determined. Alternate, which can improve coding efficiency.

(Modification 2 of Embodiment 4)

The combined motion information candidate list generating unit 140 of the fourth embodiment is applied to the first embodiment as shown in FIG. 33, but is similarly applicable to the second embodiment or the third embodiment. When the first combined motion information candidate complementing unit 164 is applied, the recessive combined motion information candidate sorting unit 162 and the recessive combined motion information candidate deleting unit 167 are present. Here, the implicit combined motion information candidate is sorted by the implicit combined motion information candidate sorting unit 162, and then the implicit combined motion information candidate deleting unit 167 deletes the implicit combined motion information candidate, or is implicit. The combined motion information candidate deletion unit 167 deletes the implicit combined motion information candidate, and then the implicit combined motion information candidate sorting unit 162 sorts the implicit combined motion information candidates to obtain the same effect, and thus may be omitted. The implicit combined motion information candidate is sorted in conjunction with the motion information candidate sorting unit 162, and only the implicit combined motion information candidate deleting unit 167 deletes the implicit combined motion information candidate.

[Embodiment 5]

Hereinafter, Embodiment 5 will be described. The configuration and operation of the combined motion information candidate list generating unit 140 differs from that of the first embodiment.

First, the configuration of the motion information candidate list generating unit 140 will be described. 38 is an explanatory diagram showing the configuration of the combined motion information candidate list generating unit 140 of the fifth embodiment. The combined motion information candidate list generating unit 140 of the first embodiment of FIG. 12 is configured to replace the recessive combined motion information candidate sorting unit 162 with the explicit combined motion information candidate sorting. Part 168, this is different.

Next, the operation of the motion information candidate list generating unit 140 will be described. Fig. 39 is an explanatory diagram showing the operation of the combined motion information candidate list generating unit 140 of the fifth embodiment. The operation of the combined motion information candidate list generating unit 140 of the first embodiment of Fig. 13 is that the step S103 is replaced with the following step S109, which is different.

The explicit combined motion information candidate ranking unit 168 is changed in such a manner that the explicit combined motion information candidate registered in the combined motion information candidate list supplied by the time combined motion information candidate generating unit 161 becomes a combined motion information candidate list. Start (S109).

Next, the operation of the explicit combined motion information candidate ranking unit 168 will be described. FIG. 40 is an explanatory diagram of the operation of the explicit combined motion information candidate sorting unit 168. First, it is checked whether the predicted block size type is 2N × N (S220). If the prediction block size type is 2N×N (Y of S220), it is checked whether it is the prediction block 0 (S221). If the predicted block size type is not 2N×N (N of S220), the processing ends. If it is the prediction block 0 (Y of S221), the motion information of the candidate block B is regarded as a dominant combined motion information candidate and moved to the beginning of the combined motion information candidate list. Check if it is predicted block 0 (S221). If block 0 is not predicted (N of S221), the process ends.

Explain that the explicit combined motion information candidate is moved to the beginning of the combined motion information candidate list. Fig. 41 is a diagram for clearly combining motion information candidates, and it is assumed that the candidate candidate block B is an example of explicit combined motion information candidates. Figure 41 shows that the coding block is 16 × 16 and the prediction block The space of size type 2N×N is combined with the position of the motion information candidate block. Here, when the prediction block sizes of the candidate block B and the candidate block A are both 4×4, the connection with the prediction block 0 (the portion of the adjacent side) is between the prediction block A and the prediction block B. Medium long. On the other hand, the candidate block B is a part of the prediction block B' of the prediction block size 16×16, and the candidate block A is a part of the prediction block A′ of the prediction block size 16×16, The connection with the prediction block 0 (the portion of the edge that is connected) is longer than the prediction block A' of the prediction block B', and the correlation between the prediction block 0 and the candidate block B is compared with the prediction block 0 and The correlation of candidate block A is also high. In addition, if the prediction block size type is 2N×N and is the prediction block 0, since the candidate block B is located outside the coding block, it cannot be a recessive combined motion information candidate.

In this way, the explicit combined motion information candidate ranking unit 168 is based on the prediction block size type (segment type) of the prediction block of the encoding target and the position of the prediction block of the encoding target in the encoding block, and the encoding object The combined motion information candidate of the adjacent block whose prediction block is connected is longer than the other candidate, and is selected as the dominant combined motion information candidate.

As described above, based on the predicted block size type and the position of the predicted block, the candidate block having a longer connection with the predicted block is moved to the beginning of the combined motion information candidate list as a dominant combined motion information candidate. By assigning a combined index with a shorter encoding length, the encoding efficiency can be improved.

(effect description)

The effects of the motion picture coding apparatus and the motion picture decoding apparatus according to the fifth embodiment of the present invention will be described. Fig. 42 is an explanatory view showing an effect of the fifth embodiment of the present invention. Here, it is assumed that the candidate block A, the candidate block B, the candidate block C, the candidate block E, and the candidate block T are registered in the combined motion information candidate list. Assume that merge index 0 (candidate block A), merge index 1 (candidate block B), merge index 2 (candidate block C), merge index 3 (candidate block E), merge index 4 (wait block T) The selection probability is 25%, 35%, 14%, 12%, 12%. At this time, although the calculation formula is omitted, the expected value of the code length of the merge index before sorting is 2.33 bits. On the other hand, the expected value of the code length of the merged index after the sorting of the explicit combined motion information candidates of the fifth embodiment is 2.23 bits. Therefore, the expected value of the coded length of the sorted merged index is shorter by 0.1 bits, and it is known that the coding efficiency is improved.

The coded stream of the video stream output by the motion picture coding apparatus according to the embodiment described above has a specific data format corresponding to the motion picture coding in order to be decoded in accordance with the coding method used in the embodiment. The dynamic video decoding device of the device can decode the encoded stream of this particular data format.

When a video or wireless network is used between the motion picture coding apparatus and the motion picture decoding apparatus to receive the code stream, the code stream can be converted into a data format suitable for the transmission mode of the communication path. In this case, a dynamic image transmitting device that converts the encoded stream outputted by the motion image encoding device into encoded data suitable for the transmission form of the communication path and then transmits it to the network, and the slave network are provided. Connect The encoded image data is recovered and converted into a coded stream and supplied to the motion picture receiving device of the motion picture decoding device.

The motion picture transmitting device includes a memory that buffers a coded stream output by the motion picture coding device, a packet processing unit that encapsulates the coded stream, and transmits the encapsulated coded data through the network. The transmitting unit that sends the message. The motion picture receiving device includes a receiving unit that receives the encoded encoded data through the network, a memory that buffers the received encoded data, and encodes the encoded data to generate a code. The stream is streamed and supplied to a packet processing unit of the motion picture decoding device.

The above processing for encoding and decoding can be implemented by means of hardware, transmission, accumulation, and receiving device. Of course, it can also be stored in ROM (read only memory) or flash memory. The firmware, or software such as a computer, is implemented. The firmware program and software program can also be recorded on a readable recording medium such as a computer, or can be provided from a server through a wired or wireless network, or can be broadcast by means of a surface wave or satellite digital broadcast. Come and provide it.

The present invention has been described above based on the embodiments. The embodiments are exemplified, and there are various possible modifications in the combinations of these constituent elements or processing programs, and these modifications are also within the scope of the invention and can be understood by the practitioner.

[Possibility of industrial use]

The invention can be utilized to exercise the motion compensation prediction Dynamic image coding technology for encoding information.

100‧‧‧Dynamic image coding device

101‧‧‧Predicted Block Image Acquisition Department

102‧‧‧Reduction Department

103‧‧‧Predictive Error Coding Section

104‧‧‧Code Column Generation Department

105‧‧‧Predictive Error Decoding Unit

106‧‧‧Sports Compensation Department

107‧‧‧Additional Department

108‧‧‧Sport Vector Detection Department

109‧‧‧Sports Information Generation Department

110‧‧‧Characteristic memory

111‧‧‧Sports information memory

120‧‧‧Predictive Vector Mode Decision Department

121‧‧‧Combined Mode Decision Department

122‧‧‧Predictive coding mode decision

130‧‧‧ Forecast vector candidate list generation unit

131‧‧‧ Forecast Vector Decision Department

140‧‧‧Combined sports information candidate list generation unit

141‧‧‧Combined with the Sports Information Selection Department

160‧‧‧ Space combined with sports information candidate generation

161‧‧‧Time combined with sports information candidate generation department

162‧‧‧Recessive combined sports information waiting list

163‧‧‧ lengthy combined with the Sports Information Alternate Removal Department

164‧‧‧1st combined sports information candidate supplement

165‧‧‧2nd Combined Sports Information Supplementary Supplement

166‧‧‧Invisible combined sports information candidate additional department

167‧‧‧Invisible combined sports information candidate deletion department

168‧‧‧ Explicit combined motion information candidate ranking

200‧‧‧Dynamic image decoding device

201‧‧‧Code Column Analysis Department

202‧‧‧Predictive Error Decoding Department

203‧‧‧Additional Department

204‧‧‧Sports Information Recycling Department

205‧‧‧Sports Compensation Department

206‧‧‧Characteristic memory

207‧‧‧Sports information memory

210‧‧‧Code Mode Judgment Department

211‧‧‧Sports Vector Reproduction Department

212‧‧‧Combined with the Ministry of Sports Information Regeneration

230‧‧‧Combined sports information candidate list generation unit

231‧‧‧Combined with the Sports Information Selection Department

Fig. 1 (a) and (b) are explanatory views of coding blocks.

[Fig. 2] Fig. 2 (a) to (d) are explanatory diagrams of prediction block size types.

[Fig. 3] An explanatory diagram of a prediction block size type.

FIG. 4 is an explanatory diagram of a prediction encoding mode.

[Fig. 5] An explanatory diagram of a relationship between a merged index and a coded column.

[Fig. 6] An explanatory diagram of an example of a syntax of a prediction block.

Fig. 7 is a view showing the configuration of a motion picture coding apparatus according to the first embodiment.

FIG. 8 is a view showing a configuration of a motion information generating unit of FIG. 7. FIG.

FIG. 9 is an explanatory diagram of a configuration of a merge mode determining unit of FIG. 8. FIG.

FIG. 10 is a diagram showing adjacent blocks of a prediction block of a processing target when the prediction block size of the processing target is 16 pixels×16 pixels.

[Fig. 11] A block diagram of a block in a prediction block on a ColPic located at the same position as a prediction block of a processing target when the prediction block size of the processing target is 16 pixels × 16 pixels, and a peripheral block thereof.

FIG. 12 is an explanatory diagram of a configuration of a combined motion information candidate list generating unit of FIG. 9. FIG.

FIG. 13 is a flowchart of the operation of the combined motion information candidate list generating unit of FIG. 9.

[Fig. 14] The action of the spatial combined motion information candidate generation unit of Fig. 12 The description uses a flow chart.

FIG. 15 is a flowchart for explaining the operation of the time combined motion information candidate generating unit of FIG.

FIG. 16 is a flow chart for explaining the operation of the recessive combined motion information candidate sorting unit of FIG.

[Fig. 17] Fig. 17 (a) to (d) are explanatory diagrams of implicit combined motion information candidates.

FIG. 18 is a flowchart for explaining the determination process of the implicit combined motion information candidate.

FIG. 19 is a flowchart showing the operation of the first combined motion information candidate supplementing unit of FIG.

FIG. 20 is a flowchart showing the operation of the second combined motion information candidate supplementing unit of FIG.

Fig. 21 is a diagram showing the configuration of a video decoding device according to the first embodiment.

Fig. 22 is a diagram showing the configuration of a motion information reproducing unit of Fig. 21;

Fig. 23 is a view showing the configuration of a combined motion information reproducing unit of Fig. 22;

Fig. 24 is an explanatory diagram showing an effect of the first embodiment.

[Fig. 25] Fig. 25 is an explanatory diagram showing a configuration of a combined motion information candidate list generating unit in the second embodiment.

FIG. 26 is an explanatory diagram of an operation of the combined motion information candidate list generating unit in the second embodiment.

Fig. 27 is an explanatory diagram showing an effect of the second embodiment.

28] The combined motion information candidate list generating unit of the third embodiment An explanatory diagram of the composition.

FIG. 29 is an explanatory diagram of an operation of the combined motion information candidate list generating unit in the third embodiment.

FIG. 30 is an explanatory diagram of an operation of the space combined motion information candidate generation unit in the third embodiment.

FIG. 31 is an explanatory diagram of an operation of the recessive combined motion information candidate adding unit of FIG. 28.

Fig. 32 is an explanatory diagram showing an effect of the third embodiment.

[Fig. 33] An explanatory diagram of a configuration of a combined motion information candidate list generating unit in the fourth embodiment.

[Fig. 34] An explanatory diagram of the operation of the combined motion information candidate list generating unit in the fourth embodiment.

FIG. 35 is an explanatory diagram of an operation of the recessive combined motion information candidate deletion unit of FIG. 33.

FIG. 36 is an explanatory diagram of an operation of the recessive combined motion information candidate deletion unit in the modification of the fourth embodiment.

[Fig. 37] An explanatory diagram of the repeated combined motion information candidate.

FIG. 38 is an explanatory diagram showing a configuration of a combined motion information candidate list generating unit in the fifth embodiment.

FIG. 39 is an explanatory diagram of an operation of the combined motion information candidate list generating unit in the fifth embodiment.

40 is an explanatory diagram of an operation of the explicit combined motion information candidate sorting unit of FIG. 38.

[Fig. 41] An explanatory diagram of a dominant combined motion information candidate.

Fig. 42 is an explanatory diagram showing an effect of the fifth embodiment.

[Fig. 43] An explanatory diagram of the relationship between the number of combined inspections and the combined motion information candidate M and the combined motion information candidate N.

12,14,15,17‧‧‧terminal

121‧‧‧Combined Mode Decision Department

140‧‧‧Combined sports information candidate list generation unit

141‧‧‧Combined with the Sports Information Selection Department

Claims (14)

A motion picture coding apparatus is a motion picture coding apparatus that divides a coding block into one or a plurality of prediction blocks and performs motion compensation prediction to encode a motion picture based on a division type, and is characterized in that: The part is selected from the complex prediction block adjacent to the prediction block of the coding target, and the motion information including the information of the motion vector and the information of the reference image is selected as a valid coded prediction block, and the pre-recording is selected. The motion information of the encoded prediction block is regarded as a selection candidate; and the invalidation unit is based on the division type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block. The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and the candidate list generation unit generates a candidate list including the pre-selection candidate; The additional unit adds the motion information having the predetermined motion vector as a new selection candidate to the pre-record candidate. The list and the decision unit determine the motion information used in the motion compensation prediction of the prediction block of the preamble encoding object from the pre-recorded candidate list; and the coding unit is used to specify the pre-record in the pre-recorded candidate list. The information required for the determined sports information is encoded. A motion picture coding apparatus is a motion picture coding apparatus that performs motion compensation prediction by dividing a coding block into one or a plurality of prediction blocks based on a division type, and is characterized in that: The motion information candidate list generating unit is configured to regard the motion information of the encoded plural adjacent blocks adjacent to the prediction block of the encoding target as the combined motion information candidate required for the prediction block of the encoding target. Adding to the combined motion information candidate list, generating a pre-recorded motion information candidate list; and combining the motion information candidate sorting unit, the segmentation type based on the prediction block of the pre-coded object and the prediction block of the pre-coded object in the pre-coded block At the position, the specific combined motion information candidate included in the exercise information candidate list is selected, and the combined combined motion information candidate in the pre-recording is combined with the position in the motion information candidate list; and the combined sports information selection unit is The pre-recording combined with the motion information candidate list selects one combined motion information candidate, which is regarded as the motion information of the prediction block of the pre-recorded coding object; and the coding department, which is used to specify the pre-record in the pre-recorded combined motion information candidate list. The index required to combine the motion information candidates is selected and encoded. A motion picture coding method belongs to a motion picture coding method for performing motion compensation prediction to encode a motion picture by dividing a coding block into one or a plurality of prediction blocks based on a segmentation type, and is characterized in that: Step: selecting, from the complex prediction block adjacent to the prediction block of the coding object, the motion information including the information of the motion vector and the information of the reference image as a valid coded prediction block, and selecting the pre-recorded block The motion information of the encoded prediction block is regarded as a candidate for selection; and The invalidation step is based on the division type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block, and the complex prediction block adjacent to the prediction block of the pre-coded object The motion information of the specific prediction block is not regarded as the pre-selection candidate; and the candidate list generation step is to generate a candidate list including the pre-selection candidate; and the appending step is to perform the motion information of the predetermined motion vector. The new selection candidate is added to the predecessor list; and the decision step determines the motion information in the motion compensation prediction of the prediction block used in the preamble encoding object from the predecessor list; and the encoding step is The information required to specify the motion information that has been determined in the pre-recorded list is encoded. A motion picture coding program belongs to a motion picture coding program for dividing a coding block into one or a plurality of prediction blocks based on a segmentation type and performing motion compensation prediction to encode a motion picture, wherein the computer performs: The candidate derivation step selects, from the complex prediction block adjacent to the prediction block of the coding target, the motion information including the information of the motion vector and the information of the reference image as a valid coded prediction block, and the pre-record Selecting the motion information of the encoded prediction block is regarded as a selection candidate; and the invalidation step is based on the division type of the prediction block of the pre-coded object and the position of the prediction block of the pre-coded object in the pre-coded block And the motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and The candidate list generating step generates a candidate list including the pre-selection candidates; and an adding step of adding the motion information having the predetermined predetermined motion vector to the pre-recorded candidate list as the new selection candidate; and the determining step From the candidate list, the motion information in the motion compensation prediction of the prediction block used in the preamble coding object is determined; and the coding step is used to specify the motion information that has been determined in the pre-recorded candidate list. Information, to be encoded. A transmitting apparatus comprising: a packet processing unit that encapsulates a coded stream to obtain coded data, wherein the coded stream is divided into one or a plurality of code blocks based on a split type The motion picture coding method for predicting the block and performing motion compensation prediction to encode the motion picture is encoded; and the transmission unit is to transmit the coded data before being encapsulated; the pre-recorded motion picture coding method is The method includes: a candidate derivation step of selecting, from the complex prediction block adjacent to the prediction block of the coding target, the motion information including the information of the motion vector and the information of the reference image as a valid coded prediction block, The motion information of the coded prediction block selected by the pre-recording is regarded as a selection candidate; and the invalidation step is based on the segmentation type of the prediction block of the pre-coded object and the prediction block of the pre-coded object in the pre-coded block Position, in the complex prediction block adjacent to the prediction block of the pre-coded object The motion information of the specific prediction block is not regarded as the pre-selection candidate; and the candidate list generation step is to generate a candidate list including the pre-selection candidate; and the appending step is to perform the motion information of the predetermined motion vector. The new selection candidate is added to the predecessor list; and the decision step determines the motion information in the motion compensation prediction of the prediction block used in the preamble encoding object from the predecessor list; and the encoding step is The information required to specify the motion information that has been determined in the pre-recorded list is encoded. A method for transmitting a packet, comprising: a packet processing step of packetizing a coded stream to obtain coded data, wherein the coded stream is divided into one or plural numbers based on a segmentation type a motion picture prediction method for predicting a block to perform motion compensation prediction to encode a motion picture; and a transmission step of transmitting a coded data before being packetized; a pre-recorded motion picture coding method The method includes: a candidate derivation step of selecting, from the complex prediction block adjacent to the prediction block of the coding target, the motion information including the information of the motion vector and the information of the reference image as a valid coded prediction block, The motion information of the coded prediction block selected by the pre-recording is regarded as a selection candidate; and the invalidation step is based on the segmentation type of the prediction block of the pre-coded object and the prediction block of the pre-coded object in the pre-coded block Position The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and the candidate list generation step is to generate a candidate including the pre-selection candidate a list; and an appending step of adding a motion information having a predetermined motion vector as a new selection candidate to the predecessor list; and a determining step of determining a pre-coding object from the pre-recorded list The motion information in the motion compensated prediction of the prediction block; and the encoding step is used to encode the information required to specify the motion information that has been determined in the pre-recorded candidate list. A sending program, characterized in that the computer executes: a packet processing step of packetizing a coded stream to obtain coded data, wherein the coded stream is divided into 1 or 1 based on the type of segmentation a plurality of prediction blocks for performing motion compensation prediction to encode a motion picture coding method for encoding a motion picture; and a transmission step of transmitting a coded data before being packetized; pre-recording motion picture coding The method has a candidate derivation step of selecting a motion prediction information including information of a motion vector and information of a reference image from a complex prediction block adjacent to a prediction block of the coding target as a valid coded prediction region. Block, the motion information of the coded prediction block selected by the pre-record is regarded as a selection candidate; and the invalidation step is based on the segmentation type of the prediction block of the pre-coded object and the prediction block of the pre-coded object in the pre-coded area Position within the block The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-coded object is not regarded as a pre-selection candidate; and the candidate list generation step is to generate a candidate including the pre-selection candidate a list; and an appending step of adding a motion information having a predetermined motion vector as a new selection candidate to the predecessor list; and a determining step of determining a pre-coding object from the pre-recorded list The motion information in the motion compensated prediction of the prediction block; and the encoding step is used to encode the information required to specify the motion information that has been determined in the pre-recorded candidate list. A motion picture decoding apparatus belongs to a motion picture decoding apparatus that performs motion compensation prediction by dividing a decoding block into one or a plurality of prediction blocks based on a division type, and decoding a coded stream of a motion picture, wherein The candidate derivation unit selects, from the complex prediction block adjacent to the prediction block to be decoded, the motion information including the information of the motion vector and the information of the reference image as valid decoded prediction blocks. The motion information of the decoded prediction block selected as the pre-selection is regarded as a selection candidate; and the invalidation unit is based on the segmentation type of the prediction block of the pre-decoded object and the prediction block of the pre-decoded object in the pre-decode block The position information is not regarded as a pre-selection candidate for the motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decoded object; and the candidate list generation unit generates the candidate with the pre-selection candidate Waiting list; and The additional unit adds the motion information having the predetermined motion vector as a new selection candidate to the predecessor list, and the code column analysis unit decodes the information indicating the position in the predecessor list. And the selection unit selects, based on the information indicating the position before decoding, the motion information used in the motion compensation prediction of the prediction block of the pre-recording target from the previous candidate list. A motion picture decoding apparatus is a motion picture decoding apparatus that performs motion compensation prediction by dividing a decoding block into one or a plurality of prediction blocks based on a division type, and is characterized in that: a decoding unit is used for Combining the coded column in which the index required for combining the motion information candidate is specified in the motion information candidate list, the preamble index is decoded; and the combined motion information candidate list generating unit is adjacent to the prediction block of the decoding target. The motion information of the decoded plurality of adjacent blocks is regarded as a combined motion information candidate required for the prediction block of the decoding object, added to the combined motion information candidate list, and generates a pre-recorded motion information candidate list; and combined motion The information candidate sorting unit selects a specific combined motion included in the pre-recorded motion information candidate list based on the segmentation type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block. Information candidate, change before the specific combination of sports information candidates in the foreword combined with sports information candidates The location within the list; and the combined sports information selection department, based on the pre-recorded index One combined motion information candidate is selected in the motion information candidate list, and is regarded as motion information of the prediction block of the pre-recorded decoding target. A dynamic image decoding method is a dynamic image decoding method for decoding a coded stream of a moving image by dividing a decoded block into one or a plurality of prediction blocks based on a segmentation type, and performing motion compensation prediction. The method includes: a candidate derivation step of selecting, from the complex prediction block adjacent to the prediction block of the decoding target, the motion information including the information of the motion vector and the information of the reference image as valid decoded prediction blocks, The motion information of the decoded prediction block selected as the pre-selection is regarded as a selection candidate; and the invalidation step is based on the segmentation type of the prediction block of the pre-decoded object and the prediction block of the pre-decoded object in the pre-decode block The position information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decoded object is not regarded as a pre-selection candidate; and the candidate list generation step generates a candidate with a pre-selection candidate a candidate list; and an additional step of treating the motion information having the predetermined motion vector as a new selection Complementing and adding to the predecessor list; and the coding column parsing step, decoding the information indicating the position in the predecessor list; and selecting the step based on the information indicating the position before decoding, from the predecessor list The motion information used in the motion compensation prediction of the prediction block of the pre-recorded decoding object is selected. A dynamic image decoding program belongs to a type based on segmentation A motion picture decoding program that divides a decoding block into one or a plurality of prediction blocks to perform motion compensation prediction, and decodes the encoded stream of the motion picture, and is characterized in that the computer executes: the candidate extraction step is performed from the decoding target In the complex prediction block adjacent to the prediction block, the motion information including the information of the motion vector and the information of the reference image is selected as a valid decoded prediction block, and the decoded prediction block selected in the foregoing is selected. The motion information is regarded as a selection candidate; and the invalidation step is based on the division type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block, and the prediction area of the pre-decoded object The motion information of the specific prediction block in the complex prediction block adjacent to the block is not regarded as a pre-selection candidate; and the candidate list generation step is to generate a candidate list including the pre-selection candidate; and an additional step, the system will have The motion information of the predetermined motion vector set in advance is regarded as a new selection candidate and added to the predecessor list; and the code column analysis The step of decoding the information indicating the position in the pre-recorded list; and the selecting step is based on the information indicating the position before decoding, and is selected from the pre-recorded list, and is used for the prediction block of the pre-decoded object. The motion information in the motion compensation prediction. A receiving device belongs to a receiving device that divides a decoding block into one or a plurality of prediction blocks and performs motion compensation prediction for decoding processing in the encoded stream of the received moving image. ,have: The receiving unit is a coded data obtained by packetizing a coded stream of a moving image encoded by motion compensation prediction by dividing a coded block into one or a plurality of prediction blocks based on a division type. And a restoring unit that performs packet processing on the received preamble encoded data to restore the original encoded stream; and the candidate deriving unit is a complex predictive block adjacent to the predicted block of the decoding target The motion information including the information of the motion vector and the information of the reference image is selected as a valid decoded prediction block, and the motion information of the decoded prediction block selected by the pre-record is regarded as a selection candidate; and invalidation The part is based on the partition type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block, and the specific prediction block adjacent to the prediction block of the pre-decoded object The motion information of the prediction block is not regarded as a pre-selection candidate; and the candidate list generation unit generates a candidate list including the pre-selection candidate; and an additional unit The motion information having the predetermined motion vector specified in advance is added to the pre-recorded list as a new selection candidate; and the coded column analysis unit decodes the encoded stream from the restored list in the pre-recorded candidate list. The information of the position; and the selection unit selects, based on the information indicating the position before decoding, the motion information used in the motion compensation prediction of the prediction block of the pre-decoded object from the previous candidate list. A receiving method belongs to a coded stream of a received moving image, and the decoding block is divided into one or a plurality of prediction blocks. A receiving method for performing motion decoding prediction on a line motion compensation, characterized in that: a receiving step is performed by dividing a coding block into one or a plurality of prediction blocks based on a division type and performing motion compensation prediction coding. The encoded data of the encoded stream of the generated moving image is received and received; and the restoring step is to packetize the received pre-encoded data to recover the original encoded stream; and the candidate The deriving step selects, from the complex prediction block adjacent to the prediction block of the decoding target, the motion information including the information of the motion vector and the information of the reference image as valid decoded prediction blocks, and selects the pre-recording The motion information of the decoded prediction block is regarded as a selection candidate; and the invalidation step is based on the division type of the prediction block of the pre-decoded object and the position of the prediction block of the pre-decoded object in the pre-decode block. The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decoded object is not regarded as a pre-selection candidate; And the candidate list generation step of generating a candidate list including the pre-selection candidates; and an appending step of adding the motion information having the predetermined motion vector as a new selection candidate to the pre-recorded candidate list; and coding column analysis The step of decoding the information indicating the position in the predecessor list from the reconstructed encoded stream; and selecting the step based on the information indicating the position before decoding, selecting from the predecessor list, and using Predicted block of the predecoded object The motion information in the motion compensation prediction. A receiving program belongs to a receiving program for dividing a decoding block into one or a plurality of prediction blocks and performing motion compensation prediction for decoding processing in the encoded stream of the received moving image. And causing the computer to execute: the receiving step is to encode the encoded stream of the moving image encoded by the motion compensation prediction by dividing the coding block into one or a plurality of prediction blocks based on the division type. The encoded data is received; and the restoring step is to packetize the received pre-coded data to recover the original encoded stream; and the candidate deriving step is adjacent to the predicted block of the decoded object In the complex prediction block, the motion information including the information of the motion vector and the information of the reference image is selected as a valid decoded prediction block, and the motion information of the decoded prediction block selected by the pre-record is regarded as a selection. The candidate and the invalidation step are based on the segmentation type of the prediction block of the pre-decoded object and the prediction block of the pre-decoded object in the pre-decode block The motion information of the specific prediction block in the complex prediction block adjacent to the prediction block of the pre-decoded object is not regarded as a pre-selection candidate; and the candidate list generation step is to generate a candidate list including the pre-selection candidate And an additional step of adding motion information having a predetermined motion vector as a new selection candidate to the predecessor list; and encoding the column parsing step, decoding the encoded stream from the restored The information indicating the position in the predecessor list; and the selecting step is based on the information indicating the position before decoding, and is selected from the pre-recorded list, and used in the motion compensation prediction of the prediction block of the pre-decoded object. News.