Encoder, decoder, and transmitter

Abstract

To appropriately perform correction processing to a prediction image.SOLUTION: An encoder includes a circuit and a memory. The circuit associates motion vector information with a BCM index to store them in an FIFO buffer for an HMVP mode (S2001), registers one or more prediction candidates including a combination of the motion vector information and the BCM index stored in the FIFO buffer for an HMVP mode as prediction candidates in a prediction candidate list for a merge mode (S2002), selects a prediction candidate from the prediction candidate list for a merge mode (S2003), and performs correction processing to a prediction image of a processing object block on the basis a BCW index of the selected prediction candidate (S2004).SELECTED DRAWING: Figure 52

Description

Technical Field

[0001] The present disclosure relates to video coding, for example, systems, components, and methods in video encoding and decoding, etc.

Background Art

[0002] Video coding technology has advanced from H.261 and MPEG-1 to H.264 / AVC (Advanced Video Coding), MPEG-LA, H.265 / HEVC (High Efficiency Video Coding), and H.266 / VVC (Versatile Video Codec). Along with this progress, it is always necessary to provide improvements and optimizations to video coding technology to process the continuously increasing amount of digital video data in various applications.

[0003] Non-Patent Document 1 relates to an example of a conventional standard for the video coding technology described above.

Prior Art Documents

Non-Patent Documents

[0004]

Non-Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0005] Regarding the encoding method as described above, for improving encoding efficiency, improving image quality, reducing processing volume, reducing circuit scale, or appropriately selecting elements or operations such as filters, blocks, sizes, motion vectors, reference pictures, or reference blocks, etc., a new method is desired to be proposed.

[0006] The present disclosure provides a configuration or method that can contribute to, for example, improvement of coding efficiency, improvement of image quality, reduction of processing amount, reduction of circuit scale, improvement of processing speed, and appropriate selection of elements or operations. Note that the present disclosure may include a configuration or method that can contribute to benefits other than the above.

Means for Solving the Problems

[0007] For example, an encoding apparatus according to an aspect of the present disclosure includes a circuit and a memory connected to the circuit. In operation, the circuit associates motion vector information derived from a processed block with a BCW index related to BCW (Bi-prediction with CU-level Weights) processing of a predicted image of the processed block, and stores the combination in a FIFO (First In First Out) buffer for the HMVP (History based Motion Vector Predictor) mode. One or more prediction candidates including the combination of the motion vector information and the BCW index stored in the FIFO buffer for the HMVP mode are registered in a prediction candidate list for the merge mode. When processing a block to be processed in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the block to be processed is performed based on the BCW index of the selected prediction candidate.

[0008] Some implementations of the embodiments in the present disclosure may improve coding efficiency, simplify encoding / decoding processing, increase the encoding / decoding processing speed, or efficiently select appropriate components / operations used for encoding and decoding, such as an appropriate filter, block size, motion vector, reference picture, reference block, etc.

[0009] Further advantages and effects in one aspect of the present disclosure will be apparent from the specification and the drawings. Such advantages and / or effects can be obtained by some embodiments and the features described in the specification and the drawings respectively, but not all of them are necessarily provided to obtain one or more advantages and / or effects.

[0010] Note that these general or specific aspects may be implemented in a system, a method, an integrated circuit, a computer program, a recording medium, or any arbitrary combination thereof.

Advantages of the Invention

[0011] The configuration or method according to one aspect of the present disclosure can contribute to, for example, one or more of improvement in coding efficiency, improvement in image quality, reduction in processing amount, reduction in circuit scale, improvement in processing speed, and appropriate selection of elements or operations. Note that the configuration or method according to one aspect of the present disclosure may contribute to benefits other than those described above.

Brief Description of the Drawings

[0012]

Figure 1

Figure 2

Figure 3

Figure 4A

Figure 4B

Figure 5A

Figure 5B

Figure 6A

Figure 6B

Figure 6C

Figure 7

Figure 8

Figure 9

Figure 10

Figure 11

Figure 12

Figure 13

Figure 14

Figure 15

Figure 16

Figure 17

Figure 18

Figure 19

Figure 20

Figure 21

Figure 22

Figure 23

Figure 24

Figure 25A

Figure 25B

Figure 26A

Figure 26B

Figure 26C

Figure 27

Figure 28A

Figure 28B

Figure 29

Figure 30A

Figure 30B

Figure 31A

Figure 31B

Figure 32

Figure 33

Figure 34

Figure 35

Figure 36

Figure 37

Figure 38

Figure 39

Figure 40

Figure 41

Figure 42

Figure 43

Figure 44

Figure 45

Figure 46

Figure 47

Figure 48

Figure 49

Figure 50

Figure 51

Figure 52

Figure 53

Figure 54

Figure 55

Figure 56

Figure 57

Figure 58

Figure 59

Figure 60

DETAILED DESCRIPTION OF THE INVENTION

[0013] An encoding device according to one aspect of the present disclosure includes a circuit and a memory connected to the circuit. In operation, the circuit associates motion vector information derived from a processed block with correction processing information related to correction processing of a predicted image of the processed block, and stores them in a FIFO (First In First Out) buffer for the HMVP (History based Motion Vector Predictor) mode. One or more prediction candidates including a combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode are registered in a prediction candidate list for the merge mode. When processing a block to be processed in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the block to be processed is performed based on the correction processing information of the selected prediction candidate.

[0014] In this way, by using the HMVP mode, the encoding device can add not only the prediction information of spatially or temporally adjacent blocks of the block to be processed but also the prediction candidates of the blocks processed before the block to be processed to the prediction candidates for the merge mode. As a result, since the variations of the prediction candidates in the merge mode increase, the encoding device can process the block to be processed using an appropriate prediction candidate. Therefore, the encoding efficiency is improved. Also, since the correction processing information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, the encoding device can appropriately manage the correction processing information for each block even when using the HMVP mode. Therefore, the encoding device can perform more appropriate correction processing on the predicted image of the block to be processed.

[0015] For example, when the prediction candidate selected from the prediction candidate list for the merge mode is the prediction candidate registered from the FIFO buffer for the HMVP mode, the circuit may perform correction processing on the predicted image of the block to be processed based on the correction processing information of the prediction candidate registered from the FIFO buffer for the HMVP mode.

[0016] Thereby, when the encoding device selects a prediction candidate registered from the FIFO buffer for the HMVP mode from the prediction candidate list for the merge mode, it can perform more appropriate correction processing on the predicted image of the block to be processed based on the correction processing information associated with the motion vector information of the HMVP mode.

[0017] For example, when a prediction candidate having the same motion vector information as the motion vector information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit may register the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0018] As a result, when a prediction candidate having motion vector information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the encoding device can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0019] For example, when the combination of the motion vector information stored in the FIFO buffer for the HMVP mode and the correction processing information is not registered in the prediction candidate list for the merge mode, the circuit may register the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0020] As a result, when a prediction candidate having a combination of motion vector information and correction processing information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the encoding device can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0021] For example, the correction processing information may at least indicate whether to apply correction processing to the predicted image of the processing target block.

[0022] As a result, the encoding device can switch whether to apply correction processing to the predicted image of the processing target block based on the correction processing information. Therefore, the encoding efficiency is improved.

[0023] For example, the correction processing may be a process of correcting the luminance and color difference of the predicted image of the processing target block.

[0024] As a result, the encoding device can appropriately correct the luminance and color difference of the predicted image of the processing target block.

[0025] For example, the correction process may be a LIC (Local Illumination Compensation) process.

[0026] Thereby, the encoding device can appropriately manage information related to the LIC process as correction process information, so that a more appropriate LIC process can be applied to the predicted image of the processing target block.

[0027] Further, a decoding device according to an aspect of the present disclosure includes a circuit and a memory connected to the circuit. In operation, the circuit associates motion vector information derived from a processed block with correction process information related to correction processing of a predicted image of the processed block and stores the combination in a FIFO buffer for the HMVP mode. One or more prediction candidates including the combination of the motion vector information and the correction process information stored in the FIFO buffer for the HMVP mode are registered in a prediction candidate list for the merge mode. When processing a processing target block in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the processing target block is performed based on the correction process information of the selected prediction candidate.

[0028] In this way, by using the HMVP mode, the decoding device can add not only the prediction information of spatially or temporally adjacent blocks of the processing target block but also the prediction candidates of the blocks processed before the processing target block to the prediction candidates for the merge mode. As a result, the variations of the prediction candidates in the merge mode increase, so that the decoding device can process the processing target block using appropriate prediction candidates. Therefore, the processing efficiency is improved. Further, since the correction process information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, the decoding device can appropriately manage the correction process information for each block even when using the HMVP mode. Therefore, the decoding device can perform correction processing more appropriately on the predicted image of the processing target block.

[0029] For example, when the prediction candidate selected from the prediction candidate list for the merge mode is the prediction candidate registered from the FIFO buffer for the HMVP mode, the circuit may perform correction processing on the predicted image of the processing target block based on the correction processing information of the prediction candidate registered from the FIFO buffer for the HMVP mode.

[0030] Thereby, when the decoding device selects a prediction candidate registered from the FIFO buffer for the HMVP mode from the prediction candidate list for the merge mode, the decoding device can perform more appropriate correction processing on the predicted image of the processing target block based on the correction processing information associated with the motion vector information of the HMVP mode.

[0031] For example, when a prediction candidate having the same motion vector information as the motion vector information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit may register the combination of the motion vector information stored in the FIFO buffer for the HMVP mode and the correction processing information in the prediction candidate list for the merge mode.

[0032] Thereby, when a prediction candidate having motion vector information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the decoding device can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0033] For example, when the combination of the motion vector information stored in the FIFO buffer for the HMVP mode and the correction processing information is not registered in the prediction candidate list for the merge mode, the circuit may register the combination of the motion vector information stored in the FIFO buffer for the HMVP mode and the correction processing information in the prediction candidate list for the merge mode.

[0034] Accordingly, when a prediction candidate having a combination of motion vector information and correction processing information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the decoding apparatus can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0035] For example, the correction processing information may at least indicate whether to apply correction processing to the predicted image of the processing target block.

[0036] Accordingly, the decoding apparatus can switch whether to apply correction processing to the predicted image of the processing target block based on the correction processing information. Therefore, the coding efficiency is improved.

[0037] For example, the correction processing may be processing for correcting the luminance and color difference of the predicted image of the processing target block.

[0038] Accordingly, the decoding apparatus can appropriately correct the luminance and color difference of the predicted image of the processing target block.

[0039] For example, the correction processing may be LIC processing.

[0040] Accordingly, since the decoding apparatus can appropriately manage the information regarding the LIC processing as the correction processing information, it can apply a more appropriate LIC processing to the predicted image of the processing target block.

[0041] Also, the encoding method according to one aspect of the present disclosure associates motion vector information derived from a processed block with correction processing information regarding correction processing of a predicted image of the processed block, stores them in a FIFO buffer for the HMVP mode, registers one or more prediction candidates including a combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode as prediction candidates in a prediction candidate list for the merge mode, and when processing a block to be processed in the merge mode, selects a prediction candidate from the prediction candidate list for the merge mode, and performs correction processing on the predicted image of the block to be processed based on the correction processing information of the selected prediction candidate.

[0042] In this way, by using the HMVP mode, an apparatus or the like that executes the encoding method can add not only prediction information of spatially or temporally adjacent blocks of the block to be processed but also prediction candidates of blocks processed before the block to be processed to the prediction candidates for the merge mode. As a result, since the variations of the prediction candidates in the merge mode increase, an apparatus or the like that executes the encoding method can process the block to be processed using appropriate prediction candidates. Therefore, the encoding efficiency is improved. Further, since the correction processing information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, an apparatus or the like that executes the encoding method can appropriately manage the correction processing information for each block even when using the HMVP mode. Therefore, an apparatus or the like that executes the encoding method can perform more appropriate correction processing on the predicted image of the block to be processed.

[0043] Also, the decoding method according to one aspect of the present disclosure associates motion vector information derived from a processed block with correction processing information related to correction processing of a predicted image of the processed block, stores the combination in a FIFO buffer for the HMVP mode, and includes, as prediction candidates, one or more prediction candidates including the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in a prediction candidate list for the merge mode. When processing a block to be processed in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the block to be processed is performed based on the correction processing information of the selected prediction candidate.

[0044] In this way, by using the HMVP mode, an apparatus or the like that executes the decoding method can add not only prediction information of spatially or temporally adjacent blocks of the block to be processed but also prediction candidates of blocks processed before the block to be processed to the prediction candidates for the merge mode. As a result, since the variations of the prediction candidates in the merge mode increase, an apparatus or the like that executes the decoding method can process the block to be processed using an appropriate prediction candidate. Therefore, the processing efficiency is improved. Further, since the correction processing information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, an apparatus or the like that executes the decoding method can appropriately manage the correction processing information for each block even when using the HMVP mode. Therefore, an apparatus or the like that executes the decoding method can perform more appropriate correction processing on the predicted image of the block to be processed.

[0045] Furthermore, these general or specific aspects may be implemented by a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory recording medium such as a computer-readable CD-ROM, or may be implemented by any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.

[0046] Hereinafter, embodiments will be specifically described with reference to the drawings. Note that all the embodiments described below are illustrative or specific examples. The numerical values, shapes, materials, components, arrangement positions and connection forms of the components, steps, relationships and orders of the steps, etc. shown in the following embodiments are merely examples and are not intended to limit the scope of the claims.

[0047] Hereinafter, embodiments of an encoding device and a decoding device will be described. The embodiments are examples of encoding devices and decoding devices to which the processes and / or configurations described in each aspect of the present disclosure are applicable. The processes and / or configurations can also be implemented in encoding devices and decoding devices different from the embodiments. For example, with respect to the processes and / or configurations applied to the embodiments, any of the following may be implemented, for example.

[0048] (1) Any one of a plurality of components of the encoding device or decoding device of the embodiment described in each aspect of the present disclosure may be replaced or combined with any other component described in any aspect of the present disclosure.

[0049] (2) In the encoding device or decoding device of the embodiment, arbitrary changes such as addition, replacement, deletion, etc. may be made to the functions or processes performed by some of the plurality of components of the encoding device or decoding device. For example, any function or process may be replaced or combined with any other function or process described in any aspect of the present disclosure.

[0050] (3) In the method implemented by the encoding device or decoding device of the embodiment, arbitrary changes such as addition, replacement, and deletion may be made to some of the plurality of processes included in the method. For example, any process in the method may be replaced or combined with any other process described in any aspect of the present disclosure.

[0051] (4) Among a plurality of components constituting the encoder or decoder of the embodiment, some components may be combined with the components described in any of the aspects of the present disclosure, or may be combined with components having a part of the functions described in any of the aspects of the present disclosure, or may be combined with components that execute a part of the processes executed by the components described in each aspect of the present disclosure.

[0052] (5) A component having a part of the functions of the encoder or decoder of the embodiment, or a component that executes a part of the processes of the encoder or decoder of the embodiment may be combined or replaced with the components described in any of the aspects of the present disclosure, a component having a part of the functions described in any of the aspects of the present disclosure, or a component that executes a part of the processes described in any of the aspects of the present disclosure.

[0053] (6) In the method executed by the encoder or decoder of the embodiment, any of the plurality of processes included in the method may be replaced or combined with the processes described in any of the aspects of the present disclosure, or with any similar processes.

[0054] (7) Some of the plurality of processes included in the method executed by the encoder or decoder of the embodiment may be combined with the processes described in any of the aspects of the present disclosure.

[0055] (8) The manner of implementing the processes and / or configurations described in each aspect of the present disclosure is not limited to the encoder or decoder of the embodiment. For example, the processes and / or configurations may be implemented in a device used for a purpose different from the moving image encoding or moving image decoding disclosed in the embodiment.

[0056] [Encoder] First, the encoder according to the embodiment will be described. FIG. 1 is a block diagram showing the functional configuration of an encoder 100 according to the embodiment. The encoder 100 is a moving image encoder that encodes moving images in block units.

[0057] As shown in FIG. 1, the encoding device 100 is a device that encodes an image in block units, and includes a division unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse conversion unit 114, an addition unit 116, a block memory 118, a loop filter unit 120, a frame memory 122, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128.

[0058] The encoding device 100 is realized by, for example, a general-purpose processor and a memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as the division unit 102, the subtraction unit 104, the conversion unit 106, the quantization unit 108, the entropy encoding unit 110, the inverse quantization unit 112, the inverse conversion unit 114, the addition unit 116, the loop filter unit 120, the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128. Also, the encoding device 100 may be realized as one or more dedicated electronic circuits corresponding to the division unit 102, the subtraction unit 104, the conversion unit 106, the quantization unit 108, the entropy encoding unit 110, the inverse quantization unit 112, the inverse conversion unit 114, the addition unit 116, the loop filter unit 120, the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.

[0059] After explaining the overall processing flow of the encoding device 100 below, each component included in the encoding device 100 will be described.

[0060] [Overall Flow of Encoding Process] FIG. 2 is a flowchart showing an example of the overall encoding process by the encoding device 100.

[0061] First, the splitting unit 102 of the encoding device 100 splits each picture included in the input image, which is a moving image, into a plurality of fixed-size blocks (for example, 128×128 pixels) (step Sa_1). Then, the splitting unit 102 selects a splitting pattern (also referred to as a block shape) for the fixed-size blocks (step Sa_2). That is, the splitting unit 102 further splits the fixed-size blocks into a plurality of blocks that constitute the selected splitting pattern. Then, for each of the plurality of blocks, the encoding device 100 performs the processes of steps Sa_3 to Sa_9 on that block (that is, the encoding target block).

[0062] That is, the prediction processing unit, which consists of all or part of the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128, generates a prediction signal (also referred to as a prediction block) for the encoding target block (also referred to as the current block) (step Sa_3).

[0063] Next, the subtraction unit 104 generates the difference between the encoding target block and the prediction block as a prediction residual (also referred to as a difference block) (step Sa_4).

[0064] Next, the conversion unit 106 and the quantization unit 108 generate a plurality of quantization coefficients by performing conversion and quantization on the difference block (step Sa_5). Note that a block consisting of a plurality of quantization coefficients is also referred to as a coefficient block.

[0065] Next, the entropy encoding unit 110 generates an encoded signal by performing encoding (specifically, entropy encoding) on the coefficient block and the prediction parameters related to the generation of the prediction signal (step Sa_6). Note that the encoded signal is also referred to as an encoded bit stream, a compressed bit stream, or a stream.

[0066] Next, the inverse quantization unit 112 and the inverse conversion unit 114 restore a plurality of prediction residuals (that is, difference blocks) by performing inverse quantization and inverse conversion on the coefficient block (step Sa_7).

[0067] Next, the addition unit 116 reconstructs the current block into a reconstructed image (also referred to as a reconstructed block or a decoded image block) by adding the prediction block to the restored difference block (step Sa_8). Thereby, a reconstructed image is generated.

[0068] When this reconstructed image is generated, the loop filter unit 120 performs filtering on the reconstructed image as necessary (step Sa_9).

[0069] Then, the encoding device 100 determines whether the encoding of the entire picture is completed (step Sa_10). If it is determined that the encoding is not completed (No in step Sa_10), the processing from step Sa_2 is repeatedly executed.

[0070] In the above example, the encoding device 100 selects one splitting pattern for a block of a fixed size and performs encoding of each block according to the splitting pattern. However, the encoding of each block may be performed according to each of a plurality of splitting patterns. In this case, the encoding device 100 may evaluate the cost for each of the plurality of splitting patterns and select, as the encoded signal to be output, the encoded signal obtained by encoding according to, for example, the splitting pattern with the smallest cost.

[0071] As shown in the figure, the processing of these steps Sa_1 to Sa_10 is sequentially performed by the encoding device 100. Alternatively, a plurality of some of those processes may be performed in parallel, and the order of those processes may be changed, etc.

[0072] [Splitting unit] The splitting unit 102 splits each picture included in the input moving image into a plurality of blocks and outputs each block to the subtraction unit 104. For example, the splitting unit 102 first splits the picture into blocks of a fixed size (for example, 128x128). Other fixed block sizes may be adopted. These fixed-size blocks are sometimes called Coding Tree Units (CTUs). Then, the splitting unit 102 splits each of the fixed-size blocks into blocks of a variable size (for example, 64x64 or less) based on, for example, recursive quadtree and / or binary tree block splitting. That is, the splitting unit 102 selects a splitting pattern. These variable-size blocks are sometimes called Coding Units (CUs), Prediction Units (PUs), or Transformation Units (TUs). Note that in various processing examples, it is not necessary to distinguish between CUs, PUs, and TUs, and some or all of the blocks in the picture may be the processing units of CUs, PUs, and TUs.

[0073] FIG. 3 is a conceptual diagram showing an example of block splitting in the embodiment. In FIG. 3, the solid lines represent block boundaries by quadtree block splitting, and the dashed lines represent block boundaries by binary tree block splitting.

[0074] Here, the block 10 is a square block of 128x128 pixels (128x128 block). This 128x128 block 10 is first split into four square 64x64 blocks (quadtree block splitting).

[0075] The upper-left 64x64 block is further vertically split into two rectangular 32x64 blocks, and the left 32x64 block is further vertically split into two rectangular 16x64 blocks (binary tree block splitting). As a result, the upper-left 64x64 block is split into two 16x64 blocks 11, 12 and a 32x64 block 13.

[0076] The upper-right 64x64 block is horizontally split into two rectangular 64x32 blocks 14, 15 (binary tree block splitting).

[0077] The bottom-left 64x64 block is divided into four square 32x32 blocks (quadtree block division). Among the four 32x32 blocks, the top-left block and the bottom-right block are further divided. The top-left 32x32 block is vertically divided into two rectangular 16x32 blocks, and the right 16x32 block is further horizontally divided into two 16x16 blocks (binary tree block division). The bottom-right 32x32 block is horizontally divided into two 32x16 blocks (binary tree block division). As a result, the bottom-left 64x64 block is divided into 16 16x32 blocks 16, two 16x16 blocks 17, 18, two 32x32 blocks 19, 20, and two 32x16 blocks 21, 22.

[0078] The bottom-right 64x64 block 23 is not divided.

[0079] As described above, in FIG. 3, block 10 is divided into 13 variable-size blocks 11 to 23 based on recursive quadtree and binary tree block division. Such a division is sometimes called QTBT (quad-tree plus binary tree) division.

[0080] Note that in FIG. 3, one block is divided into four or two blocks (quadtree or binary tree block division), but the division is not limited to these. For example, one block may be divided into three blocks (ternary tree block division). A division including such a ternary tree block division is sometimes called MBT (multi type tree) division.

[0081] [Picture Composition Slices / Tiles] To decode a picture in parallel, the picture may be composed of slices or tiles. A picture composed of slices or tiles may be composed by the dividing unit 102.

[0082] A slice is a basic encoding unit that constitutes a picture. A picture is composed of, for example, one or more slices. Also, a slice consists of one or more consecutive CTUs (Coding Tree Units).

[0083] FIG. 4A is a conceptual diagram showing an example of the composition of a slice. For example, a picture includes 11×8 CTUs and is divided into 4 slices (Slice 1-4). Slice 1 consists of 16 CTUs, Slice 2 consists of 21 CTUs, Slice 3 consists of 29 CTUs, and Slice 4 consists of 22 CTUs. Here, each CTU in the picture belongs to one of the slices. The shape of the slice is in the form of dividing the picture horizontally. The boundary of the slice does not have to be at the edge of the screen and can be anywhere among the boundaries of the CTUs within the screen. The processing order (encoding order or decoding order) of the CTUs in the slice is, for example, the raster scan order. Also, a slice includes header information and encoded data. The header information may describe the characteristics of the slice, such as the CTU address at the beginning of the slice and the slice type.

[0084] A tile is a unit of a rectangular area that constitutes a picture. A number called TileId may be assigned to each tile in the raster scan order.

[0085] FIG. 4B is a conceptual diagram showing an example of the composition of a tile. For example, a picture includes 11×8 CTUs and is divided into 4 rectangular area tiles (Tile 1-4). When tiles are used, the processing order of the CTUs is changed compared to when tiles are not used. When tiles are not used, a plurality of CTUs in the picture are processed in the raster scan order. When tiles are used, at least one CTU in each of the plurality of tiles is processed in the raster scan order. For example, as shown in FIG. 4B, the processing order of the plurality of CTUs included in Tile 1 is from the left end of the first row of Tile 1 to the right end of the first row of Tile 1, and then from the left end of the second row of Tile 1 to the right end of the second row of Tile 1.

[0086] Note that one tile may include one or more slices, and one slice may include one or more tiles.

[0087] [Subtraction unit] The subtraction unit 104 receives an input from the division unit 102 and subtracts a predicted signal (predicted sample input from the prediction control unit 128 shown below) from the original signal (original sample) in block units divided by the division unit 102. That is, the subtraction unit 104 calculates the prediction error (also referred to as the residual) of the block to be encoded (hereinafter referred to as the current block). Then, the subtraction unit 104 outputs the calculated prediction error (residual) to the conversion unit 106.

[0088] The original signal is the input signal of the encoding device 100 and is a signal representing the image of each picture constituting the moving image (for example, a luminance (luma) signal and two color difference (chroma) signals). Hereinafter, the signal representing the image may also be referred to as a sample.

[0089] [Conversion unit] The conversion unit 106 converts the prediction error in the spatial domain into conversion coefficients in the frequency domain and outputs the conversion coefficients to the quantization unit 108. Specifically, the conversion unit 106 performs a predetermined discrete cosine transform (DCT) or discrete sine transform (DST) on the prediction error in the spatial domain, for example. The predetermined DCT or DST may be determined in advance.

[0090] Note that the conversion unit 106 may adaptively select a conversion type from a plurality of conversion types and convert the prediction error into conversion coefficients using a conversion basis function corresponding to the selected conversion type. Such a conversion may be referred to as EMT (explicit multiple core transform) or AMT (adaptive multiple transform).

[0091] The plurality of transform types includes, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. FIG. 5A is a table showing the transform basis functions corresponding to the example transform types. In FIG. 5A, N indicates the number of input pixels. The selection of a transform type from among these plurality of transform types may depend on, for example, the type of prediction (intra prediction and inter prediction), or may depend on the intra prediction mode.

[0092] Information indicating whether to apply such EMT or AMT (for example, called an EMT flag or an AMT flag) and information indicating the selected transform type are usually signaled at the CU level. Note that the signaling of this information does not have to be limited to the CU level and may be at other levels (for example, the bit sequence level, the picture level, the slice level, the tile level, or the CTU level).

[0093] Also, the transform unit 106 may re-transform the transform coefficients (transformation results). Such re-transformation may be called AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the transform unit 106 performs re-transformation for each sub-block (for example, a 4x4 sub-block) included in the block of transform coefficients corresponding to the intra prediction error. Information indicating whether to apply NSST and information regarding the transform matrix used for NSST are usually signaled at the CU level. Note that the signaling of this information does not have to be limited to the CU level and may be at other levels (for example, the sequence level, the picture level, the slice level, the tile level, or the CTU level).

[0094] <s A separable transform and a non-separable transform may be applied to the transform unit 106. A separable transform is a method in which the input is separated by the number of dimensions of the input and transformed multiple times in each direction, and a non-separable transform is a method in which when the input is multi-dimensional, two or more dimensions are regarded as one dimension and transformed together.

[0095] For example, as an example of a non-separable transform, when the input is a 4×4 block, it can be regarded as an array having 16 elements, and a transform process is performed on the array using a 16×16 transform matrix.

[0096] Also, in a further example of a non-separable transform, after regarding a 4×4 input block as an array having 16 elements, a transform (Hypercube Givens Transform) that performs a plurality of Givens rotations on the array may be performed.

[0097] In the transform in the transform unit 106, the type of basis for conversion to the frequency domain can also be switched according to the region within the CU. As an example, there is SVT (Spatially Varying Transform). In SVT, as shown in FIG. 5B, the CU is divided into two equal parts in the horizontal or vertical direction, and conversion to the frequency domain is performed only on one of the regions. The type of transform basis can be set for each region. For example, DST7 and DCT8 are used. In this example, only one of the two regions within the CU is transformed, and the other is not transformed, but both regions may be transformed. Also, the division method can be made more flexible not only by dividing into two equal parts but also by dividing into four equal parts or separately encoding information indicating the division and signaling it in the same way as CU division. Note that SVT is sometimes also called SBT (Sub-block Transform).

[0098] [Quantization Unit] The quantization unit 108 quantizes the transform coefficients output from the transform unit 106. Specifically, the quantization unit 108 scans the transform coefficients of the current block in a predetermined scanning order, and quantizes the transform coefficients based on the quantization parameter (QP) corresponding to the scanned transform coefficients. Then, the quantization unit 108 outputs the quantized transform coefficients (hereinafter referred to as quantization coefficients) of the current block to the entropy encoding unit 110 and the inverse quantization unit 112. The predetermined scanning order may be determined in advance.

[0099] The predetermined scanning order is the order for quantization / inverse quantization of the conversion coefficients. For example, the predetermined scanning order may be defined in ascending order of frequency (from low frequency to high frequency) or descending order of frequency (from high frequency to low frequency).

[0100] The quantization parameter (QP) is a parameter that defines the quantization step (quantization width). For example, as the value of the quantization parameter increases, the quantization step also increases. That is, as the value of the quantization parameter increases, the quantization error increases.

[0101] Also, a quantization matrix may be used for quantization. For example, several types of quantization matrices may be used corresponding to frequency conversion sizes such as 4x4 and 8x8, prediction modes such as intra prediction and inter prediction, and pixel components such as luminance and color difference. Note that quantization means digitizing the sampled values at predetermined intervals and associating them with predetermined levels, and in this technical field, it may be referred to using other expressions such as rounding, rounding off, and scaling, or rounding, rounding off, and scaling may be adopted. The predetermined intervals and levels may be predefined.

[0102] As methods of using the quantization matrix, there are a method of using the quantization matrix directly set on the encoder side and a method of using the default quantization matrix (default matrix). On the encoder side, by directly setting the quantization matrix, a quantization matrix corresponding to the characteristics of the image can be set. However, in this case, there is a demerit that the amount of code increases due to the coding of the quantization matrix.

[0103] On the other hand, there is also a method of quantizing the high-frequency component coefficients and the low-frequency component coefficients in the same way without using the quantization matrix. Note that this method is equivalent to a method of using a quantization matrix (flat matrix) in which all the coefficients have the same value.

[0104] The quantization matrix may be specified, for example, by an SPS (Sequence Parameter Set) or a PPS (Picture Parameter Set). The SPS includes parameters used for a sequence, and the PPS includes parameters used for a picture. The SPS and the PPS may sometimes be simply referred to as parameter sets.

[0105] [Entropy Encoding Unit] The entropy encoding unit 110 generates an encoded signal (encoded bit stream) based on the quantization coefficients input from the quantization unit 108. Specifically, the entropy encoding unit 110, for example, binarizes the quantization coefficients, arithmetic-encodes the binary signal, and outputs a compressed bit stream or sequence.

[0106] [Inverse Quantization Unit] The inverse quantization unit 112 inverse-quantizes the quantization coefficients input from the quantization unit 108. Specifically, the inverse quantization unit 112 inverse-quantizes the quantization coefficients of the current block in a predetermined scanning order. Then, the inverse quantization unit 112 outputs the inverse-quantized transform coefficients of the current block to the inverse transform unit 114. The predetermined scanning order may be predefined.

[0107] [Inverse Transform Unit] The inverse transform unit 114 restores the prediction error (residual) by inverse-transforming the transform coefficients input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 performs an inverse transform corresponding to the transform by the transform unit 106 on the transform coefficients to restore the prediction error of the current block. Then, the inverse transform unit 114 outputs the restored prediction error to the addition unit 116.

[0108] Note that since information is usually lost due to quantization, the restored prediction error does not match the prediction error calculated by the subtraction unit 104. That is, the restored prediction error usually includes a quantization error.

[0109] [Addition Unit] The adder 116 reconstructs the current block by adding the prediction error input from the inverse transform unit 114 and the prediction sample input from the predictive control unit 128. Then, the adder 116 outputs the reconstructed block to the block memory 118 and the loop filter unit 120. The reconstructed block may also be called a local decoding block.

[0110] [Block Memory] The block memory 118 is, for example, a storage unit for storing blocks within the coded target picture (referred to as the current picture) that are referenced in intra prediction. Specifically, the block memory 118 stores the reconstructed block output from the adder 116.

[0111] [Frame Memory] The frame memory 122 is, for example, a storage unit for storing reference pictures used in inter prediction, and may also be called a frame buffer. Specifically, the frame memory 122 stores the reconstructed block filtered by the loop filter unit 120.

[0112] [Loop Filter Unit] The loop filter unit 120 applies a loop filter to the block reconstructed by the adder 116 and outputs the filtered reconstructed block to the frame memory 122. The loop filter is a filter (in-loop filter) used within the coding loop, and includes, for example, a deblocking filter (DF or DBF), a sample adaptive offset (SAO), and an adaptive loop filter (ALF).

[0113] In the case of the ALF, a least squares error filter for removing coding distortion is applied, and for example, for each 2x2 sub-block within the current block, one filter selected from a plurality of filters is applied based on the direction and activity of the local gradient.

[0114] Specifically, first, sub-blocks (e.g., 2x2 sub-blocks) are classified into a plurality of classes (e.g., 15 or 25 classes). The classification of sub-blocks is performed based on the direction and activity of gradients. For example, a classification value C (e.g., C = 5D + A) is calculated using a gradient direction value D (e.g., 0 to 2 or 0 to 4) and a gradient activity value A (e.g., 0 to 4). Then, based on the classification value C, the sub-blocks are classified into a plurality of classes.

[0115] The gradient direction value D is derived, for example, by comparing gradients in a plurality of directions (e.g., horizontal, vertical, and two diagonal directions). Also, the gradient activity value A is derived, for example, by adding gradients in a plurality of directions and quantizing the addition result.

[0116] Based on the results of such classification, a filter for the sub-blocks is determined from among a plurality of filters.

[0117] As the shape of the filter used in ALF, for example, a circularly symmetric shape is utilized. FIGS. 6A to 6C are diagrams showing a plurality of examples of the shape of the filter used in ALF. FIG. 6A shows a 5x5 diamond-shaped filter, FIG. 6B shows a 7x7 diamond-shaped filter, and FIG. 6C shows a 9x9 diamond-shaped filter. Information indicating the shape of the filter is usually signaled at the picture level. Note that the signaling of information indicating the shape of the filter is not necessarily limited to the picture level and may be at other levels (e.g., sequence level, slice level, tile level, CTU level, or CU level).

[0118] The on / off of ALF may be determined, for example, at the picture level or CU level. For example, for luminance, it may be determined whether to apply ALF at the CU level, and for chrominance difference, it may be determined whether to apply ALF at the picture level. The information indicating the on / off of ALF is usually signaled at the picture level or CU level. Note that the signaling of the information indicating the on / off of ALF does not have to be limited to the picture level or CU level, and it may be at other levels (for example, sequence level, slice level, tile level, or CTU level).

[0119] The coefficient sets of a plurality of selectable filters (for example, filters up to 15 or 25) are usually signaled at the picture level. Note that the signaling of the coefficient sets does not have to be limited to the picture level, and it may be at other levels (for example, sequence level, slice level, tile level, CTU level, CU level, or sub-block level).

[0120] [Loop Filter Section > Deblocking Filter] In the deblocking filter, the loop filter section 120 reduces the distortion generated at the block boundary by performing filter processing on the block boundary of the reconstructed image.

[0121] FIG. 7 is a block diagram showing an example of the detailed configuration of the loop filter section 120 that functions as a deblocking filter.

[0122] The loop filter section 120 includes a boundary determination section 1201, a filter determination section 1203, a filter processing section 1205, a processing determination section 1208, a filter characteristic determination section 1207, and switches 1202, 1204, and 1206.

[0123] The boundary determination section 1201 determines whether the pixel to be deblocking-filtered (i.e., the target pixel) exists near the block boundary. Then, the boundary determination section 1201 outputs the determination result to the switches 1202 and the processing determination section 1208.

[0124] When the boundary determination unit 1201 determines that the target pixel exists near the block boundary, the switch 1202 outputs the image before the filter processing to the switch 1204. Conversely, when the boundary determination unit 1201 determines that the target pixel does not exist near the block boundary, the switch 1202 outputs the image before the filter processing to the switch 1206.

[0125] The filter determination unit 1203 determines whether to perform deblocking filter processing on the target pixel based on the pixel values of at least one peripheral pixel around the target pixel. Then, the filter determination unit 1203 outputs the determination result to the switch 1204 and the processing determination unit 1208.

[0126] When it is determined by the filter determination unit 1203 that deblocking filter processing is to be performed on the target pixel, the switch 1204 outputs the image before the filter processing obtained via the switch 1202 to the filter processing unit 1205. Conversely, when it is determined by the filter determination unit 1203 that deblocking filter processing is not to be performed on the target pixel, the switch 1204 outputs the image before the filter processing obtained via the switch 1202 to the switch 1206.

[0127] When the filter processing unit 1205 obtains the image before the filter processing via the switches 1202 and 1204, it performs deblocking filter processing having the filter characteristics determined by the filter characteristic determination unit 1207 on the target pixel. Then, the filter processing unit 1205 outputs the pixel after the filter processing to the switch 1206.

[0128] The switch 1206 selectively outputs the pixel that has not been subjected to deblocking filter processing and the pixel that has been subjected to deblocking filter processing by the filter processing unit 1205 in accordance with the control by the processing determination unit 1208.

[0129] The processing determination unit 1208 controls the switch 1206 based on the respective determination results of the boundary determination unit 1201 and the filter determination unit 1203. That is, when the boundary determination unit 1201 determines that the target pixel exists near the block boundary and the filter determination unit 1203 determines that the target pixel is to be subjected to deblocking filter processing, the processing determination unit 1208 causes the deblocking filter-processed pixel to be output from the switch 1206. Further, in cases other than the above, the processing determination unit 1208 causes the pixel that has not been subjected to deblocking filter processing to be output from the switch 1206. By repeatedly outputting such pixels, the image after the filter processing is output from the switch 1206.

[0130] FIG. 8 is a conceptual diagram showing an example of a deblocking filter having filter characteristics symmetric with respect to a block boundary.

[0131] In the deblocking filter processing, for example, using the pixel value and the quantization parameter, one of two deblocking filters having different characteristics, namely, a strong filter and a weak filter, is selected. In the strong filter, as shown in FIG. 8, when pixels p0 to p2 and pixels q0 to q2 exist with the block boundary in between, the respective pixel values of pixels q0 to q2 are changed to pixel values q'0 to q'2, for example, by performing the operations shown in the following equations.

[0132] q’0=(p1 + 2×p0 + 2×q0 + 2×q1 + q2 + 4) / 8 q’1=(p0 + q0 + q1 + q2 + 2) / 4 q’2=(p0 + q0 + q1 + 3×q2 + 2×q3 + 4) / 8

[0133] In the above formulas, p0 to p2 and q0 to q2 are the respective pixel values of pixels p0 to p2 and pixels q0 to q2. Also, q3 is the pixel value of pixel q3 adjacent to pixel q2 on the side opposite to the block boundary. Further, in the right side of each of the above formulas, the coefficient multiplied by the pixel value of each pixel used in the deblocking filter process is the filter coefficient.

[0134] Furthermore, in the deblocking filter process, clip processing may be performed so that the pixel value after the operation is not set to exceed the threshold value. In this clip processing, the pixel value after the operation by the above formula is clipped to "operation target pixel value ± 2 × threshold value" using the threshold value determined from the quantization parameter. This can prevent excessive smoothing.

[0135] FIG. 9 is a conceptual diagram for explaining a block boundary where deblocking filter processing is performed. FIG. 10 is a conceptual diagram showing an example of the Bs value.

[0136] The block boundary where deblocking filter processing is performed is, for example, the boundary of a PU (Prediction Unit) or TU (Transform Unit) of an 8×8 pixel block as shown in FIG. 9. The deblocking filter processing can be performed in units of 4 rows or 4 columns. First, for blocks P and Q shown in FIG. 9, a Bs (Boundary Strength) value is determined as shown in FIG. 10.

[0137] According to the Bs value in FIG. 10, even for block boundaries belonging to the same image, it is determined whether to perform deblocking filter processing with different strengths. Deblocking filter processing for the color difference signal is performed when the Bs value is 2. Deblocking filter processing for the luminance signal is performed when the Bs value is 1 or more and a predetermined condition is satisfied. The predetermined condition may be determined in advance. Note that the determination condition of the Bs value is not limited to that shown in FIG. 10 and may be determined based on other parameters.

[0138] [Prediction Processing Unit (Intra Prediction Unit, Inter Prediction Unit, Prediction Control Unit)] FIG. 11 is a flowchart showing an example of the processing performed by the prediction processing unit of the encoding apparatus 100. Note that the prediction processing unit includes all or some of the components of the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.

[0139] The prediction processing unit generates a predicted image of the current block (step Sb_1). This predicted image is also referred to as a prediction signal or a prediction block. Note that the prediction signal includes, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processing unit generates a predicted image of the current block using the reconstructed image that has already been obtained by performing generation of a prediction block, generation of a difference block, generation of a coefficient block, restoration of the difference block, and generation of a decoded image block.

[0140] The reconstructed image may be, for example, an image of a reference picture, or an image of an encoded block in the current picture that is the picture including the current block. The encoded block in the current picture is, for example, an adjacent block of the current block.

[0141] FIG. 12 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding apparatus 100.

[0142] The prediction processing unit generates a predicted image in a first method (step Sc_1a), generates a predicted image in a second method (step Sc_1b), and generates a predicted image in a third method (step Sc_1c). The first method, the second method, and the third method are different methods for generating a predicted image, and may be, for example, an inter prediction method, an intra prediction method, and a prediction method other than these, respectively. In these prediction methods, the above-described reconstructed image may be used.

[0143] Next, the prediction processing unit selects any one of the plurality of predicted images generated in steps Sc_1a, Sc_1b, and Sc_1c (step Sc_2). The selection of this predicted image, that is, the selection of the method or mode for obtaining the final predicted image, may be performed based on calculating the cost for each generated predicted image and based on that cost. Or, the selection of the predicted image may be performed based on the parameters used in the encoding process. The encoding device 100 may signalize information for specifying the selected predicted image, method, or mode in an encoded signal (also referred to as an encoded bit stream). The information may be, for example, a flag or the like. Thereby, the decoding device can generate a predicted image according to the method or mode selected in the encoding device 100 based on that information. In the example shown in FIG. 12, the prediction processing unit selects any predicted image after generating predicted images by each method. However, the prediction processing unit may select a method or mode based on the parameters used in the above-described encoding process before generating those predicted images, and generate a predicted image according to the method or mode.

[0144] For example, the first method and the second method are intra prediction and inter prediction, respectively, and the prediction processing unit may select the final predicted image for the current block from the predicted images generated according to these prediction methods.

[0145] FIG. 13 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding device 100.

[0146] First, the prediction processing unit generates a predicted image by intra prediction (step Sd_1a) and generates a predicted image by inter prediction (step Sd_1b). Note that the predicted image generated by intra prediction is also referred to as an intra predicted image, and the predicted image generated by inter prediction is also referred to as an inter predicted image.

[0147] Next, the prediction processing unit evaluates each of the intra-predicted image and the inter-predicted image (step Sd_2). A cost may be used for this evaluation. That is, the prediction processing unit calculates the cost C of each of the intra-predicted image and the inter-predicted image. This cost C can be calculated by an equation of an R-D optimization model, for example, C = D + λ × R. In this equation, D is the encoding distortion of the predicted image, which is represented by, for example, the sum of absolute differences between the pixel values of the current block and the pixel values of the predicted image. Also, R is the generated code amount of the predicted image, specifically, the code amount required for encoding motion information or the like for generating the predicted image. Also, λ is, for example, the Lagrange undetermined multiplier.

[0148] Then, the prediction processing unit selects, as the final predicted image of the current block, the predicted image for which the smallest cost C has been calculated from the intra-predicted image and the inter-predicted image (step Sd_3). That is, the prediction method or mode for generating the predicted image of the current block is selected.

[0149] [Intra Prediction Unit] The intra prediction unit 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as in-picture prediction) of the current block with reference to the block in the current picture stored in the block memory 118. Specifically, the intra prediction unit 124 generates an intra prediction signal by performing intra prediction with reference to samples (for example, luminance values, color difference values) of blocks adjacent to the current block, and outputs the intra prediction signal to the prediction control unit 128.

[0150] For example, the intra prediction unit 124 performs intra prediction using one of a plurality of prescribed intra prediction modes. The plurality of intra prediction modes usually include one or more non-directional prediction modes and a plurality of directional prediction modes. The plurality of prescribed modes may be prescribed in advance.

[0151] The non-directional prediction modes of 1 or more include, for example, the Planar prediction mode and the DC prediction mode defined in the H.265 / HEVC standard.

[0152] The plurality of directional prediction modes include, for example, the 33-direction prediction mode defined in the H.265 / HEVC standard. Note that the plurality of directional prediction modes may further include a 32-direction prediction mode (a total of 65 directional prediction modes) in addition to the 33 directions. FIG. 14 is a conceptual diagram showing all 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) that can be used in intra prediction. The solid arrows represent the 33 directions defined in the H.265 / HEVC standard, and the dashed arrows represent the additional 32 directions (the 2 non-directional prediction modes are not shown in FIG. 14).

[0153] In various processing examples, in the intra prediction of a chrominance block, a luminance block may be referred to. That is, based on the luminance component of the current block, the chrominance component of the current block may be predicted. Such intra prediction is sometimes called CCLM (cross-component linear model) prediction. An intra prediction mode of a chrominance block that refers to such a luminance block (for example, called the CCLM mode) may be added as one of the intra prediction modes of the chrominance block.

[0154] The intra prediction unit 124 may correct the pixel value after intra prediction based on the gradient of the reference pixels in the horizontal / vertical direction. Such intra prediction with such correction is sometimes called PDPC (position dependent intra prediction combination). Information indicating the presence or absence of application of PDPC (for example, called a PDPC flag) is usually signaled at the CU level. Note that the signaling of this information is not necessarily limited to the CU level and may be at other levels (for example, sequence level, picture level, slice level, tile level or CTU level).

[0155] [Inter Prediction Unit] The inter prediction unit 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also called inter-frame prediction) of a current block with reference to a reference picture stored in the frame memory 122 and different from the current picture. The inter prediction is performed in units of a current block or a current sub-block (e.g., 4x4 block) within the current block. For example, the inter prediction unit 126 performs motion estimation within the reference picture for the current block or current sub-block, and finds the reference block or sub-block that most matches the current block or current sub-block. Then, the inter prediction unit 126 acquires motion information (e.g., a motion vector) for compensating the motion or change from the reference block or sub-block to the current block or sub-block. The inter prediction unit 126 performs motion compensation (or motion prediction) based on the motion information, and generates an inter prediction signal for the current block or sub-block. The inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.

[0156] The motion information used for motion compensation may be signaled as an inter prediction signal in various forms. For example, a motion vector may be signaled. As another example, the difference between a motion vector and a motion vector predictor may be signaled.

[0157] [Basic Flow of Inter Prediction] FIG. 15 is a flowchart showing an example of the basic flow of inter prediction.

[0158] The inter prediction unit 126 first generates a prediction image (steps Se_1 to Se_3). Next, the subtraction unit 104 generates the difference between the current block and the prediction image as a prediction residual (step Se_4).

[0159] Here, in generating the prediction image, the inter prediction unit 126 generates the prediction image by performing determination of the motion vector (MV) of the current block (steps Se_1 and Se_2) and motion compensation (step Se_3). Also, in determining the MV, the inter prediction unit 126 determines the MV by performing selection of candidate motion vectors (candidate MVs) (step Se_1) and derivation of the MV (step Se_2). The selection of candidate MVs is performed, for example, by selecting at least one candidate MV from a candidate MV list. Also, in deriving the MV, the inter prediction unit 126 may determine the selected at least one candidate MV as the MV of the current block by further selecting at least one candidate MV from the at least one candidate MV. Alternatively, the inter prediction unit 126 may determine the MV of the current block by searching for the region of the reference picture indicated by the candidate MV for each of the selected at least one candidate MVs. Note that searching for the region of this reference picture may be referred to as motion estimation.

[0160] Also, in the above example, steps Se_1 to Se_3 are performed by the inter prediction unit 126, but processing such as step Se_1 or step Se_2 may be performed by other components included in the encoding device 100.

[0161] [Flow of Derivation of Motion Vector] FIG. 16 is a flowchart showing an example of motion vector derivation.

[0162] The inter prediction unit 126 derives the MV of the current block in a mode of encoding motion information (e.g., MV). In this case, for example, the motion information is encoded as a prediction parameter and signaled. That is, the encoded motion information is included in the encoded signal (also referred to as an encoded bitstream).

[0163] Alternatively, the inter prediction unit 126 derives an MV in a mode in which motion information is not encoded. In this case, the motion information is not included in the encoded signal.

[0164] Here, the mode of MV derivation may include, for example, the normal inter mode, the merge mode, the FRUC mode, and the affine mode described later. Among these modes, the modes in which motion information is encoded include the normal inter mode, the merge mode, and the affine mode (specifically, the affine inter mode and the affine merge mode). Note that the motion information may include not only the MV but also prediction motion vector selection information described later. Also, the mode in which motion information is not encoded includes the FRUC mode. The inter prediction unit 126 selects a mode for deriving the MV of the current block from these multiple modes, and derives the MV of the current block using the selected mode.

[0165] FIG. 17 is a flowchart showing another example of motion vector derivation.

[0166] The inter prediction unit 126 derives the MV of the current block in a mode in which the differential MV is encoded. In this case, for example, the differential MV is encoded as a prediction parameter and signaled. That is, the encoded differential MV is included in the encoded signal. This differential MV is the difference between the MV of the current block and its predicted MV.

[0167] Alternatively, the inter prediction unit 126 derives an MV in a mode in which the differential MV is not encoded. In this case, the encoded differential MV is not included in the encoded signal.

[0168] Here, as described above, the modes for deriving the MV include the normal inter, merge mode, FRUC mode, and affine mode, etc., which will be described later. Among these modes, the modes for encoding the differential MV include the normal inter mode and the affine mode (specifically, the affine inter mode), etc. Also, the modes for not encoding the differential MV include the FRUC mode, merge mode, and affine mode (specifically, the affine merge mode), etc. The inter prediction unit 126 selects a mode for deriving the MV of the current block from these multiple modes, and derives the MV of the current block using the selected mode.

[0169] [Flow of Derivation of Motion Vector] FIG. 18 is a flowchart showing another example of motion vector derivation. There are multiple modes for the mode of MV derivation, that is, the inter prediction mode, which can be roughly divided into a mode for encoding the differential MV and a mode for not encoding the differential motion vector. The modes for not encoding the differential MV include the merge mode, FRUC mode, and affine mode (specifically, the affine merge mode). The details of these modes will be described later. Briefly, the merge mode is a mode for deriving the MV of the current block by selecting a motion vector from the surrounding encoded blocks, and the FRUC mode is a mode for deriving the MV of the current block by performing a search between encoded regions. Also, the affine mode is a mode for deriving the motion vector of each of the multiple sub-blocks constituting the current block as the MV of the current block assuming an affine transformation.

[0170] Specifically, as shown in the figure, when the inter-prediction mode information indicates 0 (0 in Sf_1), the inter-prediction unit 126 derives a motion vector by the merge mode (Sf_2). Also, when the inter-prediction mode information indicates 1 (1 in Sf_1), the inter-prediction unit 126 derives a motion vector by the FRUC mode (Sf_3). Further, when the inter-prediction mode information indicates 2 (2 in Sf_1), the inter-prediction unit 126 derives a motion vector by the affine mode (specifically, the affine merge mode) (Sf_4). Also, when the inter-prediction mode information indicates 3 (3 in Sf_1), the inter-prediction unit 126 derives a motion vector by the mode that encodes the differential MV (for example, the normal inter mode) (Sf_5).

[0171] [MV Derivation > Normal Inter Mode] The normal inter mode is an inter-prediction mode that derives the MV of the current block based on a block similar to the image of the current block from the area of the reference picture indicated by the candidate MV. Also, in this normal inter mode, the differential MV is encoded.

[0172] FIG. 19 is a flowchart showing an example of inter-prediction by the normal inter mode.

[0173] The inter-prediction unit 126 first obtains a plurality of candidate MVs for the current block based on information such as the MVs of a plurality of encoded blocks temporally or spatially around the current block (step Sg_1). That is, the inter-prediction unit 126 creates a candidate MV list.

[0174] Next, the inter-prediction unit 126 extracts each of N (N is an integer of 2 or more) candidate MVs from the plurality of candidate MVs obtained in step Sg_1 as a prediction motion vector candidate (also referred to as a prediction MV candidate) according to a predetermined priority order (step Sg_2). Note that the priority order may be determined in advance for each of the N candidate MVs.

[0175] Next, the inter prediction unit 126 selects one candidate prediction motion vector from among the N candidate prediction motion vectors as the prediction motion vector (also referred to as the prediction MV) of the current block (step Sg_3). At this time, the inter prediction unit 126 encodes prediction motion vector selection information for identifying the selected prediction motion vector into the stream. Note that the stream is the encoded signal or encoded bit stream described above.

[0176] Next, the inter prediction unit 126 refers to the encoded reference picture and derives the MV of the current block (step Sg_4). At this time, the inter prediction unit 126 further encodes the difference value between the derived MV and the prediction motion vector as the differential MV into the stream. Note that the encoded reference picture is a picture composed of a plurality of blocks reconstructed after encoding.

[0177] Finally, the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Sg_5). Note that the predicted image is the inter prediction signal described above.

[0178] Also, information indicating the inter prediction mode (normal inter mode in the above example) used for generating the predicted image, which is included in the encoded signal, is encoded as, for example, prediction parameters.

[0179] Note that the candidate MV list may be used in common with lists used in other modes. Also, the processing related to the candidate MV list may be applied to the processing related to the lists used in other modes. The processing related to this candidate MV list is, for example, extraction or selection of candidate MVs from the candidate MV list, rearrangement of candidate MVs, or deletion of candidate MVs.

[0180] [MV Derivation > Merge Mode] The merge mode is an inter prediction mode that derives an MV by selecting a candidate MV from the candidate MV list as the MV of the current block.

[0181] FIG. 20 is a flowchart showing an example of inter prediction by the merge mode.

[0182] The inter prediction unit 126 first obtains a plurality of candidate MVs for the current block based on information such as the MVs of a plurality of encoded blocks temporally or spatially around the current block (step Sh_1). That is, the inter prediction unit 126 creates a candidate MV list.

[0183] Next, the inter prediction unit 126 derives the MV of the current block by selecting one candidate MV from the plurality of candidate MVs obtained in step Sh_1 (step Sh_2). At this time, the inter prediction unit 126 encodes the MV selection information for identifying the selected candidate MV into the stream.

[0184] Finally, the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Sh_3).

[0185] Also, the information indicating the inter prediction mode (merge mode in the above example) used for generating the predicted image included in the encoded signal is encoded as, for example, prediction parameters.

[0186] FIG. 21 is a conceptual diagram for explaining an example of the motion vector derivation process of the current picture by the merge mode.

[0187] First, a prediction MV list in which candidates for the predicted MV are registered is generated. As candidates for the predicted MV, there are a spatial adjacent prediction MV which is the MV of a plurality of encoded blocks spatially adjacent to the target block, a temporal adjacent prediction MV which is the MV of a neighboring block obtained by projecting the position of the target block in the encoded reference picture, a combined prediction MV which is an MV generated by combining the MV values of the spatial adjacent prediction MV and the temporal adjacent prediction MV, and a zero prediction MV which is an MV with a value of zero, and the like.

[0188] Next, one predicted MV is selected from among the plurality of predicted MVs registered in the prediction MV list, and thus determined as the MV of the target block.

[0189] Furthermore, in the variable length encoding section, merge_idx, which is a signal indicating which predicted MV is selected, is described in the stream and encoded.

[0190] Note that the predicted MVs registered in the prediction MV list described in FIG. 21 are just examples, and there may be a configuration in which the number is different from that in the figure, a configuration that does not include some types of the predicted MVs in the figure, or a configuration in which predicted MVs other than the types of predicted MVs in the figure are added.

[0191] The final MV may be determined by performing DMVR (decoder motion vector refinement) processing described later using the MV of the target block derived in the merge mode.

[0192] Note that the candidates for the predicted MV are the above-described candidate MVs, the prediction MV list is the above-described candidate MV list. Also, the candidate MV list may be referred to as a candidate list. Also, merge_idx is MV selection information.

[0193] [MV Derivation > FRUC Mode] Motion information may be derived on the decoder side without being signaled from the encoder side. Note that, as described above, the merge mode defined in the H.265 / HEVC standard may be used. For example, motion information may also be derived by performing motion search on the decoder side. In the embodiment, on the decoder side, motion search is performed without using the pixel values of the current block.

[0194] Here, a mode in which motion search is performed on the decoder side will be described. This mode in which motion search is performed on the decoder side may be called the PMMVD (pattern matched motion vector derivation) mode or the FRUC (frame rate up-conversion) mode.

[0195] An example of the FRUC process is shown in Fig. 22 in the form of a flowchart. First, by referring to the motion vectors of the encoded blocks that are spatially or temporally adjacent to the current block, a list of a plurality of candidates each having a predicted motion vector (MV) (i.e., a candidate MV list, which may be common with the merge list) is generated (step Si_1). Next, the best candidate MV is selected from among the plurality of candidate MVs registered in the candidate MV list (step Si_2). For example, an evaluation value of each candidate MV included in the candidate MV list is calculated, and one candidate MV is selected based on the evaluation value. Then, based on the motion vector of the selected candidate, a motion vector for the current block is derived (step Si_4). Specifically, for example, the motion vector of the selected candidate (the best candidate MV) is directly derived as the motion vector for the current block. Also, for example, in the peripheral region of the position in the reference picture corresponding to the motion vector of the selected candidate, a motion vector for the current block may be derived by performing pattern matching. That is, for the region around the best candidate MV, search using pattern matching and evaluation value in the reference picture is performed, and if there is an MV with a better evaluation value, the best candidate MV is updated to the MV, and it may be used as the final MV of the current block. It is also possible to adopt a configuration in which the process of updating to an MV having a better evaluation value is not performed.

[0196] Finally, the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Si_5).

[0197] When processing is performed in units of sub-blocks, the same processing may be performed.

[0198] The evaluation value may be calculated by various methods. For example, the reconstructed image of the region in the reference picture corresponding to the motion vector is compared with the reconstructed image of a predetermined region (the region may be, for example, the region of another reference picture or the region of an adjacent block of the current picture as shown below). The predetermined region may be determined in advance.

[0199] Then, the difference between the pixel values of the two reconstructed images may be calculated and used as the evaluation value of the motion vector. In addition to the difference value, other information may be used to calculate the evaluation value.

[0200] Next, an example of pattern matching will be described in detail. First, one candidate MV included in the candidate MV list (for example, the merge list) is selected as the start point of the search by pattern matching. For example, as the pattern matching, the first pattern matching or the second pattern matching may be used. The first pattern matching and the second pattern matching may be called bilateral matching and template matching, respectively.

[0201] [MV Derivation > FRUC > Bilateral Matching] In the first pattern matching, pattern matching is performed between two blocks in two different reference pictures that are along the motion trajectory of the current block. Therefore, in the first pattern matching, as the predetermined region for calculating the evaluation value of the above-described candidate, the region in another reference picture along the motion trajectory of the current block is used. The predetermined region may be determined in advance.

[0202] FIG. 23 is a conceptual diagram for explaining an example of first pattern matching (bilateral matching) between two blocks in two reference pictures along a motion trajectory. As shown in FIG. 23, in the first pattern matching, two motion vectors (MV0, MV1) are derived by searching for the most matching pair among pairs of two blocks in two different reference pictures (Ref0, Ref1) that are two blocks along the motion trajectory of the current block (Cur block). Specifically, for the current block, the difference between the reconstructed image at the specified position in the first encoded reference picture (Ref0) specified by the candidate MV and the reconstructed image at the specified position in the second encoded reference picture (Ref1) specified by the symmetric MV obtained by scaling the candidate MV by the display time interval is derived, and an evaluation value is calculated using the obtained difference value. It is possible to select the candidate MV with the best evaluation value among a plurality of candidate MVs as the final MV, which can bring good results.

[0203] Under the assumption of a continuous motion trajectory, the motion vectors (MV0, MV1) indicating the two reference blocks are proportional to the temporal distances (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, when the current picture is temporally located between the two reference pictures and the temporal distances from the current picture to the two reference pictures are equal, in the first pattern matching, mirror-symmetric bidirectional motion vectors are derived.

[0204] [MV Derivation > FRUC > Template Matching] In the second pattern matching (template matching), pattern matching is performed between a template in the current picture (a block adjacent to the current block in the current picture (e.g., the upper and / or left adjacent block)) and a block in the reference picture. Therefore, in the second pattern matching, a block adjacent to the current block in the current picture is used as the predetermined region for calculating the evaluation value of the above-described candidate.

[0205] FIG. 24 is a conceptual diagram for explaining an example of pattern matching (template matching) between a template in a current picture and a block in a reference picture. As shown in FIG. 24, in the second pattern matching, the motion vector of the current block is derived by searching for the block that most matches the block adjacent to the current block (Cur block) in the current picture (Cur Pic) within the reference picture (Ref0). Specifically, for the current block, the difference between the reconstructed image of the coded region of both or either of the left adjacent and upper adjacent blocks and the reconstructed image at the equivalent position within the coded reference picture (Ref0) specified by the candidate MV is derived, an evaluation value is calculated using the obtained difference value, and it is possible to select the candidate MV with the best evaluation value among the plurality of candidate MVs as the best candidate MV.

[0206] Information indicating whether or not to apply such a FRUC mode (for example, called a FRUC flag) may be signaled at the CU level. Also, when the FRUC mode is applied (for example, when the FRUC flag is true), information indicating the applicable pattern matching method (first pattern matching or second pattern matching) may be signaled at the CU level. Note that the signaling of this information does not have to be limited to the CU level and may be at other levels (for example, sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[0207] [MV Derivation > Affine Mode] Next, the affine mode for deriving a motion vector in sub-block units based on the motion vectors of a plurality of adjacent blocks will be described. This mode is sometimes called an affine motion compensation prediction mode.

[0208] FIG. 25A is a conceptual diagram for explaining an example of deriving a motion vector for each sub-block based on motion vectors of a plurality of adjacent blocks. In FIG. 25A, a current block includes 16 4x4 sub-blocks. Here, based on the motion vectors of adjacent blocks, a motion vector v0 of the upper left control point of the current block is derived, and similarly, based on the motion vectors of adjacent sub-blocks, a motion vector v1 of the upper right control point of the current block is derived. Then, the two motion vectors v0 and v1 may be projected according to the following equation (1A), and the motion vectors (v x , v y ) of each sub-block within the current block may be derived.

[0209] [Equation]

[0210] Here, x and y indicate the horizontal position and vertical position of the sub-block, respectively, and w indicates a predetermined weight coefficient. The predetermined weight coefficient may be determined in advance.

[0211] Information indicating such an affine mode (for example, called an affine flag) may be signaled at the CU level. Note that the signaling of the information indicating this affine mode is not necessarily limited to the CU level, and may be at other levels (for example, sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[0212] Also, such an affine mode may include several modes in which the methods for deriving the motion vectors of the upper left and upper right control points are different. For example, the affine mode includes two modes: an affine inter (also called affine normal inter) mode and an affine merge mode.

[0213] [MV Derivation > Affine Mode] FIG. 25B is a conceptual diagram for explaining an example of deriving a motion vector of a sub-block unit in an affine mode having three control points. In FIG. 25B, a current block includes 16 4x4 sub-blocks. Here, a motion vector v0 of the upper left control point of the current block is derived based on the motion vectors of adjacent blocks. Similarly, a motion vector v1 of the upper right control point of the current block is derived based on the motion vectors of adjacent blocks, and a motion vector v2 of the lower left control point of the current block is derived based on the motion vectors of adjacent blocks. Then, the three motion vectors v0, v1, and v2 may be projected by the following equation (1B), and the motion vectors (v x , v y ) of each sub-block in the current block may be derived.

[0214] [Number]

[0215] Here, x and y indicate the horizontal position and the vertical position of the sub-block center, respectively, w indicates the width of the current block, and h indicates the height of the current block.

[0216] The affine modes with different numbers of control points (e.g., two and three) may be switched and signaled at the CU level. Note that information indicating the number of control points of the affine mode used at the CU level may be signaled at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[0217] Also, in such an affine mode having three control points, several modes with different methods of deriving the motion vectors of the upper left, upper right, and lower left control points may be included. For example, the affine mode includes two modes: an affine inter (also referred to as affine normal inter) mode and an affine merge mode.

[0218] [MV Derivation > Affine Merge Mode] Figures 26A, 26B, and 26C are conceptual diagrams for explaining the affine merge mode.

[0219] In the affine merge mode, as shown in Figure 26A, for example, among the encoded blocks A (left), B (top), C (upper right), D (lower left), and E (upper left) adjacent to the current block, a plurality of motion vectors corresponding to the blocks encoded in the affine mode are used to calculate the predicted motion vector for each control point of the current block. Specifically, these blocks are inspected in the order of encoded block A (left), block B (top), block C (upper right), block D (lower left), and block E (upper left), and the first valid block encoded in the affine mode is identified. Based on the plurality of motion vectors corresponding to this identified block, the predicted motion vector for the control point of the current block is calculated.

[0220] For example, as shown in Figure 26B, when the block A adjacent to the left of the current block is encoded in the affine mode with two control points, the motion vectors v3 and v4 projected onto the upper left and upper right corners of the encoded block including block A are derived. Then, from the derived motion vectors v3 and v4, the predicted motion vector v0 for the control point at the upper left corner of the current block and the predicted motion vector v1 for the control point at the upper right corner are calculated.

[0221] For example, as shown in Figure 26C, when the block A adjacent to the left of the current block is encoded in the affine mode with three control points, the motion vectors v3, v4, and v5 projected onto the upper left, upper right, and lower left corners of the encoded block including block A are derived. Then, from the derived motion vectors v3, v4, and v5, the predicted motion vector v0 for the control point at the upper left corner of the current block, the predicted motion vector v1 for the control point at the upper right corner, and the predicted motion vector v2 for the control point at the lower left corner are calculated.

[0222] Note that this predicted motion vector derivation method may also be used to derive each predicted motion vector of the control points of the current block in step Sj_1 of FIG. 29 described later.

[0223] FIG. 27 is a flowchart showing an example of the affine merge mode.

[0224] In the affine merge mode, as shown in the figure, first, the inter prediction unit 126 derives each predicted MV of the control points of the current block (step Sk_1). As shown in FIG. 25A, the control points are the upper left and upper right points of the current block, or as shown in FIG. 25B, the upper left, upper right, and lower left points of the current block.

[0225] That is, as shown in FIG. 26A, the inter prediction unit 126 inspects these blocks in the order of the encoded block A (left), block B (upper), block C (upper right), block D (lower left), and block E (upper left), and identifies the first valid block encoded in the affine mode.

[0226] When block A is identified and block A has two control points, as shown in FIG. 26B, the inter prediction unit 126 calculates the motion vector v0 of the control point at the upper left corner of the current block and the motion vector v1 of the control point at the upper right corner from the motion vectors v3 and v4 at the upper left and upper right corners of the encoded block including block A. For example, the inter prediction unit 126 projects the motion vectors v3 and v4 at the upper left and upper right corners of the encoded block onto the current block to calculate the predicted motion vector v0 of the control point at the upper left corner of the current block and the predicted motion vector v1 of the control point at the upper right corner.

[0227] Alternatively, when block A is identified and block A has three control points, as shown in FIG. 26C, the inter prediction unit 126 calculates the motion vectors v0, v1, and v2 of the control points at the upper left corner, upper right corner, and lower left corner of the current block from the motion vectors v3, v4, and v5 at the upper left corner, upper right corner, and lower left corner of the encoded block including block A. For example, the inter prediction unit 126 projects the motion vectors v3, v4, and v5 at the upper left corner, upper right corner, and lower left corner of the encoded block onto the current block to calculate the predicted motion vector v0 of the control point at the upper left corner of the current block, the predicted motion vector v1 of the control point at the upper right corner, and the motion vector v2 of the control point at the lower left corner.

[0228] Next, the inter prediction unit 126 performs motion compensation for each of a plurality of sub-blocks included in the current block. That is, for each of the plurality of sub-blocks, the inter prediction unit 126 calculates the motion vector of the sub-block as an affine MV using two prediction motion vectors v0 and v1 and the above-described formula (1A), or three prediction motion vectors v0, v1, and v2 and the above-described formula (1B) (step Sk_2). Then, the inter prediction unit 126 performs motion compensation on the sub-block using those affine MVs and the encoded reference picture (step Sk_3). As a result, motion compensation is performed on the current block, and a predicted picture of the current block is generated.

[0229] [MV Derivation > Affine Inter Mode] FIG. 28A is a conceptual diagram for explaining the affine inter mode having two control points.

[0230] In this affine interpolation mode, as shown in FIG. 28A, a motion vector selected from the motion vectors of the encoded blocks A, B, and C adjacent to the current block is used as the predicted motion vector v0 of the control point at the upper left corner of the current block. Similarly, a motion vector selected from the motion vectors of the encoded blocks D and E adjacent to the current block is used as the predicted motion vector v1 of the control point at the upper right corner of the current block.

[0231] FIG. 28B is a conceptual diagram for explaining the affine interpolation mode having three control points.

[0232] In this affine interpolation mode, as shown in FIG. 28B, a motion vector selected from the motion vectors of the encoded blocks A, B, and C adjacent to the current block is used as the predicted motion vector v0 of the control point at the upper left corner of the current block. Similarly, a motion vector selected from the motion vectors of the encoded blocks D and E adjacent to the current block is used as the predicted motion vector v1 of the control point at the upper right corner of the current block. Further, a motion vector selected from the motion vectors of the encoded blocks F and G adjacent to the current block is used as the predicted motion vector v2 of the control point at the lower left corner of the current block.

[0233] FIG. 29 is a flowchart showing an example of the affine interpolation mode.

[0234] As shown in the figure, in the affine interpolation mode, first, the inter prediction unit 126 derives the respective predicted MVs (v0, v1) or (v0, v1, v2) of two or three control points of the current block (step Sj_1). The control points are the points at the upper left corner, upper right corner, or lower left corner of the current block as shown in FIG. 25A or FIG. 25B.

[0235] That is, the inter prediction unit 126 derives the predicted motion vectors (v0, v1) or (v0, v1, v2) of the control points of the current block by selecting the motion vector of any one of the encoded blocks near each control point of the current block shown in FIG. 28A or FIG. 28B. At this time, the inter prediction unit 126 encodes the prediction motion vector selection information for identifying the two selected motion vectors into the stream.

[0236] For example, the inter prediction unit 126 determines which block's motion vector to select as the predicted motion vector of the control point from the encoded blocks adjacent to the current block using cost evaluation or the like, and may describe a flag indicating which predicted motion vector is selected in the bit stream.

[0237] Next, the inter prediction unit 126 performs motion search (steps Sj_3 and Sj_4) while updating the predicted motion vectors selected or derived in step Sj_1 (step Sj_2). That is, the inter prediction unit 126 calculates the motion vectors of the respective sub-blocks corresponding to the updated predicted motion vectors as affine MVs using the above formula (1A) or formula (1B) (step Sj_3). Then, the inter prediction unit 126 performs motion compensation on each sub-block using those affine MVs and the encoded reference picture (step Sj_4). As a result, the inter prediction unit 126 determines, in the motion search loop, for example, the predicted motion vector that obtains the smallest cost as the motion vector of the control point (step Sj_5). At this time, the inter prediction unit 126 further encodes the difference value between the determined MV and each predicted motion vector as a differential MV into the stream.

[0238] Finally, the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the determined MV and the encoded reference picture (step Sj_6).

[0239] [MV Derivation > Affine Inter Mode] When switching and signaling affine modes with different numbers of control points (e.g., two and three) at the CU level, the number of control points may be different between the coded block and the current block. FIGS. 30A and 30B are conceptual diagrams for explaining a method of deriving a predicted vector of control points when the number of control points is different between the coded block and the current block.

[0240] For example, as shown in FIG. 30A, when the current block has three control points at the upper left corner, upper right corner, and lower left corner, and the block A adjacent to the left of the current block is coded in an affine mode with two control points, motion vectors v3 and v4 projected onto the upper left corner and upper right corner positions of the coded block including block A are derived. Then, from the derived motion vectors v3 and v4, a predicted motion vector v0 for the control point at the upper left corner of the current block and a predicted motion vector v1 for the control point at the upper right corner are calculated. Further, from the derived motion vectors v0 and v1, a predicted motion vector v2 for the control point at the lower left corner is calculated.

[0241] For example, as shown in FIG. 30B, when the current block has two control points at the upper left corner and upper right corner, and the block A adjacent to the left of the current block is coded in an affine mode with three control points, motion vectors v3, v4, and v5 projected onto the upper left corner, upper right corner, and lower left corner positions of the coded block including block A are derived. Then, from the derived motion vectors v3, v4, and v5, a predicted motion vector v0 for the control point at the upper left corner of the current block and a predicted motion vector v1 for the control point at the upper right corner are calculated.

[0242] This predicted motion vector derivation method may be used to derive each predicted motion vector of the control points of the current block in step Sj_1 of FIG. 29.

[0243] [MV Derivation > DMVR] FIG. 31A is a flowchart showing the relationship between the merge mode and DMVR.

[0244] The inter prediction unit 126 derives the motion vector of the current block in the merge mode (step Sl_1). Next, the inter prediction unit 126 determines whether to perform motion vector search, that is, motion search (step Sl_2). Here, if the inter prediction unit 126 determines not to perform motion search (No in step Sl_2), the motion vector derived in step Sl_1 is determined as the final motion vector for the current block (step Sl_4). That is, in this case, the motion vector of the current block is determined in the merge mode.

[0245] On the other hand, if it is determined to perform motion search in step Sl_1 (Yes in step Sl_2), the inter prediction unit 126 derives the final motion vector for the current block by searching the peripheral region of the reference picture indicated by the motion vector derived in step Sl_1 (step Sl_3). That is, in this case, the motion vector of the current block is determined by DMVR.

[0246] FIG. 31B is a conceptual diagram for explaining an example of the DMVR process for determining the MV.

[0247] First, the optimal MVP set for the current block (for example, in the merge mode) is used as the candidate MV. Then, according to the candidate MV (L0), reference pixels are specified from the first reference picture (L0), which is the encoded picture in the L0 direction. Similarly, according to the candidate MV (L1), reference pixels are specified from the second reference picture (L1), which is the encoded picture in the L1 direction. A template is generated by taking the average of these reference pixels.

[0248] Next, using the template, search the peripheral regions of the candidate MVs of the first reference picture (L0) and the second reference picture (L1), respectively, and determine the MV with the minimum cost as the final MV. Note that the cost value may be calculated using, for example, the difference value between each pixel value of the template and each pixel value of the search region, and the candidate MV value, etc.

[0249] Typically, in the encoding device and the decoding device described later, the configuration and operation of the processing described here are basically common.

[0250] Even if it is not the processing example itself described here, any processing may be used as long as it is a processing capable of searching the periphery of the candidate MV and deriving the final MV.

[0251] [Motion Compensation > BIO / OBMC] In motion compensation, there are modes for generating a predicted image and correcting the predicted image. Those modes are, for example, BIO and OBMC described later.

[0252] FIG. 32 is a flowchart showing an example of the generation of a predicted image.

[0253] The inter prediction unit 126 generates a predicted image (step Sm_1), and corrects the predicted image by, for example, any of the above-described modes (step Sm_2).

[0254] FIG. 33 is a flowchart showing another example of the generation of a predicted image.

[0255] The inter prediction unit 126 determines the motion vector of the current block (step Sn_1). Next, the inter prediction unit 126 generates a prediction image (step Sn_2) and determines whether to perform correction processing (step Sn_3). Here, when the inter prediction unit 126 determines to perform correction processing (Yes in step Sn_3), it generates a final prediction image by correcting the prediction image (step Sn_4). On the other hand, when the inter prediction unit 126 determines not to perform correction processing (No in step Sn_3), it outputs the prediction image as the final prediction image without correction (step Sn_5).

[0256] Also, in motion compensation, there is a mode of correcting luminance when generating a prediction image. That mode is, for example, LIC described later.

[0257] FIG. 34 is a flowchart showing another example of generating a prediction image.

[0258] The inter prediction unit 126 derives the motion vector of the current block (step So_1). Next, the inter prediction unit 126 determines whether to perform luminance correction processing (step So_2). Here, when the inter prediction unit 126 determines to perform luminance correction processing (Yes in step So_2), it generates a prediction image while performing luminance correction (step So_3). That is, the prediction image is generated by LIC. On the other hand, when the inter prediction unit 126 determines not to perform luminance correction processing (No in step So_2), it generates a prediction image by normal motion compensation without performing luminance correction (step So_4).

[0259] [Motion Compensation > OBMC] An inter prediction signal may be generated using not only the motion information of the current block obtained by motion search but also the motion information of adjacent blocks. Specifically, a prediction signal based on the motion information obtained by motion search (in the reference picture) and a prediction signal based on the motion information of adjacent blocks (in the current picture) may be weighted and added to generate an inter prediction signal in units of sub-blocks within the current block. Such inter prediction (motion compensation) is sometimes called OBMC (overlapped block motion compensation).

[0260] In the OBMC mode, information indicating the size of sub-blocks for OBMC (for example, called OBMC block size) may be signaled at the sequence level. Further, information indicating whether to apply the OBMC mode (for example, called OBMC flag) may be signaled at the CU level. Note that the signaling levels of these pieces of information do not have to be limited to the sequence level and the CU level, and may be at other levels (for example, picture level, slice level, tile level, CTU level, or sub-block level).

[0261] An example of the OBMC mode will be described more specifically. FIGS. 35 and 36 are a flowchart and a conceptual diagram for explaining the outline of prediction image correction processing by OBMC processing.

[0262] First, as shown in FIG. 36, a predicted image (Pred) by normal motion compensation is obtained using the motion vector (MV) assigned to the processing target (current) block. In FIG. 36, the arrow “MV” points to the reference picture and indicates what the current block of the current picture refers to in order to obtain the predicted image.

[0263] Next, the motion vector (MV_L) that has already been derived for the encoded left adjacent block is applied (reused) to the block to be encoded to obtain a predicted image (Pred_L). The motion vector (MV_L) is indicated by an arrow "MV_L" pointing from the current block to the reference picture. Then, the first correction of the predicted image is performed by superimposing the two predicted images Pred and Pred_L. This has the effect of blending the boundaries between adjacent blocks.

[0264] Similarly, the motion vector (MV_U) that has already been derived for the encoded upper adjacent block is applied (reused) to the block to be encoded to obtain a predicted image (Pred_U). The motion vector (MV_U) is indicated by an arrow "MV_U" pointing from the current block to the reference picture. Then, the second correction of the predicted image is performed by superimposing the predicted image Pred_U on the predicted image (e.g., Pred and Pred_L) that has undergone the first correction. This has the effect of blending the boundaries between adjacent blocks. The predicted image obtained by the second correction is the final predicted image of the current block in which the boundaries with adjacent blocks are blended (smoothed).

[0265] Note that the above example is a two-pass correction method using left and upper adjacent blocks, but the correction method may also be a three-pass or more pass correction method using right and / or lower adjacent blocks.

[0266] Note that the area for superimposition may be only a partial area near the block boundary, rather than the entire pixel area of the block.

[0267] Here, the prediction image correction process of OBMC for obtaining one prediction image Pred by superimposing additional prediction images Pred_L and Pred_U on one reference picture has been described. However, when the prediction image is corrected based on a plurality of reference images, the same process may be applied to each of the plurality of reference pictures. In such a case, by performing the image correction of OBMC based on a plurality of reference pictures, after obtaining the corrected prediction images from each of the reference pictures, the final prediction image is obtained by further superimposing the obtained plurality of corrected prediction images.

[0268] Note that in OBMC, the unit of the target block may be a prediction block unit or a sub-block unit obtained by further dividing the prediction block.

[0269] As a method for determining whether to apply the OBMC process, for example, there is a method using an obmc_flag which is a signal indicating whether to apply the OBMC process. As a specific example, the encoding device may determine whether the target block belongs to a region with complex motion. When the target block belongs to a region with complex motion, the encoding device sets the value 1 as the obmc_flag and performs encoding by applying the OBMC process. When the target block does not belong to a region with complex motion, the encoding device sets the value 0 as the obmc_flag and performs block encoding without applying the OBMC process. On the other hand, in the decoding device, by decoding the obmc_flag described in the stream (for example, the compressed sequence), the decoding is performed by switching whether to apply the OBMC process according to the value.

[0270] In the above example, the inter prediction unit 126 generates one rectangular prediction image for the rectangular current block. However, the inter prediction unit 126 may generate a plurality of prediction images with shapes different from the rectangle for the rectangular current block, and generate the final rectangular prediction image by combining the plurality of prediction images. The shape different from the rectangle may be, for example, a triangle.

[0271] FIG. 37 is a conceptual diagram for explaining generation of two triangular prediction images.

[0272] The inter prediction unit 126 generates a prediction image of a triangle by performing motion compensation on the first partition of the triangle in the current block using the first MV of the first partition. Similarly, the inter prediction unit 126 generates a prediction image of a triangle by performing motion compensation on the second partition of the triangle in the current block using the second MV of the second partition. Then, the inter prediction unit 126 generates a prediction image of a rectangle same as the current block by combining these prediction images.

[0273] Note that in the example shown in FIG. 37, the first partition and the second partition are each a triangle, but may be a trapezoid, and may have different shapes from each other. Further, in the example shown in FIG. 37, the current block is composed of two partitions, but may be composed of three or more partitions.

[0274] Also, the first partition and the second partition may overlap. That is, the first partition and the second partition may include the same pixel region. In this case, a prediction image of the current block may be generated using the prediction image in the first partition and the prediction image in the second partition.

[0275] Also, in this example, an example in which prediction images are generated by inter prediction for both two partitions is shown, but prediction images may be generated by intra prediction for at least one partition.

[0276] [Motion Compensation > BIO] Next, a method for deriving a motion vector will be described. First, a mode for deriving a motion vector based on a model assuming uniform linear motion will be described. This mode is sometimes called the BIO (bi - directional optical flow) mode.

[0277] Figure 38 is a conceptual diagram for explaining a model assuming uniform linear motion. In Figure 38, (vx, vy) represents the velocity vector, and τ0 and τ1 represent the temporal distances between the current picture (Cur Pic) and two reference pictures (Ref0, Ref1), respectively. (MVx0, MVy0) represents the motion vector corresponding to the reference picture Ref0, and (MVx1, MVy1) represents the motion vector corresponding to the reference picture Ref1.

[0278] At this time, under the assumption of uniform linear motion of the velocity vector (vx, vy), (MVx0, MVy0) and (MVx1, MVy1) are represented as (vxτ0, vyτ0) and (-vxτ1, -vyτ1), respectively, and the following optical flow equation (2) may be adopted.

[0279] [Equation]

[0280] Here, I(k) represents the luminance value of the reference image k (k = 0, 1) after motion compensation. This optical flow equation indicates that the sum of (i) the temporal derivative of the luminance value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of the reference image, and (iii) the product of the vertical velocity and the vertical component of the spatial gradient of the reference image is equal to zero. Based on the combination of this optical flow equation and Hermite interpolation, the motion vector in block units obtained from the merge list or the like may be corrected in pixel units.

[0281] Note that the motion vector may be derived on the decoder side by a method different from the derivation of the motion vector based on the model assuming uniform linear motion. For example, the motion vector may be derived in sub-block units based on the motion vectors of a plurality of adjacent blocks.

[0282] [Motion Compensation > LIC] Next, an example of a mode for generating a predicted image (prediction) using LIC (local illumination compensation) processing will be described.

[0283] FIG. 39 is a conceptual diagram for explaining an example of a predicted image generation method using luminance correction processing by LIC processing.

[0284] First, an MV is derived from the encoded reference picture, and a reference image corresponding to the current block is obtained.

[0285] Next, for the current block, information indicating how the luminance value has changed between the reference picture and the current picture is extracted. This extraction is performed based on the luminance pixel values in the encoded left adjacent reference area (peripheral reference area) and the encoded upper adjacent reference area (peripheral reference area) in the current picture, and the luminance pixel values at the equivalent positions in the reference picture specified by the derived MV. Then, a luminance correction parameter is calculated using the information indicating how the luminance value has changed.

[0286] A predicted image for the current block is generated by performing a luminance correction process of applying the luminance correction parameter to the reference image in the reference picture specified by the MV.

[0287] Note that the shape of the peripheral reference area in FIG. 39 is an example, and other shapes may be used.

[0288] Also, although the process of generating a predicted image from one reference picture has been described here, the same applies to the case of generating a predicted image from a plurality of reference pictures. The reference images obtained from each reference picture may be subjected to luminance correction processing in the same manner as described above, and then a predicted image may be generated.

[0289] As a method for determining whether to apply LIC processing, for example, there is a method that uses lic_flag, which is a signal indicating whether to apply LIC processing. As a specific example, in an encoding device, it is determined whether the current block belongs to an area where a luminance change has occurred. If it belongs to an area where a luminance change has occurred, a value 1 is set as lic_flag and LIC processing is applied for encoding. If it does not belong to an area where a luminance change has occurred, a value 0 is set as lic_flag and encoding is performed without applying LIC processing. On the other hand, in a decoding device, by decoding the lic_flag described in the stream, decoding may be performed by switching whether to apply LIC processing according to the value thereof.

[0290] As another method for determining whether to apply LIC processing, for example, there is also a method of determining according to whether LIC processing has been applied to surrounding blocks. As a specific example, when the current block is in merge mode, it is determined whether the surrounding encoded blocks selected when deriving the MV in the merge mode process have been encoded with LIC processing applied. Encoding is performed by switching whether to apply LIC processing according to the result. Note that even in this example, the same processing is applied to the processing on the decoder side.

[0291] Although the mode of LIC processing (luminance correction processing) has been described with reference to FIG. 39, the details will be described below.

[0292] First, the inter prediction unit 126 derives a motion vector for obtaining a reference image corresponding to the encoding target block from the reference picture, which is an encoded picture.

[0293] Next, the inter prediction unit 126 extracts information indicating how the luminance values change between the reference picture and the picture to be coded, using the luminance pixel values of the left and upper adjacent coded peripheral reference regions for the block to be coded and the luminance pixel values at equivalent positions in the reference picture specified by the motion vectors, and calculates luminance correction parameters. For example, let the luminance pixel value of a certain pixel in the peripheral reference region within the picture to be coded be p0, and let the luminance pixel value of the pixel in the peripheral reference region within the reference picture at the equivalent position to this pixel be p1. The inter prediction unit 126 calculates, as luminance correction parameters, the coefficients A and B that optimize A×p1 + B = p0 for a plurality of pixels in the peripheral reference region.

[0294] Next, the inter prediction unit 126 performs luminance correction processing on the reference image in the reference picture specified by the motion vector using the luminance correction parameters, thereby generating a predicted image for the block to be coded. For example, let the luminance pixel value in the reference image be p2, and let the luminance pixel value of the predicted image after the luminance correction processing be p3. The inter prediction unit 126 generates the predicted image after the luminance correction processing by calculating A×p2 + B = p3 for each pixel in the reference image.

[0295] Note that the shape of the peripheral reference region in FIG. 39 is an example, and other shapes may be used. Also, a part of the peripheral reference region shown in FIG. 39 may be used. For example, a region including a predetermined number of pixels decimated from each of the upper adjacent pixel and the left adjacent pixel may be used as the peripheral reference region. Also, the peripheral reference region is not limited to the region adjacent to the block to be coded, and may be a region not adjacent to the block to be coded. The predetermined number regarding the pixels may be predetermined.

[0296] Also, in the example shown in FIG. 39, the peripheral reference region in the reference picture is the region specified by the motion vector of the picture to be coded from the peripheral reference region in the picture to be coded, but it may be the region specified by another motion vector. For example, the other motion vector may be the motion vector of the peripheral reference region in the picture to be coded.

[0297] Although the operation of the encoding device 100 has been described here, the operation of the decoding device 200 is typically the same.

[0298] Note that the LIC process may be applied not only to luminance but also to color differences. At this time, correction parameters may be derived individually for each of Y, Cb, and Cr, or a common correction parameter may be used for any of them.

[0299] Also, the LIC process may be applied in sub-block units. For example, correction parameters may be derived using the peripheral reference region of the current sub-block and the peripheral reference region of the reference sub-block in the reference picture specified by the MV of the current sub-block.

[0300] [Prediction control unit] The prediction control unit 128 selects either the intra prediction signal (the signal output from the intra prediction unit 124) or the inter prediction signal (the signal output from the inter prediction unit 126), and outputs the selected signal as the prediction signal to the subtraction unit 104 and the addition unit 116.

[0301] As shown in FIG. 1, in various examples of an encoding device, the prediction control unit 128 may output prediction parameters input to the entropy encoding unit 110. The entropy encoding unit 110 may generate an encoded bit stream (or sequence) based on the prediction parameters input from the prediction control unit 128 and the quantization coefficients input from the quantization unit 108. The prediction parameters may be used in a decoding device. The decoding device may receive and decode the encoded bit stream and perform the same processing as the prediction processing performed in the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128. The prediction parameters may include a selection prediction signal (e.g., a motion vector, a prediction type, or a prediction mode used in the intra prediction unit 124 or the inter prediction unit 126), or any index, flag, or value based on or indicating the prediction processing performed in the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.

[0302] [Implementation Example of Encoding Device] FIG. 40 is a block diagram showing an implementation example of the encoding device 100. The encoding device 100 includes a processor a1 and a memory a2. For example, a plurality of components of the encoding device 100 shown in FIG. 1 are implemented by the processor a1 and the memory a2 shown in FIG. 40.

[0303] The processor a1 is a circuit that performs information processing and is a circuit that can access the memory a2. For example, the processor a1 is a dedicated or general-purpose electronic circuit that encodes moving images. The processor a1 may be a processor such as a CPU. Also, the processor a1 may be an aggregate of a plurality of electronic circuits. Also, for example, the processor a1 may play the roles of a plurality of components among the plurality of components of the encoding device 100 shown in FIG. 1 and the like.

[0304] Memory a2 is a dedicated or general-purpose memory in which information for the processor a1 to encode a moving image is stored. Memory a2 may be an electronic circuit and may be connected to processor a1. Also, memory a2 may be included in processor a1. Further, memory a2 may be an aggregate of a plurality of electronic circuits. Also, memory a2 may be a magnetic disk, an optical disk, etc., or may be expressed as a storage or a recording medium, etc. Also, memory a2 may be a non-volatile memory or a volatile memory.

[0305] For example, memory a2 may store the moving image to be encoded, or may store the bit string corresponding to the encoded moving image. Also, memory a2 may store a program for the processor a1 to encode a moving image.

[0306] Also, for example, memory a2 may serve as a component for storing information among the plurality of components of the encoding device 100 shown in FIG. 1 or the like. For example, memory a2 may serve as the block memory 118 and the frame memory 122 shown in FIG. 1. More specifically, memory a2 may store the reconstructed blocks, the reconstructed pictures, etc.

[0307] Note that in the encoding device 100, not all of the plurality of components shown in FIG. 1 or the like need to be implemented, and not all of the plurality of processes described above need to be performed. A part of the plurality of components shown in FIG. 1 or the like may be included in another device, and a part of the plurality of processes described above may be executed by another device.

[0308] [Decoder] Next, for example, a decoder capable of decoding the encoded signal (encoded bit stream) output from the above-described encoding device 100 will be described. FIG. 41 is a block diagram showing the functional configuration of the decoder 200 according to the embodiment. The decoder 200 is a moving image decoder that decodes a moving image in block units.

[0309] As shown in FIG. 41, the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transformation unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, a frame memory 214, an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.

[0310] The decoding device 200 is realized by, for example, a general-purpose processor and a memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220. Further, the decoding device 200 may be realized as one or more dedicated electronic circuits corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220.

[0311] After explaining the overall processing flow of the decoding device 200 below, each component included in the decoding device 200 will be described.

[0312] [Overall Flow of Decoding Process] FIG. 42 is a flowchart showing an example of the overall decoding process by the decoding device 200.

[0313] First, the entropy decoding unit 202 of the decoding device 200 specifies a division pattern of a fixed-size block (for example, 128×128 pixels) (step Sp_1). This division pattern is the division pattern selected by the encoding device 100. Then, the decoding device 200 performs the processing of steps Sp_2 to Sp_6 for each of the plurality of blocks constituting the division pattern.

[0314] That is, the entropy decoding unit 202 decodes (specifically, entropy decodes) the encoded quantization coefficients and prediction parameters of the block to be decoded (also referred to as the current block) (step Sp_2).

[0315] Next, the inverse quantization unit 204 and the inverse transform unit 206 restore a plurality of prediction residuals (i.e., difference blocks) by performing inverse quantization and inverse transform on the plurality of quantization coefficients (step Sp_3).

[0316] Next, a prediction processing unit composed of all or part of the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 generates a prediction signal (also referred to as a prediction block) of the current block (step Sp_4).

[0317] Next, the addition unit 208 reconstructs the current block into a reconstructed image (also referred to as a decoded image block) by adding the prediction block to the difference block (step Sp_5).

[0318] Then, when this reconstructed image is generated, the loop filter unit 212 performs filtering on the reconstructed image (step Sp_6).

[0319] Then, the decoding device 200 determines whether the decoding of the entire picture is completed (step Sp_7). If it is determined that the decoding is not completed (No in step Sp_7), the processing from step Sp_1 is repeatedly executed.

[0320] As shown in the figure, the processing of steps Sp_1 to Sp_7 is sequentially performed by the decoding device 200. Alternatively, a plurality of some of these processes may be performed in parallel, or the order may be changed, etc.

[0321] [Entropy Decoding Unit] The entropy decoding unit 202 entropy-decodes the encoded bit stream. Specifically, the entropy decoding unit 202, for example, arithmetically decodes the encoded bit stream into a binary signal. Then, the entropy decoding unit 202 de-binarizes the binary signal. The entropy decoding unit 202 outputs quantization coefficients to the inverse quantization unit 204 in block units. The entropy decoding unit 202 may output prediction parameters included in the encoded bit stream (see FIG. 1) to the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 in the embodiment. The intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 can execute the same prediction processing as that performed by the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 on the encoding device side.

[0322] [Inverse Quantization Unit] The inverse quantization unit 204 inverse-quantizes the quantization coefficients of the block to be decoded (hereinafter referred to as the current block), which is an input from the entropy decoding unit 202. Specifically, for each of the quantization coefficients of the current block, the inverse quantization unit 204 inverse-quantizes the quantization coefficient based on the quantization parameter corresponding to the quantization coefficient. Then, the inverse quantization unit 204 outputs the inverse-quantized quantization coefficients (i.e., transform coefficients) of the current block to the inverse transform unit 206.

[0323] [Inverse Transform Unit] The inverse transform unit 206 restores the prediction error by inverse-transforming the transform coefficients, which is an input from the inverse quantization unit 204.

[0324] For example, when the information decoded from the encoded bit stream indicates that EMT or AMT is to be applied (for example, the AMT flag is true), the inverse transform unit 206 inverse-transforms the transform coefficients of the current block based on the information indicating the decoded transform type.

[0325] Also, for example, when the information decoded from the encoded bit stream indicates that NSST is to be applied, the inverse transform unit 206 applies inverse reverse transformation to the transform coefficients.

[0326] [Addition unit] The addition unit 208 reconstructs the current block by adding the prediction error, which is the input from the inverse conversion unit 206, and the prediction sample, which is the input from the prediction control unit 220. Then, the addition unit 208 outputs the reconstructed block to the block memory 210 and the loop filter unit 212.

[0327] [Block memory] The block memory 210 is a storage unit for storing blocks within the decoded target picture (hereinafter referred to as the current picture) that are referred to in intra prediction. Specifically, the block memory 210 stores the reconstructed block output from the addition unit 208.

[0328] [Loop filter unit] The loop filter unit 212 applies a loop filter to the block reconstructed by the addition unit 208 and outputs the filtered reconstructed block to the frame memory 214 and a display device or the like.

[0329] When the information indicating the on / off of the ALF read from the encoded bitstream indicates that the ALF is on, one filter is selected from a plurality of filters based on the local gradient direction and activity, and the selected filter is applied to the reconstructed block.

[0330] [Frame memory] The frame memory 214 is a storage unit for storing reference pictures used in inter prediction, and is sometimes called a frame buffer. Specifically, the frame memory 214 stores the reconstructed block filtered by the loop filter unit 212.

[0331] [Prediction processing unit (intra prediction unit, inter prediction unit, prediction control unit)] FIG. 43 is a flowchart showing an example of the processing performed by the prediction processing unit of the decoding apparatus 200. Note that the prediction processing unit includes all or some of the components of the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220.

[0332] The prediction processing unit generates a predicted image of the current block (step Sq_1). This predicted image is also referred to as a prediction signal or a prediction block. Note that the prediction signal includes, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processing unit generates a predicted image of the current block using the reconstructed image already obtained by performing generation of a prediction block, generation of a difference block, generation of a coefficient block, restoration of the difference block, and generation of a decoded image block.

[0333] The reconstructed image may be, for example, an image of a reference picture, or may be an image of a decoded block in the current picture that is a picture including the current block. The decoded block in the current picture is, for example, an adjacent block of the current block.

[0334] FIG. 44 is a flowchart showing another example of the processing performed by the prediction processing unit of the decoding apparatus 200.

[0335] The prediction processing unit determines a method or mode for generating a predicted image (step Sr_1). For example, this method or mode may be determined based on, for example, prediction parameters.

[0336] When the prediction processing unit determines the first method as the mode for generating the predicted image, the prediction processing unit generates the predicted image according to the first method (step Sr_2a). When the prediction processing unit determines the second method as the mode for generating the predicted image, the prediction processing unit generates the predicted image according to the second method (step Sr_2b). When the prediction processing unit determines the third method as the mode for generating the predicted image, the prediction processing unit generates the predicted image according to the third method (step Sr_2c).

[0337] The first method, the second method, and the third method are different methods for generating a predicted image, and may be, for example, an inter prediction method, an intra prediction method, and other prediction methods, respectively. In these prediction methods, the above-described reconstructed image may be used.

[0338] [Intra Prediction Unit] The intra prediction unit 216 generates a prediction signal (intra prediction signal) by performing intra prediction with reference to a block in the current picture stored in the block memory 210 based on the intra prediction mode decoded from the encoded bitstream. Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to samples (e.g., luminance values, chrominance difference values) of blocks adjacent to the current block, and outputs the intra prediction signal to the prediction control unit 220.

[0339] In addition, when an intra prediction mode that refers to a luminance block is selected for intra prediction of a chrominance difference block, the intra prediction unit 216 may predict the chrominance difference component of the current block based on the luminance component of the current block.

[0340] Also, when the information decoded from the encoded bitstream indicates the application of PDPC, the intra prediction unit 216 corrects the pixel value after intra prediction based on the gradient of the reference pixels in the horizontal / vertical direction.

[0341] [Inter Prediction Unit] The inter prediction unit 218 predicts the current block by referring to the reference picture stored in the frame memory 214. The prediction is performed in units of the current block or sub-blocks (e.g., 4x4 blocks) within the current block. For example, the inter prediction unit 218 performs motion compensation using motion information (e.g., motion vectors) decoded from the coded bitstream (e.g., prediction parameters output from the entropy decoding unit 202) to generate an inter prediction signal for the current block or sub-block, and outputs the inter prediction signal to the prediction control unit 220.

[0342] When the information decoded from the coded bitstream indicates that the OBMC mode is to be applied, the inter prediction unit 218 generates an inter prediction signal using not only the motion information of the current block obtained by motion search but also the motion information of adjacent blocks.

[0343] Also, when the information decoded from the coded bitstream indicates that the FRUC mode is to be applied, the inter prediction unit 218 derives motion information by performing motion search according to the pattern matching method (bilateral matching or template matching) decoded from the coded stream. Then, the inter prediction unit 218 performs motion compensation (prediction) using the derived motion information.

[0344] Also, the inter prediction unit 218 derives a motion vector based on a model assuming uniform linear motion when the BIO mode is applied. Also, when the information decoded from the coded bitstream indicates that the affine motion compensation prediction mode is to be applied, the inter prediction unit 218 derives a motion vector in units of sub-blocks based on the motion vectors of a plurality of adjacent blocks.

[0345] [MV Derivation > Normal Inter Mode] When the information decoded from the symbolized bitstream indicates that the normal inter mode is to be applied, the inter prediction unit 218 derives an MV based on the information decoded from the encoded stream, and performs motion compensation (prediction) using the MV.

[0346] FIG. 45 is a flowchart showing an example of inter prediction in the normal inter mode in the decoding apparatus 200.

[0347] The inter prediction unit 218 of the decoding apparatus 200 performs motion compensation for each block. The inter prediction unit 218 obtains a plurality of candidate MVs for the current block based on information such as the MVs of a plurality of decoded blocks temporally or spatially around the current block (step Ss_1). That is, the inter prediction unit 218 creates a candidate MV list.

[0348] Next, the inter prediction unit 218 extracts, as prediction motion vector candidates (also referred to as prediction MV candidates), each of N (N is an integer of 2 or more) candidate MVs from among the plurality of candidate MVs obtained in step Ss_1 according to a predetermined priority order (step Ss_2). Note that the priority order may be determined in advance for each of the N prediction MV candidates.

[0349] Next, the inter prediction unit 218 decodes prediction motion vector selection information from the input stream (i.e., the symbolized bitstream), and uses the decoded prediction motion vector selection information to select one prediction MV candidate from among the N prediction MV candidates as the prediction motion vector (also referred to as the prediction MV) of the current block (step Ss_3).

[0350] Next, the inter prediction unit 218 decodes the differential MV from the input stream, and derives the MV of the current block by adding the differential value, which is the decoded differential MV, to the selected prediction motion vector (step Ss_4).

[0351] Finally, the inter prediction unit 218 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the decoded reference picture (step Ss_5).

[0352] [Prediction control unit] The prediction control unit 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected signal as a prediction signal to the adder 208. Overall, the configuration, function, and processing of the prediction control unit 220, the intra prediction unit 216, and the inter prediction unit 218 on the decoder side may correspond to the configuration, function, and processing of the prediction control unit 128, the intra prediction unit 124, and the inter prediction unit 126 on the encoder side.

[0353] [Implementation example of decoder] FIG. 46 is a block diagram showing an implementation example of the decoder 200. The decoder 200 includes a processor b1 and a memory b2. For example, a plurality of components of the decoder 200 shown in FIG. 41 are implemented by the processor b1 and the memory b2 shown in FIG. 46.

[0354] The processor b1 is a circuit that performs information processing and is a circuit that can access the memory b2. For example, the processor b1 is a dedicated or general-purpose electronic circuit that decodes an encoded moving image (i.e., an encoded bitstream). The processor b1 may be a processor such as a CPU. Also, the processor b1 may be an aggregate of a plurality of electronic circuits. Also, for example, the processor b1 may play the roles of a plurality of components among the plurality of components of the decoder 200 shown in FIG. 41 and the like.

[0355] Memory b2 is a dedicated or general-purpose memory in which information for the processor b1 to decode the encoded bitstream is stored. Memory b2 may be an electronic circuit and may be connected to the processor b1. Also, memory b2 may be included in the processor b1. Further, memory b2 may be an aggregate of a plurality of electronic circuits. Also, memory b2 may be a magnetic disk, an optical disk, etc., or may be expressed as a storage or recording medium, etc. Also, memory b2 may be a non-volatile memory or a volatile memory.

[0356] For example, a moving image or an encoded bitstream may be stored in memory b2. Also, a program for the processor b1 to decode the encoded bitstream may be stored in memory b2.

[0357] Also, for example, memory b2 may serve as a component for storing information among a plurality of components of the decoding device 200 shown in FIG. 41 etc. Specifically, memory b2 may serve as the block memory 210 and the frame memory 214 shown in FIG. 41. More specifically, reconstructed blocks, reconstructed pictures, etc. may be stored in memory b2.

[0358] Note that in the decoding device 200, not all of the plurality of components shown in FIG. 41 etc. need to be implemented, and not all of the plurality of processes described above need to be performed. A part of the plurality of components shown in FIG. 41 etc. may be included in another device, and a part of the plurality of processes described above may be executed by another device.

[0359] [Definitions of Each Term] Each term may be defined as follows as an example.

[0360] A picture is an array of a plurality of luminance samples in monochrome format, or an array of a plurality of luminance samples and two corresponding arrays of a plurality of chrominance samples in color formats of 4:2:0, 4:2:2, and 4:4:4. The picture may be a frame or a field.

[0361] A frame is a composition of a top field where a plurality of sample rows 0, 2, 4, ··· occur, and a bottom field where a plurality of sample rows 1, 3, 5, ··· occur.

[0362] A slice is an integer number of coded tree units included in one independent slice segment and all subsequent dependent slice segments (if any) preceding the next independent slice segment (if any) in the same access unit.

[0363] A tile is a rectangular area of a plurality of coded tree blocks in a specific tile column and a specific tile row in a picture. The tile may be a rectangular area of a frame that is still intended to be independently decoded and encoded, although a loop filter spanning the edges of the tile may still be applied.

[0364] A block is an MxN (N rows and M columns) array of a plurality of samples, or an MxN array of a plurality of transform coefficients. The block may be a square or rectangular area of a plurality of pixels consisting of a plurality of matrices of one luminance and two chrominances.

[0365] A CTU (Coded Tree Unit) may be a coded tree block of a plurality of luminance samples of a picture having three sample arrays, or two corresponding coded tree blocks of a plurality of chrominance samples. Alternatively, a CTU may be a coded tree block of a plurality of samples of either a monochrome picture or a picture encoded using a syntax structure used for encoding three separate color planes and a plurality of samples.

[0366] The super block may constitute one or two mode information blocks, or may be a square block of 64×64 pixels that is recursively divided into four 32×32 blocks and can be further divided.

[0367] [First Aspect] Hereinafter, the first aspect will be described. The encoding device 100 and the decoding device 200 according to the first aspect associate motion vector information (hereinafter also referred to as MV information) derived from a processed block (hereinafter also referred to as a processed CU) with correction processing information regarding correction processing of the predicted image of the processed block, store them in a FIFO (First In First Out) buffer for the HMVP (History based Motion Vector Predictor) mode, and include one or more prediction candidates including a combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode as prediction candidates in a prediction candidate list for the merge mode (hereinafter also referred to as the candidate MVP list for the merge mode). When processing the block to be processed (hereinafter also referred to as the processing target CU) in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the processing target block is performed based on the correction processing information of the selected prediction candidate.

[0368] Here, the processed block is an encoded block in the encoding process and a decoded block in the decoding process. Hereinafter, the encoding device 100 will be described.

[0369] The merge mode acquires a plurality of candidate motion vectors for a block to be processed based on information such as a plurality of encoded blocks located around the block to be processed temporally or spatially. Specifically, the inter prediction unit 126 of the encoding device 100 creates a prediction candidate list including, as prediction candidates, combinations of motion vector candidate (so-called candidate predicted motion vector) information and correction processing information of the block to be processed based on the motion vector information and correction processing information of the plurality of encoded blocks. When creating this list, the inter prediction unit 126 selects one or more prediction candidates from the FIFO buffer for the HMVP mode and registers them in the prediction candidate list for the merge mode.

[0370] [HMVP mode] Hereinafter, the HMVP mode will be described more specifically with reference to FIG. 47. FIG. 47 is a diagram for explaining the HMVP mode. The candidate MVP list for the merge mode in the figure is an example of the prediction candidate list for the merge mode. Note that the numbers attached after MVP and HMVP indicate the order in which they are registered in the list and the buffer.

[0371] In the HMVP mode, candidate MVPs are managed using a FIFO buffer for HMVP separately from the candidate MVP list for the merge mode.

[0372] The FIFO buffer stores MV information of CUs processed in the past (that is, CUs processed before the CU to be processed) from the newest ones in the processing order of the CUs by a predetermined number (five in FIG. 47). For example, as shown in FIG. 47, every time the encoding device 100 processes one CU, it stores the MV information of the newest CU (in other words, the CU processed immediately before the said CU) in the FIFO buffer. Note that the encoding device 100 may store the MV information of the said CU in the FIFO buffer every time it finishes processing one CU.

[0373] Also, when the encoding device 100 stores new MV information in the FIFO buffer, it deletes the MV information of the oldest CU in the FIFO buffer (in other words, the CU processed first) from the FIFO buffer. Thereby, the encoding device 100 can manage the prediction candidates in the FIFO buffer in the latest state. In the example of FIG. 47, HMVP1 in the FIFO buffer is the MV information of the newest CU, and HMVP5 in the FIFO buffer is the MV information of the oldest CU.

[0374] When the encoding device 100 processes the CU to be processed in the merge mode, it determines the motion vector (MV) of the CU to be processed by selecting one prediction candidate from the prediction candidate list (hereinafter, the candidate MVP list for the merge mode) generated by referring to the processed CUs. The candidate MVP list for the merge mode registers spatial adjacent prediction motion vectors (also referred to as spatial adjacent MVPs), which are motion vectors of a plurality of encoded CUs spatially adjacent to the CU to be processed, and temporal adjacent prediction motion vectors (also referred to as temporal adjacent MVPs), which are motion vectors of neighboring CUs obtained by projecting the position of the CU to be processed in the encoded reference picture. One of the candidate MVPs registered in this candidate MVP list is the candidate MVP in the HMVP mode.

[0375] Subsequently, the outline of the process of registering the candidate MVP in the HMVP mode in the candidate MVP list for the merge mode will be described with reference to FIG. 47.

[0376] When a prediction candidate having the same MV information as the MV information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list (so-called candidate MVP list) for the merge mode, the encoding device 100 registers the MV information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0377] For example, as shown in FIG. 47, the encoding device 100 searches for whether there is MV information in the FIFO buffer that is different from all the MV information already registered in the candidate MVP list for the merge mode. More specifically, the encoding device 100 determines, for the MV information in the FIFO buffer, in order from the MV information of the newest CU (here, HMVP1), whether it is MV information different from all the candidate MVPs in the candidate MVP list for the merge mode. At this time, if it is determined that HMVP1 is MV information different from all the candidate MVPs in the candidate MVP list for the merge mode, the encoding device 100 adds HMVP1 to the candidate MVP list for the merge mode. Then, the encoding device 100 performs the same process for each of HMVP2 to HMVP5. Note that the number of predicted candidates in the HMVP mode registered in the candidate MVP list for the merge mode may be one or more.

[0378] By using the HMVP mode in this way, not only the MV information of the spatially or temporally adjacent CUs of the CU to be processed is registered as a candidate for MVP, but also the MV information of the CUs processed in the past can be added to the candidate MVP list for the merge mode as a candidate for MVP. As a result, the variations of the candidate MVPs in the merge mode increase. Therefore, the encoding device 100 can select a more appropriate candidate MVP for the block to be processed, and thus the encoding efficiency is improved.

[0379] Note that the MV information may include not only the value of the MV but also information such as the information of the reference picture, the reference direction, and the number of reference pictures.

[0380] Note that the candidate MVP list and the FIFO buffer shown in FIG. 47 are just examples, and lists and buffers of sizes different from those shown may be used, or a configuration in which candidate MVPs are registered in an order different from that shown may be used.

[0381] Note that here, the encoding device 100 is described as an example, but the above process is common to the encoding device 100 and the decoding device 200.

[0382] Figure 48 is a flowchart showing the processing flow of the inter-screen prediction processing of the encoding device 100 and the decoding device 200 in this embodiment. Here, the processing will be described by focusing on the case where the encoding device 100 processes the CU to be processed in the merge mode and performs the LIC processing.

[0383] In the prediction processing of the picture to be processed, the encoding device 100 starts the loop processing in units of CUs (S1001).

[0384] First, when processing the CU to be processed using the merge mode, the encoding device 100 generates a candidate MVP list for the merge mode (S1002). At this time, the encoding device 100 registers the MV information of the spatially or temporally adjacent CUs of the CU to be processed as candidate MVPs in the candidate MVP list for the merge mode, and registers correction processing information (hereinafter, LicFlg information) indicating whether the prediction image has been corrected by the LIC processing in the CU to which each candidate MVP belongs, in association with each candidate MVP.

[0385] Next, the encoding device 100 selects one candidate MVP from the candidate MVP list for the merge mode and determines the MV of the CU to be processed. At this time, the encoding device 100 also acquires the LicFlg information associated with the selected candidate MVP and sets it as the LicFlg information of the CU to be processed (S1003).

[0386] Then, the encoding device 100 performs motion compensation processing (MC processing) using the MV determined in S1003 to generate a prediction image (S1004), and further generates a final prediction image by performing correction processing by the LIC processing on the prediction image according to the LicFlg information (S1005).

[0387] Furthermore, the encoding device 100 updates the FIFO buffer for the HMVP mode by storing the MV information and LicFlg information assigned to the CU to be processed in the FIFO buffer for the HMVP mode (S1006). The updated FIFO buffer for the HMVP mode is used for the generation process (S1002) of the candidate MVP list for the merge mode of the CU to be processed subsequently (i.e., the subsequent CU) after the CU to be processed.

[0388] After repeating the processes of S1002 to S1006 for all the CUs in the picture to be processed, the encoding device 100 ends the loop process in units of CUs (S1007).

[0389] Here, an example in the case of processing the CU to be processed in the merge mode has been described. However, even when processing using an inter-picture prediction mode other than the merge mode, the FIFO buffer for the HMVP mode may be updated by storing the acquired MV information and LicFlg information in the FIFO buffer for the HMVP mode in the same manner, and may be used for the generation process of the candidate MVP list for the merge mode of the subsequent CU.

[0390] Note that the processing flow shown in FIG. 48 is an example, and a part of the processes described in the figure may be excluded, or processes or conditional determinations not described may be added.

[0391] Here, the processing flow of the encoding device 100 has been described. However, between the encoding device and the decoding device, there is only a difference in whether to encode the signals required for processing into a stream or decode them from the stream. Therefore, the processing flow of the encoding device described here is basically common to the processing flow of the decoding device.

[0392] FIG. 49 is a diagram for explaining the candidate MVP list for the merge mode and the FIFO buffer for the HMVP mode described in FIG. 47 in more detail.

[0393] The difference from the figure described in FIG. 47 is that correction processing information (here, LicFla information) is managed in association with the MV information in both the candidate MVP list for the merge mode and the FIFO buffer for the HMVP mode. The correction processing information indicates at least whether to apply correction processing to the predicted image of the CU to be processed. The correction processing may be processing for correcting the luminance and color difference of the predicted image of the block to be processed. For example, the correction processing is LIC processing.

[0394] As described with reference to FIG. 47, in the FIFO buffer for the HMVP mode, MV information of CUs encoded in the past is stored in a predetermined number from the newest in the processing order of the CUs. Here, when storing the MV information in the FIFO buffer, the encoding apparatus 100 also stores the LicFlg information in association with the MV information. Each time the encoding apparatus 100 processes one CU, it stores the combination of the MV information and the LicFlg information of the newest CU (that is, the CU processed immediately before the said CU) in the FIFO buffer. Note that the encoding apparatus 100 may store the combination of the MV information and the LicFla information of the said CU in the FIFO buffer each time it finishes processing one CU.

[0395] Also, when storing a new combination in the FIFO buffer, the encoding apparatus 100 deletes the combination of the MV information and the LicFlg information of the oldest CU (that is, the CU processed first) in the FIFO buffer. Thereby, the encoding apparatus 100 can manage the prediction candidates in the FIFO buffer in the latest state. In the example of FIG. 49, HMVP1 and HLicFlg1 in the FIFO buffer are the MV information and the LicFlg information of the newest CU, and HMVP5 and HLicFlg5 in the FIFO buffer are the MV information and the LicFlg information of the oldest CU.

[0396] Subsequently, an outline of the process of registering the prediction candidates in the HMVP mode in the candidate MVP list for the merge mode will be described with reference to FIG. 49.

[0397] When a prediction candidate having the same MV information as the MV information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode (so-called candidate MVP list), the symbolization device 100 registers a combination of the MV information stored in the FIFO buffer for the HMVP mode and the correction processing information in the prediction candidate list for the merge mode.

[0398] For example, as shown in FIG. 49, the symbolization device 100 searches for whether there is MV information different from all the MV information already registered in the candidate MVP list for the merge mode among the MV information in the FIFO buffer. More specifically, the symbolization device 100 determines, in order from the MV information of the newest CU (here, HMVP1) among the MV information in the FIFO buffer, whether it is MV information different from all the candidate MVPs in the candidate MVP list for the merge mode. At this time, when it is determined that HMVP1 is MV information different from all the candidate MVPs in the candidate MVP list for the merge mode, the symbolization device 100 adds HMVP1 to the candidate MVP list for the merge mode. Then, the symbolization device 100 performs the same process for each of HMVP2 to HMVP5. Note that the number of prediction candidates in the HMVP mode registered in the candidate MVP list for the merge mode may be one or more.

[0399] Also, for example, when the encoding device 100 searches for whether there is MV information different from all the candidate MVPs already registered in the candidate MVP list for the merge mode regarding the MV information in the FIFO buffer, it may be configured to determine whether the LicFlg information is also different in addition to the MV information. More specifically, the encoding device 100 determines whether the combination of the MV information and the LicFlg information in the FIFO buffer is different from all the combinations in the candidate MVP list for the merge mode in order from the combination of the newest CUs (here, HMVP1 and HLicFlg1). At this time, when at least one of the candidate MVP and the LicFlg information is different in all the combinations of the candidate MVP list for the merge mode for HMVP1 and HLicFlg1, it may be configured to determine that it is a different combination.

[0400] Further, when the combination of the MV information stored in the FIFO buffer for the HMVP mode and the correction processing information (for example, LicFla information) is not registered in the prediction candidate list for the merge mode, the encoding device 100 may register the combination of the MV information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0401] By using the HMVP mode in this way, not only is a combination of MV information and correction processing information of spatially or temporally adjacent CUs of the CU to be processed registered as a prediction candidate, but also a combination of MV information and correction processing information of CUs processed in the past can be added to the candidate MVP list for the merge mode as a prediction candidate. As a result, even if it has the same MV information as the MV information of spatially or temporally adjacent CUs of the CU to be processed, it is possible to add a combination having different correction processing information to the candidate MVP list for the merge mode as a prediction candidate. Thereby, the variations of the candidate MVPs in the merge mode further increase. Therefore, the encoding device 100 can select a more appropriate candidate MVP for the block to be processed, so the encoding efficiency is improved. That is, even when using the HMVP mode, it is possible to appropriately manage the correction processing information (here, the LicFlg information). Thereby, the encoding device 100 can apply a more appropriate LIC process to the block to be processed, so the encoding efficiency is improved.

[0402] Note that the MV information may include not only the value of the MV but also information such as the information of the reference picture, the reference direction, and the number of reference pictures.

[0403] Note that the candidate MVP list and the FIFO buffer shown in FIG. 49 are examples, and they may be lists and buffers of sizes different from those shown, and may be configured to manage information other than the illustrated information together, or may be configured to register candidate MVPs in an order different from that shown.

[0404] Note that here, the encoding device 100 has been described as an example, but the above processing is common to the encoding device and the decoding device.

[0405] [Variation] In this embodiment, in the candidate MVP list for the merge mode and the FIFO buffer for the HMVP mode, by managing correction processing information (here, LicFlg information) in addition to the MV information, even when the HMVP mode is selected as the merge mode, it is possible to apply an appropriate correction process (here, LIC process) to the processing target block. However, the correction processing information is not limited to the LicFlg information. For example, as the correction processing information, information related to other processes such as OBMC (Overlapped Block Motion Compensation) processing, BIO (Bi-Direction Optical Flow) processing, DMVR (Decoder Motion Vector Refinement) processing, BCW (Bi-prediction with CU-level Weights) processing, etc. is managed in the same manner as in this embodiment, so that even when the HMVP mode is selected as the merge mode, it is also possible to appropriately apply those correction processes.

[0406] Hereinafter, the BCW process will be described. FIG. 50 is a diagram for explaining the outline of the BCW process.

[0407] The BCW process is a process for correcting the predicted image of the processing target block in the bidirectional prediction process. The BCW process is a process for correcting the luminance and color difference of the predicted image of the processing target block.

[0408] As shown in FIG. 50, in BCW processing, the encoding device 100 multiplies the pixel value of the reconstructed image (hereinafter, the reconstructed image of the first reference block) at the specified position in the first reference picture (L0) specified by the candidate MV (MV_L0) by the weight N0 for the processing target block. Further, the encoding device 100 multiplies the pixel value of the reconstructed image (hereinafter, the reconstructed image of the second reference block) at the specified position in the second reference picture (L1) specified by the candidate MV (MV_L1) by the weight N1. Then, the encoding device 100 divides the sum of the pixel value multiplied by the weight N0 and the pixel value multiplied by the weight N1 by the sum of the weight N0 and the weight N1. Thereby, the encoding device 100 performs correction processing on the predicted image. The combination of the weights N0 and N1 is preset as a BCW index. The BCW index is specified for each block.

[0409] The encoding device 100 associates the MV information derived from the processed block with the correction processing information (here, the BCW index) regarding the correction processing of the predicted image of the processed block, stores them in the FIFO buffer for the HMVP mode, and includes the combination of the MV information and the correction processing information stored in the FIFO buffer for the HMVP mode as one or more prediction candidates in the prediction candidate list for the merge mode. When processing the processing target block in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode, and correction processing for the predicted image of the processing target block is performed based on the correction processing information of the selected prediction candidate.

[0410] FIG. 51 is a diagram showing an example of the BCW index. A predetermined number of BCW indexes (bcw_idx in the figure) are set in advance.

[0411] For example, when the BCW index is 0, both weights N0 and N1 are 4. At this time, the encoding device 100 multiplies the reconstructed image of the first reference block by the weight 4, multiplies the reconstructed image of the second reference block by the weight 4, sums them up, and divides by 8. That is, the encoding device 100 simply executes a process of taking the average of the reconstructed image of the first reference block and the reconstructed image of the second reference block. Therefore, when the BCW index is 0, the encoding device 100 does not perform the weighting process by BCW processing on the predicted image of the processing target block, that is, does not perform the correction process.

[0412] In the normal inter prediction mode, the BCW index is encoded into the stream for each block. At this time, the encoding device 100 performs a correction process on the predicted image of the processing target block based on the BCW index encoded into the stream. The decoding device 200 acquires the BCW index encoded into the stream and performs a correction process on the predicted image of the processing target block based on the acquired BCW index.

[0413] On the other hand, in the merge mode, the BCW index is not encoded into the stream. At this time, the encoding device 100 uses the BCW index of the block referred to in the merge mode. More specifically, in the merge mode, the encoding device 100 selects a prediction candidate (that is, a combination of MV information and BCW index) registered in the prediction candidate list for the merge mode, and applies BCW processing to the processing target block based on the selected prediction candidate. Also, in the pruning process (registration process to the candidate MVP list for the merge mode), the encoding device 100 determines whether not only the MV information but also the BCW index of the prediction candidate stored in the FIFO buffer for the HMVP mode matches the BCW index of the prediction candidate registered in the prediction candidate list for the merge mode, and may register the prediction candidate in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0414] [Effect] With the configuration described with reference to FIGS. 48 to 51, even when the HMVP mode is used as one of the prediction candidates in the merge mode, the encoding apparatus 100 can appropriately manage the correction processing information. As a result, when a prediction candidate in the HMVP mode is selected, the encoding apparatus 100 can apply appropriate correction processing, thereby improving the encoding efficiency.

[0415] Here, the encoding apparatus 100 has been described. However, the encoding apparatus 100 and the decoding apparatus 200 differ only in whether to encode the signals required for processing into a stream or decode them from the stream. Therefore, similar to the encoding apparatus 100, when a prediction candidate in the HMVP mode is selected, the decoding apparatus 200 can apply appropriate correction processing, thereby improving the processing efficiency.

[0416] [Typical Examples of Processing] Typical examples of the processing of the encoding apparatus 100 and the decoding apparatus 200 shown above are shown below.

[0417] FIG. 52 is a flowchart showing the operations performed by the encoding apparatus 100. The encoding apparatus 100 includes a circuit and a memory connected to the circuit. The circuit and the memory included in the encoding apparatus 100 may correspond to the processor a1 and the memory a2 shown in FIG. 40. The circuit of the encoding apparatus 100 performs the following in operation.

[0418] For example, the circuit of the encoding apparatus 100 associates the motion vector information derived from the processed block with the correction processing information regarding the correction processing of the predicted image of the processed block, and stores them in the FIFO buffer for the HMVP mode (S2001). One or more prediction candidates including the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode are registered in the prediction candidate list for the merge mode (S2002). When processing the block to be processed in the merge mode, a prediction candidate is selected from the prediction candidate list for the merge mode (S2003), and correction processing for the predicted image of the block to be processed is performed based on the correction processing information of the selected prediction candidate (S2004).

[0419] In this way, by using the HMVP mode, the encoding device 100 can add not only the prediction information of spatially or temporally adjacent blocks of the block to be processed but also the prediction candidates of the blocks processed before the block to be processed to the prediction candidates for the merge mode. As a result, since the variations of the prediction candidates in the merge mode increase, the encoding device 100 can process the block to be processed using an appropriate prediction candidate. Therefore, the encoding efficiency is improved. Further, since the correction processing information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, the encoding device 100 can appropriately manage the correction processing information for each block even when using the HMVP mode. Therefore, the encoding device 100 can perform more appropriate correction processing on the predicted image of the block to be processed.

[0420] Further, for example, when the prediction candidate selected from the prediction candidate list for the merge mode is the prediction candidate registered from the FIFO buffer for the HMVP mode, the circuit of the encoding device 100 may perform correction processing on the predicted image of the block to be processed based on the correction processing information of the prediction candidate registered from the FIFO buffer for the HMVP mode.

[0421] Thereby, when the encoding device 100 selects the prediction candidate registered from the FIFO buffer for the HMVP mode from the prediction candidate list for the merge mode, the encoding device 100 can perform more appropriate correction processing on the predicted image of the block to be processed based on the correction processing information associated with the motion vector information of the HMVP mode.

[0422] For example, when a prediction candidate having the same motion vector information as the motion vector information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit of the encoding device 100 may register the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0423] Thus, when a prediction candidate having motion vector information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the encoding device 100 can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0424] For example, when the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit of the encoding device 100 may register the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0425] Thus, when a prediction candidate having a combination of motion vector information and correction processing information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the encoding device 100 can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0426] For example, the correction processing information may at least indicate whether to apply correction processing to the predicted image of the processing target block.

[0427] Thereby, the encoding device 100 can switch whether to apply correction processing to the predicted image of the processing target block based on the correction processing information. Therefore, the encoding efficiency is improved.

[0428] For example, the correction processing may be processing for correcting the luminance and color difference of the predicted image of the processing target block.

[0429] Thereby, the encoding device 100 can appropriately correct the luminance and color difference of the predicted image of the processing target block.

[0430] For example, the correction process may be the LIC process.

[0431] As a result, the encoding device 100 can appropriately manage information related to the LIC process as correction process information, and thus can apply a more appropriate LIC process to the predicted image of the processing target block.

[0432] FIG. 53 is a flowchart showing the operations performed by the decoding device 200. For example, the decoding device 200 includes a circuit and a memory connected to the circuit. The circuit and memory included in the decoding device 200 may correspond to the processor b1 and the memory b2 shown in FIG. 46. The circuit of the decoding device 200 performs the following in operation.

[0433] Also, the circuit of the decoding device 200 associates the motion vector information derived from the processed block with the correction process information regarding the correction process of the predicted image of the processed block and stores them in the FIFO buffer for the HMVP mode (S3001), registers one or more prediction candidates including the combination of the motion vector information and the correction process information stored in the FIFO buffer for the HMVP mode as prediction candidates in the prediction candidate list for the merge mode (S3002), when processing the processing target block in the merge mode, selects a prediction candidate from the prediction candidate list for the merge mode (S3003), and performs a correction process on the predicted image of the processing target block based on the correction process information of the selected prediction candidate (S3004).

[0434] In this way, by using the HMVP mode, the decoding device 200 can add not only the prediction information of the spatially or temporally adjacent blocks of the block to be processed but also the prediction candidates of the blocks processed before the block to be processed to the prediction candidates for the merge mode. As a result, since the variations of the prediction candidates in the merge mode increase, the decoding device 200 can process the block to be processed using appropriate prediction candidates. Therefore, the processing efficiency is improved. Also, since the correction processing information is stored in the FIFO buffer for the HMVP mode together with the motion vector information, the decoding device 200 can appropriately manage the correction processing information for each block even when using the HMVP mode. Therefore, the decoding device 200 can perform more appropriate correction processing on the predicted image of the block to be processed.

[0435] For example, when the prediction candidate selected from the prediction candidate list for the merge mode is the prediction candidate registered from the FIFO buffer for the HMVP mode, the circuit of the decoding device 200 may perform correction processing on the predicted image of the block to be processed based on the correction processing information of the prediction candidate registered from the FIFO buffer for the HMVP mode.

[0436] Thereby, when the decoding device 200 selects the prediction candidate registered from the FIFO buffer for the HMVP mode from the prediction candidate list for the merge mode, it can perform more appropriate correction processing on the predicted image of the block to be processed based on the correction processing information associated with the motion vector information of the HMVP mode.

[0437] For example, when a prediction candidate having the same motion vector information as the motion vector information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit of the decoding device 200 may register the combination of the motion vector information and the correction processing information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0438] As a result, when a prediction candidate having motion vector information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the decoding apparatus 200 can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0439] For example, when the combination of the motion vector information and the correction process information stored in the FIFO buffer for the HMVP mode is not registered in the prediction candidate list for the merge mode, the circuit of the decoding apparatus 200 may register the combination of the motion vector information and the correction process information stored in the FIFO buffer for the HMVP mode in the prediction candidate list for the merge mode.

[0440] As a result, when a prediction candidate having a combination of motion vector information and correction process information not registered in the prediction candidate list for the merge mode is stored in the FIFO buffer for the HMVP mode, the decoding apparatus 200 can add the prediction candidate for the HMVP mode to the prediction candidate list for the merge mode. Therefore, the variations of the prediction candidates for the merge mode increase.

[0441] For example, the correction process information may at least indicate whether to apply a correction process to the predicted image of the processing target block.

[0442] As a result, the decoding apparatus 200 can switch whether to apply a correction process to the predicted image of the processing target block based on the correction process information. Therefore, the coding efficiency is improved.

[0443] Also, for example, the correction process may be a process of correcting the luminance and color difference of the predicted image of the processing target block.

[0444] As a result, the decoding apparatus 200 can appropriately correct the luminance and color difference of the predicted image of the processing target block.

[0445] For example, the correction process may be the LIC process.

[0446] As a result, the decoding device 200 can appropriately manage information related to the LIC process as correction process information, and thus can apply a more appropriate LIC process to the predicted image of the processing target block.

[0447] Also, as described above, each component may be a circuit. These circuits may form one circuit as a whole, or may be separate circuits respectively. Also, each component may be realized by a general-purpose processor or a dedicated processor.

[0448] Also, a process executed by a specific component may be executed by another component. Also, the order in which the processes are executed may be changed, or a plurality of processes may be executed in parallel. Also, the encoding / decoding device may include the encoding device 100 and the decoding device 200.

[0449] As described above, the aspects of the encoding device 100 and the decoding device 200 have been described based on a plurality of examples, but the aspects of the encoding device 100 and the decoding device 200 are not limited to these examples. Without departing from the spirit of the present disclosure, various modifications conceived by those skilled in the art applied to each example, or forms constructed by combining components in different examples may also be included within the scope of the aspects of the encoding device 100 and the decoding device 200.

[0450] One or more aspects disclosed herein may be implemented in combination with at least a part of other aspects in the present disclosure. Also, a part of the processes described in the flowchart of one or more aspects disclosed herein, a part of the configuration of the device, a part of the syntax, etc. may be implemented in combination with other aspects.

[0451] [Implementation and Application] In each of the above embodiments, each of the functional or operative blocks can generally be realized by an MPU (micro processing unit), a memory, or the like. Further, the processing by each of the functional blocks may be realized as a program execution unit such as a processor that reads and executes software (program) recorded on a recording medium such as a ROM. The software may be distributed. The software may be recorded on various recording media such as a semiconductor memory. Note that each functional block can also be realized by hardware (a dedicated circuit). Various combinations of hardware and software can be adopted.

[0452] The processing described in each embodiment may be realized by centralized processing using a single device (system), or may be realized by distributed processing using a plurality of devices. Further, the processor that executes the above program may be singular or plural. That is, centralized processing or distributed processing may be performed.

[0453] Aspects of the present disclosure are not limited to the above embodiments, and various modifications are possible, and these are also included within the scope of the aspects of the present disclosure.

[0454] Furthermore, here, application examples of the moving image encoding method (image encoding method) or the moving image decoding method (image decoding method) shown in each of the above embodiments, and various systems for implementing the application examples will be described. Such a system may be characterized by having an image encoding device using an image encoding method, an image decoding device using an image decoding method, or an image encoding / decoding device including both. Other configurations of such a system can be appropriately changed as the case may be.

[0455] [Usage Example] FIG. 54 is a diagram showing the overall configuration of a suitable content supply system ex100 for realizing a content distribution service. The communication service providing area is divided into a desired size, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed radio stations in the illustrated example, are installed in each cell.

[0456] In this content supply system ex100, devices such as a computer ex111, a game machine ex112, a camera ex113, home appliances ex114, and a smartphone ex115 are connected to the Internet ex101 via an Internet service provider ex102 or a communication network ex104 and base stations ex106 to ex110. The content supply system ex100 may be connected by combining any of the above devices. In various embodiments, the devices may be directly or indirectly connected to each other via a telephone network or short-range wireless communication without passing through base stations ex106 to ex110. Further, the streaming server ex103 may be connected to devices such as a computer ex111, a game machine ex112, a camera ex113, home appliances ex114, and a smartphone ex115 via the Internet ex101 or the like. Also, the streaming server ex103 may be connected to terminals within a hotspot in an airplane ex117 via a satellite ex116.

[0457] Note that a wireless access point or a hotspot or the like may be used instead of base stations ex106 to ex110. Also, the streaming server ex103 may be directly connected to the communication network ex104 without passing through the Internet ex101 or the Internet service provider ex102, or may be directly connected to the airplane ex117 without passing through the satellite ex116.

[0458] The camera ex113 is a device capable of still image shooting and video shooting such as a digital camera. Also, the smartphone ex115 is a smartphone device, a mobile phone, or a PHS (Personal Handy-phone System) etc. corresponding to the mobile communication system methods called 2G, 3G, 3.9G, 4G, and in the future 5G.

[0459] The home appliance ex114 is a device included in a refrigerator or a household fuel cell cogeneration system etc.

[0460] In the content supply system ex100, by connecting a terminal having a shooting function to the streaming server ex103 through the base station ex106 etc., live distribution etc. becomes possible. In live distribution, the terminal (computer ex111, game machine ex112, camera ex113, home appliance ex114, smartphone ex115, and the terminal etc. in the airplane ex117 etc.) may perform the encoding process described in each of the above embodiments on the still image or video content shot by the user using the terminal, may multiplex the video data obtained by encoding and the audio data obtained by encoding the sound corresponding to the video, and may transmit the obtained data to the streaming server ex103. That is, each terminal functions as an image encoding device according to one aspect of the present disclosure.

[0461] On the other hand, the streaming server ex103 stream-distributes the content data transmitted to the requested client. The client is a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, or a terminal etc. in the airplane ex117 etc. that can decode the encoded data. Each device that has received the distributed data may decode and reproduce the received data. That is, each device may function as an image decoding device according to one aspect of the present disclosure.

[0462] [Distributed Processing] Moreover, the streaming server ex103 may be a plurality of servers or a plurality of computers that distribute, process, and record data. For example, the streaming server ex103 may be implemented by a CDN (Content Delivery Network), and content delivery may be realized by a network connecting a large number of edge servers distributed around the world and between the edge servers. In a CDN, a physically closer edge server can be dynamically assigned according to the client. Then, by caching and delivering the content to the edge server, the delay can be reduced. Also, when several types of errors occur or the communication state changes due to an increase in traffic, etc., the processing can be distributed among multiple edge servers, the delivery entity can be switched to another edge server, or the part of the network with a failure can be bypassed to continue the delivery, so high-speed and stable delivery can be realized.

[0463] Moreover, not only the distributed processing of the delivery itself, but also the encoding process of the captured data may be performed on each terminal, on the server side, or shared between them. As an example, generally in the encoding process, the processing loop is performed twice. In the first loop, the complexity of the image in units of frames or scenes, or the amount of code is detected. Also, in the second loop, a process to improve the encoding efficiency while maintaining the image quality is performed. For example, by having the terminal perform the first encoding process and the server side that receives the content perform the second encoding process, it is possible to improve the quality and efficiency of the content while reducing the processing load on each terminal. In this case, if there is a request to receive and decode in almost real time, the already encoded data from the first encoding performed by the terminal can also be received and played back by other terminals, so more flexible real-time delivery is also possible.

[0464] As another example, cameras such as camera ex113 extract feature amounts (amounts of features or characteristics) from images, compress data related to the feature amounts as metadata, and transmit the compressed data to a server. The server performs compression according to the meaning (or importance of content) of the image, such as determining the importance of an object from the feature amounts and switching the quantization accuracy. The feature amount data is particularly effective in improving the accuracy and efficiency of motion vector prediction during re-compression at the server. Also, simple encoding such as VLC (Variable Length Coding) may be performed at the terminal, and encoding with a large processing load such as CABAC (Context Adaptive Binary Arithmetic Coding) may be performed at the server.

[0465] As yet another example, in a stadium, a shopping mall, a factory, etc., there may be a plurality of video data in which substantially the same scene is photographed by a plurality of terminals. In this case, using the plurality of terminals that performed the shooting, and other terminals and a server that did not perform the shooting as necessary, encoding processes are respectively assigned and distributed, for example, in units of GOP (Group of Picture), in units of pictures, or in units of tiles obtained by dividing a picture. This can reduce the delay and realize higher real-time performance.

[0466] Since the plurality of video data are of substantially the same scene, the server may manage and / or give instructions so that the video data photographed by each terminal can refer to each other. Also, the server may receive the encoded data from each terminal, change the reference relationship among the plurality of data, or correct or replace the picture itself and re-encode it. This can generate a stream with improved quality and efficiency for each piece of data.

[0467] Furthermore, the server may perform transcoding to change the encoding method of the video data and then distribute the video data. For example, the server may convert an MPEG-based encoding method to a VP-based method (e.g., VP9), or convert H.264 to H.265, etc.

[0468] Thus, the encoding process can be performed by a terminal or one or more servers. Therefore, hereinafter, descriptions such as "server" or "terminal" will be used as the entity performing the process, but part or all of the processes performed by the server may be performed by the terminal, or part or all of the processes performed by the terminal may be performed by the server. Also, regarding these, the same applies to the decoding process.

[0469] [3D, Multi-angle] There is an increasing trend to integrate and utilize different scenes captured by a plurality of cameras ex113 and / or terminals such as smartphones ex115 that are substantially synchronized with each other, or images or videos of the same scene captured from different angles. The videos captured by each terminal can be integrated based on the relative positional relationship between the terminals obtained separately, or the regions where the feature points included in the videos match.

[0470] The server may not only encode a two-dimensional moving image, but also automatically encode a still image based on scene analysis of the moving image or at a time specified by the user, and transmit it to the receiving terminal. If the server can further obtain the relative positional relationship between the shooting terminals, based on not only the two-dimensional moving image but also the videos of the same scene captured from different angles, it can generate the three-dimensional shape of the scene. The server may separately encode the three-dimensional data generated by a point cloud or the like, or based on the results of recognizing or tracking a person or an object using the three-dimensional data, select or reconstruct the video to be transmitted to the receiving terminal from the videos captured by a plurality of terminals.

[0471] In this way, the user can arbitrarily select each video corresponding to each shooting terminal to enjoy the scene, or can enjoy the content obtained by cutting out the video of the selected viewpoint from the three-dimensional data reconstructed using a plurality of images or videos. Furthermore, sounds are also collected from a plurality of different angles together with the video, and the server may multiplex the sound from a specific angle or space with the corresponding video and transmit the multiplexed video and sound.

[0472] In recent years, content that associates the real world with the virtual world, such as Virtual Reality (VR) and Augmented Reality (AR), has also become popular. In the case of VR images, the server may create viewpoint images for the right eye and the left eye respectively, and perform encoding that allows references between each viewpoint video by means of Multi-View Coding (MVC) or the like, or may perform encoding as separate streams without referring to each other. At the time of decoding the separate streams, they may be reproduced in synchronization with each other so that a virtual three-dimensional space is reproduced according to the user's viewpoint.

[0473] In the case of AR images, the server may superimpose virtual object information in the virtual space on the camera information of the real space based on the three-dimensional position or the movement of the user's viewpoint. The decoding device may acquire or hold the virtual object information and the three-dimensional data, generate a two-dimensional image according to the movement of the user's viewpoint, and create superimposed data by smoothly connecting them. Alternatively, the decoding device may transmit the movement of the user's viewpoint to the server in addition to the request for the virtual object information. The server may create superimposed data in accordance with the movement of the viewpoint received from the three-dimensional data held by the server, encode the superimposed data, and distribute it to the decoding device. Note that the superimposed data typically has an α value indicating transparency in addition to RGB, and the server may encode it with the α value of the portion other than the object created from the three-dimensional data set to 0 or the like so that the portion is in a transparent state. Or, the server may set the RGB value of a predetermined value like chroma key as the background, and generate data with the portion other than the object being the background color. The RGB value of the predetermined value may be predetermined.

[0474] The decoding process of the data delivered in the same way may be performed on the client side (for example, a terminal), on the server side, or they may be shared between each other. As an example, a certain terminal may once send a reception request to the server, and the content corresponding to the request may be received by another terminal and decoded, and the decoded signal may be transmitted to a device having a display. By dispersing the processing regardless of the performance of the communicable terminals themselves and selecting appropriate content, it is possible to reproduce high-quality data. As another example, while receiving large-size image data on a TV or the like, a part of the area such as a tile in which a picture is divided may be decoded and displayed on the personal terminal of the viewer. Thereby, while sharing the overall image, it is possible to check at hand the area of one's own field of responsibility or the area that one wants to check in more detail.

[0475] In a situation where multiple short-range, medium-range, or long-range wireless communications inside and outside the house can be used, it may be possible to receive content seamlessly using a delivery system standard such as MPEG-DASH. The user may freely select a decoding device or a display device such as the user's terminal or a display arranged inside and outside the house and switch in real time. Also, using the user's own location information or the like, decoding can be performed while switching the terminal to be decoded and the terminal to be displayed. Thereby, while the user is moving to the destination, it becomes possible to map and display information on a part of the wall surface or the ground of the adjacent building in which a displayable device is embedded. Also, based on the ease of access to the encoded data on the network, such as the encoded data being cached in a server that can be accessed from the receiving terminal in a short time, or being copied to an edge server in a content delivery service, it is also possible to switch the bit rate of the received data.

[0476] [Scalable Encoding] Regarding content switching, an explanation will be given using a scalable stream that is compression-encoded by applying the moving image encoding method shown in each of the above embodiments, as shown in FIG. 55. The server may have a plurality of streams with the same content but different qualities as individual streams, but it may also be configured to switch content by taking advantage of the characteristics of a temporally / spatially scalable stream realized by encoding in layers as shown in the figure. That is, by determining which layer to decode according to internal factors such as performance and external factors such as the state of the communication bandwidth on the decoding side, the decoding side can freely switch between low-resolution content and high-resolution content for decoding. For example, when a user wants to watch the continuation of a video that was being viewed on a smartphone ex115 while moving on a device such as an Internet TV after returning home, the device only needs to decode the same stream to a different layer, thus reducing the burden on the server side.

[0477] Furthermore, as described above, pictures are encoded for each layer. In addition to the configuration where scalability is realized in the enhancement layer above the base layer, the enhancement layer may include meta information based on statistical information of the image, etc. The decoding side may generate high-quality content by super-resolving the picture of the base layer based on the meta information. The super-resolution may improve the signal-to-noise ratio while maintaining and / or enlarging the resolution. The meta information includes information for specifying linear or non-linear filter coefficients for use in super-resolution processing, or information for specifying parameter values in filter processing, machine learning, or least-squares operation used in super-resolution processing.

[0478] Alternatively, a configuration may be provided in which a picture is divided into tiles or the like according to the meaning of an object or the like in the image. The decoding side decodes only a part of the area by selecting the tile to be decoded. Further, by storing the attributes of the object (such as a person, a car, a ball, etc.) and the position in the video (such as the coordinate position in the same image) as meta information, the decoding side can specify the position of the desired object based on the meta information and determine the tile including the object. For example, as shown in FIG. 56, the meta information may be stored using a data storage structure different from the pixel data, such as an SEI (supplemental enhancement information) message in HEVC. This meta information indicates, for example, the position, size, or color of the main object.

[0479] The meta information may be stored in a unit composed of a plurality of pictures, such as a stream, a sequence, or a random access unit. The decoding side can obtain the time when a specific person appears in the video, and by combining the picture unit information and the time information, can specify the picture in which the object exists and determine the position of the object in the picture.

[0480] [Optimization of Web Page] FIG. 57 is a diagram showing an example of a display screen of a web page on a computer ex111 or the like. FIG. 58 is a diagram showing an example of a display screen of a web page on a smartphone ex115 or the like. As shown in FIGS. 57 and 58, a web page may include a plurality of link images that are links to image contents, and the appearance may be different depending on the device for viewing. When a plurality of link images are visible on the screen, until the user explicitly selects a link image, or until the link image approaches the vicinity of the center of the screen or the entire link image enters the screen, the display device (decoding device) may display a still image or an I picture that each content has as a link image, or may display a video like a gif animation with a plurality of still images or I pictures, etc., or may receive only the base layer, decode and display the video.

[0481] When a user selects a linked image, the display device performs decoding, for example, with the base layer having the highest priority. If there is information indicating that the HTML constituting the web page is scalable content, the display device may decode up to the enhancement layer. Further, in order to ensure real-time performance, before selection or when the communication bandwidth is very strict, the display device can reduce the delay between the decoding time and the display time of the leading picture (the delay from the start of content decoding to the start of display) by decoding and displaying only forward-reference pictures (I pictures, P pictures, B pictures with only forward reference). Furthermore, the display device may deliberately ignore the reference relationship of pictures, roughly decode all B pictures and P pictures with forward reference, and perform normal decoding as the received pictures increase over time.

[0482] [Autonomous Driving] Also, when transmitting and receiving still image or video data such as two-dimensional or three-dimensional map information for the autonomous driving or driving support of a vehicle, in addition to the image data belonging to one or more layers, the receiving terminal may also receive weather or construction information, etc. as meta information, and decode them in association with each other. Note that the meta information may belong to a layer or may simply be multiplexed with the image data.

[0483] In this case, since vehicles, drones, airplanes, etc. including the receiving terminal move, the receiving terminal can realize seamless reception and decoding by transmitting the position information of the receiving terminal while switching between base stations ex106 to ex110. Also, the receiving terminal can dynamically switch how much meta information to receive or how much to update the map information according to the user's selection, the user's situation, and / or the state of the communication bandwidth.

[0484] In the content supply system ex100, the client can receive, decode, and play back the encoded information transmitted by the user in real time.

[0485] [Distribution of Personal Content] In addition, in the content supply system ex100, not only high-quality and long-duration content by video distributors but also unicast or multicast distribution of low-quality and short-duration content by individuals is possible. It is considered that such individual content will continue to increase in the future. In order to make individual content into better content, the server may perform encoding processing after performing editing processing. This can be realized, for example, using the following configuration.

[0486] At the time of shooting in real time or accumulating and after shooting, the server performs recognition processing such as shooting error, scene search, semantic analysis, and object detection from the original image data or encoded data. Then, based on the recognition result, the server manually or automatically corrects out-of-focus or camera shake, deletes less important scenes such as scenes with lower brightness or out-of-focus compared to other pictures, emphasizes the edges of objects, or changes the color tone. The server encodes the edited data based on the editing result. It is also known that the viewing rate decreases if the shooting time is too long. The server may automatically clip not only less important scenes but also scenes with little movement within a specific time range according to the shooting time so as to be content within that range, based on the image processing result. Alternatively, the server may generate a digest based on the result of semantic analysis of the scene and encode it.

[0487] Personal content may contain elements that, as they are, would constitute infringement of copyright, moral rights of the author, or the right of portrait, etc., and there may be inconvenient situations for individuals, such as the sharing scope exceeding the intended scope. Therefore, for example, the server may deliberately change the image to an unfocused one, such as the face of a person in the peripheral part of the screen or the inside of a house, and then encode it. Furthermore, the server may recognize whether a face of a person different from the pre-registered person is reflected in the image to be encoded, and if so, perform processing such as applying a mosaic to the face part. Alternatively, as pre-processing or post-processing of encoding, the user may specify a person or a background area that the user wants to process the image from the perspective of copyright, etc. The server may perform processing such as replacing the specified area with another video or blurring the focus. In the case of a person, in a moving image, the person can be tracked and the video of the face part of the person can be replaced.

[0488] Since the viewing of personal content with a small data volume has a strong requirement for real-time performance, depending on the bandwidth, the decoding device may first receive the base layer with the highest priority and perform decoding and playback. During this period, the decoding device may receive the enhancement layer and, when the playback is looped or played more than twice, play a high-quality video including the enhancement layer. For a stream with scalable encoding like this, the video is rough when not selected or at the beginning of viewing, but it can provide an experience where the stream gradually becomes smarter and the image quality improves. In addition to scalable encoding, a similar experience can be provided even if a rough stream played for the first time and a second stream encoded with reference to the first video are configured as one stream.

[0489] [Other implementation and application examples] Also, these encoding or decoding processes are generally processed in the LSIex500 that each terminal has. The LSI (large scale integration circuitry)ex500 (see FIG. 54) may be a one-chip configuration or a configuration consisting of multiple chips. Note that software for moving image encoding or decoding may be incorporated into some recording medium (such as a CD-ROM, a flexible disk, or a hard disk) readable by a computer ex111 or the like, and encoding or decoding processes may be performed using the software. Further, when the smartphone ex115 has a camera, video data acquired by the camera may be transmitted. The video data at this time may be data encoded by the LSIex500 that the smartphone ex115 has.

[0490] Note that the LSIex500 may be configured to download and activate application software. In this case, the terminal first determines whether the terminal supports the encoding method of the content or has the ability to execute a specific service. If the terminal does not support the encoding method of the content or does not have the ability to execute a specific service, the terminal may download a codec or application software and then acquire and play the content.

[0491] Also, not limited to the content supply system ex100 via the Internet ex101, at least either a moving image encoding device (image encoding device) or a moving image decoding device (image decoding device) of the above-described embodiments can be incorporated into a digital broadcast system. In order to transmit and receive multiplexed data in which video and audio are multiplexed on a broadcast radio wave using a satellite or the like, there is a difference in that it is more suitable for multicast compared to the unicast-oriented configuration of the content supply system ex100, but similar applications are possible for encoding and decoding processes.

[0492] [Hardware Configuration] FIG. 59 is a diagram showing further details of the smartphone ex115 shown in FIG. 54. FIG. 60 is a diagram showing a configuration example of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of capturing video and still images, and a display unit ex458 for displaying data obtained by decoding video captured by the camera unit ex465, video received by the antenna ex450, and the like. The smartphone ex115 further includes an operation unit ex466 such as a touch panel, an audio output unit ex457 such as a speaker for outputting audio or sound, an audio input unit ex456 such as a microphone for inputting audio, a memory unit ex467 capable of storing captured video or still images, recorded audio, received video or still images, encoded data such as emails, or decoded data, and a slot unit ex464 which is an interface unit with the SIM ex468 for identifying the user and authenticating access to various data including the network. Note that an external memory may be used instead of the memory unit ex467.

[0493] A main control unit ex460 capable of comprehensively controlling the display unit ex458, the operation unit ex466, and the like, a power supply circuit unit ex461, an operation input control unit ex462, a video signal processing unit ex455, a camera interface unit ex463, a display control unit ex459, a modulation / demodulation unit ex452, a multiplexing / demultiplexing unit ex453, an audio signal processing unit ex454, a slot unit ex464, and a memory unit ex467 are connected via a synchronization bus ex470.

[0494] When the power key is turned on by the user's operation, the power supply circuit unit ex461 activates the smartphone ex115 to an operable state and supplies power to each unit from the battery pack.

[0495] The smartphone ex115 performs processes such as calls and data communications based on the control of the main control unit ex460 having a CPU, ROM, RAM, etc. During a call, the voice signal picked up by the voice input unit ex456 is converted into a digital voice signal by the voice signal processing unit ex454, subjected to spread spectrum processing by the modulation / demodulation unit ex452, and subjected to digital-to-analog conversion processing and frequency conversion processing by the transmission / reception unit ex451, and the resulting signal is transmitted via the antenna ex450. Also, received data is amplified and subjected to frequency conversion processing and analog-to-digital conversion processing, subjected to inverse spread spectrum processing by the modulation / demodulation unit ex452, converted into an analog voice signal by the voice signal processing unit ex454, and then output from the voice output unit ex457. In the data communication mode, text, still images, or video data can be sent under the control of the main control unit ex460 via the operation input control unit ex462 based on operations of the operation unit ex466 of the main body unit or the like. Similar transmission and reception processes are performed. When transmitting video, still images, or video and audio in the data communication mode, the video signal processing unit ex455 compresses and encodes the video signal stored in the memory unit ex467 or the video signal input from the camera unit ex465 by the moving image encoding method shown in each of the above embodiments, and sends the encoded video data to the multiplexing / demultiplexing unit ex453. The voice signal processing unit ex454 encodes the voice signal picked up by the voice input unit ex456 while the camera unit ex465 is capturing video or still images, and sends the encoded voice data to the multiplexing / demultiplexing unit ex453. The multiplexing / demultiplexing unit ex453 multiplexes the encoded video data and the encoded voice data in a predetermined manner, performs modulation processing and conversion processing by the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the transmission / reception unit ex451, and transmits it via the antenna ex450. The predetermined manner may be determined in advance.

[0496] When receiving a video attached to an email or chat, or a video linked to a web page, etc., in order to decode the multiplexed data received via the antenna ex450, the multiplexing / demultiplexing unit ex453 separates the multiplexed data into a bit stream of video data and a bit stream of audio data by separating the multiplexed data, supplies the encoded video data to the video signal processing unit ex455 via the synchronization bus ex470, and supplies the encoded audio data to the audio signal processing unit ex454. The video signal processing unit ex455 decodes the video signal by a video decoding method corresponding to the moving image encoding method shown in each of the above embodiments, and a video or a still image included in the linked moving image file is displayed from the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 decodes the audio signal, and audio is output from the audio output unit ex457. Since real-time streaming is becoming increasingly popular, depending on the user's situation, it may not be socially appropriate to play audio. Therefore, as an initial value, it is desirable to have a configuration that plays only video data without playing the audio signal, and the audio may be played synchronously only when the user performs an operation such as clicking on the video data.

[0497] Also, although the smartphone ex115 has been described as an example here, as the terminal, in addition to a transmission / reception type terminal having both an encoder and a decoder, other implementation forms such as a transmission terminal having only an encoder and a reception terminal having only a decoder are conceivable. In the digital broadcast system, it has been described as receiving or transmitting multiplexed data in which audio data is multiplexed with video data. However, in the multiplexed data, character data related to the video etc. may be multiplexed in addition to the audio data. Also, instead of the multiplexed data, the video data itself may be received or transmitted.

[0498] Although the main control unit ex460 including the CPU has been described as controlling the encoding or decoding process, many types of terminals are often equipped with a GPU. Therefore, a configuration may be adopted in which a memory shared by the CPU and the GPU, or a memory whose addresses are managed so that they can be commonly used, is used to take advantage of the performance of the GPU to process a wide area in a batch. This can shorten the encoding time, ensure real-time performance, and achieve low latency. In particular, it is efficient to perform processes such as motion search, deblocking filter, SAO (Sample Adaptive Offset), and transform / quantization in units such as pictures using the GPU instead of the CPU.

Industrial Applicability

[0499] The present disclosure can be applied to, for example, a television receiver, a digital video recorder, a car navigation system, a mobile phone, a digital camera, a digital video camera, a video conference system, or an electronic mirror.

Description of Signs

[0500] 100 Encoding device 102 Splitting unit 104 Subtraction unit 106 Transformation unit 108 Quantization unit 110 Entropy encoding unit 112, 204 Inverse quantization unit 114, 206 Inverse transformation unit 116, 208 Addition unit 118, 210 Block memory 120, 212 Loop filter unit 122, 214 Frame memory 124, 216 Intra prediction unit 126, 218 Inter prediction unit 128, 220 Prediction control unit 200 Decoding device 202 Entropy decoding unit 1201 Boundary determination unit 1202, 1204, 1206 Switch 1203 Filter determination unit 1205 Filter processing unit 1207 Filter characteristic determination unit 1208 Processing determination unit a1, b1 processors a2, b2 memories

Claims

1. A circuit, and a memory connected to the circuit, comprising: In operation, the circuit associates motion vector information derived from a processed block with a BCW index related to BCW (Bi-prediction with CU-level Weights) processing of a predicted image of the processed block, and stores the association in a FIFO (First In First Out) buffer for HMVP (History based Motion Vector Predictor) mode, registers one or more prediction candidates including a combination of the motion vector information and the BCW index stored in the FIFO buffer for the HMVP mode as a prediction candidate in a prediction candidate list for merge mode, when processing a block to be processed in merge mode, selects a prediction candidate from among the prediction candidates in the prediction candidate list for the merge mode, and performs correction processing on a predicted image of the block to be processed based on the BCW index of the selected prediction candidate. An encoding device.

2. A circuit, and a memory connected to the circuit, comprising: In operation, the circuit associates motion vector information derived from a processed block with a BCW index related to BCW (Bi-prediction with CU-level Weights) processing of a predicted image of the processed block, and stores the association in a FIFO (First In First Out) buffer for HMVP (History based Motion Vector Predictor) mode, registers one or more prediction candidates including a combination of the motion vector information and the BCW index stored in the FIFO buffer for the HMVP mode as a prediction candidate in a prediction candidate list for merge mode, when processing a block to be processed in merge mode, selects a prediction candidate from among the prediction candidates in the prediction candidate list for the merge mode, and performs correction processing on a predicted image of the block to be processed based on the BCW index of the selected prediction candidate. A decoding device.

3. A circuit, and a memory connected to the circuit, comprising: In operation, the circuit Associate the motion vector information derived from the processed block with the BCW index related to the BCW (Bi-prediction with CU-level Weights) processing of the predicted image of the processed block, and store them in a FIFO (First In First Out) buffer for the HMVP (History based Motion Vector Predictor) mode. Register one or more prediction candidates including the combination of the motion vector information and the BCW index stored in the FIFO buffer for the HMVP mode as prediction candidates in the prediction candidate list for the merge mode. When processing the block to be processed in the merge mode, select a prediction candidate from the prediction candidate list for the merge mode, and perform correction processing on the predicted image of the block to be processed based on the BCW index of the selected prediction candidate. Encode the block to be processed using the predicted image after the correction processing. Generate a bitstream including the encoded block to be processed. Transmit the generated bitstream. Transmitting device.

Images