Video encoding device, video encoding method, video encoding program, video decoding device, video decoding method, and video decoding program

Abstract

To provide a technique for improving encoding efficiency by performing block division suitable for image encoding and decoding.SOLUTION: An image encoding device includes: a block vector candidate derivation unit that derives block vector candidates for a processing target block of a processing target picture from encoding information that is stored in an encoding information storage memory; a selection unit that selects a selected block vector from the block vector candidates; and a reference position correction unit that, for a reference block that is to be referenced by the selected block vector, corrects a reference position for the reference block so that an inside of a referenceable region is referenced. On the basis of the reference position for the reference block, decoded pixels of the processing target picture are obtained from a decoded image memory as prediction values for the processing target block.SELECTED DRAWING: Figure 2

Description

[Technical field]

[0001] The present invention relates to an image encoding and decoding technique for dividing an image into blocks and performing prediction. [Background technology]

[0002] In image encoding and decoding, the image to be processed is divided into blocks, which are groups of a predetermined number of pixels. Divide into appropriate blocks and process in blocks. By appropriately setting the inter-frame prediction and frame prediction, the coding efficiency is improved. do.

[0003] In Patent Document 1, a prediction image is generated by using decoded pixels adjacent to the block to be coded or decoded. An intra prediction technique for obtaining an image is disclosed. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] JP 2009-246975 A Summary of the Invention [Problem to be solved by the invention]

[0005] However, the technology in Patent Document 1 does not use the decoded blocks adjacent to the block to be encoded or decoded. Only pixels are used for prediction, and prediction efficiency is poor. [Means for solving the problem]

[0006] In one aspect of the present invention for solving the above problem, a coding information storage memory stores a coding A block vector candidate of a processing target block in a processing target picture is derived from the information. a block vector candidate derivation unit for selecting a selected block vector from the block vector candidates; a selection unit for selecting a reference block to be referenced by the selected block vector; a reference position correction unit that corrects a reference position of the reference block so as to refer to the inside of the available area; a reference block for a decoded image in the current picture based on a reference position of the reference block; The prediction value of the target block is obtained from the decoded image memory unit. Effect of the Invention

[0007] According to the present invention, highly efficient image encoding / decoding processing can be realized with a low load. [Brief description of the drawings]

[0008] [Figure 1] 1 is a block diagram of an image encoding device according to an embodiment of the present invention. [Diagram 2] 1 is a block diagram of an image decoding device according to an embodiment of the present invention. [Diagram 3] 13 is a flowchart for explaining an operation of dividing a tree block. [Figure 4] FIG. 13 is a diagram showing how an input image is divided into tree blocks. [Diagram 5] FIG. 1 is a diagram illustrating a z-scan. [Figure 6A] FIG. 13 is a diagram showing the divided shapes of blocks. [Figure 6B] FIG. 13 is a diagram showing the divided shapes of blocks. [Figure 6C] FIG. 13 is a diagram showing the divided shapes of blocks. [Figure 6D] FIG. 13 is a diagram showing the divided shapes of blocks. [Figure 6E] FIG. 13 is a diagram showing the divided shapes of blocks. [Figure 7] 13 is a flowchart for explaining an operation of dividing a block into four. [Figure 8]13 is a flowchart for explaining an operation of dividing a block into two or three. [Figure 9] This is a syntax for expressing the shape of block division. [Figure 10A] FIG. 1 is a diagram illustrating intra prediction. [Figure 10B] FIG. 1 is a diagram illustrating intra prediction. [Figure 11] FIG. 13 is a diagram for explaining reference blocks for inter prediction. [Figure 12A] This is a syntax for expressing a coding block prediction mode. [Figure 12B] This is a syntax for expressing a coding block prediction mode. [Figure 13] FIG. 11 is a diagram showing the correspondence between syntax elements and modes relating to inter prediction. [Figure 14] FIG. 13 is a diagram for explaining affine transformation motion compensation of two control points. [Figure 15] FIG. 13 is a diagram for explaining affine transformation motion compensation of three control points. [Figure 16] FIG. 2 is a block diagram showing a detailed configuration of the inter prediction unit 102 in FIG. [Figure 17] 17 is a block diagram showing a detailed configuration of a normal predicted motion vector mode derivation unit 301 in FIG. 16. [Figure 18] 17 is a block diagram showing a detailed configuration of a normal merge mode derivation unit 302 in FIG. 16. [Figure 19] 17 is a flowchart for explaining a normal predicted motion vector mode derivation process of the normal predicted motion vector mode derivation unit 301 of FIG. 16. [Figure 20] 13 is a flowchart showing a processing procedure of a normal predicted motion vector mode derivation process. [Figure 21] 13 is a flowchart illustrating a processing procedure for a normal merge mode derivation process. [Figure 22] FIG. 3 is a block diagram showing a detailed configuration of an inter prediction unit 203 in FIG. 2. [Diagram 23]23 is a block diagram showing a detailed configuration of a normal predicted motion vector mode derivation unit 401 in FIG. 22. [Figure 24] 23 is a block diagram showing a detailed configuration of a normal merge mode derivation unit 402 in FIG. 22. [Diagram 25] 23 is a flowchart for explaining a normal predicted motion vector mode derivation process of the normal predicted motion vector mode derivation unit 401 in FIG. 22. [Figure 26] FIG. 13 is a diagram illustrating a procedure for initializing and updating a history motion vector predictor candidate list. [Figure 27] 13 is a flowchart of a procedure of a process of checking identical elements in the procedure of a process of initializing and updating a history motion vector predictor candidate list. [Figure 28] 13 is a flowchart of an element shifting process procedure in the history motion vector predictor candidate list initialization / update process procedure. [Figure 29] 13 is a flowchart illustrating a procedure of a process of deriving a history predicted motion vector candidate. [Diagram 30] 13 is a flowchart illustrating a history merging candidate derivation process procedure. [Figure 31A] FIG. 11 is a diagram for explaining an example of a history motion vector predictor candidate list update process. [Figure 31B] FIG. 11 is a diagram for explaining an example of a history motion vector predictor candidate list update process. [Figure 31C] FIG. 11 is a diagram for explaining an example of a history motion vector predictor candidate list update process. [Diagram 32] FIG. 13 is a diagram illustrating motion compensation prediction in the case of L0 prediction in which an L0 reference picture (RefL0Pic) is located at a time earlier than a current picture (CurPic). [Diagram 33] 13 is a diagram for explaining motion compensation prediction in the case where L0 prediction is performed and a reference picture for L0 prediction is located at a later time than the current picture to be processed. FIG. [Diagram 34]FIG. 1 is a diagram for explaining the prediction direction of motion compensation prediction in a bi-predictive case where a reference picture for L0 prediction is at a time earlier than a current picture to be processed and a reference picture for L1 prediction is at a time later than a current picture to be processed. [Diagram 35] 13 is a diagram for explaining the prediction direction of motion compensation prediction in bi-prediction where the reference picture for L0 prediction and the reference picture for L1 prediction are located at a time earlier than the current picture. FIG. [Diagram 36] 13 is a diagram for explaining the prediction direction of motion compensation prediction in bi-prediction where a reference picture for L0 prediction and a reference picture for L1 prediction are at a time later than the current picture. FIG. [Figure 37] 1 is a diagram illustrating an example of a hardware configuration of a coding / decoding device according to an embodiment of the present invention; [Figure 38] 13 is a flowchart illustrating an average merging candidate derivation process; [Figure 39A] FIG. 13 is a diagram illustrating a valid reference area for intra block copying. [Figure 39B] FIG. 13 is a diagram illustrating a valid reference area for intra block copying. [Diagram 40] 2 is a block diagram showing a detailed configuration of an intra prediction unit 103 in FIG. 1. [Diagram 41] 3 is a block diagram showing a detailed configuration of an intra prediction unit 204 in FIG. 2. [Diagram 42] FIG. 13 is a block diagram of an intra block copy prediction unit 352. [Diagram 43] FIG. 13 is a block diagram of an intra block copy prediction unit 362. [Diagram 44] 13 is a flowchart illustrating a predictive intra block copy process of the intra block copy predictor 352. [Diagram 45] 13 is a flowchart illustrating a predictive intra block copy process of the intra block copy predictor 362. [Diagram 46] 13 is a flowchart illustrating a merge intra block copy process. [Figure 47]13 is a flowchart showing a processing procedure of a block vector mode derivation process for predictive intra block copy. [Figure 48] 13 is a diagram for explaining the processing of the reference position correction unit 380 and the reference position correction unit 480. FIG. [Figure 49] FIG. 13 is a diagram showing how a reference position is corrected. [Figure 50A] 13 is a diagram illustrating the positions of the top left and bottom right when the referenceable area is rectangular. FIG. [Figure 50B] 13 is a diagram illustrating the positions of the top left and bottom right when the referenceable area is rectangular. FIG. [Figure 50C] 13 is a diagram illustrating the positions of the top left and bottom right when the referenceable area is rectangular. FIG. [Figure 50D] 13 is a diagram illustrating the positions of the top left and bottom right when the referenceable area is rectangular. FIG. [Figure 51] 13A and 13B are diagrams illustrating a process for correcting the reference position of a portion where the referenceable area is not rectangular. [Figure 52A] FIG. 13 is a diagram showing how a reference position is corrected. [Figure 52B] FIG. 13 is a diagram showing how a reference position is corrected. [Diagram 53] 13 is a diagram for explaining the processing of the reference position correction unit 380 and the reference position correction unit 480. FIG. [Figure 54A] FIG. 13 is a diagram for explaining how a referenceable area is decomposed into two. [Figure 54B] FIG. 13 is a diagram for explaining how a referenceable area is decomposed into two. [Fig. 54C] FIG. 13 is a diagram for explaining how a referenceable area is decomposed into two. [Fig. 54D] FIG. 13 is a diagram for explaining how a referenceable area is decomposed into two. [Figure 55] FIG. 13 is a diagram illustrating a process of dividing a referenceable area into two and correcting the reference position of each. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] The technologies and technical terms used in this embodiment will be defined below.

[0010] <Tree Block> In this embodiment, the image to be encoded / decoded is divided equally into a predetermined size. In Figure 4, the size of the tree block is 128x128 pixels. However, the size of the tree block is not limited to this and can be any size. The processing target (the encoding target in the encoding process, and the decoding target in the decoding process) may be set. The tree blocks of the tree are sorted in raster scan order, i.e., from left to right and from top to bottom. The order is as follows: Inside each tree block, further recursive partitioning is possible. After recursively dividing the tree block, the block to be coded and decoded is called the coding block. In addition, the tree block and the coding block are collectively defined as blocks. By dividing the blocks appropriately, efficient coding becomes possible. The size of the code can be a fixed value previously agreed upon between the coding device and the decoding device, or The size of the tree block determined by the encoding device may be transmitted to the decoding device. Here, the maximum size of the tree block is set to 128x128 pixels, and the tree block size is set to The minimum size of the coding block is 16x16 pixels. The maximum size of the coding block is 64x64. The minimum size of a pixel,coding block is set to 4x4 pixels.

[0011] <Prediction mode> An image prediction algorithm that predicts the processed image signal of the image to be processed on a per-block basis. Inter prediction (MODE_INTRA), which predicts from the image signal of the processed image, and Inter prediction (MODE_M DE_INTER).

[0012] In the coding process, a processed image is an image obtained by decoded a signal that has been coded. It is used for codes, tree blocks, blocks, coding blocks, etc., and in the decoding process, is used for completed images, image signals, tree blocks, blocks, coding blocks, etc. .

[0013] This predicts the mode to distinguish between intra prediction (MODE_INTRA) and inter prediction (MODE_INTER). The prediction mode (PredMode) is defined as the intra prediction (MODE_INTRA ), or inter prediction (MODE_INTER).

[0014] <Intra Block Copy Prediction> Intra block copy prediction is a method for decoding a picture to be processed. This is a process of encoding / decoding a target block by referring to previously encoded pixels as predicted values. The distance from the processing target block to the reference pixel is expressed by a block vector. The block vector refers to the picture to be processed, and the reference picture is uniquely determined. The difference between block vectors and motion vectors is that the picture they refer to is The block vector is either a current picture or a processed picture. Using the multi-pixel resolution (AMVR), you can select either 1-pixel or 4-pixel accuracy.

[0015] Intra block copy supports predictive intra block copy mode and merge intra block copy mode. Two block copy modes are available.

[0016] The predicted intra block copy mode uses predicted block vectors derived from previously processed information. A model that determines the block vector of the target block from the difference block vector and the The prediction block vector is the same as the processed block adjacent to the current block. , derived from an index for identifying a prediction block vector. The index for identifying the vector and the difference block vector are transmitted in the bit stream. do.

[0017] The merge intra block copy mode does not transmit differential motion vectors, but The intra block copy prediction information of the processed blocks adjacent to the block is used to determine the intra block copy prediction information of the processed blocks. This is a mode for deriving intra block copy prediction information for a block.

[0018] <Inter Prediction> Inter-prediction, which predicts from the image signal of a processed image, refers to multiple processed images. It can be used as a reference picture. To manage multiple reference pictures, L0 (reference link) Two types of reference lists, L0 (reference list 0) and L1 (reference list 1), are defined, and the reference indexes are The L0 prediction (Pred_L0) is available for P slices. For B slices, L0 prediction (Pred_L0), L1 prediction (Pred_L1), and bi-prediction (Pred_BI ) is available. L0 prediction (Pred_L0) refers to the reference picture managed by L0. Inter prediction is used to predict the frame rate of a frame, and L1 prediction (Pred_L1) uses a reference picture managed by L1. This is the inter prediction to refer to. Bi-prediction (Pred_BI) is performed with both L0 prediction and L1 prediction, Inter prediction refers to one reference picture managed in L0 and one in L1. Information specifying L0 prediction, L1 prediction, and bi-prediction is defined as an inter prediction mode. In the following processing, the constants and variables with the subscript LX in the output are L0, L1 It is assumed that processing is performed for each

[0019] <Predictive motion vector mode> The predicted motion vector mode is an index for specifying a predicted motion vector, Transmits the inter prediction vector, inter prediction mode, and reference index, and the index of the block to be processed. The predicted motion vector is determined based on the motion vector of the block adjacent to the current block. A processed block that belongs to the same image as the target block, or a block that belongs to the processed image and has the same position as the target block A candidate predicted motion vector is derived from a block located at or near the block. The measured motion vector is derived from an index for identifying the measured motion vector.

[0020] <Merge mode> In the merge mode, the difference motion vector and reference index are not transmitted, and the target block is merged. The processed blocks adjacent to the block to be processed or blocks belonging to the processed image The inter prediction information of the block located at the same position as the block or in its vicinity (neighborhood) is used for processing. This is a mode for deriving inter prediction information for the current block.

[0021] The processed blocks adjacent to the block to be processed and the inter-blocks of the processed blocks The spatial merge candidate is defined as a block belonging to the processed image. Blocks that are in the same location as the block or in its vicinity (neighborhood), and the index of that block Inter prediction information derived from the super prediction information is defined as a temporal merge candidate. The complement is registered in the merge candidate list, and the prediction of the target block is determined by the merge index. Identify merge candidates to use in

[0022] <Adjacent block> FIG. 11 shows the procedure for deriving inter prediction information in the predicted motion vector mode and the merge mode. A0, A1, A2, B0, B1, B2, B3 is a processed block adjacent to the block to be processed. T0 is the processed image. The block belongs to the same position as the processing target block in the processing target image or its vicinity ( It is a block located in the neighborhood.

[0023] A1 and A2 are located to the left of the coding block to be processed and are adjacent to the coding block to be processed. B1 and B3 are adjacent blocks located above the coding block to be processed. A0, B0, and B2 are the blocks adjacent to the target coding block. These are the blocks located at the bottom left, top right, and top left of the encryption block.

[0024] Details of how adjacent blocks are treated in predictive motion vector mode and merge mode The details will be described later.

[0025] <Affine transformation motion compensation> In the affine transformation motion compensation, a coding block is divided into sub-blocks of a predetermined unit, and the divided sub-blocks are The motion vector is determined individually for each sub-block and motion compensation is performed. The motion vector of each sub-block is determined based on the processed blocks adjacent to the current block, or is a block that belongs to the processed image and is located at the same position as the block to be processed or in its vicinity (neighborhood) based on one or more control points derived from inter prediction information of a block located at In this embodiment, the size of the sub-block is set to 4x4 pixels. The size is not limited to this, and the motion vector may be derived on a pixel-by-pixel basis.

[0026] FIG. 14 shows an example of affine transformation motion compensation for two control points. A control point has two parameters, a horizontal component and a vertical component. Therefore, The affine transformation in these two cases is called a four-parameter affine transformation. CP2 is the control point.

[0027] FIG. 15 shows an example of affine transformation motion compensation for three control points. A control point has two parameters, a horizontal component and a vertical component. Therefore, The affine transformation in the three cases is called a six-parameter affine transformation. CP2 and CP3 are control points.

[0028] Affine transformation motion compensation is available in both the predicted motion vector mode and the merge mode. It is also available in the predictive motion vector mode. The mode in which the affine transformation is performed is defined as the subblock prediction motion vector mode, and the merge mode is A mode in which motion compensation is applied is defined as a sub-block merging mode.

[0029] <Syntax of coding block> The prediction mode of the coding block is represented using FIG. 12A, FIG. 12B, and FIG. 13. The syntax for this will be described. The pred_mode_flag in FIG. 12A indicates whether or not inter prediction is performed. If pred_mode_flag is 0, it is inter prediction, and if pred_mode_flag is 1, it is In the case of intra prediction, intra block copy prediction is used. The flag pred_mode_ibc_flag indicates whether intra block copy prediction is enabled. If the merge mode is set to 1 (pred_mode_ibc_flag=1), the merge_flag is sent. A flag indicating whether to use the block copy mode or the predicted intra block copy mode. If the merge intra block copy mode is selected (merge_flag=1), the merge Send index merge_idx. If it is not an intra block copy prediction (pred_mode_ibc _flag=0), normal intra prediction is used, and normal intra prediction information intra_pred_mode is sent.

[0030] In the case of inter prediction, merge_flag is sent. merge_flag is either merge mode or pre-prediction mode. This is a flag indicating whether to use the predicted motion vector mode. rge_flag=0), a flag indicating whether to apply the sub-block prediction motion vector mode, Send r_affine_flag if sub-block prediction motion vector mode is applied (inter_affine ine_flag=1), send cu_affine_type_flag. cu_affine_type_flag is used for sub-block prediction. In motion vector mode, this is a flag to determine the number of control points.

[0031] On the other hand, in the case of merge mode (merge_flag=1), the merge_subblock_flag in FIG. 12B is sent. merge_subblock_flag is a flag that indicates whether to apply the subblock merge mode. In the case of subblock merge mode (merge_subblock_flag=1), the merge index If the subblock merge mode is not selected (merge_subblock_idx), lock_flag=0), and the flag merge_triangle_flag indicating whether to apply the triangle merge mode. If triangle merge mode is applied (merge_triangle_flag=1), the block is split. merge_triangle_split_dir and the direction of the split Send triangle indices merge_triangle_idx0, merge_triangle_idx1. If no mode is applied (merge_triangle_flag=0), the merge index merge_idx is sent. do.

[0032] Figure 13 shows the values ​​of each syntax element for inter prediction and the corresponding prediction modes. merge_flag=0,inter_affine_flag=0 indicates normal predicted motion vector mode (Inter Pr merge_flag=0,inter_affine_flag=1 corresponds to the sub-block prediction motion vector. Supports Inter Affine Mode. merge_flag=1,merge_subblock_flag=0, merge_trianlge_flag=0 corresponds to the normal merge mode. merge_flag=1, merge_subblock_flag=0,merge_trianlge_flag=1 is the triangle merge mode. Mode) merge_flag=1,merge_subblock_flag=1 corresponds to the subblock merge mode. (Affine Merge Mode) is supported.

[0033] <poc> POC (Picture Order Count) is a variable associated with the picture being coded. The value is set to a value that increases by 1 according to the picture output order. It can also determine whether a picture is the same as another picture, determine the order of pictures in the output, and For example, if two pictures have the same POC, we can calculate the distance between them. If the POCs of two pictures have different values, they are considered to be the same picture. If it does, the picture with the smaller POC value is determined to be the picture to be output first. The difference between the POCs of two pictures indicates the distance between the pictures along the time axis. (First embodiment) Regarding the image encoding device 100 and the image decoding device 200 according to the first embodiment of the present invention, He explains.

[0034] FIG. 1 is a block diagram of an image coding device 100 according to a first embodiment. The image encoding device 100 in this embodiment includes a block division unit 101, an inter prediction unit 102, an intra prediction unit 103, and an A prediction unit 103, a decoded image memory 104, a prediction method determination unit 105, a residual generation unit 106, and an orthogonal A transform / quantization unit 107, a bit string encoding unit 108, an inverse quantization / inverse orthogonal transformation unit 109, and a decoding unit 109. The image signal superimposing unit 110 and the encoded information storage memory 111 are provided.

[0035] The block division unit 101 recursively divides an input image to generate coding blocks. The block division unit 101 divides the blocks to be divided into horizontal and vertical blocks. The four divisions into which the blocks are divided and the direction in which the blocks are divided, either horizontally or vertically. The block division unit 101 processes the generated coding blocks. The image signal of the processing target coding block is input to the inter prediction unit. 102, the intra prediction unit 103, and the residual generation unit 106. The unit 101 supplies information indicating the determined recursive division structure to the bit string encoding unit 108. The detailed operation of the lock division unit 101 will be described later.

[0036] The inter prediction unit 102 performs inter prediction on the coding block to be processed. The measurement unit 102 receives the inter-prediction information stored in the encoded information storage memory 111 and the A plurality of inter-prediction information are obtained from the decoded image signal stored in the image memory 104. and selecting an appropriate inter prediction mode from among the derived candidates. and a prediction image signal according to the selected inter prediction mode. The inter prediction unit 102 supplies the prediction method to the prediction method determination unit 105. The detailed configuration and operation of the inter prediction unit 102 will be described later. .

[0037] The intra prediction unit 103 performs intra prediction on the coding block to be processed. The measurement unit 103 measures the decoded image signal stored in the decoded image memory 104 as a reference pixel. The coding information storage memory 111 stores the intra-prediction mode and other codes. A predicted image signal is generated by intra prediction based on the encoding information. The intra prediction unit 103 selects an appropriate intra prediction mode from among a plurality of intra prediction modes. Then, the selected intra prediction mode and a predicted image according to the selected intra prediction mode are The intra-prediction unit 103 supplies the image signal to a prediction method determination unit 105. The detailed configuration and operation of the intra-prediction unit 103 are described in This will be explained later.

[0038] The decoded image memory 104 stores the decoded image generated by the decoded image signal superimposing unit 110 . The decoded image memory 104 transfers the stored decoded images to the inter prediction unit 102 and the intra prediction unit 103. The measurement unit 103 supplies the signal.

[0039] The prediction method determination unit 105 determines the coding information for each of the intra prediction and the inter prediction. The evaluation is performed using the amount of coding information and residuals, the amount of distortion between the predicted image signal and the image signal to be processed, etc. In the case of intra prediction, the prediction method determination unit 10 5 is a bitstream encoding unit 1 which encodes intra prediction information such as an intra prediction mode as encoding information. In the case of the inter prediction merge mode, the prediction method determination unit 105 supplies the merge sub-block merge mode (sub-block merge flag) The inter prediction information such as the inter-frame coding information is supplied to the bit stream coding unit 108 as coding information. In the case of the predicted motion vector mode of the inter prediction, the prediction method determination unit 105 selects the inter prediction mode. code, predicted motion vector index, L0, L1 reference index, differential motion vector information indicating whether the mode is a sub-block predicted motion vector mode (sub-block predicted motion vector mode) The inter prediction information such as the bit stream (transform flag) is supplied to the bit stream coding unit 108 as coding information. Furthermore, the prediction method determination unit 105 stores the determined coding information in the coding information storage memory 11. The prediction method determination unit 105 outputs the residual signal to the residual generation unit 106 and the prediction image signal to the decoded image 1. The signal is supplied to the signal superimposing unit 110.

[0040] The residual generation unit 106 generates a residual by subtracting a predicted image signal from an image signal to be processed. The generated signal is supplied to the orthogonal transform and quantization unit 107.

[0041] The orthogonal transform and quantization unit 107 performs orthogonal transform and quantization on the residual in accordance with the quantization parameter. The residual is then subjected to orthogonal transformation and quantization, and the generated residual is then input to a bit string coding unit 10. 8 and the inverse quantization and inverse orthogonal transformation unit 109.

[0042] The bitstream coding unit 108 encodes the bitstream in units of sequences, pictures, slices, and coding blocks. In addition to the information, the prediction method determined by the prediction method determination unit 105 for each coding block is Specifically, the bit string coding unit 108 encodes the coding information according to the coding block. The prediction mode PredMode for each block is coded. If the prediction mode is inter prediction (MODE_INTER), In this case, the bitstream encoding unit 108 sets a flag for determining whether or not the merge mode is selected, merge flag, merge index if in merge mode, index if not in merge mode Prediction mode, predicted motion vector index, information on differential motion vector, Block prediction motion vector flags and other coding information (inter prediction information) are stored in a specified syntax. The first bitstream is encoded according to the bitstream syntax rules. When the bitstream is intra prediction (MODE_INTRA), the bitstream coding unit 108 performs intra block coding. The flag that determines whether the block is an intrablock or not is coded according to a specified syntax. For copy, the merge index if in merge mode, or the Prediction block vector index, differential block vector, and other coding information (intra prediction If it is not an intra block copy, the block size is coded according to the specified syntax. The encoding information (intra prediction information) such as intra prediction mode is stored according to the specified syntax. The above encoding process generates a first bit string. The orthogonal transform and quantized residual is converted into an entropy vector in accordance with a specified syntax. The bit string encoding unit 108 encodes the first bit string and The second bit stream is multiplexed according to a prescribed syntax to output a bit stream.

[0043] The inverse quantization and inverse orthogonal transformation unit 109 performs the orthogonal transformation supplied from the orthogonal transformation and quantization unit 107. The quantized residual is inversely quantized and inversely orthogonally transformed to calculate the residual, and the calculated residual is converted into a decoded image. The image signal is supplied to the image signal superimposing unit 110.

[0044] The decoded image signal superimposing unit 110 outputs a predicted image signal according to the determination by the prediction method determining unit 105. The residuals that have been inverse quantized and inverse orthogonally transformed by the inverse quantization and inverse orthogonal transformation unit 109 are superimposed to form a decoded image. The decoded image signal superimposing unit 110 generates a decoded image and stores it in the decoded image memory 104. The image is filtered to reduce block distortion and other distortions caused by coding. The decoded image may then be stored in the decoded image memory 104 .

[0045] The coding information storage memory 111 stores the prediction mode (inference mode) determined by the prediction method determination unit 105. In the case of inter prediction, the code is stored. The coding information stored in the coding information storage memory 111 includes the determined motion vector, the reference list, Inter prediction information such as L0 and L1 reference indexes, and historical prediction motion vector candidate list In the case of the merge mode of the inter prediction, the coding information storage memory 111 includes The encoded information to be stored includes the merge index, sub-block markers, and the above information. Inter prediction information is included, such as information indicating whether the sub-block is in the multi-mode or not (sub-block merge flag). In the case of the inter-prediction predicted motion vector mode, the coding information storage memory 111 The stored coding information includes the above information as well as inter prediction mode, predicted motion vector, etc. An index, a differential motion vector, and information indicating whether or not the sub-block prediction motion vector mode is used. It includes inter prediction information such as intra block prediction information (sub-block prediction motion vector flag). In the case of prediction, the coding information stored in the coding information storage memory 111 includes the determined input. The JPEG 2000 includes intra prediction information such as intra prediction mode.

[0046] FIG. 2 shows the configuration of an image decoding device according to an embodiment of the present invention, which corresponds to the image encoding device of FIG. The image decoding device according to the embodiment includes a bit stream decoding unit 201, a block diagram showing a configuration of the image decoding device. A block division unit 202, an inter prediction unit 203, an intra prediction unit 204, and an encoding information storage memory 205, an inverse quantization and inverse orthogonal transformation unit 206, a decoded image signal superimposition unit 207, and a decoded image memory unit 208. Equipped with 208 harpoons.

[0047] The decoding process of the image decoding device of FIG. 2 is performed by the decoding device provided inside the image encoding device of FIG. Since this corresponds to the processing, the coding information storage memory 205 in FIG. The configurations of the conversion unit 206, the decoded image signal superimposition unit 207, and the decoded image memory 208 are shown in FIG. The image encoding device includes an encoding information storage memory 111, an inverse quantization and inverse orthogonal transformation unit 109, and a decoding unit 114. The configurations of the decoded image signal superimposing unit 110 and the decoded image memory 104 and their corresponding functions has.

[0048] The bit stream supplied to the bit stream decoder 201 conforms to the prescribed syntax rules. The bit stream decoding unit 201 decodes the separated first bit stream and Sequence, picture, slice, coding block unit information, and coding block unit Specifically, the bit stream decoding unit 201 obtains the coding information by inter-coding the coding block unit. -Prediction mode PredMode that determines whether prediction is (MODE_INTER) or intra prediction (MODE_INTRA) When the prediction mode is inter prediction (MODE_INTER), the bitstream decoding unit 201 Flag to determine whether or not the mode is merged. If it is merged, the merge index and sub Block merge flag, Inter prediction mode if predictive motion vector mode, prediction Motion vector index, differential motion vector, sub-block predicted motion vector flag, etc. The coding information (inter prediction information) related to is decoded according to a specified syntax and coded Information (inter prediction information) is sent to the inter prediction unit 203 and the block division unit 202. The prediction mode is intra prediction (MODE_INTRA). In this case, the bitstream decoding unit 201 decodes a flag for determining whether or not the bitstream is an intra block copy. In the case of intra block copy, if merge mode is selected, the merge index and the If it is not a multi-mode, the prediction block vector index, difference block vector, etc. The encoding information (intra prediction information) is decoded according to a specified syntax. If the coding information is not a copy, specify the coding information (intra prediction information) such as the intra prediction mode. The above decoding process results in the encoded information (intra prediction information) via the inter prediction unit 203 or the intra prediction unit 204 and the block division unit 202. The bit stream decoding unit 201 outputs the second The bit string is decoded to calculate an orthogonally transformed and quantized residual, and the orthogonally transformed and quantized residual is The result is supplied to the inverse quantization and inverse orthogonal transformation unit 206.

[0049] The inter prediction unit 203 detects that the prediction mode PredMode of the coding block to be processed is inter When the prediction motion vector mode is set to prediction (MODE_INTER), the coding information storage memory 205 A plurality of predictive motion vectors are generated by using the coding information of the already decoded image signal stored in The motion vector predictor candidates are derived, and the derived motion vector predictor candidates are used as the motion vector predictor candidates described later. The inter prediction unit 203 registers the motion vector predicted candidate in the motion vector predicted candidate list. Among the multiple motion vector predictor candidates recorded in the bitstream, the bitstream decoder 201 decodes and supplies A motion vector predictor corresponding to the motion vector predictor index is selected, and a bit stream is decoded. A motion vector is calculated from the differential motion vector decoded by the unit 201 and the selected predicted motion vector. The calculated motion vector is stored in the coded information storage memory 205 together with other coded information. The coding information of the coding block to be supplied and stored here is the prediction mode PredMode , flags predFlagL0[xP][yP], predFlag indicating whether to use L0 prediction and L1 prediction L1[xP][yP], L0, L1 reference indices refIdxL0[xP][yP], refIdxL1[xP][yP], L0 , L1 motion vectors mvL0[xP][yP], mvL1[xP][yP], etc., where xP and yP are the The Prediction Mode PredMo is an index indicating the position of the top left pixel of the coding block in the Prediction Mode PredMo. When de is inter prediction (MODE_INTER) and the inter prediction mode is L0 prediction (Pred_L0) A flag predFlagL0 indicating whether to use L0 prediction is 1, and a flag predFlagL0 indicating whether to use L1 prediction is 2. The flag predFlagL1 indicating this is 0. When the inter prediction mode is L1 prediction (Pred_L1), The flag predFlagL0, which indicates whether to use L0 prediction, is set to 0, and the flag predFlagL0, which indicates whether to use L1 prediction, is set to 1. The flag predFlagL1 is set to 1. When the inter prediction mode is bi-prediction (Pred_BI), Flag indicating whether prediction is used. predFlag: Flag indicating whether L0, L1 prediction is used. predFlagL1 and predFlagL2 are both set to 1. Furthermore, the prediction mode PredMode of the coding block to be processed is Derives merge candidates when in merge mode with inter prediction (MODE_INTER). Using the coding information of the already decoded coding block stored in the storage memory 205 , multiple merge candidates are derived and registered in a merge candidate list described later. The merging candidates are decoded by the bitstream decoding unit 201 and supplied from among the multiple merging candidates registered in the Select a merging candidate corresponding to the merging index, and perform L0 prediction of the selected merging candidate. Flags predFlagL0[xP][yP], predFlagL1[xP][yP], and L0 , the reference indices of L1 refIdxL0[xP][yP], refIdxL1[xP][yP], the motion vectors of L0 and L1 Inter prediction information such as mvL0[xP][yP] and mvL1[xP][yP] is stored in the coding information storage memory 205. Here, xP and yP are the indices that indicate the position of the top left pixel of the coding block in the picture. The detailed configuration and operation of the inter prediction unit 203 will be described later.

[0050] The intra prediction unit 204 detects whether the prediction mode PredMode of the coding block to be processed is intra. In the case of prediction (MODE_INTRA), intra prediction is performed. The encoding information includes an intra-prediction mode. The intra-prediction unit 204 performs bitstream decoding. The decoded image memory 202 is generated according to the intra-prediction mode included in the encoded information decoded by the decoding unit 201. A predicted image signal is generated by intra-prediction from the decoded image signal stored in the memory 208. The intra prediction unit 206 generates a prediction image signal and supplies the generated prediction image signal to the decoded image signal superimposition unit 207. 204 corresponds to the intra prediction unit 103 of the image encoding device 100. The same processing as that of the intra-prediction unit 103 is performed.

[0051] The inverse quantization and inverse orthogonal transformation unit 206 performs orthogonal transformation and quantization on the bit string decoded by the bit string decoding unit 201. The inverse orthogonal transform and inverse quantization are performed on the inverse orthogonal transformed and inverse quantized residual. get.

[0052] The decoded image signal superimposing unit 207 receives the predicted image signal inter-predicted by the inter prediction unit 203. 203, or a predicted image signal obtained by intra-prediction in the intra-prediction unit 204, and The decoded image is obtained by superimposing the residual that has been inversely orthogonally transformed and inversely quantized by the orthogonal transform unit 206. The decoded image signal is stored in the decoded image memory 208. When storing the decoded image in the memory 208, the decoded image signal superimposing unit 207 performs coding on the decoded image. After filtering to reduce block distortion, the decoded image is stored in the decoded image memory 208. It may be stored.

[0053] Next, the operation of the block division unit 101 in the image coding device 100 will be described. Figure 3 shows the division of an image into treeblocks and the further division of each treeblock. First, the input image is divided into tree blocks of a given size. For each tree block, a predetermined order, i.e., a raster The tree block is scanned in the scan order (step S1002) and the inside of the tree block to be processed is divided. (Step S1003).

[0054] FIG. 7 is a flowchart showing the detailed operation of the division process in step S1003. Then, it is determined whether or not the block to be processed is to be divided into four (step S1101).

[0055] If it is determined that the processing block should be divided into four, the processing block is divided into four (step (Step S1102). For each block into which the processing target block is divided, That is, the upper left, upper right, lower left, and lower right are scanned in this order (step S1103). FIG. 6A shows an example of a scan order in which the processing target block is divided into four. The numbers 0 to 3 in 601 of A indicate the order of processing. For each divided block, the division process of FIG. 7 is recursively performed (step S1104 ).

[0056] If it is determined that the block to be processed is not to be divided into four, it is divided into two or three (step S1 105).

[0057] FIG. 8 is a flowchart showing the detailed operation of the 2-3 division process in step S1105. First, we decide whether to divide the block to be processed into 2 or 3 parts, i.e., how many parts to divide into 2 or 3 parts. It is determined whether or not to perform either of these (step S1201).

[0058] When it is not determined that the processing block should be divided into 2-3 blocks, i.e., when it is determined that the processing block should not be divided In other words, the division is terminated by the recursive division process (step S1211). No further recursive division processing is performed on the blocks that have been divided.

[0059] If it is determined that the block to be processed should be divided into 2-3, the block to be processed is further divided into 2 It is determined whether or not to divide (step S1202).

[0060] If it is determined that the processing block should be divided into two, the processing block is divided into upper and lower parts (vertical ) (step S1203), and based on the result, Either divide the block vertically into two (step S1204), or Divide the image into two on the right (horizontal direction) (step S1205). The target block is divided into two parts, top and bottom (vertical direction), as shown in 602 of FIG. 6B, and the steps are As a result of the step S1205, the processing target block is divided into left and right (horizontal) blocks as shown in 604 of FIG. 6D. (direction) is divided into two parts.

[0061] In step S1202, if it is not determined that the block to be processed is to be divided into two In other words, if it is determined that the block should be divided into three parts, the block to be processed is divided into upper, middle and lower parts (vertically). Based on the result of the determination, the processing target block is moved up or down. Divide the target block into three vertically (step S1207), or divide the target block into left, center, right, As a result of step S1207, the processing object is divided into three parts (horizontal direction) (step S1208). The block is divided into three parts, top, middle and bottom (vertical direction), as shown in 603 of FIG. 6C. As a result of step S1208, the processing target block is divided into four blocks, left, center, and right (horizontally) as shown in 605 of FIG. 6E. (direction) is divided into three parts.

[0062] Step S1204, Step S1205, Step S1207, Step S1208 After performing either of the above, for each block into which the processing target block is divided, The numbers 0 to 605 in FIG. 2 shows the order of processing. For each divided block, the 2-3 division process in FIG. The process is then recursively executed (step S1210).

[0063] The recursive block splitting described here is done by dividing the number of times or the number of blocks to be processed. The necessity of division may be restricted depending on the size of the image. By making a prearrangement between the decoder and the decoder, the decoder can be realized without transmitting information. Alternatively, the encoding device may determine information that limits the necessity of division and record it in the bit string. , may be transmitted to a decoding device.

[0064] When a block is divided, the block before the division is called the parent block, and each block after the division is called the parent block. The blocks are called child blocks.

[0065] Next, the operation of the block division unit 202 in the image decoding device 200 will be described. The block division unit 202 performs the same processing procedure as the block division unit 101 of the image encoding device 100. However, the block division of the image coding device 100 is In the unit 101, an optimization method such as optimal shape estimation by image recognition and strain rate optimization is applied, The optimal block division shape is determined, whereas the block division in the image decoding device 200 is determined. The dividing unit 202 divides the blocks by decoding the block division information recorded in the bit string. The difference is in determining the division shape.

[0066] The syntax (syntax rules for bit strings) related to block division in the first embodiment is shown in FIG. coding_quadtree() represents the syntax for dividing a block into four parts. _type_tree() represents the syntax for splitting a block into two or three parts. it is a flag that indicates whether to divide the block into four parts. To divide the block into four parts, use qt If you do not want to split the image into four, set qt_split=0. If you want to split the image into four (qt_split=1), For each block, recursively divide it into four (coding_quadtree(0), codin g_quadtree(1), coding_quadtree(2), coding_quadtree(3), arguments 0 to 3 are the 6 in Figure 6A. (This corresponds to the number 01.) If you do not split into four (qt_split=0), the following is true: , determines the subsequent split. mtt_split is a flag indicating whether to perform further splitting. If further splitting is done (mtt_split=1), indicates whether to split vertically or horizontally. The flag mtt_split_vertical determines whether to split the image into two or three parts. mtt_split_binary is transmitted to split the binary data. mtt_split_vertical=1 indicates splitting in the vertical direction. mtt_split_vertical=0 indicates splitting horizontally. mtt_split_binary=1 indicates splitting horizontally. mtt_split_binary=0 indicates splitting into 2, mtt_split_binary=0 indicates splitting into 3. tt_split_binary=1), recursively split each block into two (multi_t ype_tree(0), multi_type_tree(1), arguments 0 to 1 are 602 or 604 in Figure 6B to D (The number corresponds to the number.) When dividing into 3 parts (mtt_split_binary=0), and recursively split the tree (multi_type_tree(0), multi_type_tree(1), multi_type_ tree(2), 0 to 2 correspond to numbers 603 in FIG. 6B or 605 in FIG. 6E.) mtt_spli Hierarchical block partitioning is performed by recursively calling multi_type_tree until t=0. Do the following.

[0067] <Intra prediction> The intra prediction method according to the embodiment is performed by the intra prediction unit 100 of the image encoding device 100 shown in FIG. 103 and the intra prediction unit 204 of the image decoding device 200 in FIG.

[0068] An intra prediction method according to an embodiment will be described with reference to the drawings. The method is performed in both encoding and decoding processes on a coding block basis.

[0069] <Description of the intra prediction unit 103 on the encoding side> FIG. 40 is a diagram showing a detailed configuration of the intra-prediction unit 103 of the image encoding device 100 of FIG. The normal intra prediction unit 351 predicts the number of decoded pixels adjacent to the coding block to be processed. A predicted image signal is generated by normal intra prediction from the image, and a prediction signal is selected from among a plurality of intra prediction modes. and selecting an appropriate intra-prediction mode from the selected intra-prediction mode and the selected A prediction image signal corresponding to the intra prediction mode is supplied to the prediction method determination unit 105. FIG. 10A shows a prediction direction of normal intra prediction and FIG. 10B shows an example of intra prediction. For example, the intra prediction mode 50 corresponds to An intra prediction image is generated by copying pixels vertically. Mode 1 is DC mode, in which all pixel values ​​of the processing target block are the average value of the reference pixels. Intra prediction mode 0 is a planar mode, and the vertical and horizontal directions are This is a mode in which a two-dimensional intra-prediction image is created from reference pixels in the opposite direction. 1 is an example of generating an intra-prediction image in the case of intra-prediction mode 40. For each pixel in the intra prediction mode, the value of the reference pixel in the direction indicated by the intra prediction mode is copied. If the reference pixel of the prediction mode is not an integer position, it is interpolated from the reference pixel value of the neighboring integer position. The reference pixel value is determined by:

[0070] The intra block copy prediction unit 352 receives the encoded image data to be processed from the decoded image memory 104. The decoded area of ​​the image signal that is the same as the block is obtained, and the intra-block copy process is performed The prediction method determination unit 105 generates a prediction image signal and supplies it to the prediction method determination unit 105. The detailed configuration and processing of the measurement unit 352 will be described later.

[0071] <Description of the intra prediction unit 204 on the decoding side> FIG. 41 is a diagram showing a detailed configuration of the intra-prediction unit 204 of the image decoding device 200 of FIG. do.

[0072] The normal intra prediction unit 361 predicts a pixel value from decoded pixels adjacent to the coding block to be processed. A predicted image signal is generated by normal intra prediction, and an appropriate intra prediction mode is selected from a plurality of intra prediction modes. and selects the selected intra prediction mode and the selected intra prediction mode. A predicted image signal corresponding to the prediction mode is obtained. This predicted image signal is input to the switch 364. The normal intra prediction unit 361 in FIG. Since this corresponds to the normal intra prediction unit 351 in FIG. do.

[0073] The intra block copy prediction unit 362 receives the encoded image data to be processed from the decoded image memory 208. The decoded area of ​​the image signal that is the same as the block is obtained, and the intra-block copy process is performed This predicted image signal is then superimposed on the decoded image signal via a switch 364. The detailed configuration and processing of the intra block copy prediction unit 362 are described below. More details will be provided later.

[0074] <Inter Prediction> The inter prediction method according to the embodiment is performed by the inter prediction unit 102 of the image encoding device shown in FIG. This is carried out in the inter prediction unit 203 of the image decoding device in FIG.

[0075] The inter prediction method according to the embodiment will be described with reference to the drawings. The method is performed in both encoding and decoding processes on a coding block basis.

[0076] <Description of the inter prediction unit 102 on the encoding side> FIG. 16 is a diagram showing a detailed configuration of the inter prediction unit 102 in the image encoding device of FIG. The normal motion vector predictor mode derivation unit 301 derives a plurality of normal motion vector predictor candidates. A predicted motion vector is selected by the motion vector prediction method, and the selected predicted motion vector and the detected motion vector are compared. The difference motion vector of the detected inter prediction mode, reference index, and motion vector are calculated. The calculated differential motion vector is the inter prediction motion vector in normal prediction motion vector mode. This inter prediction information is supplied to the inter prediction mode determination unit 305. The detailed configuration and processing of the predictive motion vector mode derivation unit 301 will be described later.

[0077] The normal merge mode derivation unit 302 derives a plurality of normal merge candidates and determines the normal merge candidates. Select the inter prediction information for normal merge mode to obtain the inter prediction information for normal merge mode. The prediction mode determination unit 305 receives the merge mode. The theory will be explained later.

[0078] The sub-block prediction motion vector mode derivation unit 303 determines a plurality of sub-block prediction motion vectors. A vector candidate is derived to select a sub-block predictive motion vector, and the selected sub-block predictive motion vector is A difference motion vector is calculated between the estimated motion vector and the detected motion vector. Inter prediction mode, reference index, motion vector, and calculated differential motion vector are This is the inter prediction information of the sub-block prediction motion vector mode. is supplied to the inter prediction mode determination unit 305.

[0079] The sub-block merging mode derivation unit 304 derives a plurality of sub-block merging candidates. Select sub-block merging candidates and obtain inter prediction information for sub-block merging mode This inter prediction information is supplied to the inter prediction mode determination unit 305.

[0080] The inter prediction mode determination unit 305 determines whether the normal prediction motion vector mode is derived from the normal prediction motion vector mode derivation unit 301 or the normal A merge mode derivation unit 302, a sub-block predicted motion vector mode derivation unit 303, a sub-block Based on the inter prediction information supplied from the block merge mode derivation unit 304, The inter prediction mode determination unit 305 determines the prediction information. The measurement information is supplied to a motion compensation prediction unit 306 .

[0081] The motion compensation prediction unit 306 stores the decoded image in the decoded image memory 1 based on the determined inter prediction information. The motion compensation prediction unit 306 performs inter prediction on the reference image signal stored in the motion compensation prediction unit 306. The detailed configuration and processing will be described later.

[0082] <Description of the Inter Prediction Unit 203 on the Decoding Side> FIG. 22 is a diagram showing a detailed configuration of the inter prediction unit 203 of the image decoding device in FIG.

[0083] The normal prediction motion vector mode derivation unit 401 derives a plurality of normal prediction motion vector candidates. A predicted motion vector is selected by the above-mentioned method, and the selected predicted motion vector and the decoded differential motion vector are The decoded inter prediction mode, reference index, and In this case, the motion vector is the inter prediction information in the normal prediction motion vector mode. The center prediction information is supplied to the motion compensation prediction unit 406 via the switch 408. The detailed configuration and processing of the motion vector measurement mode derivation unit 401 will be described later.

[0084] The normal merge mode derivation unit 402 derives a plurality of normal merge candidates and determines the normal merge candidates. Select and obtain inter prediction information for normal merge mode. This inter prediction information is switched The merge mode derivation unit 402 normally supplies the merge mode derivation signal to the motion compensation prediction unit 406 via the merge mode derivation unit 408. The detailed configuration and processing will be described later.

[0085] The sub-block prediction motion vector mode derivation unit 403 selects a plurality of sub-block prediction motion vectors. A vector candidate is derived to select a sub-block predictive motion vector, and the selected sub-block predictive motion vector is The sum of the estimated motion vector and the decoded differential motion vector is calculated and used as the motion vector. The decoded inter prediction mode, reference index, and motion vector are used for sub-block prediction. This inter prediction information is the motion vector mode inter prediction information. The signal is then supplied to the motion compensation prediction unit 406 via

[0086] The subblock merging mode derivation unit 404 derives multiple subblock merging candidates. Select sub-block merging candidates and obtain inter prediction information for sub-block merging mode This inter prediction information is supplied to the motion compensation prediction unit 406 via the switch 408. .

[0087] The motion compensation prediction unit 406 stores the decoded image in the decoded image memory 2 based on the determined inter prediction information. 08. The motion compensation prediction unit 406 performs inter prediction on the reference image signal stored in the motion compensation prediction unit 406. The detailed configuration and processing are the same as those of the motion compensation prediction unit 306 on the encoding side.

[0088] <Normal predicted motion vector mode derivation part (normal AMVP)> The normal prediction motion vector mode derivation unit 301 in FIG. unit 321, a temporal predicted motion vector candidate derivation unit 322, and a historical predicted motion vector candidate derivation unit 3 23, a predicted motion vector candidate supplementation unit 325, a normal motion vector detection unit 326, a predicted motion vector candidate The image processing unit 320 includes a vector candidate selection unit 327 and a motion vector subtraction unit 328.

[0089] The normal prediction motion vector mode derivation unit 401 in FIG. unit 421, a temporal predicted motion vector candidate derivation unit 422, and a historical predicted motion vector candidate derivation unit 4 23, a motion vector predictor candidate supplementation unit 425, a motion vector predictor candidate selection unit 426, a motion vector The vector adder 427 is included.

[0090] The normal prediction motion vector mode derivation unit 301 on the encoding side and the normal prediction motion vector mode derivation unit 302 on the decoding side The processing procedure of the torque mode derivation unit 401 is shown in the flowcharts of FIG. 19 and FIG. 25. 19 is a diagram showing a normal motion vector mode derivation unit 301 on the encoding side. FIG. 25 is a flowchart showing a procedure for deriving a predicted motion vector mode. The normal motion vector mode derivation unit 401 performs a normal predicted motion vector mode derivation process. 6 is a flowchart.

[0091] <Normal prediction motion vector mode derivation part (normal AMVP): Explanation on the encoding side> The normal prediction motion vector mode derivation process procedure on the encoding side will be described with reference to FIG. In the explanation of the processing procedure of FIG. 19, the word "normal" shown in FIG. 19 may be omitted.

[0092] First, the normal motion vector detection unit 326 detects the inter prediction mode and the reference index. First, a normal motion vector is detected (step S100 in FIG. 19).

[0093] Next, the spatial prediction motion vector candidate derivation unit 321 and the temporal prediction motion vector candidate derivation unit 3 22, a history prediction motion vector candidate derivation unit 323, a prediction motion vector candidate supplement unit 325, A predicted motion vector candidate selection unit 327 and a motion vector subtraction unit 328 select a normal predicted motion vector The difference motion vectors of the motion vectors used in the inter prediction of the mode are set for L0 and L1, respectively. Specifically, the prediction of the processing target block is calculated (steps S101 to S106 in FIG. 19). Prediction mode PredMode is inter prediction (MODE_INTER) and inter prediction mode is L0 prediction (Pr ed_L0), calculate the motion vector predictor candidate list mvpListL0 of L0 and Then, the differential motion vector mvdL0 of the motion vector mvL0 of L0 is calculated. If the inter prediction mode of the target block is L1 prediction (Pred_L1), the predicted motion vector of L1 is A motion vector candidate list mvpListL1 is calculated, a predicted motion vector mvpL1 is selected, and the motion vector of L1 is calculated. Calculate the differential motion vector mvdL1 of the to-be-processed block mvL1. When bi-prediction (Pred_BI) is used, both L0 and L1 predictions are performed, and the predicted motion vector of L0 is A motion vector candidate list mvpListL0 is calculated, a motion vector predictor mvpL0 of L0 is selected, and the motion vector predictor A differential motion vector mvdL0 of the vector mvL0 is calculated, and a predicted motion vector candidate of L1 is calculated. A complementary list mvpListL1 is calculated, a predicted motion vector mvpL1 of L1 is calculated, and the motion vector of L1 is calculated. Then, the differential motion vector mvdL1 of the corresponding to the tor mvL1 is calculated.

[0094] The differential motion vector calculation process is performed for each of L0 and L1. Therefore, in the following explanation, L0 and L1 are represented as a common LX. In the process of calculating the difference motion vector of L0, X of LX is 0, and the difference motion vector of L1 is In the process of calculating the motion vector of LX, X of LX is 1. If you refer to information in the other list instead of the LX during the process of is expressed as LY.

[0095] When the motion vector mvLX of LX is used (step S102 in FIG. 19: YES), Calculate the candidate predicted motion vectors of LX and construct a candidate predicted motion vector list mvpListLX of LX. (Step S103 in FIG. 19). A spatial prediction motion vector candidate derivation unit 321, a temporal prediction motion vector candidate derivation unit 322, a history A motion vector predictor candidate derivation unit 323 and a motion vector predictor candidate supplement unit 325 generate a plurality of motion vector predictors. The motion vector predictor candidate list mvpListLX is constructed by deriving motion vector candidates. The detailed process of step S103 will be described later with reference to the flowchart of FIG. do.

[0096] Next, the motion vector predictor candidate selection unit 327 selects a motion vector predictor candidate list for LX. Select a predicted motion vector mvpLX for LX from the mvpListLX (step S104 in FIG. 19). Here, in the motion vector predictor candidate list mvpListLX, a certain element (counting from 0) The motion vector mvLX and the motion vector predictor candidate are expressed as mvpListLX[i]. The difference between each predicted motion vector candidate mvpListLX[i] stored in the list mvpListLX is The differential motion vectors are calculated for each of the two frames. The coding amount is calculated for each element (predictor motion vector candidate) of the predictor motion vector candidate list mvpListLX. Then, among the elements registered in the motion vector predictor candidate list mvpListLX, The candidate motion vector predictor mvpListLX[i] that has the smallest coding amount for each candidate motion vector predictor is The motion vector predictor mvpLX is selected as the motion vector predictor mvpLX, and its index i is obtained. There are multiple candidates for the predicted motion vector with the smallest generated code amount in the candidate list mvpListLX. In this case, the index i in the motion vector predictor candidate list mvpListLX is a small number. The candidate motion vector predictor mvpListLX[i] represented by the following is set as the optimal motion vector predictor mvpLX. Select it and get its index i.

[0097] Next, the motion vector subtraction unit 328 subtracts the motion vector mvLX of LX selected from the motion vector mvLX of LX. Subtract the predicted motion vector mvpLX, mvdLX = mvLX - mvpLX Then, the differential motion vector mvdLX of LX is calculated as (Step S105 in FIG. 19).

[0098] <Normal predicted motion vector mode derivation part (normal AMVP): Decoding side explanation> Next, a normal predicted motion vector mode process procedure on the decoding side will be described with reference to FIG. On the other hand, a spatial prediction motion vector candidate derivation unit 421 and a temporal prediction motion vector candidate derivation unit 4 22, the history prediction motion vector candidate derivation unit 423 and the prediction motion vector candidate supplementation unit 425, The motion vectors used in inter prediction in normal prediction motion vector mode are divided into L0 and L1. Specifically, the process of the processing block is performed as follows (steps S201 to S206 in FIG. 25). Prediction mode PredMode is inter prediction (MODE_INTER) and the processing target block is inter prediction When the mode is L0 prediction (Pred_L0), calculate the predicted motion vector candidate list mvpListL0 of L0. Then, the predicted motion vector mvpL0 is selected, and the motion vector mvL0 of L0 is calculated. If the inter prediction mode of the target block is L1 prediction (Pred_L1), the predicted motion vector of L1 is A motion vector candidate list mvpListL1 is calculated, a predicted motion vector mvpL1 is selected, and the motion vector of L1 is calculated. If the inter prediction mode of the processing target block is bi-predictive (Pred_BI), Then, both L0 prediction and L1 prediction are performed, and the L0 predicted motion vector candidate list mvpListL0 is calculated. Then, the predicted motion vector mvpL0 of L0 is selected, and the motion vector mvL0 of L0 is calculated. In both cases, a motion vector predictor candidate list mvpListL1 of L1 is calculated, and the motion vector predictor of L1 is Then, the motion vector mvpL1 for L1 is calculated, and the motion vector mvL1 for L2 is calculated.

[0099] As with the encoding side, the decoding side also performs motion vector calculation processing for each of L0 and L1. However, the same process is used for both L0 and L1. Therefore, in the following explanation, L1 is represented as a common LX. LX is used for inter prediction of the coding block being processed. It represents the inter prediction mode. In the process of calculating the motion vector of L0, X is 0, and in the process of calculating the motion vector of L1, In the process of calculating the motion vector of X, X is 1. Also, the motion vector of LX is calculated. During processing, the LX is calculated by referencing information from another reference list, not the same reference list. When referring to one reference list, the other reference list is represented as LY.

[0100] When the motion vector mvLX of LX is used (step S202 in FIG. 25: YES), Calculate the candidate predicted motion vectors of LX and construct a candidate predicted motion vector list mvpListLX of LX. (Step S203 in FIG. 25). A spatial prediction motion vector candidate derivation unit 421, a temporal prediction motion vector candidate derivation unit 422, a history A motion vector predictor candidate derivation unit 423 and a motion vector predictor candidate supplement unit 425 generate a plurality of motion vector predictors. Then, the motion vector predictor candidate list mvpListLX is constructed. The detailed process of step S203 will be described later with reference to the flowchart of FIG. do.

[0101] Next, the motion vector predictor candidate selection unit 426 selects the motion vector predictor candidate list mvpListLX The bitstream decoder 201 decodes and supplies the predicted motion vector index mv The candidate predicted motion vector mvpListLX[mvpIdxLX] corresponding to pIdxLX is selected as the predicted motion vector. The vector mvpLX is extracted (step S204 in FIG. 25).

[0102] Then, the motion vector adder 427 decodes the bit stream and supplies it to the bit stream decoder 201. Add the differential motion vector mvdLX of LX and the predicted motion vector mvpLX of LX, mvLX = mvpLX + mvdLX Then, the motion vector mvLX of LX is calculated (step S205 in FIG. 25).

[0103] <Normal predicted motion vector mode derivation part (normal AMVP): Motion vector prediction method> FIG. 20 shows a normal prediction motion vector mode derivation process of the image coding apparatus according to the embodiment of the present invention. Functions common to the motion vector mode derivation unit 301 and the normal prediction motion vector mode derivation unit 401 of the image decoding device 13 is a flowchart showing a processing procedure of a normal predicted motion vector mode derivation process having the above-mentioned steps.

[0104] The normal prediction motion vector mode derivation unit 301 and the normal prediction motion vector mode derivation unit 40 1, a motion vector predictor candidate list mvpListLX is provided. The mvpListLX has a list structure and is a prediction vector that indicates the location within the predicted motion vector candidate list. A motion vector index and a motion vector predictor candidate corresponding to the index are used as elements. The predicted motion vector index number starts from 0. The motion vector predictor candidate list mvpListLX is stored in a storage area of ​​the motion vector predictor candidate list mvpListLX. In this embodiment, the motion vector predictor candidate list mvpListLX stores at least At least two predicted motion vector candidates (inter prediction information) can be registered. In addition, the motion vector predictor registered in the motion vector predictor candidate list mvpListLX is The variable numCurrMvpCand, which indicates the number of candidates, is set to 0.

[0105] The spatial prediction motion vector candidate derivation units 321 and 421 derive the spatial prediction motion vector candidate from the adjacent block on the left. In this process, a candidate predicted motion vector is derived from the adjacent block on the left ( Whether inter prediction information (A0 or A1), i.e., whether a predicted motion vector candidate is available A flag indicating whether the motion vector is a predicted motion vector mv LXA is derived, and the derived mvLXA is added to the motion vector predictor candidate list mvpListLX (FIG. 20). In step S301, X is set to 0 for L0 prediction and 1 for L1 prediction. Next, the spatial prediction motion vector candidate derivation units 321 and 421 select the adjacent spatial prediction motion vector candidate In this process, the candidate predicted motion vectors are derived from the adjacent block on the upper side. Inter prediction information of the block (B0, B1, or B2 in FIG. 11), i.e., predicted motion vector A flag indicating whether a candidate is available or not, and a reference of motion vectors, reference indexes, etc. The predicted motion vector mvLXB is derived based on the calculated motion vector mvLXA and mvLXB. If so, mvLXB is added to the motion vector predictor candidate list mvpListLX (step S3 in FIG. 20). 02). The processes in steps S301 and S302 in FIG. 20 refer to the position and number of adjacent blocks. The difference is whether the predicted motion vector candidate of the coding block can be used. A flag indicating whether the motion vector is available or not, a motion vector mvLXN, and a reference index refIdxN( N indicates A or B, and so on).

[0106] Next, the temporal motion vector predictor candidate derivation units 322 and 422 calculate the current processing target picture A candidate motion vector predictor is derived from a block in a picture that is different in time from the image. In this process, motion vector prediction candidates of coding blocks of pictures at different times are used. availableFlagLXCol, a flag indicating whether the motion vector mvLXCol and the reference index The refIdxCol and the reference list listCol are derived, and mvLXCol is used to create the predicted motion vector candidate list m vpListLX (step S303 in FIG. 20).

[0107] Note that temporal prediction can be performed on a sequence (SPS), picture (PPS), or slice basis. It is assumed that the processing of the motion vector candidate derivation units 322 and 422 can be omitted.

[0108] Next, the history prediction motion vector candidate derivation units 323 and 423 calculate the history prediction motion vector candidate. The historical predicted motion vector candidates registered in the auxiliary list HmvpCandList are used as the predicted motion vector candidates. The mvpListLX is added to the auxiliary list (step S304 in FIG. 20). The registration process will be described in detail later with reference to the flowchart of FIG.

[0109] Next, the motion vector predictor candidate supplementation units 325 and 425 generate the motion vector predictor candidate list mv Add a motion vector predictor candidate with a predetermined value, such as (0,0), until pListLX is satisfied ( S305 in Figure 20).

[0110] <Normal merge mode derivation part (normal merge)> The normal merge mode derivation unit 302 in FIG. 18 includes a spatial merge candidate derivation unit 341, a temporal merge candidate derivation unit 342, and a A candidate derivation unit 342, an average merge candidate derivation unit 344, a history merge candidate derivation unit 345, and a merge It includes a candidate supplementation unit 346 and a merge candidate selection unit 347 .

[0111] The normal merge mode derivation unit 402 in FIG. 24 includes a spatial merge candidate derivation unit 441, a temporal merge candidate derivation unit 442, and a A candidate derivation unit 442, an average merge candidate derivation unit 444, a history merge candidate derivation unit 445, and a merge It includes a candidate supplementation unit 446 and a merge candidate selection unit 447 .

[0112] FIG. 21 shows the normal merge mode derivation unit 302 and A normal merge mode having a function common to the normal merge mode derivation unit 402 of the image decoding device and the normal merge mode derivation unit 402 of the image decoding device. 11 is a flowchart illustrating the procedure of a code derivation process.

[0113] The steps will be explained below in order. The slice type slice_type is explained for the B slice, but for the P slice, However, if the slice type slice_type is P slice, the inter prediction model can be applied. There is only L0 prediction (Pred_L0) as a mode, L1 prediction (Pred_L1) and bi-prediction (Pred_BI) are also supported. Since there is no L1, processing related to L1 can be omitted.

[0114] In the normal merge mode derivation unit 302 and the normal merge mode derivation unit 402, The merge candidate list mergeCandList has a list structure, A merge index that indicates the location within the merge candidate list, and the merge A memory area is provided to store merge candidates as elements. The merge index number is 0. The merge candidates are stored in the merge candidate list (mergeCandList) starting from In the following process, the merge index i registered in the merge candidate list mergeCandList is The merge candidates are represented by mergeCandList[i]. The candidate list mergeCandList must contain at least six merge candidates (inter prediction information). In addition, the merge candidates registered in the mergeCandList can be The variable numCurrMergeCand, which indicates the number of merge candidates, is set to 0.

[0115] The spatial merge candidate derivation unit 341 and the spatial merge candidate derivation unit 441 are The encoded information stored in the encoded information storage memory 111 or the encoded information storage memory 205 of the image decoding device From the coding information stored in the memory, each block adjacent to the target block (B in FIG. 11) is 1, A1, B0, A0, B2) to B1, A1, B0, A0, B2 The spatial merge candidates are derived in order and registered in the merge candidate list mergeCandList. (Step S401 in FIG. 21). Here, B1, A1, B0, A0, B2 or time marker We define N, which indicates one of the candidate blocks Col. A flag indicating whether the candidate can be used as a spatial merge candidate, availableFlagN, is Reference index refIdxL0N and L1 reference index refIdxL1N, L0 prediction is performed A L0 prediction flag predFlagL0N indicates whether L1 prediction is performed or not, and a L1 prediction flag predFlagL0N indicates whether L1 prediction is performed or not. The measurement flag predFlagL1N, the motion vector mvL0N for L0, and the motion vector mvL1N for L1 are derived. However, in this embodiment, the blocks included in the coding block to be processed Since the merging candidates are derived without referring to the inter prediction information, the coding block to be processed , no spatial merge candidates using inter prediction information of blocks included in

[0116] Next, the temporal merge candidate derivation unit 342 and the temporal merge candidate derivation unit 442 determine different time Then, a temporal merge candidate is derived from the pictures between the first and second pictures, and the derived temporal merge candidate is called a merge candidate. The time merge candidates are registered in the list mergeCandList (step S402 in FIG. 21). availableFlagCol, a flag indicating whether L0 prediction of temporal merge candidates is performed L0 prediction flag predFlagL0Col indicating whether L0 prediction is performed and L1 prediction flag predFlagL0Col indicating whether L1 prediction is performed The flag predFlagL1Col, the motion vector mvL0Col of L0, and the motion vector mvL1Col of L1 are Derive.

[0117] Note that time markers can be set in units of sequences (SPS), pictures (PPS), or slices. The processing of the merge candidate derivation unit 342 and the time merge candidate derivation unit 442 can be omitted. Let us assume that.

[0118] Next, the history merging candidate derivation unit 345 and the history merging candidate derivation unit 445 perform history prediction Mark the historical predicted motion vector candidates registered in the motion vector candidate list HmvpCandList. The candidate list is registered in mergeCandList (step S403 in FIG. 21).

[0119] The number of merge candidates registered in the merge candidate list mergeCandList is numCurrMergeC If and is smaller than the maximum number of merge candidates, MaxNumMergeCand, the merge candidate list, mergeCandL The number of merge candidates registered in ist is numCurrMergeCand, which is the maximum number of merge candidates, MaxNumMergeCand. History merge candidates are derived with nd as the upper limit and registered in the merge candidate list mergeCandList. can be.

[0120] Next, the average merge candidate derivation unit 344 and the average merge candidate derivation unit 444 calculate the merge candidates. Derive average merge candidates from the complement list mergeCandList and merge the derived average merge candidates. The merge candidate list mergeCandList is then added to the merge candidate list mergeCandList (step S404 in FIG. 21).

[0121] The number of merge candidates registered in the merge candidate list mergeCandList is numCurrMergeC If and is smaller than the maximum number of merge candidates, MaxNumMergeCand, the merge candidate list, mergeCandL The number of merge candidates registered in ist is numCurrMergeCand, which is the maximum number of merge candidates, MaxNumMergeCand. The average merge candidates are derived with nd as the upper limit and registered in the merge candidate list mergeCandList. can be.

[0122] Here, the average merge candidate is the first merge candidate registered in the merge candidate list mergeCandList. The motion vectors of the merge candidate and the second merge candidate are averaged for L0 prediction and L1 prediction. The new merge candidate has the motion vector obtained by

[0123] Next, the merge candidate supplementation unit 346 and the merge candidate supplementation unit 446 create a merge candidate list The number of merge candidates registered in mergeCandList, numCurrMergeCand, is less than the maximum number of merge candidates, M If it is smaller than axNumMergeCand, the merge candidate list mergeCandList The number of merge candidates numCurrMergeCand is the maximum number of merge candidates MaxNumMergeCand. The merge candidates are derived and registered in the merge candidate list mergeCandList (step S4 in FIG. 21). 05). In P slices, the motion vector is A merge candidate having a prediction mode of L0 prediction (Pred_L0) with a value of (0,0) is added. In B slices, the prediction mode with a motion vector of (0,0) is bi-predictive (Pred_BI). Add a merge candidate. The reference index for adding a merge candidate is the same as the index of the The reference index is different from the one specified.

[0124] Next, the merging candidate selection unit 347 and the merging candidate selection unit 447 select the merging candidate list Select a merge candidate from the merge candidates registered in mergeCandList. The merge candidate selection unit 347 selects merge candidates by calculating the code amount and the distortion amount. , a merge index indicating the selected merge candidate, inter prediction information of the merge candidate, The inter-prediction mode determination unit 305 supplies the inter-prediction mode to the motion compensation prediction unit 306. The merge candidate selection unit 447 on the side selects merge candidates based on the decoded merge index. The motion compensation prediction unit 406 selects a merge candidate from the list of merge candidates and supplies the selected merge candidate to the motion compensation prediction unit 406.

[0125] <Update of historical motion vector prediction candidate list> Next, the coding information storage memory 111 on the coding side and the coding information storage memory 20 on the decoding side Method for initializing and updating the historical motion vector predictor candidate list HmvpCandList in preparation for 5 FIG. 26 shows the procedure for initializing and updating the history predicted motion vector candidate list. 1 is a flowchart illustrating the above.

[0126] In this embodiment, the history motion vector predictor candidate list HmvpCandList is updated based on the coding information. The information storage memory 111 and the encoded information storage memory 205 are assumed to be implemented. A history prediction motion vector candidate list update unit is provided in the prediction unit 102 and the inter prediction unit 203. It may be set to update the historical motion vector predictor candidate list HmvpCandList.

[0127] At the beginning of the slice, the historical motion vector prediction candidate list HmvpCandList is initialized. On the encoding side, the prediction method decision unit 105 decides whether the normal predicted motion vector mode or the normal merge mode is selected. When the selected motion vector prediction candidate list HmvpCandList is updated, The prediction information decoded by the bit stream decoding unit 201 is in the normal predicted motion vector mode or the normal In the case of merge mode, the historical motion vector predictor candidate list HmvpCandList is updated.

[0128] Used when performing inter prediction in normal prediction motion vector mode or normal merge mode. The inter prediction information is stored as the inter prediction information candidate hMvpCand in the history prediction motion vector candidate list. The inter prediction information candidate hMvpCand is registered in the HmvpCandList. The reference index for L0 and L1, refIdxL1, indicates whether L0 prediction is performed. An L0 prediction flag predFlagL0 and an L1 prediction flag predFl indicating whether or not L1 prediction is performed agL1, the motion vector mvL0 for L0, and the motion vector mvL1 for L1 are included.

[0129] The encoding information storage memory 111 on the encoding side and the encoding information storage memory 205 on the decoding side are provided The elements registered in the history motion vector predictor candidate list HmvpCandList (i.e., Among the inter prediction information candidates, there is inter prediction information with the same value as the inter prediction information candidate hMvpCand. If it exists, remove the element from the historical motion vector predictor candidate list HmvpCandList. On the other hand, if there is no inter-prediction information with the same value as the inter-prediction information candidate hMvpCand, Then, the first element of the history prediction motion vector candidate list HmvpCandList is deleted, and the history prediction motion vector The inter-prediction information candidate hMvpCand is added to the end of the vector candidate list HmvpCandList.

[0130] The encoding information storage memory 111 on the encoding side and the encoding information storage memory 2 on the decoding side according to the present invention The number of elements in the historical motion vector predictor candidate list HmvpCandList for 05 is six.

[0131] First, initialize the historical motion vector predictor candidate list HmvpCandList in slice units. (Step S2101 in FIG. 26). At the beginning of the slice, the history predicted motion vector candidate list Hm All elements of vpCandList are emptied and registered in the historical motion vector prediction candidate list HmvpCandList. The number of recorded history motion vector predictor candidates (current number of candidates). The value of NumHmvpCand is set to 0. do.

[0132] Note that the initialization of the historical predicted motion vector candidate list HmvpCandList is performed on a slice-by-slice basis ( However, it was decided to implement it on a picture-by-picture, tile-by-tile or tree block basis. This may be done on a row-by-row basis.

[0133] Next, for each coding block in the slice, the following historical motion vector predictor candidate list Hmvp The process of updating the CandList is repeated (steps S2102 to S2107 in FIG. 26).

[0134] First, the initial setting is performed for each coding block. Set the value of the field "identicalCandExist" to FALSE, and then delete the target index that indicates the candidate for deletion. The index removeIdx is set to 0 (step S2103 in FIG. 26).

[0135] It is determined whether or not there is an inter-prediction information candidate hMvpCand to be registered (step S20 in FIG. 26). In the prediction method determination unit 105 on the encoding side, the normal prediction motion vector mode or When the normal merge mode is determined, or when the bitstream decoding unit 201 on the decoding side performs normal prediction, When decoded as a motion vector mode or normal merge mode, the inter prediction information The information is set as the inter prediction information candidate hMvpCand to be registered. Intra prediction mode, sub-block prediction motion vector mode or sub-block merge mode, or when the bitstream decoding unit 201 on the decoding side determines that the bitstream is an intra-prediction mode, Decoded as sub-block predicted motion vector mode or sub-block merge mode In this case, the historical motion vector predictor candidate list HmvpCandList is not updated, and the registered object There is no inter-prediction information candidate hMvpCand. If it does not exist, steps S2105 to S2106 are skipped (step S in FIG. 26). 2104: NO). If there is an inter-prediction information candidate hMvpCand to be registered, The processes from S2105 onwards are carried out (step S2104 in FIG. 26: YES).

[0136] Next, the input motion vector to be registered is added to each element of the history motion vector candidate list HmvpCandList. The elements (inter prediction information) with the same value as the target prediction information candidate hMvpCand, i.e., the same elements It is determined whether or not the same element exists (step S2105 in FIG. 26). 10 is a flowchart of a processing procedure. (Step S2121 in FIG. 27: NO), the historical motion vector predictor candidate list HmvpCa Since the ndList is empty and there are no identical candidates, steps S2122 to S2125 in FIG. 27 are skipped. The number of historical motion vector predictor candidates NumHmvpC is If the value of and is greater than 0 (YES in step S2121 of FIG. 27), the history predicted motion vector The process of step S2123 is repeated for the memory index hMvpIdx from 0 to NumHmvpCand-1. First, the history of the motion vector predictor candidate list is returned (steps S2122 to S2125 in FIG. 27). The hMvpIdx-th element HmvpCandList[hMvpIdx], counting from 0 in the list, is the inter prediction information candidate hM It is compared with vpCand to see if it is the same (step S2123 in FIG. 27). Step S2123: YES), a flag identicalCandE indicating whether an identical candidate exists or not Set the value of TRUE in xist and the deletion target index remo, which indicates the position of the element to be deleted. Set the current value of the history predicted motion vector index hMvpIdx to veIdx and check the same element. If they are not the same (step S2123 in FIG. 27: NO), increment hMvpIdx by 1. If the history prediction motion vector index hMvpIdx is less than or equal to NumHmvpCand-1, If so, the process proceeds to step S2123 and thereafter.

[0137] Returning to the flowchart of FIG. 26, the historical motion vector predictor candidate list HmvpCandList The element shift and addition process is performed (step S2106 in FIG. 26). Step S2106: Shifting / adding elements of the history prediction motion vector candidate list HmvpCandList 1 is a flowchart of a processing procedure. First, in the historical motion vector predictor candidate list HmvpCandList, Either remove the stored elements and then add new elements, or add new elements without removing any elements. Specifically, the flag "identicalCandE" indicates whether or not an identical candidate exists. A comparison is made with xist to see if it is TRUE or if NumHmvpCand is 6 (step S2141 in FIG. 28). ). The flag identicalCandExist indicates whether an identical candidate exists or not. When the number of candidates NumHmvpCand is 6 (step S2141 in FIG. 28: YES), except for the elements stored in the historical motion vector predictor candidate list HmvpCandList. Add a new element from . Set the initial value of index i to the value of removeIdx + 1. The element shift process in step S2143 is repeated from the initial value of NumHmvpCand to NumHmvpCand. Steps S2142 to S2144 of 28. HmvpCandList[i - 1] is set to HmvpCandList[i ] is copied to shift the elements forward (step S2143 in FIG. 28), and i is Increment by 1 (steps S2142 to S2144 in FIG. 28). The (NumHmvpCand-1)th HmvpCandLi, which corresponds to the end of the motion vector candidate list and counts from 0. The inter-prediction information candidate hMvpCand is added to st[NumHmvpCand-1] (step S21 in FIG. 28). 45) Finish shifting and adding elements of this history predicted motion vector candidate list HmvpCandList. On the other hand, if the flag identicalCandExist, which indicates whether an identical candidate exists, is set to TRUE, If neither of the conditions of NumHmvpCand and NumHmvpCand is 6 is satisfied (step S2141 in FIG. 28: N O), without excluding the elements stored in the history motion vector predictor candidate list HmvpCandList, Add the inter prediction information candidate hMvpCand to the end of the history prediction motion vector candidate list (Figure 28, step S2146). Here, the end of the history motion vector predictor candidate list is 0 The NumHmvpCandth HmvpCandList[NumHmvpCand] is counted from the beginning. Increment by 1 and shift the elements of this history predicted motion vector candidate list HmvpCandList. And the addition process is completed.

[0138] FIG. 31 is a diagram for explaining an example of a process of updating the history predicted motion vector candidate list. The elements (inter prediction information) of the registered historical predicted motion vector candidate list HmvpCandList When adding a new element to the history motion vector predictor candidate list HmvpCandList, The new inter prediction information is compared with the previous prediction information (Figure 31A). If the value is the same as the third element HMVP2 from the top of the vector candidate list HmvpCandList, The element HMVP2 is deleted from the motion vector predictor candidate list HmvpCandList, and the following elements HMVP3 to HM Shift (copy) VP5 forward one by one and create a history prediction motion vector candidate list HmvpCandList t (FIG. 31B) and the history predicted motion vector candidate list HmvpCan The update of dList is then completed (Figure 31C).

[0139] <Historical Prediction Motion Vector Candidate Derivation Process> Next, the history of predicted motion vector candidates in the normal predicted motion vector mode derivation unit 301 on the encoding side is The prediction motion vector mode derivation unit 323 and the history prediction motion vector mode derivation unit 401 on the decoding side The process of step S304 in FIG. 20 is common to all the torque candidate derivation units 423. A method for deriving a historical predicted motion vector candidate from a historical predicted motion vector candidate list HmvpCandList FIG. 29 is a flowchart for explaining a procedure for deriving a historical motion vector predictor candidate. This is a low chart.

[0140] The number of current motion vector predictor candidates numCurrMvpCand is the motion vector predictor candidate list mvpList The number of elements of tLX is equal to or greater than the maximum number of elements (2 in this example) or the number of history predicted motion vector candidates is equal to or greater than NumHm If the value of vpCand is 0 (NO in step S2201 in FIG. 29), step S22 in FIG. The process from S2202 to S2209 is omitted, and the procedure for deriving the historical predicted motion vector candidate is terminated. The current number of motion vector predictor candidates numCurrMvpCand is the motion vector predictor candidate list mvpList If the number of elements of tLX is smaller than 2, and the number of history motion vector predictor candidates NumHmvpCa If the value of nd is greater than 0 (YES in step S2201 in FIG. 29), Processes S2202 to S2209 are carried out.

[0141] Next, the index i goes from 1 to 4 and the number of historical motion vector predictor candidates numCheckedHMVP The process of steps S2203 to S2208 in FIG. 29 is repeated until the smaller value of The current number of motion vector predictor candidates, nu, is returned (steps S2202 to S2209 in FIG. 29). When mCurrMvpCand is equal to or greater than 2, which is the maximum number of elements in the motion vector predictor candidate list mvpListLX. (Step S2203 in FIG. 29: NO), Steps S2204 to S2209 in FIG. 29 The process is omitted, and the procedure for deriving the historical motion vector predictor candidate is terminated. The number of vector candidates, numCurrMvpCand, is the maximum number of elements in the motion vector predictor candidate list, mvpListLX. If the value is smaller than 2 (step S2203 in FIG. 29: YES), step S2 Perform processing from 204 onwards.

[0142] Next, the process from step S2205 to S2207 is performed when Y is 0 and 1 (L0 and L1). The process is repeated for each of the current predicted motion vectors (steps S2204 to S2208 in FIG. 29). The number of motion vector predictor candidates, numCurrMvpCand, is the maximum number of elements in the motion vector predictor candidate list, mvpListLX. If the number of the first pair is two or more (step S2205 in FIG. 29: NO), the process proceeds from step S2206 in FIG. Therefore, the process of S2209 is omitted, and the process of deriving the historical motion vector predictor candidate is terminated. The number of current motion vector predictor candidates numCurrMvpCand is the motion vector predictor candidate list mvpListLX If the number of elements is smaller than 2, which is the maximum number of elements in (step S2205 in FIG. 29: YES), The process proceeds to step S2206 and thereafter.

[0143] Next, the motion vector to be encoded / decoded is added to the history prediction motion vector candidate list HmvpCandList. The element of the same reference index as the vector reference index refIdxLX. If the element is different from any element in the vector list mvpListLX (step S2206 in FIG. 29), : YES), the numCurrMvpCand-th element mvpL of the motion vector predictor candidate list, counting from 0 istLX[numCurrMvpCand] is the LY of the history predicted motion vector candidate HmvpCandList[NumHmvpCand - i] (Step S2207 in FIG. 29) to the current predicted motion vector candidate Increment the number of historical motion vector predictor candidates, numCurrMvpCand, by 1. In the list, there is a reference index that is the same as the reference index refIdxLX of the motion vector to be coded / decoded. An element of the motion vector predictor list mvpListLX that is different from any element of the motion vector predictor list mvpListLX If not (step S2206 in FIG. 29: NO), skip the additional process of step S2207. Upload.

[0144] The above steps S2205 to S2207 in FIG. 29 are performed on both L0 and L1. (Steps S2204 to S2208 in FIG. 29). Increment the index i by 1. , the index i is the smaller value between 4 and the number of historical motion vector predictor candidates NumHmvpCand. In the following cases, the process from step S2203 onward is performed again (steps S2202 to S2204 in FIG. 29). S2209).

[0145] <History merge candidate derivation process> Next, the history merge candidate derivation unit 345 of the normal merge mode derivation unit 302 on the encoding side, This is a common process between the normal merge mode derivation unit 402 and the history merge candidate derivation unit 445. The history from the history merge candidate list HmvpCandList, which is the processing procedure of step S404 in The method of deriving merge candidates will now be described in detail. Figure 30 shows the history merge candidate derivation process. 1 is a flowchart for explaining the process.

[0146] First, an initialization process is performed (step S2301 in FIG. 30). Set the value of FALSE for each (rrMergeCand -1)th element and set the variable numOrigMergeCand to the current Sets numCurrMergeCand, the number of elements currently in the merge candidate list.

[0147] Next, set the initial value of the index hMvpIdx to 1, and then run the Then, the additional processing from step S2303 to step S2310 in FIG. 30 is repeated (FIG. 3 0 steps S2302 to S2311). Elements registered in the current merge candidate list If the number of merge candidates, numCurrMergeCand, is not less than (MaxNumMergeCand-1), Since merge candidates have been added to all elements in the candidate list, the process of deriving merge candidates in this history is The process ends (NO in step S2303 in FIG. 30). If the number of elements in the merge candidate list, numCurrMergeCand, is less than or equal to (MaxNumMergeCand-1), the merge candidate list is The process from step S2304 onwards is carried out. Set the value of sameMotion to FALSE (see Figure 30). (Step S2304). Next, the initial value of index i is set to 0, and The processes in steps S2306 and S2307 in FIG. 30 are repeated up to numOrigMergeCand-1 (FIG. 30 S2305 to S2308 of the previous motion vector prediction candidate list. Counting from 0 in the history motion vector prediction candidate list (NumHmvp Cand - hMvpIdx)th element HmvpCandList[NumHmvpCand- hMvpIdx] is the merge candidate list. Counting from 0, compare whether the value is the same as the i-th element mergeCandList[i] (step in Figure 30). (P2306).

[0148] The same value for a merge candidate means that all components (inter prediction mode, reference If the values ​​of the merge candidates (reference index, motion vector) are the same, the merge candidates are considered to have the same value. If the complements are the same and isPruned[i] is FALSE (YES in step S2306 of FIG. 30), Both sameMotion and isPruned[i] are set to TRUE (step S2307 in FIG. 30). If the values ​​are not the same (NO in step S2306 in FIG. 30), the process in step S2307 is performed. The process from step S2305 to step S2308 in FIG. When the process is completed, compare whether sameMotion is FALSE (step S230 in FIG. 30). 9) If sameMotion is FALSE (YES in step S2309 in FIG. 30), that is, That is, the (NumHmvpCand - hMvpIdx)th element in the history motion vector candidate list, counting from 0 The element HmvpCandList[NumHmvpCand - hMvpIdx] does not exist in mergeCandList, so it is not a merge candidate. The history prediction movement vector is stored in the numCurrMergeCand-th mergeCandList[numCurrMergeCand] of the list. The (NumHmvpCand - hMvpIdx)th element of the candidate list, counting from 0, is HmvpCandList[NumHmv pCand - hMvpIdx] and increment numCurrMergeCand by 1 (step 30 in Figure 30). The index hMvpIdx is incremented by 1 (step S23 in FIG. 30). 02), steps S2302 to S2311 in FIG. 30 are repeated.

[0149] All elements in the history motion vector prediction candidate list are checked or the merge candidate list is Once all elements in the history have been added with merge candidates, the process of deriving merge candidates for this history is complete. .

[0150] <Average merge candidate derivation process> Next, the average merge candidate derivation unit 344 of the normal merge mode derivation unit 302 on the encoding side This is a common process between the average merge candidate derivation unit 444 of the normal merge mode derivation unit 402 on the side. A detailed description of the method for deriving average merging candidates, which is the processing procedure in step S403 of 21, is provided below. 38 is a flowchart illustrating the procedure of the average merging candidate derivation process.

[0151] First, an initialization process is performed (step S1301 in FIG. 38). Sets numCurrMergeCand, the number of elements currently in the merge candidate list.

[0152] Next, the merge candidate list is scanned from the top to determine two pieces of motion information. Let the index i=0 indicating the first motion information, and the index j=1 indicating the second motion information. Steps S1302 to S1303 in FIG. 38. If the number of elements, numCurrMergeCand, is not less than (the maximum number of merge candidates, MaxNumMergeCand-1), Since merge candidates have been added to all elements in the history candidate list, the history merge candidate derivation process The process is then terminated (step S1304 in FIG. 38). If the number of elements to be merged is numCurrMergeCand (the maximum number of merge candidates, MaxNumMergeCand-1), the The processing from step S1305 onwards is carried out.

[0153] The i-th motion information of the merge candidate list, mergeCandList[i], and the j-th motion information of the merge candidate list, It is determined whether or not both of the pieces of information mergeCandList[j] are invalid (step S130 in FIG. 38). 5) If both are invalid, the average merge candidates of mergeCandList[i] and mergeCandList[j] If mergeCandList[i] and mergeCandList[j] are both invalid, If not, the following process is repeated with X set to 0 and 1 (steps S1306 to S1309 in FIG. 38). 1314).

[0154] Determine whether the LX prediction of mergeCandList[i] is valid (step S1307 in FIG. 38). If the LX prediction of mergeCandList[i] is valid, then the LX prediction of mergeCandList[j] is valid. It is determined whether the LX prediction of mergeCandList[j] is valid (step S1308 in FIG. 38). That is, if the LX prediction of mergeCandList[i] and the LX prediction of mergeCandList[j] are both valid, If so, the motion vector of the LX prediction in mergeCandList[i] and the motion vector of the LX prediction in mergeCandList[j] are The motion vector of the LX prediction obtained by averaging the motion vectors and the reference index of the LX prediction in mergeCandList[i] The average merge candidate of the LX prediction with the averaging function is calculated and set to the LX prediction of averageCand. The LX prediction of geCand is validated (step S1309 in FIG. 38). In step 08, if the LX prediction of mergeCandList[j] is not valid, i.e., the LX prediction of mergeCandList[i] If the prediction is valid and the LX prediction of mergeCandList[j] is invalid, Derive the average merge candidate of the LX prediction with the motion vector and reference index of the prediction, and The LX prediction of ageCand is set to the LX prediction of averageCand, and the LX prediction of averageCand is enabled (step S13 in FIG. 38). 10). In step S1307 of FIG. 38, if the LX prediction of mergeCandList[i] is not valid, Determine whether the LX prediction of mergeCandList[j] is valid (step S1311 in FIG. 38). ) If the LX prediction of mergeCandList[j] is valid, i.e., the LX prediction of mergeCandList[i] is If invalid and the LX prediction of mergeCandList[j] is valid, the LX prediction of mergeCandList[j] The average merge candidate of LX prediction with the motion vector and reference index of and sets the LX prediction of averageCand to valid (step S1312 in FIG. 38). In step S1311 of FIG. 38, if the LX prediction of mergeCandList[j] is not valid, i.e. That is, if both the LX prediction of mergeCandList[i] and the LX prediction of mergeCandList[j] are invalid, The LX prediction of averageCand is disabled (step S1312 in FIG. 38).

[0155] The average merge candidate averageCand of the L0 prediction, L1 prediction, or BI prediction generated as above is , and add it to mergeCandList[numCurrMergeCand], the numCurrMergeCand-th merge candidate in the merge candidate list. Then, numCurrMergeCand is incremented by 1 (step S1315 in FIG. 38). , completing the process of deriving the average merging candidates.

[0156] The average merge candidate is calculated by dividing the horizontal and vertical components of the motion vector. It is averaged.

[0157] <Motion compensation prediction processing> The motion compensation prediction unit 306 predicts the current block being predicted during coding. The motion compensation prediction unit 306 obtains the position and size of the inter prediction information. The inter prediction mode is obtained from the inter prediction mode determination unit 305. The pixel value and the motion vector are derived and stored in the decoded image memory 104. The reference picture to be used is moved from the same position as the image signal of the prediction block by the amount of the motion vector. After acquiring the image signal at the position where the image has been shifted, a prediction signal is generated.

[0158] In inter prediction, the inter prediction mode is a single reference picture, such as L0 prediction or L1 prediction. In the case of prediction from a reference picture, the prediction signal obtained from one reference picture is called the motion compensated prediction signal. The prediction mode is a prediction mode from two reference pictures, such as BI prediction. In the case of prediction, the weighted average of the prediction signals obtained from two reference pictures is used as the motion vector. The bidirectional motion compensation prediction signal is supplied to the prediction method determination unit 105. The weighted average of the predictions is set to a ratio of 1:1, but weighting can be done using other ratios. For example, the picture interval between the picture to be predicted and the reference picture is close. The weighting ratio may be set to be larger for a larger number of pixels. This may be done using a correspondence table of combinations of channel intervals and weighting ratios.

[0159] The motion compensation prediction unit 406 has the same function as the motion compensation prediction unit 306 on the encoding side. The compensation prediction unit 406 outputs the inter prediction information to the normal prediction motion vector mode derivation unit 401, A normal merge mode derivation unit 402, a sub-block predicted motion vector mode derivation unit 403, The block merge mode is obtained from the block merge mode derivation unit 404 via the switch 408. The prediction unit 406 supplies the obtained motion compensation prediction signal to the decoded image signal superimposition unit 207 .

[0160] <Inter prediction mode> The process of making predictions from a single reference picture is defined as uni-prediction, and in the case of uni-prediction, it is called L0 prediction. Or L1 prediction, which is a prediction using one of the two reference pictures registered in the reference lists L0 and L1. A prediction is made using either one of them.

[0161] FIG. 32 shows a uni-prediction model in which the L0 reference picture (RefL0Pic) is the picture to be processed. FIG. 33 shows a case where the time is before the CurPic (CurPic). In the example shown in FIG. 1, the reference picture is located after the current picture. 32 and 33, the reference picture for L0 prediction is changed to the reference picture for L1 prediction (RefL1Pi It is also possible to replace it with c) and perform uni-prediction.

[0162] The process of making predictions from two reference pictures is defined as bi-prediction, and in the case of bi-prediction, it is called L0 prediction. The bi-prediction is expressed as BI prediction using both L0 and L1 prediction. The reference picture for L1 prediction is located before the current picture and the reference picture for L1 prediction is the current picture. FIG. 35 shows a case where the picture is bi-predictive and has a reference for L0 prediction. This indicates that the reference picture for L1 prediction and the reference picture for L2 prediction are located at a time earlier than the picture being processed. FIG. 36 shows a bi-prediction example in which a reference picture for L0 prediction and a reference picture for L1 prediction are processed. This shows the case where the picture is located after the picture to be processed.

[0163] In this way, the relationship between the L0 / L1 prediction type and time is that L0 is the past direction and L1 is the future direction. In the case of bi-prediction, the same reference picture can be used. Alternatively, the motion compensation prediction may be performed in a uni-predictive manner. The decision as to whether to use L0 prediction or bi-prediction is made based on, for example, whether to use L1 prediction or not. The determination is made based on information (for example, a flag) indicating whether or not the

[0164] <About reference indexes> In the embodiment of the present invention, in order to improve the accuracy of the motion compensation prediction, This makes it possible to select the most suitable reference picture from among a number of reference pictures. The reference picture used in the motion compensation prediction is used as a reference index, and The index is coded into the bitstream together with the differential motion vector.

[0165] <Motion compensation process based on normal predicted motion vector mode> The motion compensation prediction unit 306 is also shown in the inter prediction unit 102 on the encoding side in FIG. In this way, the inter prediction mode determination unit 305 performs normal prediction motion vector mode derivation. When the inter prediction information by the unit 301 is selected, the inter prediction information is - The inter prediction mode of the block currently being processed is obtained from the prediction mode determination unit 305. The prediction mode, reference index, and motion vector are derived, and a motion compensation prediction signal is generated. The generated motion compensation prediction signal is supplied to the prediction method determination unit 105.

[0166] Similarly, the motion compensation prediction unit 406 also performs the same processing as the inter prediction unit 203 on the decoding side in FIG. As shown, during the decoding process, a switch 408 is turned on to the normal predicted motion vector mode derivation unit 40. When connected to 1, inter prediction by the normal prediction motion vector mode derivation unit 401 The information is obtained and the inter prediction mode and reference index of the currently processed block are The generated motion compensation prediction signal is then used to derive a motion vector. The signal is supplied to a decoded image signal superimposing unit 207.

[0167] <Motion compensation processing based on normal merge mode> The motion compensation prediction unit 306 is also shown in the inter prediction unit 102 on the encoding side in FIG. In this way, the inter prediction mode determination unit 305 determines whether the normal merge mode is When inter prediction information by the inter prediction mode is selected, the inter prediction information is the inter prediction mode of the block currently being processed, obtained from the inter prediction mode determination unit 305; A reference index and a motion vector are derived, and a motion compensation prediction signal is generated. The compensated prediction signal is supplied to a prediction method determination unit 105.

[0168] Similarly, the motion compensation prediction unit 406 also performs the same processing as the inter prediction unit 203 on the decoding side in FIG. As shown, during the decoding process, the switch 408 is normally connected to the merge mode derivation unit 402. If the merge mode is not set, the inter prediction information is obtained from the normal merge mode derivation unit 402, and the current process is performed. The inter prediction mode, reference index, and motion vector of the block being processed are The generated motion compensation prediction signal is multiplied by the decoded image signal. The signal is supplied to the folding unit 207.

[0169] <Motion compensation process based on sub-block predicted motion vector mode> The motion compensation prediction unit 306 is also shown in the inter prediction unit 102 on the encoding side in FIG. In this way, the inter prediction mode determination unit 305 determines the sub-block predicted motion vector model. When the inter prediction information by the code derivation unit 303 is selected, this inter prediction information The inter prediction mode determination unit 305 obtains the inter prediction mode of the block currently being processed. Derives the center prediction mode, reference index, and motion vector, and generates a motion compensated prediction signal. The generated motion compensation prediction signal is supplied to the prediction method determination unit 105.

[0170] Similarly, the motion compensation prediction unit 406 also performs the same processing as the inter prediction unit 203 on the decoding side in FIG. As shown, during the decoding process, a switch 408 controls the subblock prediction motion vector mode. When the sub-block prediction motion vector mode derivation unit 403 is connected to the The inter prediction information is obtained by the current block being processed. The generated code, reference index, and motion vector are derived to generate a motion compensation prediction signal. The resulting motion compensation prediction signal is supplied to a decoded image signal superimposing unit 207 .

[0171] <Motion compensation processing based on sub-block merge mode> The motion compensation prediction unit 306 is also shown in the inter prediction unit 102 on the encoding side in FIG. In this way, the inter prediction mode determination unit 305 includes a sub-block merge mode derivation unit When the inter prediction information by 304 is selected, the inter prediction information is Inter prediction of the block currently being processed obtained from the prediction mode determination unit 305 A mode, a reference index, and a motion vector are derived, and a motion compensation prediction signal is generated. The motion compensation prediction signal is supplied to the prediction method determination unit 105 .

[0172] Similarly, the motion compensation prediction unit 406 also performs the same processing as the inter prediction unit 203 on the decoding side in FIG. As shown, during the decoding process, a switch 408 controls the sub-block merge mode derivation unit 404 to , the inter prediction information by the subblock merge mode derivation unit 404 The inter prediction mode and reference index of the currently processed block are obtained. , derive a motion vector, and generate a motion compensation prediction signal. The generated motion compensation prediction signal is , and is supplied to the decoded image signal superimposing unit 207.

[0173] <Motion compensation processing based on affine transformation prediction> In normal motion vector prediction mode and normal merge mode, the following flags are used: The following flags are used to indicate whether the affine model is used in the encoding process. Based on the inter prediction conditions determined by the inter prediction mode determination unit 305, the following flags are The bitstream is then coded into the bitstream. Determine whether to perform affine model motion compensation based on the following flags in the program: .

[0174] sps_affine_enabled_flag is the flag for motion compensation using the affine model in inter prediction. If sps_affine_enabled_flag is 0, it is possible to use The motion compensation is suppressed so that it is not based on the affine model. cu_affine_type_flag specifies the CU (coded block) syntax of the coded video sequence. If sps_affine_enabled_flag is set to 1, the encoded video sequence is not transmitted. In this case, affine model-based motion compensation can be used.

[0175] sps_affine_type_flag is the 6-parameter affine model for inter prediction. Indicates whether motion compensation is available. If sps_affine_type_flag is 0, then 6 parameters The motion compensation is suppressed so that it is not based on the affine model. is not conveyed in the CU syntax of a coded video sequence. If e_flag is 1, the 6-parameter affine model is used in the coded video sequence. If sps_affine_type_flag is not present, it is assumed to be 0. do.

[0176] When decoding a P or B slice, the current CU If r_affine_flag is 1, generate a motion compensation prediction signal for the CU currently being processed. To achieve this, affine motion compensation is used. If set, no affine model is used for the currently processed CU. If lag is not present, it is assumed to be 0.

[0177] When decoding a P or B slice, in the currently processed CU, If ffine_type_flag is 1, the motion compensation prediction signal for the currently processed CU is generated. To achieve this, a 6-parameter affine model of motion compensation is used. If e_flag is 0, the motion compensation prediction signal for the currently processed CU is generated. In this paper, motion compensation using a four-parameter affine model is used.

[0178] In the affine model, the reference index and the motion vector are calculated for each subblock. Since the tor is derived, the reference index that is processed on a subblock basis and a motion vector are used to generate a motion compensation prediction signal.

[0179] The four-parameter affine model is the horizontal and vertical components of the motion vectors of the two control points. The motion vector of a subblock is derived from the four parameters of the vertical component. This is a mode in which motion compensation is performed at the pixel position.

[0180] <Intra Block Copy (IBC)> The valid reference area of ​​the intra block copy will be described with reference to FIG. The effective reference area is determined by using the tree block unit as the intra block copy reference block. In FIG. 39A, 500, 501, 502, 503, and 504 are coding trees. 505 is a processing tree block, and 504 is a coding tree block to be processed. This is the target coding block. The processing order of the coding tree blocks is 500, 501, 502. In this case, the coding tree including the coding block 505 to be processed is The three coding tree blocks 501, 502, and 503 processed immediately before the coding tree block 504 are 03 is set as the valid reference area of ​​the coding block 505 to be processed. 1 and before the coding tree block to be processed 505 Regardless of whether the processing has been completed or not, the coding tree including the coding block to be processed 505 is The entire area included in the leaf block 504 is set as an invalid reference area.

[0181] FIG. 39B shows the intra block copy reference block for each of the four divisions of the coding tree block. This is an example of determining a valid reference area as a lock. 515 is the coding tree block to be processed, and 516 is the coding tree block to be processed. Lee block 515 is divided into 4 parts: 506, 507, 508, and 509. 516 is divided into 510, The image is divided into four parts, 511, 512, and 513. 514 is the coding block to be processed. The processing order of the traffic block copy reference block is 506, 507, 508, 509, 510. , 511, 512, 513 in that order. In this case, the coding block 514 to be processed is included. The three intra blocks processed immediately before the intra block copy reference block 511 The copy reference blocks 508, 509, and 510 are used as valid references for the coding block 514 to be processed. The coding tree processed before the intra block copy reference block 508 is block, and whether processing has been completed before the processing target coding block 514. Regardless of the above, the intra block copy reference block 51 including the coding block 514 to be processed All areas included in 1 are considered invalid reference areas.

[0182] <Predictive Intra Block Copy: Encoding Side Explanation> The predictive intra block copy processing procedure on the encoding side will be described with reference to FIG.

[0183] First, the block vector detection unit 375 detects the block vector mvL (see the block diagram of FIG. 44). Next, the IBC space block vector candidate derivation unit 371, IB C history prediction block vector candidate derivation unit 372, IBC prediction block vector candidate supplementation unit 373, an IBC prediction block vector candidate selection unit 376, and a block vector subtraction unit 378 Then, calculate the difference block vector of the block vector used in the predicted block vector mode. (Steps S4501 to S4503 in FIG. 44).

[0184] Calculate the predicted block vector candidates and construct the block vector candidate list mvpList. (Step S4501 in FIG. 44). A spatial block vector candidate derivation unit 371, an IBC history block vector candidate derivation unit 372 Then, the IBC prediction block vector candidate supplementation unit 373 selects a plurality of prediction block vector candidates. The prediction block vector candidate list mvpList is constructed by deriving the vectors. The detailed process procedure of step 01 will be described later with reference to the flowchart of FIG.

[0185] Next, the IBC prediction block vector candidate selection unit 376 selects the prediction block vector A prediction block vector mvpL is selected from the candidate list mvpListL (step S45 in FIG. 44). 02). The block vector mvL and the predicted block vector candidate list mvpListL are stored in Each differential block is a difference between each predicted block vector and the candidate mvpListL[i]. The amount of code when encoding the difference block vectors is calculated. Then, the predicted block vector is calculated for each element of the block vector candidate list mvpListL. Among the elements registered in the candidate list mvpListL, the coding amount for each candidate of the prediction block vector The candidate mvpListL[i] of the predicted block vector for which is the smallest is set as the predicted block vector mvpL. The prediction block vector candidate list mvpListL is selected and its index i is obtained. If there are multiple candidates for the prediction block vector that has the smallest amount of generated code among the prediction blocks, The prediction where index i in the block vector candidate list mvpListL is a small number. Select the candidate block vector mvpListL[i] as the optimal predicted block vector mvpL, and Get the index i of

[0186] Next, the block vector subtraction unit 378 subtracts the prediction vector mvL selected from the block vector mvL. Subtract the block vector mvpL, mvdL = mvL - mvpL The differential block vector mvdL is calculated as follows (step S4503 in FIG. 44).

[0187] <Predictive intra block copy: Decoding side explanation> Next, a procedure of the prediction block vector mode process on the decoding side will be described with reference to FIG. On the other hand, the IBC spatial prediction block vector candidate derivation unit 471 and the IBC history block vector candidate derivation unit 472 are A vector candidate deriving unit 472 and an IBC predicted block vector supplementing unit 473 Calculate the block vector used in the torque mode (steps S4600 to S4601 in FIG. 45). 02). Specifically, the predicted block vector candidate list mvpListL is calculated and the predicted block A vector mvpL is selected, and a block vector mvL is calculated.

[0188] Calculate the predicted block vector candidates and construct the predicted block vector candidate list mvpListL. (Step S4601 in FIG. 45). BC space block vector candidate derivation unit 471, IBC history block vector candidate derivation unit 4 72, the IBC block vector supplement unit 473 calculates multiple prediction block vector candidates. Then, the prediction block vector candidate list mvpListL is constructed. The detailed process of the IBC prediction block vector is not explained here. The candidate selection unit 476 selects the bitstream from the prediction block vector candidate list mvpListL to the bitstream decoding unit 201 A prediction corresponding to the index mvpIdxL of the prediction block vector decoded and supplied by The candidate block vector mvpListL[mvpIdxL] is set as the selected predicted block vector mvpL. Then, the block vector addition unit 47 In step 8, the difference block vector mvdL and the prediction block vector mvdL are decoded and supplied by the bit stream decoding unit 201. Add the lock vector mvpL, mvL = mvpL + mvdL (Step S4602 in FIG. 45).

[0189] <Prediction block vector mode: Block vector prediction method> FIG. 47 shows an intra block copy prediction unit of a video encoding device according to an embodiment of the present invention. 352 and the intra block copy prediction unit 362 of the video decoding device have a common function. 10 is a flowchart showing a procedure of a predictive intra block copy mode derivation process. .

[0190] In the intra block copy prediction unit 352 and the intra block copy prediction unit 362, A prediction block vector candidate list mvpListL is provided. mvpListL has a list structure and is a prediction vector that indicates the location within the prediction block vector candidate list. The block vector index and the predicted block vector candidate corresponding to the index are A memory area is provided to store the number of predicted block vector indexes as elements. The character starts from 0, and the predicted block vector candidate list mvpListL is stored in the memory area of ​​the predicted block vector candidate list mvpListL. In this embodiment, the prediction block vector candidate list is stored. The mvpListL can register three prediction block vector candidates. Furthermore, the predicted block vectors registered in the predicted block vector candidate list mvpListL are The variable numCurrMvpIbcCand, which indicates the number of candidates, is set to 0.

[0191] The IBC spatial block vector candidate derivation units 371 and 471 are A candidate prediction block vector from the vectors is derived (step S4801 in FIG. 47). In this process, the prediction block vector candidate of the adjacent block on the left (A0 or A1) is used. A flag "availableFlagLA" indicating whether the block vector mvLA can be used is derived, and the block vector mvLA is calculated. Then, the IBC spatial block vector is added to the prediction block vector candidate list mvpListL. The vector candidate derivation units 371 and 471 select the adjacent block (B0, B1 or B2) on the upper side. ) is derived (step S4802 in FIG. 47). In the process, a flag indicating whether a motion vector predictor candidate of an upper adjacent block is available is used. The lag availableFlagLB and the block vector mvLB are derived, and if mvLA and mvLB are not equal, In step S4 of FIG. 47, mvLB is added to the predicted block vector candidate list mvpListL. The processes in S401 and S402 are the same except for the positions and number of adjacent blocks to be referenced. The flag availa indicates whether the prediction block vector candidate of the coding block is available or not. bleFlagLN and a motion vector mvLN (N is A or B, and so on below) are derived.

[0192] Next, the IBC history block vector candidate derivation units 372 and 472 derive the history block vectors. The prediction block is made by using the historical block vector candidates registered in the candidate list HmvpIbcCandList. The vector candidate list mvpListL is added to this block vector candidate list mvpListL (step S4803 in FIG. 47). For details of the registration process in step S4803, see the flowchart in Figure 29. In the explanation of the operation, the motion vector is a block vector, and the list of reference indexes is L0 , the historical predicted motion vector candidate list HmvpCandList is converted into the historical block vector candidate list Hmvp The operation should be the same as when IbcCandList is used, so the explanation will be omitted.

[0193] Next, the IBC prediction block vector supplement units 373 and 473 are Add a block vector of a given value, such as (0,0), until the complement list mvpListL is filled ( S4804 in Figure 47).

[0194] <Merge intra block copy mode derivation part> The intra block copy prediction unit 352 in FIG. 371, an IBC history block vector candidate derivation unit 372, an IBC block vector complement A filling unit 373, a reference position correction unit 380, a reference area boundary correction unit 381, and an IBC merge candidate selection unit The prediction mode determining unit 377 includes an IBC prediction mode determining unit 374 and an IBC prediction mode determining unit 377.

[0195] The intra block copy prediction unit 362 in FIG. 471, an IBC history block vector candidate derivation unit 472, an IBC block vector complement A filling unit 473, an IBC merge candidate selection unit 474, a reference position correction unit 480, and a reference area boundary correction unit The block copy unit 477 includes a block copy unit 481 .

[0196] FIG. 46 shows an intra block copy prediction unit of a video encoding device according to an embodiment of the present invention. 352 and the intra block copy prediction unit 362 of the video decoding device have a common function. 10 is a flowchart for explaining a procedure of a merge intra block copy mode derivation process. do.

[0197] In the intra block copy prediction unit 352 and the intra block copy prediction unit 362, It has a merge intra block copy candidate list mergeIbcCandList. The mergeIbcCandList is a list structure of merge intrablock copy candidates. The merge index indicates the location of the copy candidate and the merge A storage area is provided for storing intra block copy candidates as elements. The index number starts from 0 and the merge intra block copy candidate list mergeIbc Merge intra block copy candidates are stored in the CandList storage area. The merge intra block copy candidate list mergeIbcCandList lists the merge intra block copy candidates. The merge candidates for index i are represented as mergeIbcCandList[i]. In this case, the merge candidate list mergeCandList must contain at least three merge intra-block codes. In addition, merge intra block copy candidates can be registered. Indicates the number of merge intra block copy candidates registered in the supplementary list mergeIbcCandList. Set the variable numCurrMergeIbcCand to 0.

[0198] The IBC space block vector candidate derivation unit 371 and the IBC space block vector candidate derivation unit The output unit 471 receives the encoded information storage memory 111 of the video encoding device or the encoded information storage memory 111 of the video decoding device. From the coding information stored in the coding information storage memory 205, The spatial merge candidates A and B are derived from the adjacent blocks on the left and right. The candidate for the merge block copy is registered in the mergeIbcCandList (Figure 4). Here, we define N, which indicates either spatial merge candidate A or B. The intra block copy prediction information of block N is the spatial block vector merge candidate N Derive a flag, availableFlagN, indicating whether the vector can be used as a block vector, mvL. However, in this embodiment, the block including the coding block to be processed Since the block vector merging candidates are derived without referring to other coding blocks, The spatial block vector merge candidates included in the block containing the coding block to be processed are derived. Not put out.

[0199] Next, the IBC history block vector candidate derivation unit 372 and the IBC history block vector candidate derivation unit 373 The vector candidate derivation unit 472 registers the vector candidate in the history prediction block vector candidate list HmvpIbcCandList. Merge the historical predicted block vector candidates into the intra block copy candidate list me In this embodiment, the merg Block vectors added to eIbcCandList and blocks of historical prediction block vector candidates If the vectors have the same value, they shall not be added to mergeIbcCandList.

[0200] Next, the IBC prediction block vector supplementation unit 373 and the IBC prediction block vector supplementation unit The filler 473 is registered in the merge intra block copy candidate list mergeIbcCandList. The number of merge candidates numCurrMergeIbcCand is less than the maximum number of intra-block merge candidates MaxNumM If less than ergeIbcCand, the merge intra block copy candidate list mergeIbcCandList The number of merge candidates registered in t is numCurrMergeIbcCand, which is the maximum number of merge candidates. Derive additional intra block merge candidates with bcCand as the upper limit and merge intra block candidates. The mergeIbcCandList is registered in the copy candidate list mergeIbcCandList (step S4703 in FIG. 46). A block vector with a value of (0,0) with the upper limit set to the number of merge candidates MaxNumMergeIbcCand Add it to the merge intra block copy candidate list, mergeIbcCandList.

[0201] Next, the IBC merge candidate selection unit 374 and the IBC merge candidate selection unit 474 select the merge candidates. Intrablocks registered in the intrablock copy candidate list mergeIbcCandList The IBC merge candidates are selected (step S4704 in FIG. 46). The selection unit 374 obtains the decoded image at the reference position from the decoded image memory 104 and compares it with the code amount. A merge candidate is selected by calculating the amount of the intra block merge candidate. The IBC prediction mode determination unit 377 receives a merge index indicating the IBC prediction mode. The mode determination unit 377 calculates the amount of code and the amount of distortion to determine whether or not the mode is a merge mode. The result is supplied to the prediction method determination unit 105. In unit 474, intra block merging candidates are selected based on the decoded merging index. and supplies the selected intra block merging candidate to the reference position correction unit 480.

[0202] Next, the reference position correction unit 380 and the reference position correction unit 480 perform intra-block marking. The process of correcting the reference position of the page candidate is performed (step S4705 in FIG. 46). The processing by the correction section 380 and the reference position correction section 480 will be described in detail later.

[0203] Next, the reference area boundary correction unit 381 and the reference area boundary correction unit 481 perform intra-block The process of correcting the reference area boundary for the check merge candidate is performed (step S4706 in FIG. 46). The processing performed by the reference position correction unit 381 and the reference position correction unit 481 will be described in detail later.

[0204] The block copy unit 477 obtains the decoded image at the reference position from the decoded image memory 208, The block copy unit 477 supplies the decoded image signal to the decoded image signal superimposing unit 207. and the chrominance components are copied.

[0205] The above block vector mvL indicates the block vector of luminance. For mvC, if the color difference format is 420, mvC = ( ( mvL >> ( 3 + 2 ) ) * 32 Using the above formula, the x and y components of mvC are processed respectively.

[0206] <Reference position correction section> FIG. 48 is a flowchart explaining the processing of the reference position correction unit 380 and the reference position correction unit 480. Now, the unit of the intra block copy reference block is the coding tree block. The size of the CTU is not 128x128 pixels.

[0207] First, the positions of the top left and bottom right of the reference block are calculated (S6001). indicates a block that the processing target coding block refers to using a block vector. If the top left corner of the reference block is (xRefTL, yRefTL) and the bottom right corner is (xRefBR, yRefBR), then ( xRefTL, yRefTL ) = ( xCb + ( mvL

[0000] >> 4 ), yCb + ( mvL

[0001] >> 4 ) ) ( xRefBR, yRefBR ) = ( xRefTL + cbWidth - 1, yRefTL + cbHeight - 1 ) Here, the position of the coding block to be processed is (xCb, yCb), and the block vector is (mvL[ The width of the coding block to be processed is cbWidth and the height is cbHeight.

[0208] Next, it is determined whether the size of the CTU is 128 x 128 pixels (S6002). is not 128x128 pixels (S6002: NO), so the top left and bottom right positions of the accessible area The upper left corner of the accessible area is calculated as (xAvlTL, yAvlTL) and the lower right corner as (xAvlBR , yAvlBR), then NL = Min( 1, 7 - CtbLog2SizeY ) - ( 1 << ((7 - CtbLog2SizeY) << 1) ) ( xAvlTL, yAvlTL ) = ( ((xCb >> CtbLog2SizeY) + NL) << CtbLog2SizeY, (yCb >> CtbLog2SizeY) << CtbLog2SizeY ) ( xAvlBR, yAvlBR ) = ( ((xCb >> CtbLog2SizeY) << CtbLog2SizeY) - 1, (((yCb >> CtbLog2SizeY) + 1) << CtbLog2SizeY) - 1 ) Here, the size of the CTU is CtbLog2SizeY.

[0209] Next, determine whether the reference position in the x direction of the reference block is smaller than the top left corner of the referenceable area. If the determination is false (S6004: NO), the next process is performed (S6006). On the other hand, if the judgment is true (S6004: YES), the upper left corner of the accessible area is aligned. The reference position in the x direction is corrected (S6005).

[0210] 49 is a diagram showing how to correct the reference position. 6001 is a coding tree to be processed. 6001 indicates the block, 6002 indicates the coding block to be processed, and 6003 indicates the accessible area. Let's say that the reference block r2 is located at 6011. Then, the reference position in the x direction is It is smaller than the upper left corner of the area (S6004: YES). Therefore, xRefTL = xAvlTL, so 6012 The reference position is corrected to the position of (S6005). Here, as in S6001, xRefBR=x Since it is RefTL+cbWidth-1, xRefBR will be corrected along with the correction of xRefTL. In this correction of the reference position, the block vector mvL[0] may be corrected. , mvL[0] = (xAvlTL - xCb) << 4 This makes xRefTL=xAvlTL, so the reference position can be corrected.

[0211] In this way, if the reference block is located outside the accessible region, By correcting the above, it becomes possible to refer to the data.

[0212] Now, the block vector candidate list constructed in the intra block copy prediction unit 352 is Suppose some of the block vectors in the list are outside the referenceable region. If the position is not corrected, reference by those block vectors is not possible, so The block vectors cannot be candidates for the IBC merge mode. When correcting the reference position in the block vector candidate list, all blocks in the block vector candidate list are The block vector is inside the accessible region. Therefore, the access by all block vectors is All block vectors can be candidates for the IBC merge mode. Therefore, in the IBC merge mode selection unit 374, The optimal prediction mode can be selected from the candidates of each IBC merge mode. This improves the efficiency of the process.

[0213] Now, the block vector candidate list constructed in the intra block copy prediction unit 362 is Suppose some of the block vectors in the list are outside the referenceable region. If the position is not corrected, reference by those block vectors is not possible, so The IBC merge mode using the block vectors cannot be decoded. In the case of a coding device that does not have such a block vector, the IBC merge mode is indicated by the block vector. The page index operates as if it were not coded. However, due to malfunctions, Such merge indexes may be encoded to generate a bitstream. Or, due to packet loss, some part of the bit stream is missing, and the decoding is not possible. Such a merge index may result. When attempting to decode the stream, an invalid position is reached because the reference is outside the accessible region. As a result, the decoding device may access the decoded image memory. On the other hand, when the reference position is corrected in the present invention, All block vectors in the constructed block vector candidate list are in the referenceable region. Therefore, even if such an incomplete bitstream is decoded, the referenceable area is The reference position is corrected to the inside of the region, making it possible to refer to the image. This guarantees the memory access range. As a result, the decoded result is the same depending on the decode device. This allows the decoding process to be continued, thereby improving the robustness of the decoding device.

[0214] In addition, when correcting the block vector in the correction of the reference position, the target is the luminance block vector. Here, the chrominance block vector is a vector that is divided by the luminance block vector. In other words, if the luminance block vector is corrected, the chrominance block vector is calculated. Therefore, there is no need to correct the reference position again for color difference. When block vectors are not corrected, it is necessary to determine whether they can be referenced in both luminance and chrominance. In comparison with the conventional method, the amount of processing can be reduced.

[0215] In addition, when correcting a block vector in the correction of the reference position, the corrected block The vector is stored in the coding information storage memory as a block vector of the coding block to be processed. 111 or the coded information storage memory 205. The lock vector points to the same location. Here, the decoded result is stored in the decoded image memory. In this filtering process, the block boundaries are deblocked. The strength of the filter is controlled by the difference between the block vectors of the two blocks facing the boundary. If the block vector is not corrected, the corrected reference position and the block vector are Compared to when the position is different, the strength of the filter is more appropriate, improving coding efficiency. It can be done.

[0216] Next, check whether the reference position in the y direction of the reference block is smaller than the top left corner of the accessible area. If the determination is false (S6006: NO), the next process (S6008 On the other hand, if the judgment is true (S6006: YES), align it to the top left of the accessible area. Then, the reference position in the y direction is corrected (S6007).

[0217] Now, if the reference block r4 is located at 6021, the reference position in the y direction is It is smaller than the upper left corner of the available area (S6006: YES). Therefore, yRefTL = yAvlTL is set to 60. The reference position is corrected to the position of 22 (S6007). Here, as in S6001, yRef Since BR=yRefTL+cbHeight-1, yRefBR is also corrected when yRefTL is corrected. In this correction of the reference position, the block vector mvL[1] may be corrected. Mari, mvL[1] = (yAvlTL - yCb) << 4 This makes it so that yRefTL=yAvlTL, and the reference position can be corrected.

[0218] Next, check whether the reference position in the x direction of the reference block is greater than the bottom right corner of the accessible area. If the determination is false (S6008: NO), the next process (S6010 On the other hand, if the judgment is true (S6008: YES), align it to the bottom right of the accessible area. Then, the reference position in the x direction is corrected (S6009).

[0219] Now, if the reference block r7 is located at 6031, the reference position in the x direction is It is larger than the bottom right corner of the available area (S6008: YES). Therefore, xRefBR = xAvlBR, so 60 The reference position is corrected to the position of 32 (S6009). Here, xRef BR=xRefTL+cbWidth-1, that is, xRefTL=xRefBR-(cbWidth-1), so xRefBR was corrected. In this correction of the reference position, the block vector is You can also correct the vector mvL[0]. That is, mvL[0] = (xAvlBR - (xCb + cbWidth - 1)) << 4 This makes xRefBR=xAvlBR, so the reference position can be corrected.

[0220] Next, check whether the reference position in the y direction of the reference block is greater than the bottom right corner of the accessible area. If the determination is false (S6010: NO), the process ends. If the answer is true (S6010: YES), the reference in the y direction is aligned to the bottom right of the accessible area. The position is corrected (S6011).

[0221] Now, if the reference block r5 is located at 6041, the reference position in the y direction is It is larger than the bottom right corner of the available area (S6010: YES). Therefore, yRefBR = yAvlBR, so 60 The reference position is corrected to the position of 42 (S6011). Here, as in S6001, yRef BR=yRefTL+cbHeight-1, that is, yRefTL=yRefBR-(cbHeight-1), so yRefBR is corrected. In this correction of the reference position, the block The vector mvL[1] may be corrected. That is, mvL[1] = (yAvlBR - (yCb + cbHeitght - 1)) << 4 This makes it so that yRefBR=yAvlBR, and the reference position can be corrected.

[0222] Here, we will explain the case where the reference block r1 is located at 6051. In this case, In the same way as when the reference block is r2, the reference position in the x direction is corrected. As in the case of r4, the reference position in the y direction is corrected. As a result, the reference block r1 is It is located at 6052 inside the illuminatable area.

[0223] If reference block r3 is located at 6061, then reference block r6 is located at 6062. If the reference block r8 is located at 6063, the x and y directions are calculated as above. The reference position is corrected. As a result, each reference block is located within the accessible area. do.

[0224] This completes the process when the size of the CTU is not 128x128 pixels. If the size is 128x128 pixels (S6002: YES), the upper left corner of the accessible area is And the bottom right position is calculated (S6012).

[0225] FIG. 50 is a diagram for explaining the positions of the upper left and lower right corners when the accessible area is rectangular. In the case of FIG. 50A, the coding tree block 6101 to be processed is divided into four. The coding block 6102 to be processed is located at the upper left of the division. The area is an inverted L-shape, as shown by the shaded area in 6103. If the accessible area is rectangular, The range is the rectangular range of 6103. When the referenceable area is rectangular, If the top left corner of the block is (xRefTL, yRefTL) and the bottom right corner is (xRefBR, yRefBR), then offset[4] = {0, 64, 128, 128} NL = -offset[3 - blk_idx], NR = offset[blk_idx] ( xAvlTL, yAvlTL ) = ( (xCb >> CtbLog2SizeY) << CtbLog2SizeY + NL, (yCb >> CtbLog2SizeY) << CtbLog2SizeY ) ( xAvlBR, yAvlBR ) = ( ((xCb >> CtbLog2SizeY) << CtbLog2SizeY) - 1 + NR, (((yCb >> CtbLog2SizeY) + 1) << CtbLog2SizeY) - 1 ) Here, blk_idx is an index indicating the position of the coding block to be processed. The coding tree block to be processed is divided into four parts, and the coding block to be processed is the left If the target coding block is located above, blk_idx = 0. If they are located at the top right, bottom left, and bottom right, respectively, blk_idx is 1, 2, and 3. 50B to 50D are diagrams showing the case where blk_idx=1 to 3, respectively. FIG.

[0226] Next, the reference position of the non-rectangular referable area is corrected (S6013). 1 is a flowchart for explaining a process for correcting the reference position of a portion where the referenceable area is not rectangular. First, the top left position of the accessible area is calculated (S6021). The accessible area is shown in Figure 5. Since it is a diagonal line part of 0, except for the case of blk_idx=3, there are two positions in the upper left corner, 6111 and 6112. If they are (X1, Y1) and (X2, Y2), then offset[4] = {64, 128, 64, 0}, NL = offset[blk_idx] (X1, Y1) = (xAvlTL, yAvlTL + 64) (X2, Y2) = (xAvlTL + NL, yAvlTL) It becomes.

[0227] Next, it is determined whether or not to correct the reference position to match the top left corner of the referenceable area (S602 2) In this judgment, blk_idx=3 is not satisfied and the reference block is located in an area smaller than X2 and Y1. If it is, it is judged as true (S6022: YES). If it is false (S6022: NO), Then proceed to the next process (S6026).

[0228] Next, the difference in the x direction between the reference block and the accessible area is It is determined whether the difference is smaller than the difference in the y direction (S6023). 23: YES), the reference position in the x direction is corrected (S6024). On the other hand, if the judgment is false ( S6023: NO), and correct the reference position in the y direction (S6025).

[0229] FIG. 52A is a diagram showing how the reference position is corrected in S6024 and S6025. Now, blk_idx=0. If the reference block r1 is located at 6201, then blk_i dx=3 and the upper left corner of the reference block is X2 (x direction of 6112) and Y1 (y direction of 6111). It is located in a smaller area (S6022: YES). Also, the reference block and the referenceable The difference in the x direction of the area is smaller than the difference in the y direction of the reference block and the accessible area (S6 023:YES). Therefore, the reference position in the x direction is set to 6202 as xRefTL=xAvlTL+NL. Correct (S6024). Here, as in S6001, xRefBR = xRefTL + cbWidth - 1 Therefore, when xRefTL is corrected, xRefBR is also corrected. In the correction of the position, the block vector mvL[0] may be corrected. mvL[0] = (xAvlTL + NL - xCb) << 4 This makes it so that xRefTL=xAvlTL+NL, and the reference position can be corrected.

[0230] On the other hand, if the reference block r2 is located at 6203, blk_idx=3 is not true and the reference The upper left corner of the reference block is located in an area smaller than X2 (x direction of 6112) and Y1 (y direction of 6111). (S6022: YES). Also, the difference in the x direction between the reference block and the referenceable area is not smaller than the difference between the reference block and the accessible area in the y direction (S6023:NO Therefore, the reference position in the y direction is corrected to the position of 6204 by setting yRefTL=yAvlTL+64 (S 6025). Here, as in S6001, yRefBR = yRefTL + cbHeight - 1, so yR The yRefBR is also corrected according to the correction of the efTL. Then, the block vector mvL[0] may be corrected. mvL[1] = (yAvlTL + 64 - yCb) << 4 This makes it so that yRefTL=yAvlTL+64, and the reference position can be corrected.

[0231] Here, let us assume that the reference block r3 is located at 6205. In this case, the reference block and The difference in the x direction of the accessible area is smaller than the difference in the y direction of the reference block and the accessible area. Therefore, the reference position in the x direction is corrected in the same way as for the reference block r1. At this point, the reference block is located at 6206 (S6024). However, by the processing in S6006 and S6007 described later, Correct the reference position. In the end, the reference block is inside the referenceable area.

[0232] Next, the bottom right position of the accessible area is calculated (S6026). The accessible area is shown in FIG. Since this is the shaded area, except for the case where blk_idx=0, there are two positions at the bottom right: 6113 and 6114. If they are (X3, Y3) and (X4, Y4), then offset[4] = {0, 64, 128, 64}, NR = offset[blk_idx] (X3, Y3) = (xAvlBR, yAvlBR - 64) (X4, Y4) = (xAvlBR - NR, yAvlBR) It becomes.

[0233] Next, it is determined whether or not to correct the reference position to match the bottom right corner of the referenceable area (S602 7). In this judgment, blk_idx is not 0 and the reference block is located in an area larger than X4 and Y3. If it is set, it is judged as true (S6027: YES). If it is false (S6027: NO), Then, the process ends.

[0234] Next, the difference in the x direction between the reference block and the accessible area is It is determined whether the difference is smaller than the difference in the y direction (S6028). 28: YES), the reference position in the x direction is corrected (S6029). On the other hand, if the judgment is false ( S6028: NO), and correct the reference position in the y direction (S6030).

[0235] FIG. 52B is a diagram showing how the reference position is corrected in S6029 and S6030. Now, blk_idx=3. If the reference block r1 is located at 6211, then blk_i dx=0 and the bottom right of the reference block is X4 (x direction of 6114) and Y3 (y direction of 6113). It is located in a larger area (S6027: YES). Also, the reference block and the referenceable The difference in the x direction of the area is smaller than the difference in the y direction of the reference block and the accessible area (S6 028:YES). Therefore, the reference position in the x direction is added to the position 6212 with xRefBR=xAvlBR. Correct (S6029). Here, as in S6001, xRefBR = xRefTL + cbWidth - 1, Therefore, xRefTL=xRefBR-(cbWidth-1), so xRefTL is also corrected when xRefBR is corrected. In this correction of the reference position, the block vector mvL[0] is corrected. is also good. mvL[0] = (xAvlBR - NR - (xCb + cbWitdh - 1)) << 4 This makes xRefBR=xAvlBR, so the reference position can be corrected.

[0236] On the other hand, if the reference block r2 is located at 6213, blk_idx is not 0 and the reference The bottom right corner of the reference block is located in an area larger than X4 (x direction of 6114) and Y3 (y direction of 6113). (S6027: YES). Also, the difference in the x direction between the reference block and the accessible area is is not smaller than the difference between the reference block and the accessible area in the y direction (S6028:NO Therefore, the reference position in the y direction is corrected to the position 6214 by setting yRefBR=yAvlBR (S60 30). Here, as in S6001, yRefBR = yRefTL + cbHeight - 1, that is, yRefTL = yRe Since it is fBR-(cbHeight-1), yRefTL will be corrected along with the correction of yRefBR. In this correction of the reference position, the block vector mvL[1] may be corrected. , mvL[1] = (yAvlBR - 64 - (yCb + cbHeight - 1)) << 4 This makes it so that yRefBR=yAvlBR, and the reference position can be corrected.

[0237] Now, let us assume that the reference block r3 is located at 6215. In this case, the reference block and The difference in the x direction of the accessible area is smaller than the difference in the y direction of the reference block and the accessible area. (S6028: NO). Therefore, the reference position in the y direction is corrected in the same way as for the reference block r2. At this point, the reference block is located at 6216 (S6030). However, by the processing in S6008 and S6009 described later, The reference position of the block is corrected. In the end, the reference block is inside the accessible area.

[0238] In FIG. 52, the process of correcting the reference position is described using the cases of blk_idx=0 and 3 as examples. In the cases of 1 and 2, the reference position is corrected in the same manner as in the cases of blk_idx=0 and 3.

[0239] After the process of correcting the reference position of the non-rectangular referenceable area (S6013), The process from 04 to S6011 is performed. This completes the process when the CTU size is 128x128 pixels. will end.

[0240] Now, in the process of correcting the reference position of the non-rectangular referable area (S6013), Then, the reference position in the x direction is corrected to match the top left corner of the referenceable area (S6024). Then, the reference position in the x direction of the reference block is smaller than the top left corner of the accessible area. Therefore, the result of S6004 is always false (S6004: NO). If you have processed S6024, you may choose not to process S6004 and S6005. Similarly, if you process S6025, do not process S6006 and S6007. If S6029 is processed, S6008 and S6009 are not processed. If you have performed S6030, you can also perform S6010 and S6011. It is okay to not do this.

[0241] In the flowchart of FIG. 51, the comparison process of step S6023 is omitted, and Alternatively, step S6025 may always be executed. Similarly, the comparison process in step S6028 may be omitted. Alternatively, a configuration may be adopted in which step S6029 is always executed, or step S60 In such a configuration, the participation can be made by simple processing. This makes it possible to correct the illumination position.

[0242] In FIG. 48, when the size of the CTU is 128x128 pixels, S6012, S6013 and The reference position is corrected using the processes from S6004 to S6011. As shown in FIG. 53, the referenceable area is divided into two and the reference position of each is corrected (S6 101) can also be used.

[0243] FIG. 54 is a diagram for explaining how the accessible area is divided into two. Unlike the previous example, which uses a rectangular accessible area, in Figure 54 the accessible area is divided into two parts. The coding tree block (6101) to be processed is divided into four parts. If the block (6102) is located in the upper left corner, blk_idx=0. If the target coding block is located in the upper right, lower left, or lower right, blk_idx is 1, 2 , 3. FIG. 54A shows the case where blk_idx=0. Similarly, FIG. 54B to FIG. 54D 6A and 6B are diagrams showing the cases where blk_idx=1 to 3, respectively. 1) is referred to as referenceable area A, and the other referenceable area (6302) is referred to as referenceable area B.

[0244] FIG. 55 shows the process of dividing the referenceable area into two and correcting the reference position of each (S61 55 is a flowchart for explaining the process of FIG. 48. First, calculate the top left and bottom right positions of the accessible area A. The top left corner of the accessible area A is set to (xAvlTL, yAvlTL) and the bottom right corner is set to (xAvlBR, yAvlBR), then xOffsetTL[4] = {-128, -128, -64, 0}, yOffsetTL[4] = {64, 64, 64, 0} xOffsetBR[4] = {0, 0, 0, 128}, yOffsetBR[4] = {128, 128, 128, 64} ( xAvlTL, yAvlTL ) = ( (xCb >> CtbLog2SizeY) << CtbLog2SizeY + xOffsetTL[blk_idx], (yCb >> CtbLog2SizeY) << CtbLog2SizeY + yOffsetTL[blk_idx]) ( xAvlBR, yAvlBR ) = ( ((xCb >> CtbLog2SizeY) << CtbLog2SizeY) - 1 + xOffsetBR[blk_idx], (((yCb >> CtbLog2SizeY) + 1) << CtbLog2SizeY) - 1 + yOffsetBR[blk_idx] ) It becomes.

[0245] Next, whether the reference block is outside the referenceable area A or not out_xRefTL = xRefTL < xAvlTL out_yRefTL = yRefTL < yAvlTL out_xRefBR = xRefBR > xAvlBR out_yRefBR = yRefBR > yAvlBR (S6112).

[0246] Next, the upper left and lower right positions of the referenceable area B are calculated (S6113). If the top left corner of area B is (xAvlTL, yAvlTL) and the bottom right corner is (xAvlBR, yAvlBR), then xOffsetTL[4] = {-64, 0, 0, 0}, yOffsetTL[4] = {0, 0, 0, 0} xOffsetBR[4] = {0, 64, 128, 64}, yOffsetBR[4] = {128, 64, 64, 128} ( xAvlTL, yAvlTL ) = ( (xCb >> CtbLog2SizeY) << CtbLog2SizeY + xOffsetTL[blk_idx], (yCb >> CtbLog2SizeY) << CtbLog2SizeY + yOffsetTL[blk_idx]) ( xAvlBR, yAvlBR ) = ( ((xCb >> CtbLog2SizeY) << CtbLog2SizeY) - 1 + xOffsetBR[blk_idx], (((yCb >> CtbLog2SizeY) + 1) << CtbLog2SizeY) - 1 + yOffsetBR[blk_idx] ) It becomes.

[0247] Next, the reference position in the x direction of the reference block is smaller than the top left corner of the referenceable area A, and It is determined whether the reference position of the block in the x direction is smaller than the upper left corner of the referenceable area B (S6 If the determination is false (S6114: NO), the process proceeds to the next step (S6116). If the answer is true (S6114: YES), the reference area in the x direction is aligned with the top left corner of the referenceable area B. The reference position is corrected (S6005). The process of S6005 has already been explained, so we will not explain it here. Omitted.

[0248] Next, the reference position in the y direction of the reference block is smaller than the top left corner of the referenceable area A and the reference Determine whether the reference position in the y direction of the reference block is smaller than the top left corner of the referenceable area B (S If the determination is false (S6116: NO), the process proceeds to the next step (S6118). On the other hand, if the answer is true (S6116: YES), the upper left corner of the accessible area B is aligned with the y-axis. The reference position is corrected (S6007). The process of S6007 has already been explained, so we will not explain it here. is omitted.

[0249] Next, the reference position in the x direction of the reference block is greater than the bottom right corner of the referenceable area A, and It is determined whether the reference position of the block in the x direction is greater than the bottom right corner of the referenceable area B (S6 If the determination is false (S6118: NO), the process proceeds to the next step (S6120). If the answer is true (S6118: YES), the reference area in the x direction is aligned with the bottom right of the referenceable area B. The reference position is corrected (S6009). The processing of S6009 has already been explained, so we will not explain it here. Omitted.

[0250] Next, the reference position in the y direction of the reference block is greater than the bottom right corner of the referenceable area A and It is determined whether the reference position of the block in the y direction is greater than the bottom right corner of the referenceable area B (S6 120). If the determination is false (S6120: NO), the process ends. On the other hand, if the determination is true, If the answer is YES (S6120), the reference position in the y direction is adjusted to match the bottom right corner of the referable area B. The process of S6011 has already been explained, so the explanation will be omitted.

[0251] From the above, when the size of the CTU is 128x128 pixels, the reference block is Even if the object is located outside the referenceable area, it can be referenced by correcting the reference position. By dividing the area into two and correcting the reference position of each, the processing is simplified and the amount of calculation is reduced. Here, one of the accessible areas (6301) is designated as accessible area A. The other accessible area (6302) is set as accessible area B. Swap area A and referenceable area B, and change one of the referenceable areas (6301) to referenceable area B. and the other referenceable area (6302) may be processed as referenceable area A.

[0252] In this embodiment, it is determined whether the size of the CTU is 128x128 pixels (S6002), and the process is terminated. This is because the intra block copy reference block is replaced by the coding tree block. It may be determined whether the CTU is a unit divided into four, or whether the size of the CTU is the maximum size of the coding block. It may be determined whether the size is larger than the large size.

[0253] All of the above-described embodiments may be combined in multiple forms.

[0254] In all the embodiments described above, the bit stream output by the image coding device The specific data is encoded so that it can be decoded according to the encoding method used in the embodiment. The bitstream is compatible with HDDs, SSDs, and flash memory. The information may be provided by recording it on a computer-readable recording medium such as an optical disk. The image may be provided from a server via a wired or wireless network. The image decoding device corresponding to the image coding device can read the specific data format regardless of the providing means. The bitstream of the bit can be decoded.

[0255] In order to exchange bitstreams between the image coding device and the image decoding device, a wired or When a wireless network is used, the data is bit-coded in a data format suitable for the transmission mode of the communication path. In that case, the bit stream output by the image coding device may be converted and transmitted. The stream is converted into coded data in a format suitable for the transmission mode of the communication path and transmitted over the network. a transmitting device that transmits encoded data to a network and receives the encoded data from the network and decodes the data into a bit stream; The image encoding device includes a receiving device that transmits the image to the image decoding device. Memory to buffer the output bitstream and packetize the bitstream A packet processing unit and a transmission unit for transmitting packetized encoded data via a network. The receiving device receives packetized encoded data via a network. a receiving unit for receiving the encoded data, a memory for buffering the received encoded data, and a packetizing unit for packetizing the encoded data. and a packet processing unit that processes the received signal to generate a bitstream and provides the bitstream to the image decoding device.

[0256] In order to exchange bitstreams between the image coding device and the image decoding device, a wired or In the case where a wireless network is used, in addition to the transmitting device and the receiving device, A relay device may be provided to receive the encoded data transmitted by the transmission device and supply the data to the receiving device. The relay device includes a receiving unit for receiving packetized encoded data transmitted from the transmitting device, and a receiving unit for receiving the packetized encoded data. A memory for buffering the received coded data, and a packetized coded data and a network The relay device further includes a transmission unit for transmitting the packetized encoded data to the A reception packet processing unit that processes packets to generate a bit stream; and a transmission packet processing unit that packetizes the bit stream. is also good.

[0257] In addition, by adding a display unit for displaying the image decoded by the image decoding device to the configuration, In this case, the display unit may display the decoded image signal generated by the decoded image signal superimposing unit 207. The decoded image signal stored in the decoded image memory 208 is read out and displayed on the screen.

[0258] In addition, an imaging unit is added to the configuration, and the captured image is input to the image encoding device. In this case, the imaging unit inputs an image signal captured by the imaging unit to the block division unit 101. To exert effort.

[0259] FIG. 37 shows an example of a hardware configuration of the encoding / decoding device according to the present embodiment. The image encoding device includes the configuration of an image encoding device and an image decoding device according to an embodiment of the present invention. The encoding / decoding device 9000 includes a CPU 9001, a codec IC 9002, an I / O O interface 9003, memory 9004, optical disk drive 9005, network The network interface 9006 and the video interface 9009 are connected via a bus. Connected by 9010.

[0260] The image encoding unit 9007 and the image decoding unit 9008 are typically a codec IC 9002 and The image encoding process of the image encoding device according to the embodiment of the present invention is implemented as an image encoding The image decoding process is executed by the decoding unit 9007 in the image decoding device according to the embodiment of the present invention. The decoding process is performed by the image decoding unit 9008. The I / O interface 9003 For example, a USB interface is used to connect an external keyboard 9104 and mouse 91 The CPU 9001 receives input via the I / O interface 9003. The encoding / decoding device 90 is controlled to execute an operation desired by the user based on the user's operation. 00. The user's operations using the keyboard 9104, mouse 9105, etc. are as follows: , select whether to perform encoding or decoding functions, set the encoding quality, and There are input and output destinations for programs, and input and output destinations for images, etc.

[0261] When the user desires to play back the images recorded on the disk recording medium 9100 The optical disk drive 9005 reads the bitstream from the inserted disk recording medium 9100. The read bit stream is then sent to the codec I via bus 9010. The image decoder 9008 of the C9002 receives the bit stream and sends it to the image decoder 9008. The image decoding process is performed on the image data in the image decoding device according to the embodiment of the present invention. The image is sent to an external monitor 9103 via a video interface 9009. The encoding / decoding device 9000 includes a network interface 9006. Through the network 9101, it is possible to connect to an external distribution server 9106 and a mobile terminal 9107. The user changes the image recorded on the disk recording medium 9100 to the image distribution server 9106. If you want to play back images stored in the mobile terminal 9107, you will need to connect to the network. The interface 9006 receives a bit stream from the input disk recording medium 9100. Instead of reading out the bit stream, the bit stream is acquired from the network 9101. When the user wishes to play back an image stored in memory 9004, 004, an image decoding apparatus according to an embodiment of the present invention The image decoding process is then performed.

[0262] The user captures an image using an external camera 9102, encodes the image, and records it in memory 9004. When an operation is desired, the video interface 9009 receives an image from the camera 9102. The image data is inputted and sent to the image encoding unit 9007 of the codec IC 9002 via the bus 9010. The image encoding unit 9007 performs the following on the image input via the video interface 9009: An image encoding process is performed in the image encoding device according to the embodiment of the present invention, and a bitstream is The bit stream is then sent to the memory 9004 via the bus 9010. The user changes the memory 9004 and writes the bit stream to the disk recording medium 9100. If a user wishes to record a program, the optical disk drive 9005 reads the inserted disk. The bit stream is written to the disk recording medium 9100.

[0263] A hardware configuration that has an image encoding device but does not have an image decoding device, or a hardware configuration that has an image decoding device It is also possible to realize a hardware configuration that does not include an image coding device. The hardware configuration is, for example, a codec IC 9002, an image encoding unit 9007, or This is realized by replacing the image decoding unit 9008 with the image decoding unit 9009.

[0264] The above coding and decoding processes are carried out by hardware-based transmission, storage, and reception devices. It is of course possible to realize it by using ROM (read only memory) or flash memory. Firmware stored in memory, etc., and software executed by a computer, etc. The firmware program and software program may be executed on a computer. The information may be provided by recording it on a recording medium that can be read by a computer or by a wired or wireless network. It may be provided from a server via the Internet, or it may be provided as terrestrial or satellite digital broadcasting data. It may also be provided as a broadcast.

[0265] The present invention has been described above based on the embodiments. The embodiments are merely examples, and each of the structures The combination of components and processes can be modified in many different ways, and these modifications It will be appreciated by those skilled in the art that the embodiments are within the scope of the present invention. [Explanation of symbols]

[0266] 100 image encoding device, 101 block division unit, 102 inter prediction unit, 103 intra prediction unit, 104 decoded image memory, 105 prediction method determination unit, 10 6 residual generation unit, 107 orthogonal transformation and quantization unit, 108 bit string encoding unit, 10 9 inverse quantization and inverse orthogonal transformation unit, 110 decoded image signal superposition unit, 111 coding information storage unit A memory for storing data, 200 an image decoding device, 201 a bit string decoding unit, 202 a block A division unit, 203 an inter prediction unit, 204 an intra prediction unit, and 205 an encoding information storage unit. A memory for storing the image data, 206 an inverse quantization and inverse orthogonal transformation unit, 207 a decoded image signal superposition unit, 8 Decoded image memory.< / poc>

Claims

1. An image coding device that performs coding in units of intra block copy reference blocks, comprising: a block vector candidate list generating unit that derives block vector candidates for a processing target block in a processing target picture from coding information stored in a coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation unit that adds a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a selection unit for selecting a selected block vector from the block vector candidate list; an encoding unit that encodes a block vector index indicating a position of the selected block vector in the block vector candidate list; a reference position correction unit that corrects a reference position of a reference block referenced by the selected block vector so as to reference an inside of a referenceable area; a prediction unit that obtains a decoded pixel in the current picture as a predicted value of the current block from a decoded image memory based on a reference position of the reference block; The image encoding device is characterized in that the reference position correction unit sets a fixed number of intra block copy reference blocks encoded immediately before the intra block copy reference block including the block to be processed as a referenceable area, and sets an intra block copy reference block before the referenceable area as an invalid reference area regardless of whether the encoding process has been completed.

2. An image coding method for coding an image in units of intra block copy reference blocks, comprising: a block vector candidate list generating step of deriving block vector candidates for a target block in a target picture from the coding information stored in the coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation step of adding a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a selection step of selecting a selected block vector from the block vector candidate list; an encoding step of encoding a block vector index indicating a position of the selected block vector in the block vector candidate list; a reference position correcting step of correcting a reference position of a reference block referenced by the selected block vector so as to refer to an inside of a referenceable area; Based on the reference position of the reference block, a decoded pixel in the processing target picture is a prediction step of obtaining a predicted value of the target block from a decoded image memory; The image encoding method is characterized in that the reference position correction step sets a fixed number of intra block copy reference blocks encoded immediately before the intra block copy reference block including the block to be processed as a referenceable area, and sets an intra block copy reference block preceding the referenceable area as an invalid reference area regardless of whether the encoding process has been completed.

3. An image coding program for coding an image in units of intra block copy reference blocks, a block vector candidate list generating step of deriving block vector candidates for a target block in a target picture from the coding information stored in the coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation step of adding a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a selection step of selecting a selected block vector from the block vector candidate list; an encoding step of encoding a block vector index indicating a position of the selected block vector in the block vector candidate list; a reference position correcting step of correcting a reference position of a reference block referenced by the selected block vector so as to refer to an inside of a referenceable area; Based on the reference position of the reference block, a decoded pixel in the processing target picture is a prediction step of obtaining a predicted value of the target block from a decoded image memory; The reference position correction step is characterized in that a fixed number of intra block copy reference blocks encoded immediately before the intra block copy reference block including the block to be processed are set as referenceable areas, and an intra block copy reference block preceding the referenceable area is set as an invalid reference area regardless of whether the encoding process has been completed.

4. An image decoding device that decodes in units of intra block copy reference blocks, a block vector candidate list generating unit that derives block vector candidates for a target block in a target picture from the coding information stored in the coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation unit that adds a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a decoding unit for decoding a block vector index indicating a position of a selected block vector in the block vector candidate list; a selection unit for selecting the selected block vector from the block vector candidate list based on the block vector index; a reference position correction unit that corrects a reference position of a reference block referenced by the selected block vector so as to reference an inside of a referenceable area; Based on the reference position of the reference block, a decoded pixel in the processing target picture is a prediction unit that obtains a predicted value of the target block from a decoded image memory; The image decoding device is characterized in that the reference position correction unit sets a fixed number of intra block copy reference blocks decoded immediately before the intra block copy reference block including the block to be processed as a referenceable area, and sets an intra block copy reference block before the referenceable area as an invalid reference area regardless of whether the decoding process has been completed.

5. An image decoding method for decoding in units of intra block copy reference blocks, comprising: a block vector candidate list generating step of deriving block vector candidates for a target block in a target picture from the coding information stored in the coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation step of adding a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a decoding step of decoding a block vector index indicating a position of the selected block vector in the block vector candidate list; a selection step of selecting the selected block vector from the block vector candidate list based on the block vector index; a reference position correcting step of correcting a reference position of a reference block referenced by the selected block vector so as to refer to an inside of a referenceable area; Based on the reference position of the reference block, a decoded pixel in the processing target picture is a prediction step of obtaining a predicted value of the target block from a decoded image memory; An image decoding method characterized in that the reference position correction step sets a fixed number of intra block copy reference blocks decoded immediately before the intra block copy reference block including the block to be processed as a referenceable area, and sets an intra block copy reference block before the referenceable area as an invalid reference area regardless of whether the decoding process has been completed.

6. An image decoding program for decoding in units of intra block copy reference blocks, a block vector candidate list generating step of deriving block vector candidates for a target block in a target picture from the coding information stored in the coding information storage memory to generate a block vector candidate list; a spatial block vector candidate derivation step of adding a predicted block vector predicted from a block adjacent to the target block to the block vector candidate list; a decoding step of decoding a block vector index indicating a position of the selected block vector in the block vector candidate list; a selection step of selecting the selected block vector from the block vector candidate list based on the block vector index; a reference position correcting step of correcting a reference position of a reference block referenced by the selected block vector so as to refer to an inside of a referenceable area; Based on the reference position of the reference block, a decoded pixel in the processing target picture is a prediction step of obtaining a predicted value of the target block from a decoded image memory; an intra block copy reference block that is decoded immediately before the intra block copy reference block that includes the block to be processed and that is a reference area; and an intra block copy reference block that is before the reference area and that is an invalid reference area, regardless of whether the decoding process is completed or not.

7. A method for storing a bit stream generated according to the image coding method according to claim 2 on a recording medium.

8. A transmission method for transmitting a bit stream generated according to the image coding method according to claim 2.

Images