Encoder, encoding method, decoder, and decoding method

Abstract

To reduce processing delay.SOLUTION: An encoder is configured to: in inter prediction processing, derive a first motion vector of a first current block to be processed, using a motion vector of a previous block which has been previously processed; derive a second motion vector of the first current block to be processed by performing motion search in the vicinity of the first motion vector; generate a prediction image of the first current block to be processed by performing motion compensation using the second motion vector; derive a third motion vector of a second current block, which is a block to be processed subsequent to the first current block to be procerssed, using the first motion vector; derive a fourth motion vector of the second current block to be processed by performing motion search in the vicinity of the third motion vector; and generate a prediction image of the second current block to be processed by performing motion compensation using the fourth motion vector.SELECTED DRAWING: Figure 15

Description

[Technical field]

[0001] The present disclosure relates to an encoding device, a decoding device, an encoding method, and a decoding method. [Background technology]

[0002] Conventionally, H.265 exists as a standard for encoding moving images. H.265 is also called High Efficiency Video Coding (HEVC). [Prior art documents] [Non-patent literature]

[0003] [Non-Patent Document 1] H.265(ISO / IEC 23008-2 HEVC(High Efficiency Video Coding)) Summary of the Invention [Problem to be solved by the invention]

[0004] In such encoding and decoding methods, it is desirable to be able to suppress processing delays.

[0005] An object of the present disclosure is to provide a decoding device, an encoding device, a decoding method, or an encoding method that can suppress processing delays. [Means for solving the problem]

[0006] An encoding device according to an aspect of the present disclosure includes a circuit and a memory, and the circuit, using the memory, in an inter prediction process, derives a first motion vector of a first processing target block using a motion vector of a past processing target block, derives a second motion vector of the first processing target block by performing a motion search process on a peripheral area of ​​the first motion vector, including searching for a position having a lowest evaluation value in a peripheral area of ​​the first motion vector, derives a second motion vector of the first processing target block, generates a predicted image of the first processing target block by motion compensation using the second motion vector, and generates a predicted image of a second processing target block that is a processing target block subsequent to the first processing block. and, when the second block to be processed belongs to a picture different from that of the first block to be processed, deriving a third motion vector of the second block to be processed using the first motion vector of the first block to be processed. When the second block to be processed belongs to a picture different from that of the first block to be processed, deriving a third motion vector of the second block to be processed using the second motion vector of the first block to be processed, performing a motion search process on a peripheral area of ​​the third motion vector to derive a fourth motion vector of the second block to be processed, and generating a predicted image of the second block to be processed by motion compensation using the fourth motion vector.

[0007] In addition, these comprehensive or specific aspects may be realized 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 realized by any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium. Effect of the Invention

[0008] The present disclosure can provide a decoding device, an encoding device, a decoding method, or an encoding method that can suppress processing delays. [Brief description of the drawings]

[0009] [Figure 1]FIG. 1 is a block diagram showing a functional configuration of a coding device according to the first embodiment. [Diagram 2] FIG. 2 is a diagram showing an example of block division according to the first embodiment. [Diagram 3] FIG. 3 is a table showing the transform basis functions corresponding to each transform type. [Figure 4A] FIG. 4A is a diagram showing an example of the shape of a filter used in ALF. [Figure 4B] FIG. 4B is a diagram showing another example of the shape of the filter used in the ALF. [Figure 4C] FIG. 4C is a diagram showing another example of the shape of the filter used in the ALF. [Figure 5A] FIG. 5A is a diagram showing 67 intra prediction modes in intra prediction. [Figure 5B] FIG. 5B is a flowchart for explaining an outline of the predicted image correction process by the OBMC process. [Figure 5C] FIG. 5C is a conceptual diagram for explaining an overview of the predicted image correction process by the OBMC process. [Figure 5D] FIG. 5D is a diagram showing an example of FRUC. [Figure 6] FIG. 6 is a diagram for explaining pattern matching (bilateral matching) between two blocks along a motion trajectory. [Figure 7] FIG. 7 is a diagram for explaining pattern matching (template matching) between a template in a current picture and a block in a reference picture. [Figure 8] FIG. 8 is a diagram for explaining a model assuming uniform linear motion. [Figure 9A] FIG. 9A is a diagram for explaining derivation of a motion vector for each sub-block based on motion vectors of a plurality of adjacent blocks. [Figure 9B] FIG. 9B is a diagram for explaining an overview of the motion vector derivation process in the merge mode. [Figure 9C]FIG. 9C is a conceptual diagram for explaining an overview of the DMVR process. [Figure 9D] FIG. 9D is a diagram for explaining an outline of a predicted image generating method using luminance correction processing by LIC processing. [Figure 10] FIG. 10 is a block diagram showing a functional configuration of a decoding device according to the first embodiment. As shown in FIG. [Figure 11] FIG. 11 is a schematic diagram showing a first example of a pipeline structure according to the first embodiment. [Figure 12] FIG. 12 is a schematic diagram showing an example of block division used to explain the pipeline processing according to the first embodiment. [Figure 13] FIG. 13 is a time chart showing an example of processing timing in the first example of the pipeline structure according to the first embodiment. [Figure 14] FIG. 14 is a flowchart of an inter prediction process in a first example of a pipeline configuration according to the first embodiment. [Figure 15] FIG. 15 is a schematic diagram showing a second example of a pipeline structure according to the first embodiment. [Figure 16] FIG. 16 is a time chart showing an example of processing timing in the second example of the pipeline structure according to the first embodiment. [Figure 17] FIG. 17 is a flowchart of an inter prediction process in the second example of the pipeline configuration according to the first embodiment. [Figure 18] FIG. 18 is a schematic diagram showing a third example of a pipeline structure according to the first embodiment. [Figure 19] FIG. 19 is a time chart showing an example of processing timing in the third example of the pipeline structure according to the first embodiment. [Figure 20] FIG. 20 is a flowchart of an inter prediction process in the third example of the pipeline configuration according to the first embodiment. [Figure 21] FIG. 21 is a diagram showing an example of a motion vector to be referred to according to the first embodiment. [Figure 22]FIG. 22 is a diagram showing an example of a motion vector to be referred to according to the first embodiment. [Figure 23] FIG. 23 is a block diagram showing an example of implementation of the encoding device. [Figure 24] FIG. 24 is a block diagram showing an implementation example of a decoding device. [Diagram 25] FIG. 25 is a diagram showing the overall configuration of a content supply system that realizes a content distribution service. [Figure 26] FIG. 26 is a diagram showing an example of a coding structure in scalable coding. [Figure 27] FIG. 27 is a diagram showing an example of a coding structure in scalable coding. [Figure 28] FIG. 28 is a diagram showing an example of a display screen of a web page. [Figure 29] FIG. 29 is a diagram showing an example of a display screen of a web page. [Diagram 30] FIG. 30 is a diagram illustrating an example of a smartphone. [Diagram 31] FIG. 31 is a block diagram showing an example of the configuration of a smartphone. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0010] An encoding device according to one embodiment of the present disclosure includes a circuit and a memory, and when encoding a target block in an inter prediction mode in which motion search is performed in a decoding device, the circuit uses the memory to derive a first motion vector for the target block, store the derived first motion vector in the memory, derive a second motion vector for the target block, and generate a predicted image of the target block by motion compensation using the second motion vector, and in deriving the first motion vector, derives the first motion vector for the target block using a first motion vector of a processed block.

[0011] According to this, in the pipeline control, the decoding device can start deriving the first motion vector of the target block after completing the derivation of the first motion vector of the peripheral block, without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared to the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device can be reduced, and the processing delay can be reduced.

[0012] For example, in deriving the first motion vector, (i) a predicted motion vector list indicating a plurality of predicted motion vectors is generated using the first motion vector of the processed block, and (ii) the first motion vector of the target block may be determined from the plurality of predicted motion vectors indicated in the predicted motion vector list.

[0013] For example, the inter prediction mode for performing motion search in the decoding device may be a merge mode, and the second motion vector may be derived by performing a motion search process on a periphery of the first motion vector.

[0014] For example, the inter prediction mode in which motion search is performed in the decoding device may be FRUC mode, and the second motion vector may be derived by performing a motion search process on a periphery of the first motion vector.

[0015] For example, the inter prediction mode in which motion search is performed in the decoding device is FRUC mode, and in deriving the second motion vector, (i) a third motion vector may be determined from the multiple predicted motion vectors indicated in the predicted motion vector list, and (ii) the second motion vector may be derived by performing a motion search process around the third motion vector.

[0016] For example, in determining the first motion vector, the first motion vector may be derived based on an average value or a median value for each prediction direction of the plurality of predicted motion vectors indicated in the predicted motion vector list.

[0017] For example, in determining the first motion vector, the predictor motion vector indicated at the top of the predictor motion vector list among the plurality of predictor motion vectors indicated in the predictor motion vector list may be determined as the first motion vector.

[0018] For example, in generating the predictor motion vector list, each of the multiple predictor motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and in determining the first motion vector, the first motion vector may be determined from a predictor motion vector candidate derived using the second motion vector among the multiple predictor motion vectors indicated in the predictor motion vector list.

[0019] According to this, the encoding device can determine the first motion vector using the highly reliable second motion vector, and therefore can suppress a decrease in the reliability of the first motion vector.

[0020] For example, in generating the predictive motion vector list, each of the multiple predictive motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and if the processed block belongs to the same picture as the target block, a predictive motion vector may be derived using the first motion vector of the processed block, and if the processed block belongs to a different picture from the target block, a predictive motion vector may be derived using the second motion vector of the processed block.

[0021] With this, when the processed block belongs to a different picture from the current block, the encoding device can improve the reliability of the predicted motion vector by using the second motion vector.

[0022] For example, in generating the predicted motion vector list, each of the multiple predicted motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and depending on the position of the processed block relative to the target block, it may be determined whether to use the first motion vector of the processed block or the second motion vector of the processed block to derive the predicted motion vector.

[0023] For example, in generating the predictive motion vector list, for a processed block that is N blocks before the target block in processing order and a processed block that is after the N blocks before the target block in processing order, among a plurality of processed blocks that belong to the same picture as the target block, the predictive motion vector may be derived using a first motion vector of the processed block, and for a processed block that is before the N blocks before the target block in processing order, the predictive motion vector may be derived using a second motion vector of the processed block.

[0024] With this, the encoding device can improve the reliability of the predicted motion vector by using the second motion vector for a processed block that precedes the Nth processed block in processing order.

[0025] For example, N may be 1.

[0026] For example, the first motion vector may be referred to in processes other than the derivation of the predicted motion vector.

[0027] For example, the other processing may be a loop filter processing.

[0028] For example, the second motion vector may be used in the loop filter process.

[0029] For example, when the current block is encoded in a low latency mode, the first motion vector may be derived by using a first motion vector of the processed block.

[0030] This allows the encoding device to perform appropriate processing depending on whether or not the low delay mode is used.

[0031] For example, information indicating whether or not the current block is to be coded in the low latency mode may be coded in a sequence header area, a picture header area, a slice header area, or an auxiliary information area.

[0032] For example, whether or not to encode the target block in the low latency mode may be switched depending on the size of the target picture including the target block.

[0033] For example, whether or not to encode the current block in the low delay mode may be switched depending on the processing capability of the decoding device.

[0034] For example, whether or not to encode the current block in the low delay mode may be switched depending on profile or level information assigned to the current stream.

[0035] A decoding device according to one embodiment of the present disclosure is a decoding device comprising a circuit and a memory, wherein the circuit uses the memory to derive a first motion vector for the target block when decoding a target block in an inter prediction mode in which motion search is performed in the decoding device, store the derived first motion vector in the memory, derive a second motion vector for the target block, and generate a predicted image of the target block by motion compensation using the second motion vector, and in deriving the first motion vector, derives the first motion vector for the target block using a first motion vector of a processed block.

[0036] According to this, in the pipeline control, the decoding device can start deriving the first motion vector of the target block after completing the derivation of the first motion vector of the peripheral block, without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared to the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device can be reduced, and the processing delay can be reduced.

[0037] For example, in deriving the first motion vector, (i) a predicted motion vector list indicating a plurality of predicted motion vectors is generated using the first motion vector of the processed block, and (ii) the first motion vector of the target block may be determined from the plurality of predicted motion vectors indicated in the predicted motion vector list.

[0038] For example, the inter prediction mode for performing motion search in the decoding device may be a merge mode, and the second motion vector may be derived by performing a motion search process on a periphery of the first motion vector.

[0039] For example, the inter prediction mode in which motion search is performed in the decoding device may be FRUC mode, and the second motion vector may be derived by performing a motion search process on a periphery of the first motion vector.

[0040] For example, the inter prediction mode in which motion search is performed in the decoding device is FRUC mode, and in deriving the second motion vector, (i) a third motion vector may be determined from the multiple predicted motion vectors indicated in the predicted motion vector list, and (ii) the second motion vector may be derived by performing a motion search process around the third motion vector.

[0041] For example, in determining the first motion vector, the first motion vector may be derived based on an average value or a median value for each prediction direction of the plurality of predicted motion vectors indicated in the predicted motion vector list.

[0042] For example, in determining the first motion vector, the predictor motion vector indicated at the top of the predictor motion vector list among the plurality of predictor motion vectors indicated in the predictor motion vector list may be determined as the first motion vector.

[0043] For example, in generating the predictor motion vector list, each of the multiple predictor motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and in determining the first motion vector, the first motion vector may be determined from a predictor motion vector candidate derived using the second motion vector among the multiple predictor motion vectors indicated in the predictor motion vector list.

[0044] According to this, the decoding device can determine the first motion vector using the highly reliable second motion vector, and therefore can suppress a decrease in the reliability of the first motion vector.

[0045] For example, in generating the predictive motion vector list, each of the multiple predictive motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and if the processed block belongs to the same picture as the target block, a predictive motion vector may be derived using the first motion vector of the processed block, and if the processed block belongs to a different picture from the target block, a predictive motion vector may be derived using the second motion vector of the processed block.

[0046] With this, when the processed block belongs to a different picture from the current block, the decoding device can improve the reliability of the predicted motion vector by using the second motion vector.

[0047] For example, in generating the predicted motion vector list, each of the multiple predicted motion vectors may be derived using a first motion vector or a second motion vector of the processed block, and depending on the position of the processed block relative to the target block, it may be determined whether to use the first motion vector of the processed block or the second motion vector of the processed block to derive the predicted motion vector.

[0048] For example, in generating the predictive motion vector list, for a processed block that is N blocks before the target block in processing order and a processed block that is after the N blocks before the target block in processing order, among a plurality of processed blocks that belong to the same picture as the target block, the predictive motion vector may be derived using a first motion vector of the processed block, and for a processed block that is before the N blocks before the target block in processing order, the predictive motion vector may be derived using a second motion vector of the processed block.

[0049] With this, the decoding device can improve the reliability of the predicted motion vector by using the second motion vector for a processed block that precedes the Nth processed block in the processing order.

[0050] For example, N may be 1.

[0051] For example, the first motion vector may be referred to in processes other than the derivation of the predicted motion vector.

[0052] For example, the other processing may be a loop filter processing.

[0053] For example, the second motion vector may be used in the loop filter process.

[0054] For example, when the current block is decoded in a low latency mode, the first motion vector of the current block may be derived using a first motion vector of the processed block.

[0055] This allows the decoding device to perform appropriate processing depending on whether or not the low latency mode is used.

[0056] For example, information indicating whether or not to decode the target block in the low latency mode may be decoded from a sequence header area, a picture header area, a slice header area, or an auxiliary information area, and based on the information, it may be determined whether or not to decode the target block in the low latency mode.

[0057] For example, the pipeline structure of the decoding device may include a first stage that performs processing to derive the first motion vector of the target block, and a second stage separate from the first stage that performs processing to derive the second motion vector of the target block, and may start the first stage processing of the target block when the first stage processing of the block immediately preceding the target block in processing order is completed, without waiting for completion of the second stage processing of the blocks up to M blocks before the target block in processing order.

[0058] For example, the pipeline structure of the decoding device may include a first stage that performs processing to derive the first motion vector of the target block, and a second stage separate from the first stage that performs processing to derive the second motion vector of the target block, and the first stage processing of the target block may be started at the point in time when the first motion vector of the block M blocks before in processing order is derived, without waiting for completion of the second stage processing of the blocks up to M blocks before the target block in processing order.

[0059] For example, M may be 1.

[0060] An encoding method according to one embodiment of the present disclosure, when encoding a target block in an inter prediction mode in which motion search is performed in a decoding device, derives a first motion vector for the target block, stores the derived first motion vector in the memory, derives a second motion vector for the target block, and generates a predicted image of the target block by motion compensation using the second motion vector, and in deriving the first motion vector, derives the first motion vector for the target block using a first motion vector of a processed block.

[0061] According to this, in the pipeline control, the decoding device can start deriving the first motion vector of the target block after completing the derivation of the first motion vector of the peripheral block, without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared to the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device can be reduced, and the processing delay can be reduced.

[0062] A decoding method according to one embodiment of the present disclosure, when decoding a target block in an inter prediction mode in which motion search is performed in a decoding device, derives a first motion vector for the target block, stores the derived first motion vector in the memory, derives a second motion vector for the target block, and generates a predicted image of the target block by motion compensation using the second motion vector, and in deriving the first motion vector, derives the first motion vector for the target block using a first motion vector of a processed block.

[0063] According to this, in the decoding method, for example, after the derivation of the first motion vector of the peripheral block is completed, the derivation of the first motion vector of the target block can be started without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared with the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device can be reduced, and the processing delay can be reduced.

[0064] Furthermore, these comprehensive or specific aspects may be realized in 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 realized in any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.

[0065] Hereinafter, the embodiment will be described in detail with reference to the drawings.

[0066] The embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, component arrangement and connection forms, steps, and order of steps shown in the following embodiments are merely examples and are not intended to limit the scope of the claims. Furthermore, among the components in the following embodiments, components that are not described in an independent claim showing a top concept are described as optional components.

[0067] (Embodiment 1) First, an overview of the first embodiment will be described as an example of an encoding device and a decoding device to which the processes and / or configurations described in each aspect of the present disclosure can be applied. However, the first embodiment is merely an example of an encoding device and a decoding device to which the processes and / or configurations described in each aspect of the present disclosure can be applied, and the processes and / or configurations described in each aspect of the present disclosure can also be implemented in encoding devices and decoding devices different from the first embodiment.

[0068] When applying the processing and / or configurations described in each aspect of the present disclosure to the first embodiment, for example, any of the following may be performed.

[0069] (1) For the encoding device or the decoding device of the first embodiment, among the multiple components constituting the encoding device or the decoding device, components corresponding to the components described in each aspect of the present disclosure are replaced with the components described in each aspect of the present disclosure. (2) In the encoding device or decoding device of the first embodiment, any modification such as addition, replacement, or deletion of functions or processes performed by some of the components constituting the encoding device or decoding device is made, and then the components corresponding to the components described in each aspect of the present disclosure are replaced with the components described in each aspect of the present disclosure. (3) Adding a process to the method implemented by the encoding device or decoding device of the first embodiment, and / or replacing or deleting some of the processes included in the method, and then replacing the process corresponding to the process described in each aspect of the present disclosure with the process described in each aspect of the present disclosure. (4) Some of the components constituting the encoding device or decoding device of the first embodiment may be implemented in combination with components described in each aspect of the present disclosure, components having some of the functions of the components described in each aspect of the present disclosure, or components performing some of the processing performed by the components described in each aspect of the present disclosure. (5) Implementing a component having some of the functions of some of the multiple components constituting the encoding device or decoding device of embodiment 1, or a component that performs some of the processing performed by some of the multiple components constituting the encoding device or decoding device of embodiment 1, in combination with a component described in each aspect of the present disclosure, a component having some of the functions of the component described in each aspect of the present disclosure, or a component that performs some of the processing performed by the component described in each aspect of the present disclosure. (6) In the method implemented by the encoding device or the decoding device of the first embodiment, among a plurality of processes included in the method, a process corresponding to a process described in each aspect of the present disclosure is replaced with a process described in each aspect of the present disclosure. (7) Some of the processes included in the method implemented by the encoding device or the decoding device of the first embodiment may be implemented in combination with the processes described in each aspect of the present disclosure.

[0070] It should be noted that the manner of implementing the processes and / or configurations described in each aspect of the present disclosure is not limited to the above examples. For example, the processes and / or configurations may be implemented in a device used for a purpose other than the video / image encoding device or video / image decoding device disclosed in the first embodiment, or the processes and / or configurations described in each aspect may be implemented independently. Furthermore, the processes and / or configurations described in different aspects may be implemented in combination.

[0071] [Outline of the encoding device] First, a description will be given of an overview of a coding device according to embodiment 1. Fig. 1 is a block diagram showing a functional configuration of a coding device 100 according to embodiment 1. The coding device 100 is a video / image coding device that codes a video / image on a block-by-block basis.

[0072] As shown in FIG. 1, the encoding device 100 is a device that encodes an image on a block-by-block basis, and includes a division unit 102, a subtraction unit 104, a transformation unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse transformation 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.

[0073] The encoding device 100 is realized by, for example, a general-purpose processor and a memory. In this case, when the software program stored in the memory is executed by the processor, the processor functions as the division unit 102, the subtraction unit 104, the transformation unit 106, the quantization unit 108, the entropy coding unit 110, the inverse quantization unit 112, the inverse transformation 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. The encoding device 100 may also be realized as one or more dedicated electronic circuits corresponding to the division unit 102, the subtraction unit 104, the transformation unit 106, the quantization unit 108, the entropy coding unit 110, the inverse quantization unit 112, the inverse transformation 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.

[0074] Each component included in the encoding device 100 will be described below.

[0075] [Divided part] The division unit 102 divides each picture included in the input video into a plurality of blocks, and outputs each block to the subtraction unit 104. For example, the division unit 102 first divides a picture into blocks of a fixed size (e.g., 128x128). These fixed-size blocks may be called coding tree units (CTUs). The division unit 102 then divides each of the fixed-size blocks into blocks of a variable size (e.g., 64x64 or less) based on recursive quadtree and / or binary tree block division. These variable-size blocks may be called coding units (CUs), prediction units (PUs), or transform units (TUs). Note that in this embodiment, it is not necessary to distinguish between CUs, PUs, and TUs, and some or all of the blocks in a picture may be the processing units of CUs, PUs, and TUs.

[0076] Fig. 2 is a diagram showing an example of block division according to embodiment 1. In Fig. 2, solid lines represent block boundaries based on quadtree block division, and dashed lines represent block boundaries based on binary tree block division.

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

[0078] The top-left 64x64 block is further divided vertically into two rectangular 32x64 blocks, and the left 32x64 block is further divided vertically into two rectangular 16x64 blocks (binary tree block division). As a result, the top-left 64x64 block is divided into two 16x64 blocks 11 and 12 and a 32x64 block 13.

[0079] The top right 64x64 block is divided horizontally into two rectangular 64x32 blocks 14, 15 (binary tree block division).

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

[0081] The bottom right 64x64 block 23 is not split.

[0082] 2, the block 10 is divided into 13 variable-sized blocks 11 to 23 based on recursive quad-tree and binary tree block division. Such division is sometimes called QTBT (quad-tree plus binary tree) division.

[0083] In Fig. 2, one block is divided into four or two blocks (quadtree or binary tree block division), but the division is not limited to this. For example, one block may be divided into three blocks (ternary tree block division). Division including such ternary tree block division is sometimes called MBT (multi type tree) division.

[0084] [Subtraction section] The subtraction unit 104 subtracts a prediction signal (prediction sample) from an original signal (original sample) for each block divided by the division unit 102. That is, the subtraction unit 104 calculates a prediction error (also called a residual error) of a block to be coded (hereinafter, referred to as a current block). Then, the subtraction unit 104 outputs the calculated prediction error to the conversion unit 106.

[0085] The original signal is an input signal to the encoding device 100, and is a signal representing an image of each picture constituting a 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.

[0086] [Conversion section] The transform unit 106 transforms the prediction error in the spatial domain into transform coefficients in the frequency domain, and outputs the transform coefficients to the quantization unit 108. Specifically, the transform unit 106 performs, for example, a predetermined discrete cosine transform (DCT) or discrete sine transform (DST) on the prediction error in the spatial domain.

[0087] The transform unit 106 may adaptively select a transform type from among a plurality of transform types, and transform the prediction errors into transform coefficients using a transform basis function corresponding to the selected transform type. Such a transform may be called an explicit multiple core transform (EMT) or an adaptive multiple transform (AMT).

[0088] The multiple transform types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. Figure 3 is a table showing the transform basis functions corresponding to each transform type. In Figure 3, N indicates the number of input pixels. The selection of the transform type from among the multiple transform types may depend on, for example, the type of prediction (intra prediction and inter prediction) or the intra prediction mode.

[0089] Such information indicating whether EMT or AMT is applied (e.g., called an AMT flag) and information indicating the selected transformation type are signaled at the CU level. Note that the signaling of such information does not need to be limited to the CU level, and may be at other levels (e.g., sequence level, picture level, slice level, tile level, or CTU level).

[0090] Furthermore, the transform unit 106 may retransform the transform coefficients (transformation results). Such retransformation may be called AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the transform unit 106 performs retransformation for each subblock (e.g., 4x4 subblock) included in a block of transform coefficients corresponding to intra-prediction errors. Information indicating whether or not to apply NSST and information regarding a transform matrix used in NSST are signaled at a CU level. Note that signaling of these pieces of information does not need to be limited to the CU level, and may be at other levels (e.g., sequence level, picture level, slice level, tile level, or CTU level).

[0091] Here, a separable transformation is a method in which the transformation is performed multiple times by separating the input into directions equal to the number of dimensions, and a non-separable transformation is a method in which when the input is multidimensional, two or more dimensions are treated as one dimension and the transformation is performed together.

[0092] For example, one example of a non-separable transformation is when the input is a 4x4 block, it is treated as a single array with 16 elements, and the transformation process is performed on that array using a 16x16 transformation matrix.

[0093] Another example of a non-separable transformation is the Hypercube Givens Transform, which treats a 4x4 input block as a single array with 16 elements and then performs Givens rotations on that array multiple times.

[0094] [Quantization section] 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 a quantization parameter (QP) corresponding to the scanned transform coefficients. Then, the quantization unit 108 outputs the quantized transform coefficients of the current block (hereinafter, referred to as quantized coefficients) to the entropy coding unit 110 and the inverse quantization unit 112.

[0095] The predetermined order is an order for quantization / dequantization of the transform coefficients. For example, the predetermined scanning order is defined as ascending (low to high) or descending (high to low) frequency order.

[0096] The quantization parameter is a parameter that defines the quantization step (quantization width). For example, if the value of the quantization parameter increases, the quantization step also increases. In other words, if the value of the quantization parameter increases, the quantization error increases.

[0097] [Entropy coding part] The entropy coding unit 110 generates a coded signal (coded bit stream) by variable-length coding the quantized coefficients input from the quantization unit 108. Specifically, the entropy coding unit 110, for example, binarizes the quantized coefficients and arithmetically codes the binary signal.

[0098] [Dequantization section] The inverse quantization unit 112 inverse quantizes the quantized coefficients input from the quantization unit 108. Specifically, the inverse quantization unit 112 inverse quantizes the quantized 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.

[0099] [Inverse conversion section] The inverse transform unit 114 restores the prediction error by inverse transforming the transform coefficients that are input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 restores the prediction error of the current block by performing an inverse transform on the transform coefficients that corresponds to the transform performed by the transform unit 106. Then, the inverse transform unit 114 outputs the restored prediction error to the adder unit 116.

[0100] Note that the restored prediction error does not match the prediction error calculated by the subtraction unit 104 because information has been lost due to quantization. That is, the restored prediction error includes a quantization error.

[0101] [Addition section] The adder 116 reconstructs the current block by adding the prediction error input from the inverse transformer 114 and the prediction sample input from the prediction control unit 128. The adder 116 then outputs the reconstructed block to the block memory 118 and the loop filter unit 120. The reconstructed block is sometimes called a local decoded block.

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

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

[0104] In ALF, a least squared error filter is applied to remove coding artifacts. For example, for each 2x2 sub-block in the current block, one filter is selected from among multiple filters based on local gradient direction and activity.

[0105] 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 the sub-blocks is performed based on the gradient direction and activity. 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 (e.g., 15 or 25 classes).

[0106] The gradient direction value D is derived, for example, by comparing gradients in multiple directions (e.g., horizontal, vertical, and two diagonal directions), and the gradient activity value A is derived, for example, by adding gradients in multiple directions and quantizing the sum.

[0107] Based on the result of such classification, a filter for the sub-block is determined from among a plurality of filters.

[0108] The shape of the filter used in the ALF is, for example, a circularly symmetric shape. FIGS. 4A to 4C are diagrams showing a number of examples of the shape of the filter used in the ALF. FIG. 4A shows a 5×5 diamond-shaped filter, FIG. 4B shows a 7×7 diamond-shaped filter, and FIG. 4C shows a 9×9 diamond-shaped filter. Information indicating the shape of the filter is signaled at the picture level. Note that the signaling of the information indicating the shape of the filter does not need to be limited to the picture level, and may be at other levels (for example, the sequence level, slice level, tile level, CTU level, or CU level).

[0109] The on / off of ALF is determined, for example, at the picture level or the CU level. For example, whether or not to apply ALF is determined for luminance at the CU level, and whether or not to apply ALF is determined for chrominance at the picture level. Information indicating whether or not to apply ALF is signaled at the picture level or the CU level. Note that the signaling of information indicating whether or not to apply ALF is not limited to the picture level or the CU level, and may be at another level (for example, the sequence level, the slice level, the tile level, or the CTU level).

[0110] The coefficient sets of multiple selectable filters (e.g., up to 15 or 25 filters) are signaled at the picture level. Note that the signaling of the coefficient sets does not need to be limited to the picture level, but may be at other levels (e.g., sequence level, slice level, tile level, CTU level, CU level, or sub-block level).

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

[0112] [Intra prediction section] The intra prediction unit 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also called intra-screen prediction) of the current block with reference to a 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 (e.g., luminance values, chrominance values) of blocks adjacent to the current block, and outputs the intra prediction signal to the prediction control unit 128.

[0113] For example, the intra prediction unit 124 performs intra prediction using one of a plurality of predefined intra prediction modes. The plurality of intra prediction modes includes one or more non-directional prediction modes and a plurality of directional prediction modes.

[0114] The one or more non-directional prediction modes include, for example, a planar prediction mode and a DC prediction mode defined in the H.265 / High-Efficiency Video Coding (HEVC) standard (Non-Patent Document 1).

[0115] The multiple directional prediction modes include, for example, 33 prediction modes defined in the H.265 / HEVC standard. The multiple directional prediction modes may include 32 prediction modes in addition to the 33 directions (a total of 65 directional prediction modes). FIG. 5A is a diagram showing 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) 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.

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

[0117] The intra prediction unit 124 may correct pixel values ​​after intra prediction based on the gradient of reference pixels in the horizontal / vertical directions. Intra prediction with such correction may be called position dependent intra prediction combination (PDPC). Information indicating whether or not PDPC is applied (e.g., called a PDPC flag) is signaled, for example, at a CU level. Note that the signaling of this information does not need to be limited to the CU level, and may be at other levels (e.g., sequence level, picture level, slice level, tile level, or CTU level).

[0118] [Inter prediction section] The inter prediction unit 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also called inter prediction) of the 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 the current block or a sub-block (e.g., 4x4 block) in the current block. For example, the inter prediction unit 126 performs motion estimation in the reference picture for the current block or the sub-block. Then, the inter prediction unit 126 generates an inter prediction signal of the current block or the sub-block by performing motion compensation using motion information (e.g., a motion vector) obtained by the motion estimation. Then, the inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.

[0119] The motion information used for the motion compensation is signaled. For the signaling of the motion vector, a motion vector predictor may be used, i.e. the difference between the motion vector and the motion vector predictor may be signaled.

[0120] In addition, the 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 the adjacent block. Specifically, the inter prediction signal may be generated for each sub-block in the current block by performing weighted addition of the prediction signal based on the motion information obtained by motion search and the prediction signal based on the motion information of the adjacent block. Such inter prediction (motion compensation) may be called OBMC (overlapped block motion compensation).

[0121] In such an OBMC mode, information indicating the size of a sub-block for OBMC (e.g., called OBMC block size) is signaled at the sequence level. Also, information indicating whether or not to apply the OBMC mode (e.g., called OBMC flag) is signaled at the CU level. Note that the signaling level of these pieces of information does not need to be limited to the sequence level and CU level, and may be other levels (e.g., picture level, slice level, tile level, CTU level, or sub-block level).

[0122] The OBMC mode will now be described in more detail. Figures 5B and 5C are a flowchart and a conceptual diagram for explaining an overview of the predicted image correction process in the OBMC process.

[0123] First, a predicted image (Pred) is obtained by normal motion compensation using a motion vector (MV) assigned to a block to be coded.

[0124] Next, the motion vector (MV_L) of the already-encoded left adjacent block is applied to the block to be encoded to obtain a predicted image (Pred_L), and the predicted image is weighted and superimposed with Pred_L to perform a first correction of the predicted image.

[0125] Similarly, the motion vector (MV_U) of the already-encoded adjacent block above is applied to the block to be encoded to obtain a predicted image (Pred_U), and the predicted image that has been corrected the first time is weighted and overlaid with Pred_U to perform a second correction of the predicted image, which is used as the final predicted image.

[0126] Although a two-stage correction method using the left adjacent block and the upper adjacent block has been described here, it is also possible to configure a method in which more than two stages of correction are performed using the right adjacent block or the lower adjacent block.

[0127] The area in which overlapping is performed does not have to be the entire pixel area of ​​the block, but may be only a part of the area near the block boundary.

[0128] Note that although the predicted image correction process from one reference picture has been described here, the process is similar when correcting a predicted image from multiple reference pictures; after obtaining corrected predicted images from each reference picture, the obtained predicted images are further overlaid to obtain the final predicted image.

[0129] The block to be processed may be a prediction block unit, or a sub-block unit obtained by further dividing the prediction block.

[0130] As a method of determining whether or not to apply OBMC processing, for example, there is a method of using obmc_flag, which is a signal indicating whether or not to apply OBMC processing. As a specific example, in an encoding device, it is determined whether or not the encoding target block belongs to an area with complex motion, and if it belongs to an area with complex motion, a value of 1 is set as obmc_flag and encoding is performed by applying OBMC processing, and if it does not belong to an area with complex motion, a value of 0 is set as obmc_flag and encoding is performed without applying OBMC processing. On the other hand, in a decoding device, by decoding obmc_flag described in a stream, decoding is performed by switching whether or not to apply OBMC processing according to the value.

[0131] In addition, the motion information may be derived on the decoding device side without being signaled. For example, a merge mode defined in the H.265 / HEVC standard may be used. Also, for example, the motion information may be derived by performing motion estimation on the decoding device side. In this case, the motion estimation is performed without using pixel values ​​of the current block.

[0132] Here, a mode in which motion estimation is performed on the decoding device side will be described. This mode in which motion estimation is performed on the decoding device side is sometimes called a pattern matched motion vector derivation (PMMVD) mode or a frame rate up-conversion (FRUC) mode.

[0133] An example of the FRUC process is shown in FIG. 5D. First, a list of multiple candidates (which may be the same as the merge list) each having a predicted motion vector is generated by referring to the motion vectors of encoded blocks spatially or temporally adjacent to the current block. Next, a best candidate MV is selected from multiple candidate MVs registered in the candidate list. For example, an evaluation value of each candidate included in the candidate list is calculated, and one candidate is selected based on the evaluation value.

[0134] Then, based on the motion vector of the selected candidate, a motion vector for the current block is derived. Specifically, for example, the motion vector of the selected candidate (best candidate MV) is derived as it is as the motion vector for the current block. Also, for example, the motion vector for the current block may be derived by performing pattern matching in the surrounding area of ​​the position in the reference picture corresponding to the motion vector of the selected candidate. That is, a search is performed in the surrounding area of ​​the best candidate MV in the same manner, and if there is an MV with a better evaluation value, the best candidate MV may be updated to the MV, and the MV may be set as the final MV of the current block. It is also possible to configure the system without performing this process.

[0135] The same processing may be performed when processing is performed in sub-block units.

[0136] The evaluation value is calculated by finding a difference value of the reconstructed image by pattern matching between an area in a reference picture corresponding to the motion vector and a predetermined area. The evaluation value may be calculated using information other than the difference value.

[0137] As the pattern matching, a first pattern matching or a second pattern matching is used. The first pattern matching and the second pattern matching are sometimes called bilateral matching and template matching, respectively.

[0138] 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, an area in another reference picture along the motion trajectory of the current block is used as a predetermined area for calculating the evaluation value of the above-mentioned candidate.

[0139] FIG. 6 is a diagram for explaining an example of pattern matching (bilateral matching) between two blocks along a motion trajectory. As shown in FIG. 6, in the first pattern matching, two motion vectors (MV0, MV1) are derived by searching for a pair of two blocks that are along the motion trajectory of a current block (Cur block) and are in two different reference pictures (Ref0, Ref1) that best match each other. Specifically, for the current block, a difference is derived between a reconstructed image at a designated position in a first coded reference picture (Ref0) designated by a candidate MV and a reconstructed image at a designated position in a second coded reference picture (Ref1) designated by a symmetric MV obtained by scaling the candidate MV by a display time interval, and an evaluation value is calculated using the obtained difference value. It is preferable to select the candidate MV with the best evaluation value among a plurality of candidate MVs as the final MV.

[0140] Under the assumption of continuous motion trajectories, the motion vectors (MV0, MV1) pointing to 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, if the current picture is located between two reference pictures in time and the temporal distances from the current picture to the two reference pictures are equal, the first pattern matching derives bidirectional motion vectors that are mirror-symmetric.

[0141] In the second pattern 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., an 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 a predetermined area for calculating the evaluation value of the above-mentioned candidate.

[0142] Fig. 7 is a 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. 7, in the second pattern matching, a motion vector of a current block is derived by searching in a reference picture (Ref0) for a block that best matches a block adjacent to a current block (Cur block) in a current picture (Cur Pic). Specifically, for the current block, a difference is derived between a reconstructed image of both or either of the left adjacent and / or upper adjacent coded areas and a reconstructed image at the same position in a coded reference picture (Ref0) specified by a candidate MV, an evaluation value is calculated using the obtained difference value, and a candidate MV with the best evaluation value among a plurality of candidate MVs is selected as a best candidate MV.

[0143] Information indicating whether such a FRUC mode is applied (e.g., when the FRUC flag is true) is signaled at the CU level. Also, when the FRUC mode is applied (e.g., when the FRUC flag is true), information indicating a pattern matching method (first pattern matching or second pattern matching) (e.g., when the FRUC mode flag is true) is signaled at the CU level. Note that the signaling of such information does not need to be limited to the CU level, and may be at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or subblock level).

[0144] Here, a mode in which a motion vector is derived based on a model assuming uniform linear motion will be described. This mode is sometimes called a BIO (bi-directional optical flow) mode.

[0145] FIG. 8 is a diagram for explaining a model assuming uniform linear motion. In FIG. x ,v y ) denotes the velocity vector, and τ 0 , τ 1respectively represent the current picture (Cur Pic) and two reference pictures (Ref 0 ,Ref 1 ) indicates the time distance between (MVx 0 ,MVy 0 ) is the reference picture Ref 0 Let us denote the motion vector corresponding to (MVx 1 , M.V.y. 1 ) is the reference picture Ref 1 The motion vector corresponding to

[0146] At this time, the velocity vector (v x ,v y Under the assumption of uniform linear motion of (MVx 0 ,MVy 0 ) and (MVx 1 ,MVy 1 ) are respectively, (v x τ 0 ,v y τ 0 ) and (-v x τ 1 ,-v y τ 1 ) and the following optical flow equation (1) holds:

[0147]

number

[0148] Here, I (k) denotes the luminance value of reference image k (k=0,1) after motion compensation. This optical flow equation indicates that the sum of (i) the time 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 a combination of this optical flow equation and Hermite interpolation, block-wise motion vectors obtained from a merge list or the like are corrected pixel by pixel.

[0149] Note that the decoding device may derive the motion vector using a method other than the method based on a model assuming uniform linear motion. For example, the motion vector may be derived for each sub-block based on the motion vectors of multiple adjacent blocks.

[0150] Here, a mode in which a motion vector is derived for each sub-block 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.

[0151] 9A is a diagram for explaining derivation of a motion vector for each sub-block based on the motion vectors of multiple adjacent blocks. In FIG. 9A, the current block includes 16 4x4 sub-blocks. Here, the motion vector v of the upper left corner control point of the current block is derived based on the motion vectors of the adjacent blocks. 0 is derived, and the motion vector v of the upper right corner control point of the current block is calculated based on the motion vectors of the neighboring sub-blocks. 1 Then, two motion vectors v 0 and v 1 Using the above, the motion vector (v x ,v y ) is derived.

[0152]

number

[0153] Here, x and y respectively indicate the horizontal and vertical positions of the sub-block, and w indicates a predetermined weighting factor.

[0154] Such affine motion compensation prediction mode may include several modes with different methods of deriving the motion vectors of the upper left and upper right corner control points. Information indicating such affine motion compensation prediction mode (e.g., called affine flag) is signaled at the CU level. Note that the signaling of the information indicating this affine motion compensation prediction mode does not need to be limited to the CU level, and may be at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or subblock level).

[0155] [Predictive control unit] The prediction control unit 128 selects either the intra-prediction signal or the inter-prediction signal, and outputs the selected signal to the subtraction unit 104 and the addition unit 116 as a prediction signal.

[0156] Here, an example of deriving a motion vector for a picture to be coded in the merge mode will be described. Fig. 9B is a diagram for explaining an overview of a motion vector derivation process in the merge mode.

[0157] First, a prediction MV list is generated in which prediction MV candidates are registered. The prediction MV candidates include spatially adjacent prediction MVs, which are MVs held by multiple coded blocks located spatially around the block to be coded, temporally adjacent prediction MVs, which are MVs held by nearby blocks projected onto the position of the block to be coded in the coded reference picture, joint prediction MVs, which are MVs generated by combining the MV values ​​of spatially adjacent prediction MVs and temporally adjacent prediction MVs, and zero prediction MVs, which are MVs with a value of zero.

[0158] Next, one prediction MV is selected from the multiple prediction MVs registered in the prediction MV list, and is determined as the MV for the block to be coded.

[0159] Furthermore, the variable length coding unit writes merge_idx, which is a signal indicating which predicted MV has been selected, into the stream and codes it.

[0160] Note that the predicted MVs registered in the predicted MV list described in Figure 9B are just an example, and the number may be different from the number shown in the figure, the configuration may not include some of the types of predicted MVs shown in the figure, or the configuration may include additional predicted MVs other than the types of predicted MVs shown in the figure.

[0161] Note that the final MV may be determined by performing DMVR processing, which will be described later, using the MV of the block to be coded derived in the merge mode.

[0162] Here, an example of determining the MV using the DMVR process will be described.

[0163] FIG. 9C is a conceptual diagram for explaining an overview of the DMVR process.

[0164] First, the optimal MVP set for the block to be processed is set as a candidate MV, and reference pixels are obtained from the first reference picture, which is a processed picture in the L0 direction, and the second reference picture, which is a processed picture in the L1 direction, according to the candidate MV, and a template is generated by taking the average of each reference pixel.

[0165] Next, the template is used to search the surrounding areas of the candidate MVs of the first and second reference pictures, and the MV with the smallest cost is determined as the final MV. The cost value is calculated using the difference value between each pixel value of the template and each pixel value of the search area, the MV value, etc.

[0166] The outline of the processing described here is basically the same for the encoding device and the decoding device.

[0167] Note that other processing may be used instead of the processing described here, as long as it is processing that can search the vicinity of the candidate MV and derive the final MV.

[0168] Here, a mode in which a predicted image is generated using LIC processing will be described.

[0169] FIG. 9D is a diagram for explaining an outline of a predicted image generating method using luminance correction processing by LIC processing.

[0170] First, a MV for obtaining a reference image corresponding to a block to be coded from a reference picture that is a coded picture is derived.

[0171] Next, for the block to be coded, the luminance pixel values ​​of the coded surrounding reference areas adjacent to the left and above and the luminance pixel values ​​at the equivalent positions in the reference picture specified by the MV are used to extract information indicating how the luminance values ​​have changed between the reference picture and the picture to be coded, and a luminance correction parameter is calculated.

[0172] A luminance correction process is performed on a reference image in a reference picture specified by the MV using the luminance correction parameter, thereby generating a predicted image for the block to be coded.

[0173] It should be noted that the shape of the peripheral reference region in FIG. 9D is just an example, and other shapes may be used.

[0174] Although the process of generating a predicted image from one reference picture has been described here, the process is similar when generating a predicted image from multiple reference pictures, and a luminance correction process is performed in a similar manner on the reference images obtained from each reference picture before generating a predicted image.

[0175] As a method of determining whether or not to apply LIC processing, for example, there is a method of using lic_flag, which is a signal indicating whether or not to apply LIC processing. As a specific example, in an encoding device, it is determined whether or not the encoding target block belongs to an area where a luminance change occurs, and if it belongs to an area where a luminance change occurs, a value of 1 is set as lic_flag and encoding is performed by applying LIC processing, and if it does not belong to an area where a luminance change occurs, a value of 0 is set as lic_flag and encoding is performed without applying LIC processing. On the other hand, a decoding device decodes lic_flag described in a stream, and switches whether or not to apply LIC processing depending on the value, and performs decoding.

[0176] Another method of determining whether to apply LIC processing is, for example, a method of determining according to whether LIC processing is applied to surrounding blocks.As a specific example, when the block to be coded is in merge mode, determine whether the surrounding coded blocks selected when deriving MV in merge mode processing have been coded by applying LIC processing, and switch whether to apply LIC processing according to the result and perform coding.In addition, in this example, the process in decoding is exactly the same.

[0177] [Overview of the Decryption Device] Next, a description will be given of an overview of a decoding device capable of decoding the coded signal (coded bit stream) output from the above coding device 100. Fig. 10 is a block diagram showing a functional configuration of a decoding device 200 according to the first embodiment. The decoding device 200 is a video / image decoding device that decodes a video / image on a block-by-block basis.

[0178] As shown in FIG. 10, the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transform 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.

[0179] The decoding device 200 is realized by, for example, a general-purpose processor and a memory. In this case, when the 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 transform 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. The decoding device 200 may also be realized as one or more dedicated electronic circuits corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse transform 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.

[0180] Each component included in the decoding device 200 will be described below.

[0181] [Entropy Decoding Part] The entropy decoding unit 202 entropy decodes the coded bit stream. Specifically, the entropy decoding unit 202 arithmetically decodes the coded bit stream into a binary signal, for example. The entropy decoding unit 202 then debinarizes the binary signal. As a result, the entropy decoding unit 202 outputs quantized coefficients to the inverse quantization unit 204 on a block-by-block basis.

[0182] [Dequantization section] The inverse quantization unit 204 inverse quantizes the quantized coefficients of a block to be decoded (hereinafter, referred to as a current block) that is input from the entropy decoding unit 202. Specifically, the inverse quantization unit 204 inverse quantizes each quantized coefficient of the current block based on a quantization parameter corresponding to the quantized coefficient. Then, the inverse quantization unit 204 outputs the inverse quantized quantized coefficients (i.e., transform coefficients) of the current block to the inverse transform unit 206.

[0183] [Inverse conversion section] The inverse transform unit 206 restores the prediction error by inverse transforming the transform coefficients input from the inverse quantization unit 204 .

[0184] For example, if the information interpreted from the encoded bitstream indicates that EMT or AMT is to be applied (e.g., the AMT flag is true), the inverse transform unit 206 inverse transforms the transform coefficients of the current block based on the interpreted information indicating the transform type.

[0185] Also for example, if the information interpreted from the coded bitstream indicates to apply NSST, then inverse transform unit 206 applies an inverse re-transform to the transform coefficients.

[0186] [Addition section] The adder 208 reconstructs the current block by adding the prediction error, which is an input from the inverse transformer 206, and the prediction sample, which is an input from the prediction control unit 220. The adder 208 then outputs the reconstructed block to the block memory 210 and the loop filter unit 212.

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

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

[0189] If the information indicating ALF on / off read from the encoded bitstream indicates ALF on, one filter is selected from among multiple filters based on the local gradient direction and activity, and the selected filter is applied to the reconstructed block.

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

[0191] [Intra prediction section] 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 an intra prediction mode interpreted from the encoded bit stream. Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to samples (e.g., luminance values, chrominance values) of blocks adjacent to the current block, and outputs the intra prediction signal to the prediction control unit 220.

[0192] Note that, when an intra prediction mode that references a luminance block in intra prediction of a chrominance block is selected, the intra prediction unit 216 may predict the chrominance component of the current block based on the luminance component of the current block.

[0193] Furthermore, when information interpreted from the encoded bitstream indicates the application of PDPC, the intra prediction unit 216 corrects pixel values ​​after intra prediction based on the gradients of reference pixels in the horizontal / vertical directions.

[0194] [Inter prediction section] The inter prediction unit 218 predicts the current block by referring to a 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) in the current block. For example, the inter prediction unit 218 generates an inter prediction signal of the current block or sub-block by performing motion compensation using motion information (e.g., motion vectors) interpreted from the encoded bitstream, and outputs the inter prediction signal to the prediction control unit 220.

[0195] In addition, when the information interpreted from the encoded 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.

[0196] Also, if the information interpreted from the encoded bitstream indicates that the FRUC mode is applied, the inter prediction unit 218 derives motion information by performing motion search according to the pattern matching method (bilateral matching or template matching) interpreted from the encoded bitstream. Then, the inter prediction unit 218 performs motion compensation using the derived motion information.

[0197] In addition, when the BIO mode is applied, the inter prediction unit 218 derives a motion vector based on a model assuming uniform linear motion. In addition, when information interpreted from the encoded bitstream indicates that an affine motion compensation prediction mode is applied, the inter prediction unit 218 derives a motion vector on a sub-block basis based on the motion vectors of multiple adjacent blocks.

[0198] [Predictive control unit] The prediction control unit 220 selects either the intra-prediction signal or the inter-prediction signal, and outputs the selected signal to the addition unit 208 as a prediction signal.

[0199] [First example of inter prediction processing] 11 is a diagram showing a first example of a schematic pipeline configuration used in the decoding device 200. This pipeline configuration includes four stages: a first stage, a second stage, a third stage, and a fourth stage.

[0200] In the first stage, the decoding device 200 performs an entropy decoding process on an input stream to be decoded, thereby acquiring information required for decoding (S101).

[0201] In the second stage, the decoding device 200 uses the information to derive a motion vector (MV) in inter prediction processing. Specifically, the decoding device 200 first derives one or more predicted motion vectors (hereinafter, MVPs) that are candidates for motion vectors, with reference to surrounding decoded blocks (S102). Next, the decoding device 200 transfers a reference image to memory according to the derived MVP (S103).

[0202] Next, when the inter prediction mode is the FRUC mode, the decoding device 200 determines a motion vector by performing an optimal MVP determination (S104) and an optimal MVP neighborhood search (S105). When the inter prediction mode is the merge mode, the decoding device 200 determines a motion vector by performing a DMVR process (S106).

[0203] In the third stage, the decoding device 200 decodes the residual image by inverse quantization and inverse transform processing (S110). If the current block is an intra block, the decoding device 200 decodes a predicted image by intra prediction processing (S108). If the current block is an inter block, the decoding device 200 decodes a predicted image by performing motion compensation processing or the like using the motion vector derived in the second stage (S107).

[0204] Next, the decoding device 200 selects one of the predicted image generated by the intra prediction process and the predicted image generated by the inter prediction process (S109), and generates a reconstructed image by adding the residual image and the selected predicted image (S111).

[0205] In the fourth stage, the decoding device 200 generates a decoded image by performing loop filtering on the reconstructed image (112).

[0206] The motion vector derived in the second stage is used as a surrounding reference motion vector for deriving an MVP in the decoding process of the following block, and is therefore fed back as an input to the MVP derivation process (S102). In order to refer to the motion vector belonging to the block immediately preceding it in the processing order, this feedback process needs to be contained within one stage. As a result, as shown in FIG. 11, the second stage is composed of a great number of processes, and the processing time is long.

[0207] Note that this outline of the pipeline configuration is just one example, and some of the processes described may be removed, processes not described may be added, or the way the stages are divided may be changed.

[0208] Fig. 12 is a schematic diagram showing an example of block division used to explain pipeline processing. In the example of block division shown in Fig. 12, two coding tree units are shown. One coding tree unit includes two coding units CU0 and CU1, and the other coding tree unit includes three coding units CU2, CU3, and CU4.

[0209] Coding units CU0, CU1, and CU4 are the same size. Coding units CU2 and CU3 are the same size. The size of each of coding units CU0, CU1, and CU4 is twice the size of each of coding units CU2 and CU3.

[0210] Fig. 13 is a diagram showing a time sequence of processing timings of stage processing of each block to be decoded in the first example of the schematic pipeline configuration described in Fig. 11. Fig. 13 shows processing timings of five blocks to be decoded, namely, coding units CU0 to CU4 shown in Fig. 12. Moreover, S1 to S4 in Fig. 13 show processing times of the first to fourth stages in Fig. 11.

[0211] Since the coding units CU0, CU1, and CU4 are twice as large as the coding units CU2 and CU3, the processing time of each stage is also twice as long.

[0212] Also, as explained in FIG. 11, the processing time of the second stage is long, so the processing time of the second stage is twice as long as that of the other stages.

[0213] Each stage process starts after waiting for the same stage of the previous block to finish in the processing order. For example, the second stage process of the coding unit CU1 starts at time t6 when the second stage of the coding unit CU0 finishes. At this time, the processing time of the second stage of the coding unit CU0 is twice as long as that of the coding unit CU0, so a waiting time occurs in the coding unit CU1 from time t4 when the first stage process finishes to time t6 when the second stage process starts.

[0214] In this way, a waiting time always occurs at the start of the second stage, and the waiting time accumulates each time the processing of the block to be decoded progresses. As a result, in the coding unit CU4, a waiting time occurs from time t8 when the processing of the first stage ends to time t14 when the processing of the second stage begins.

[0215] As a result, when the decoding process of one picture is completed, the processing time including the waiting time increases to about twice the original processing time, which may make it difficult to complete the processing of all blocks within the processing time allocated to one picture.

[0216] Fig. 14 is a flowchart of inter prediction processing in the first example of the schematic pipeline configuration described in Fig. 11. The processing shown in Fig. 14 is repeatedly performed in units of prediction blocks, which are processing units of inter prediction processing. The processing shown in Fig. 14 is also performed in the encoding device 100 and the decoding device 200. Note that, although the operation of the inter prediction unit 126 included in the encoding device 100 will be mainly described below, the operation of the inter prediction unit 218 included in the decoding device 200 is also similar.

[0217] The inter prediction unit 126 selects an inter prediction mode to be used for a current block, which is a block to be coded or decoded, from a plurality of modes (such as a normal inter mode, a merge mode, and a FRUC mode). The inter prediction unit 126 derives a motion vector (MV) using the selected inter prediction mode. Specifically, the inter prediction mode information indicates the inter prediction mode to be used for the current block.

[0218] When normal inter mode is used (normal inter mode in S201), the inter prediction unit 126 acquires a plurality of predicted motion vectors (MVPs) by referring to the motion vectors of neighboring processed blocks, and creates a normal MVP list indicating the acquired plurality of MVPs. The inter prediction unit 126 designates one MVP from the plurality of MVPs indicated in the created normal MVP list, and determines a final motion vector by adding a differential motion vector (MVD) to the designated MVP (S202). Specifically, the encoding device 100 generates a differential motion vector from the motion vector and the MVP, and transmits the generated differential motion vector to the decoding device 200. The decoding device 200 acquires a motion vector by adding the transmitted differential motion vector to the predicted motion vector.

[0219] When the merge mode is used (merge mode in S201), the inter prediction unit 126 acquires one or more MVPs by referring to the motion vectors of the surrounding processed blocks, and creates a merge MVP list indicating the acquired one or more MVPs. Next, the inter prediction unit 126 designates one MVP from the created merge mode MVP list as an optimal MVP (S203). Next, the inter prediction unit 126 performs DMVR processing to search for a position with the smallest cost value in the surrounding area of ​​the optimal MVP using the processed picture, thereby determining the final motion vector (S204).

[0220] When the FRUC mode is used (FRUC in S201), the inter prediction unit 126 acquires multiple MVPs by referring to the motion vectors of neighboring processed blocks, and creates an MVP list for FRUC that indicates the acquired multiple MVPs (S205). Next, the inter prediction unit 126 derives an optimal MVP with a minimum cost value from the multiple MVPs indicated in the MVP list for FRUC using a bilateral matching method or a template matching method (S206). Next, the inter prediction unit 126 further searches for a position with a minimum cost in the surrounding area of ​​the derived optimal MVP by a similar process, and determines the motion vector obtained by the search as the final motion vector (S207).

[0221] The final motion vectors derived by each method are stored in a surrounding reference MV memory to be used as surrounding reference MVs for deriving the MVPs of the following blocks.

[0222] Finally, the inter prediction unit 126 generates a predicted image by performing a motion compensation process or the like using the final motion vector (S208).

[0223] In this way, when the current block is processed in the merge mode or FRUC mode, much more processing is required to derive the final motion vector than in the other modes, which results in a longer processing time, which causes an increase in the waiting time of the stages in the pipeline control described in FIG.

[0224] Note that the process flow shown here is just an example, and some of the processes described may be omitted, or processes not described may be added.

[0225] Furthermore, the encoding device 100 and the decoding device 200 basically share the same processing flow as described above, with the only difference being whether a signal required for processing is encoded into a stream or decoded from a stream.

[0226] [Second example of inter prediction processing] Fig. 15 is a diagram showing a second example of a schematic pipeline configuration used in the decoding device 200. In the second example shown in Fig. 15, unlike the first example described in Fig. 11, the decoding device 200 uses a provisional motion vector (first motion vector) generated using one or more MVPs acquired in the MVP derivation process, instead of using a final motion vector (second motion vector) after all processes related to motion vector derivation are performed, as a neighboring reference motion vector of a neighboring decoded block used in MVP derivation in the inter prediction process.

[0227] In this way, by using the tentative motion vector as a neighboring reference motion vector for deriving the MVP in the decoding process of the subsequent block, the length of the feedback loop can be significantly shortened. As a result, the second stage, which had to be one long stage in the first example, can be divided into two short stages, the second stage and the third stage, while satisfying the condition that the feedback loop does not span between stages.

[0228] Note that this outline of the pipeline configuration is just one example, and some of the processes described may be removed, processes not described may be added, or the way the stages are divided may be changed.

[0229] FIG. 16 is a diagram showing a time sequence of processing timings of stage processing of each block to be decoded in the second example of the schematic pipeline configuration described in FIG.

[0230] Fig. 16, like Fig. 13, shows the processing timing for five blocks to be decoded, from the coding unit CU0 to the coding unit CU4, shown in the block division example shown in Fig. 12. The second stage, which was one long stage in the first example, is divided into two short stages, the second stage and the third stage, in the second example. Also, the length of each of the second stage and the third stage is the same as that of the other stages.

[0231] Each stage process starts after waiting for the same stage of the previous block to finish in the processing order. For example, the second stage process of the coding unit CU1 starts at time t4 when the second stage of the coding unit CU0 finishes. At this time, since the processing time of the second stage of the coding unit CU0 is the same as that of the other stages, the coding unit CU1 can start the second stage process without waiting time after the first stage process finishes.

[0232] On the other hand, since the block size of the coding unit CU2 is smaller than that of the coding unit CU1 immediately preceding it in the processing order, a waiting time occurs between the first and second stages; however, this waiting time is not accumulated, and there is no waiting time by the time of the coding unit CU4.

[0233] As a result, even when the decoding process for one picture is completed, the processing time including waiting time will be almost the same as the original processing time, increasing the likelihood that the processing of all blocks can be completed within the processing time allocated to one picture.

[0234] Fig. 17 is a flowchart of inter prediction processing in the second example of the schematic pipeline configuration described in Fig. 15. The processing shown in Fig. 17 is repeatedly performed in units of prediction blocks, which are processing units of inter prediction processing. The processing shown in Fig. 17 is also performed in the encoding device 100 and the decoding device 200. Note that, although the operation of the inter prediction unit 126 included in the encoding device 100 will be mainly described below, the operation of the inter prediction unit 218 included in the decoding device 200 is also similar.

[0235] The process shown in Fig. 17 differs from the first example described in Fig. 14 in the following respects: In the process shown in Fig. 17, the final motion vector derived by each method is not stored in the peripheral reference motion vector memory, but a provisional motion vector derived using one or more MVPs obtained by each method is stored in the peripheral reference motion vector memory.

[0236] This makes it possible to perform feedback of the surrounding reference motion vectors for deriving the MVP in the processing of the subsequent block at an early stage in the processing flow, which increases the possibility of significantly reducing the waiting time of the stages in the pipeline control as described in FIG.

[0237] The provisional motion vectors to be stored in the surrounding reference motion vector memory are derived as follows.

[0238] (1) In normal inter mode, the inter predictor 126 determines the final motion vector obtained by normal motion vector derivation processing as the provisional motion vector.

[0239] (2) In the merge mode, the inter predictor 126 determines, as a provisional motion vector, an MVP (optimum MVP) designated by a merge index among a plurality of MVPs indicated in the MVP list for merging.

[0240] (3) In FRUC mode, the inter prediction unit 126 derives a provisional motion vector using multiple MVPs indicated in the FRUC MVP list, for example, using one of the following methods. The inter prediction unit 126 determines the MVP registered at the top of the FRUC MVP list as the provisional motion vector. Alternatively, the inter prediction unit 126 scales each of the multiple MVPs indicated in the FRUC MVP list to the time interval of the closest reference picture. The inter prediction unit 126 calculates the average value or median value of the multiple MVPs obtained by scaling for each of the L0 direction and the L1 direction, and determines the obtained motion vector as the provisional motion vector.

[0241] In addition, the inter prediction unit 126 may exclude MVPs that have been registered by referring to provisional motion vectors from among the multiple MVPs indicated in the MVP list for FRUC, and derive provisional motion vectors by applying any of the above methods to the remaining MVPs.

[0242] In addition, in FIG. 17, the provisional motion vector stored in the peripheral reference motion vector memory is used as the peripheral reference motion vector for deriving the MVP, but the provisional motion vector may be used as the peripheral reference motion vector in other processes such as loop filter processing. Note that in other processes such as loop filter processing, the final motion vector used for motion compensation may be used instead of the provisional motion vector. Specifically, the final motion vector is derived in the third stage shown in FIG. 15. Therefore, in the processes from the fourth stage onwards, this final motion vector may be used.

[0243] In addition, in the configuration shown in Figure 15, which is a pipeline configuration assuming this processing flow, a provisional motion vector is fed back as a peripheral reference motion vector immediately after the MVP derivation process, but the provisional motion vector may be fed back at other times as long as it is possible to obtain the same information as the provisional motion vector described here.

[0244] This processing flow is an example, and some of the described processing may be omitted or other processing may be added. For example, in the merge mode, when the peripheral search process of the optimal MVP is not performed, the provisional motion vector may be the same as the final motion vector.

[0245] Furthermore, the encoding device 100 and the decoding device 200 basically share the same processing flow as described above, with the only difference being whether a signal required for processing is encoded into a stream or decoded from a stream.

[0246] [Effect of the second example of inter-prediction processing] The configuration described with reference to Figures 15 to 17 enables feedback of the surrounding reference motion vectors for deriving MVP in the processing of the subsequent block at an early stage in the processing flow. Therefore, the waiting time of the stages in the pipeline control that occurred in the first example is significantly reduced. This increases the possibility that even a decoding device with low processing performance can complete the processing of all blocks within the processing time allocated to one picture.

[0247] [Third example of inter prediction processing] Fig. 18 is a diagram showing a third example of the outline of the pipeline configuration used in the decoding device 200. In the third example shown in Fig. 18, unlike the first example described in Fig. 11, the decoding device 200 does not use the final motion vector after all processes related to motion vector derivation are performed as the peripheral reference motion vector of the peripheral decoded block used in MVP derivation in the inter prediction process, but uses a provisional motion vector before performing the optimal MVP peripheral search when the inter prediction mode is the FRUC mode, and uses a provisional motion vector before performing the DMVR process when the inter prediction mode is the merge mode.

[0248] In this way, the length of the feedback loop is relatively short by using the tentative motion vector as the peripheral reference motion vector for deriving the MVP in the decoding process of the following block. This allows the peripheral reference motion vector to be fed back at an early point in the third stage. Therefore, if the start timing of the MVP derivation process of the following block can be delayed until the tentative motion vector is determined, the second stage, which must be one long stage in the first example, can be divided into two short stages, the second stage and the third stage.

[0249] Note that this outline of the pipeline configuration is just one example, and some of the processes described may be removed, processes not described may be added, or the way the stages are divided may be changed.

[0250] FIG. 19 is a diagram showing a time sequence of processing timings of stage processing of each block to be decoded in the third example of the schematic pipeline configuration described in FIG.

[0251] Fig. 19, like Fig. 13, shows the processing timing for five blocks to be decoded from the coding unit CU0 to the coding unit CU4 shown in the block division example shown in Fig. 12. The second stage, which was one long stage in the first example, is divided into two short stages, the second stage and the third stage, in the third example. Here, the second stage is shorter than the other stages. This is because the processing in the second stage is only MVP derivation and reference image memory transfer, and the amount of processing is small. Note that it is assumed here that the speed of reference image memory transfer is sufficiently fast.

[0252] The processing of each stage is started after the same stage of the block immediately preceding the processing order is completed. However, in the third example, exceptionally, the second stage is started at a timing after the provisional motion vector is determined in the third stage of the block immediately preceding the processing order. Therefore, for example, the processing of the second stage of the coding unit CU1 is started at time t4 when the first half of the processing of the third stage of the coding unit CU0 is completed. At this time, since the processing time of the second stage of the coding unit CU0 is sufficiently short compared with the other stages, the coding unit CU1 can start the processing of the second stage without waiting time after the processing of the first stage is completed.

[0253] On the other hand, for example, the processing of the second stage of coding unit CU3 starts after the first half of the processing of the third stage of coding unit CU2 is completed, but since the processing time of the second stage of coding unit CU2 is not sufficiently short compared to the other stages, a slight increase in waiting time occurs.

[0254] As a result, compared to the second example described in Fig. 16, a waiting time from time t8 to time t9 occurs between the first stage and the second stage when the coding unit CU4 is processed. However, compared to the first example described in Fig. 13, the waiting time is significantly reduced, and even at the completion of the decoding process of one picture, the processing time including the waiting time is almost the same as the original processing time. Therefore, it is more likely that the processing of all blocks can be completed within the processing time allocated to one picture.

[0255] Fig. 20 is a flowchart of inter prediction processing in the schematic third example of the pipeline configuration described in Fig. 18. The processing shown in Fig. 20 is repeatedly performed in units of prediction blocks, which are processing units of inter prediction processing. The processing shown in Fig. 17 is performed in the encoding device 100 and the decoding device 200. Note that, although the operation of the inter prediction unit 126 included in the encoding device 100 will be mainly described below, the operation of the inter prediction unit 218 included in the decoding device 200 is also similar.

[0256] The process shown in Fig. 20 differs from the first example described in Fig. 14 in the following respects: In the process shown in Fig. 20, the final motion vector derived by each method is not used as the peripheral reference motion vector, but a provisional motion vector, which is an intermediate value in the process of deriving a motion vector by each method, is stored in the peripheral reference motion vector memory.

[0257] This makes it possible to perform feedback of the surrounding reference motion vectors for deriving the MVP in the processing of the subsequent block at an early stage in the processing flow, which increases the possibility of significantly reducing the waiting time of the stages in the pipeline control as described in FIG.

[0258] The provisional motion vectors to be stored in the surrounding reference motion vector memory are derived as follows.

[0259] (1) In normal inter mode, the inter predictor 126 determines the final motion vector obtained by normal motion vector derivation processing as the provisional motion vector.

[0260] (2) In the merge mode, the inter predictor 126 determines, as a provisional motion vector, an MVP (optimum MVP) designated by a merge index among a plurality of MVPs indicated in the MVP list for merging.

[0261] (3) In FRUC mode, the inter prediction unit 126 determines, as a provisional motion vector, the MVP (optimal MVP) that is determined to have the smallest cost value using the bilateral matching method or the template matching method among the multiple MVPs indicated in the FRUC MVP list.

[0262] Also, in FIG. 20, the motion vector stored in the peripheral reference motion vector memory is used as the peripheral reference motion vector for deriving the MVP, but the provisional motion vector may be used as the peripheral reference motion vector in other processes such as loop filter processing. Note that in other processes such as loop filter processing, the final motion vector used for motion compensation may be used instead of the provisional motion vector. Specifically, the final motion vector is derived in the third stage shown in FIG. 18. Therefore, in the processes from the fourth stage onwards, this final motion vector may be used.

[0263] In addition, in the configuration shown in Figure 18, which is a pipeline configuration assuming this processing flow, a provisional motion vector is fed back as a peripheral reference motion vector immediately before the optimal MVP peripheral search processing and DMVR processing, but as long as it is possible to obtain the same information as the provisional motion vector described here, the provisional motion vector may be fed back at other times.

[0264] Note that this processing flow is an example, and some of the described processing may be omitted, or processing not described may be added. For example, in the merge mode or FRUC mode, when the peripheral search process of the optimal MVP is not performed, the provisional motion vector may be the same as the final motion vector.

[0265] Furthermore, the encoding device 100 and the decoding device 200 basically share the same processing flow as described above, with the only difference being whether a signal required for processing is encoded into a stream or decoded from a stream.

[0266] [Effect of the third example of inter-prediction processing] The configuration described with reference to Figures 18 to 20 enables feedback of surrounding reference motion vectors for deriving MVP in processing of the subsequent block at an early stage in the processing flow. Therefore, the waiting time of the stages in the pipeline control that occurred in the first example is significantly reduced. This increases the possibility that even a decoding device with low processing performance can complete the processing of all blocks within the processing time allocated to one picture.

[0267] In addition, compared with the second example described in Fig. 17, when the inter prediction mode is the FRUC mode, the motion vector that has been subjected to the optimal MVP determination process can be used as the peripheral reference motion vector. Therefore, it is possible to refer to a more reliable motion vector, which increases the possibility of improving the coding efficiency.

[0268] [Motion vector for peripheral reference, which is a combination of the final motion vector and the provisional motion vector] In the second example described in FIG. 17 and the third example described in FIG. 20, in addition to storing a provisional motion vector in the surrounding reference motion vector memory, the final motion vector may also be stored therein, as in the first example described in FIG. 14.

[0269] As a result, in the MVP derivation process for the subsequent block, the inter prediction unit 126 can obtain a final motion vector as a peripheral reference motion vector from a block for which a final motion vector can be obtained among the multiple peripheral reference blocks, and obtain a provisional motion vector as a peripheral reference motion vector from a block for which a final motion vector cannot be obtained.

[0270] 21 and 22 are diagrams for explaining neighboring blocks to be referred to for deriving the MVP of the current block. Coding unit CU4 is the current block, coding units CU0 to CU3 are spatial neighboring blocks for which processing has already been completed, and coding unit CU col is a temporal neighboring block belonging to the same position of another picture for which processing has already been completed.

[0271] 21 is a diagram showing an example of a case where the final motion vector cannot be obtained from the block immediately preceding the target block in the processing order. In this example, the inter prediction unit 126 obtains a tentative motion vector for the coding unit CU3 as a peripheral reference motion vector, and obtains a final motion vector for the other blocks as a peripheral reference motion vector. Note that the coding unit CU col is a block belonging to a picture that has already been processed. Therefore, the inter prediction unit 126 obtains a final motion vector for the coding unit CU col as a peripheral reference motion vector.

[0272] FIG. 22 is a diagram showing an example of a case where the final motion vector cannot be obtained for the two blocks immediately preceding the target block in the processing order. In this example, the inter prediction unit 126 obtains tentative motion vectors for the coding units CU2 and CU3 as peripheral reference motion vectors, and obtains final motion vectors for the other blocks as peripheral reference motion vectors. Note that the coding unit CU col is a block belonging to a picture that has already been processed. Therefore, the inter prediction unit 126 obtains the final motion vector for the coding unit CU col as the peripheral reference motion vector.

[0273] In this way, the inter prediction unit 126 obtains the final motion vector from the peripheral reference blocks from which the final motion vector can be obtained as the peripheral reference motion vector, and can derive the MVP by referring to a more reliable motion vector compared to the case where all tentative motion vectors are obtained as the peripheral reference motion vector. This increases the possibility of improving the coding efficiency.

[0274] The inter prediction unit 126 may switch the motion vector that can be referred to depending on whether the boundary of the target block is the boundary of the CTU. For example, when the target block is not adjacent to the upper boundary of the CTU, the inter prediction unit 126 determines whether to refer to the final motion vector or the provisional motion vector for the block adjacent to the upper side of the target block by the method described in FIG. 21 and FIG. 22. On the other hand, when the target block is adjacent to the upper boundary of the CTU, the derivation of the final motion vector for the block adjacent to the upper side of the target block is completed, so that the inter prediction unit 126 always refers to the final motion vector. Similarly, when the target block is adjacent to the left boundary of the CTU, the inter prediction unit 126 always refers to the final motion vector for the block adjacent to the left side of the target block.

[0275] [Combination of the first, second and third examples] A processing flow that combines the first example described in FIG. 14, the second example described in FIG. 17, and the third example described in FIG. 20 may be used.

[0276] As a specific example, for example, when the inter prediction mode is the merge mode, the inter prediction unit 126 may use the final motion vector as the peripheral reference motion vector as in the first example, and when the inter prediction mode is the FRUC mode, the inter prediction unit 126 may use the provisional motion vector before performing the optimum MVP peripheral search as the peripheral reference motion vector as in the third example. Since the processing in the merge mode has a smaller processing amount than the processing in the FRUC mode, even if the final motion vector is fed back as the peripheral reference motion vector after waiting until the final motion vector is determined, the processing of the subsequent block can be completed within the required processing time. Therefore, there is a possibility that the processing can be performed without accumulating the waiting time of the stage in the pipeline control. Furthermore, by making it possible to use a more reliable motion vector as the peripheral reference motion vector in the merge mode, the coding efficiency is more likely to be improved.

[0277] [Switching by low latency mode signal] The inter prediction unit 126 determines whether or not to process the stream to be processed in low latency mode, and if the stream to be processed is to be processed in low latency mode, it may refer to a provisional motion vector as a peripheral reference motion vector in the MVP derivation process, as described in the second or third example, and if the stream to be processed is not to be processed in low latency mode, it may refer to a final motion vector as a peripheral reference motion vector in the MVP derivation process, as described in the first example.

[0278] As a result, in the low-latency mode, the length of the feedback loop for the peripheral reference motion vector is shortened, which increases the possibility of significantly reducing the latency of the stages in the pipeline control. On the other hand, in cases other than the low-latency mode, latency of the stages in the pipeline control occurs, but since a highly reliable motion vector can be referenced as the peripheral reference motion vector, it is highly likely that the coding efficiency can be improved.

[0279] The encoding device 100 generates information indicating whether or not to process in low-delay mode, and encodes the generated information into a stream. The decoding device 200 obtains the information by decoding from the stream, and determines whether or not to process in low-delay mode based on the obtained information. Note that the information is described in a sequence header area, a picture header area, a slice header area, or an auxiliary information area of ​​the stream to be processed.

[0280] For example, the encoding device 100 may switch whether to process in low latency mode depending on the size of the picture to be encoded. For example, when the picture size is small, the encoding device 100 does not set the low latency mode because the number of blocks to be processed is small and there is ample processing time, and when the picture size is large, the encoding device 100 sets the low latency mode because the number of blocks to be processed is large and there is no ample processing time.

[0281] Furthermore, the encoding device 100 may switch whether to process in low-delay mode depending on the processing capability of the decoding device 200, which is the transmission destination of the stream. For example, when the processing capability of the decoding device 200 is high, the encoding device 100 does not set the decoding device 200 to low-delay mode because the decoding device 200 can perform a large amount of processing in a certain processing time. On the other hand, when the processing capability of the decoding device 200 is low, the encoding device 100 sets the decoding device 200 to low-delay mode because the decoding device 200 cannot perform a large amount of processing in a certain processing time.

[0282] Furthermore, the encoding device 100 may switch whether to process in low delay mode depending on the profile or level information assigned to the stream to be encoded. For example, if a profile and level that assume sufficient processing capability of a decoding device are assigned to a stream, the encoding device 100 does not set the stream to low delay mode. On the other hand, if a profile and level that assume insufficient processing capability of a decoding device are assigned to a stream, the encoding device 100 sets the stream to low delay mode.

[0283] In addition, the information indicating whether to process in the low-delay mode to be coded into the stream does not have to be a signal of information directly indicating whether to process in the low-delay mode, and may be coded as a signal having another meaning. For example, the information indicating whether to process in the low-delay mode may be directly associated with the profile and the level, so that it is possible to determine whether to process in the low-delay mode only by the signal indicating the profile and the level.

[0284] As described above, when encoding a target block in an inter prediction mode in which motion search is performed in the decoding device 200 (for example, merge mode or FRUC mode in S201 of FIG. 17), the encoding device 100 according to this embodiment derives a first motion vector for the target block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector for the target block (S204 or S207), and generates a predicted image for the target block by motion compensation using the second motion vector (S208). In deriving the first motion vector (S203 or S205), the encoding device 100 derives the first motion vector for the target block using the first motion vector of a processed block.

[0285] According to this, in the pipeline control, the decoding device 200 can start deriving the first motion vector of the target block after completing the derivation of the first motion vector of the peripheral block, without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared to the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device 200 can be reduced, and the processing delay can be reduced.

[0286] For example, in deriving the first motion vector, the encoding device 100 (i) generates a predictive motion vector list indicating multiple predictive motion vectors using the first motion vector of a processed block, and (ii) determines the first motion vector of the current block from the multiple predictive motion vectors indicated in the predictive motion vector list (for example, S203 or S205 in Figure 17).

[0287] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is merge mode, and the encoding device 100 derives the second motion vector by performing motion search processing on the periphery of the first motion vector (for example, S204 in Figure 17).

[0288] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is FRUC mode, and the encoding device 100 derives the second motion vector by performing motion search processing on the periphery of the first motion vector (for example, S207 in Figure 20).

[0289] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is the FRUC mode, and in deriving the second motion vector, the encoding device 100 (i) determines a third motion vector (optimum MVP) from a plurality of predicted motion vectors indicated in the predicted motion vector list (e.g., S206 in FIG. 17), and (ii) derives the second motion vector by performing motion search processing around the third motion vector (e.g., S207 in FIG. 17).

[0290] For example, in determining the first motion vector (eg, S205 in FIG. 17), the encoding device 100 derives the first motion vector based on the average value or median value for each prediction direction of a plurality of predictor motion vectors indicated in the predictor motion vector list.

[0291] For example, in determining the first motion vector (eg, S205 in FIG. 17), the encoding device 100 determines the predictor motion vector indicated at the top of the predictor motion vector list as the first motion vector among the multiple predictor motion vectors indicated in the predictor motion vector list.

[0292] For example, in generating a motion vector predictor list (for example, S203 or S205 in FIG. 17), the encoding device 100 derives each of a plurality of motion vector predictors using the first motion vector or the second motion vector of a processed block. In determining the first motion vector (for example, S205 in FIG. 17), the encoding device 100 determines the first motion vector from a motion vector predictor candidate derived using the second motion vector among the plurality of motion vector predictors indicated in the motion vector predictor list. This allows the first motion vector to be determined using the highly reliable second motion vector, thereby suppressing a decrease in the reliability of the first motion vector.

[0293] For example, in generating a predicted motion vector list (for example, S203 or S205 in FIG. 17), the encoding device 100 derives a predicted motion vector using a first motion vector of the processed block when the processed block belongs to the same picture as the target block, and derives a predicted motion vector using a second motion vector of the processed block when the processed block belongs to a different picture from the target block. According to this, the encoding device 100 can improve the reliability of the predicted motion vector by using the second motion vector when the processed block belongs to a different picture from the target block.

[0294] For example, when generating a predicted motion vector list (e.g., S203 or S205 in FIG. 17), encoding device 100 determines whether to use the first motion vector of the processed block or the second motion vector of the processed block to derive a predicted motion vector, depending on the position of the processed block relative to the current block.

[0295] For example, when generating a predicted motion vector list (e.g., S203 or S205 in Figure 17), if the processed block belongs to a processing unit different from the processing unit (e.g., CTU) that includes the current block, encoding device 100 uses the second motion vector of the processed block to derive the predicted motion vector.

[0296] For example, when generating a predictive motion vector list (e.g., S203 or S205 in FIG. 17), the encoding device 100 derives a predictive motion vector for a processed block that is N blocks before the target block in processing order and a processed block that is after the processed block that is N blocks before the target block in processing order, using a first motion vector of the processed block, and derives a predictive motion vector for a processed block that is before the processed block that is N blocks before the target block in processing order, using a second motion vector of the processed block.

[0297] According to this, the encoding device 100 can improve the reliability of the predicted motion vector by using the second motion vector for a processed block that precedes the Nth processed block in the processing order.

[0298] For example, N is 1.

[0299] For example, the first motion vector is also referred to in processes other than the derivation of the predicted motion vector, for example, in a loop filter process.

[0300] For example, in the loop filter process, the second motion vector is used.

[0301] For example, when encoding a current block in low delay mode, the encoding device 100 derives the first motion vector of the current block using the first motion vector of a processed block.

[0302] This allows the encoding device 100 to perform appropriate processing depending on whether or not the low delay mode is used.

[0303] For example, the encoding device 100 encodes information indicating whether or not the current block is to be encoded in low delay mode in a sequence header region, a picture header region, a slice header region, or a supplementary information region.

[0304] For example, the encoding device 100 switches whether or not to encode the current block in low delay mode depending on the size of the current picture that includes the current block.

[0305] For example, the encoding device 100 switches whether or not to encode the current block in low delay mode depending on the processing capability of the decoding device.

[0306] For example, the encoding device 100 switches whether to encode the current block in low delay mode, depending on the profile or level information assigned to the current stream.

[0307] When the decoding device 200 according to this embodiment encodes a target block in an inter prediction mode in which motion search is performed in the decoding device 200 (for example, merge mode or FRUC mode in S201 of FIG. 17), it derives a first motion vector of the target block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector of the target block (S204 or S207), and generates a predicted image of the target block by motion compensation using the second motion vector (S208). In deriving the first motion vector (S203 or S205), the decoding device 200 derives the first motion vector of the target block using the first motion vector of a processed block.

[0308] According to this, in the pipeline control, the decoding device 200 can start deriving the first motion vector of the target block after completing the derivation of the first motion vector of the peripheral block, without waiting for the completion of the derivation of the second motion vector of the peripheral block. Therefore, compared to the case where the first motion vector is derived using the second motion vector of the peripheral block, the waiting time in the pipeline control of the decoding device 200 can be reduced, and the processing delay can be reduced.

[0309] For example, in deriving the first motion vector, the decoding device 200 (i) generates a predictive motion vector list indicating multiple predictive motion vectors using the first motion vector of a processed block, and (ii) determines the first motion vector of the current block from the multiple predictive motion vectors indicated in the predictive motion vector list (for example, S203 or S205 in FIG. 17).

[0310] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is merge mode, and in deriving the second motion vector, the decoding device 200 derives the second motion vector by performing motion search processing on the periphery of the first motion vector (for example, S204 in FIG. 17).

[0311] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is FRUC mode, and in deriving the second motion vector, the decoding device 200 derives the second motion vector by performing motion search processing on the periphery of the first motion vector (for example, S207 in Figure 20).

[0312] For example, the inter prediction mode in which motion search is performed in decoding device 200 is FRUC mode, and in deriving the second motion vector, decoding device 200 (i) determines a third motion vector (optimum MVP) from a plurality of predicted motion vectors indicated in the predicted motion vector list (e.g., S206 in FIG. 17), and (ii) derives the second motion vector by performing motion search processing around the third motion vector (e.g., S207 in FIG. 17).

[0313] For example, in determining the first motion vector (eg, S205 in FIG. 17), the decoding device 200 derives the first motion vector based on the average value or median value for each prediction direction of a plurality of predictor motion vectors indicated in the predictor motion vector list.

[0314] For example, in determining the first motion vector (eg, S205 in FIG. 17), the decoding device 200 determines, as the first motion vector, the predictor motion vector indicated at the top of the predictor motion vector list, among the multiple predictor motion vectors indicated in the predictor motion vector list.

[0315] For example, in generating a motion vector predictor list (for example, S203 or S205 in FIG. 17), the decoding device 200 derives each of a plurality of motion vector predictors using the first motion vector or the second motion vector of a processed block. In determining the first motion vector (for example, S205 in FIG. 17), the decoding device 200 determines the first motion vector from a motion vector predictor candidate derived using the second motion vector among the plurality of motion vector predictors indicated in the motion vector predictor list. This allows the first motion vector to be determined using the highly reliable second motion vector, thereby suppressing a decrease in the reliability of the first motion vector.

[0316] For example, in generating a predicted motion vector list (for example, S203 or S205 in FIG. 17), the decoding device 200 derives a predicted motion vector using a first motion vector of the processed block when the processed block belongs to the same picture as the target block, and derives a predicted motion vector using a second motion vector of the processed block when the processed block belongs to a picture different from the target block. According to this, the decoding device 200 can improve the reliability of the predicted motion vector by using the second motion vector when the processed block belongs to a picture different from the target block.

[0317] For example, when generating a predicted motion vector list (e.g., S203 or S205 in FIG. 17), decoding device 200 determines whether to use the first motion vector of the processed block or the second motion vector of the processed block to derive a predicted motion vector, depending on the position of the processed block relative to the current block.

[0318] For example, when generating a predicted motion vector list (e.g., S203 or S205 in FIG. 17), if a processed block belongs to a processing unit different from a processing unit (e.g., a CTU) that includes a current block, decoding device 200 uses the second motion vector of the processed block to derive a predicted motion vector.

[0319] For example, when generating a predicted motion vector list (e.g., S203 or S205 in FIG. 17), decoding device 200 derives a predicted motion vector for a processed block N blocks before the target block in processing order and a processed block after the processed block N blocks before the target block in processing order, using a first motion vector of the processed block, and derives a predicted motion vector for a processed block before the processed block N blocks before the target block in processing order, using a second motion vector of the processed block.

[0320] According to this, the decoding device 200 can improve the reliability of the predicted motion vector by using the second motion vector for a processed block that precedes the Nth processed block in the processing order.

[0321] For example, N is 1.

[0322] For example, the first motion vector is also referred to in processes other than the derivation of the predicted motion vector, for example, in a loop filter process.

[0323] For example, in the loop filter process, the second motion vector is used.

[0324] For example, when decoding a current block in low delay mode, the decoding device 200 derives the first motion vector of the current block using the first motion vector of a processed block.

[0325] This allows the decoding device 200 to perform appropriate processing depending on whether or not the low delay mode is used.

[0326] For example, the decoding device 200 decodes information indicating whether or not to decode the target block in low latency mode from a sequence header area, a picture header area, a slice header area, or an auxiliary information area, and determines whether or not to decode the target block in low latency mode based on the information.

[0327] For example, as shown in Fig. 15, the pipeline structure of the decoding device 200 includes a first stage (second stage in Fig. 15) that performs a process of deriving a first motion vector of a target block, and a second stage (third stage in Fig. 15) that is separate from the first stage and that performs a process of deriving a second motion vector of the target block. The decoding device 200 starts the first stage process of the target block when the first stage process of the block immediately preceding the target block in the processing order is completed, without waiting for the completion of the second stage processes of the blocks up to M blocks before the target block in the processing order.

[0328] For example, as shown in Fig. 18, the pipeline structure of the decoding device 200 includes a first stage (second stage in Fig. 18) for performing a process of deriving a first motion vector of a target block, and a second stage (third stage in Fig. 18) separate from the first stage for performing a process of deriving a second motion vector of the target block. The decoding device 200 starts the first stage process of the target block when the first motion vector of the block M blocks before in the processing order is derived, without waiting for the completion of the second stage processes of the blocks up to M blocks before in the processing order with respect to the target block.

[0329] For example, M is 1.

[0330] Moreover, the encoding device 100 according to this embodiment includes a division unit 102 that divides an image into a plurality of blocks, an intra prediction unit 124 that predicts blocks included in the image using reference pictures included in the image, an inter prediction unit 126 that predicts blocks included in the image using reference blocks included in an image different from the image, a loop filter unit 120 that applies a filter to blocks included in the image, a conversion unit 106 that converts a prediction error between a prediction signal generated by the intra prediction unit 124 or the inter prediction unit 126 and an original signal to generate transformation coefficients, a quantization unit 108 that quantizes the transformation coefficients to generate quantized coefficients, and an entropy encoding unit 110 that generates an encoded bit stream by variable-length coding the quantized coefficients. When encoding a target block in an inter prediction mode in which motion search is performed in the decoding device 200 (for example, merge mode or FRUC mode in S201 of FIG. 17), the inter prediction unit 126 derives a first motion vector of the target block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector of the target block (S204 or S207), and generates a predicted image of the target block by motion compensation using the second motion vector (S208). In deriving the first motion vector, the encoding device 100 derives the first motion vector of the target block using the first motion vector of a processed block.

[0331] In addition, the decoding device 200 according to this embodiment includes a decoding unit (entropy decoding unit 202) that decodes an encoded bitstream and outputs quantized coefficients, an inverse quantization unit 204 that inverse quantizes the quantized coefficients and outputs transform coefficients, an inverse transform unit 206 that inversely transforms the transform coefficients and outputs prediction errors, an intra prediction unit 216 that predicts blocks included in an image using a reference picture included in the image, an inter prediction unit 218 that predicts blocks included in the image using a reference block included in an image other than the image, and a loop filter unit 212 that applies a filter to blocks included in the image. When encoding a target block in an inter prediction mode in which motion search is performed in the decoding device 200 (for example, merge mode or FRUC mode in S201 of FIG. 17), the inter prediction unit 218 derives a first motion vector of the target block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector of the target block (S204 or S207), and generates a predicted image of the target block by motion compensation using the second motion vector (S208). In deriving the first motion vector, the encoding device 100 derives the first motion vector of the target block using the first motion vector of a processed block.

[0332] [Example of an encoding device implementation] Fig. 23 is a block diagram showing an example implementation of the encoding device 100 according to embodiment 1. The encoding device 100 includes a circuit 160 and a memory 162. For example, a number of components of the encoding device 100 shown in Fig. 1 are implemented by the circuit 160 and the memory 162 shown in Fig. 23.

[0333] The circuit 160 is a circuit that performs information processing and is a circuit that can access the memory 162. For example, the circuit 160 is a dedicated or general-purpose electronic circuit that encodes moving images. The circuit 160 may be a processor such as a CPU. The circuit 160 may also be a collection of multiple electronic circuits. For example, the circuit 160 may play the roles of multiple components of the encoding device 100 shown in FIG. 1 and the like, excluding components for storing information.

[0334] The memory 162 is a dedicated or general-purpose memory in which information for the circuit 160 to encode a moving image is stored. The memory 162 may be an electronic circuit and may be connected to the circuit 160. The memory 162 may be included in the circuit 160. The memory 162 may be a collection of multiple electronic circuits. The memory 162 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage or a recording medium, or the like. The memory 162 may be a non-volatile memory or a volatile memory.

[0335] For example, the memory 162 may store a video to be encoded, or a bit string corresponding to the encoded video, or may store a program for the circuit 160 to encode the video.

[0336] Also, for example, the memory 162 may play the role of a component for storing information among the multiple components of the encoding device 100 shown in Fig. 1 etc. Specifically, the memory 162 may play the role of the block memory 118 and the frame memory 122 shown in Fig. 1. More specifically, the memory 162 may store reconstructed blocks, reconstructed pictures, etc.

[0337] In addition, in the encoding device 100, all of the components shown in Fig. 1 and the like may not be implemented, and all of the above-described processes may not be performed. Some of the components shown in Fig. 1 and the like may be included in another device, and some of the above-described processes may be executed by another device. Then, in the encoding device 100, some of the components shown in Fig. 1 and the like are implemented, and some of the above-described processes are performed, so that motion compensation is efficiently performed.

[0338] [Example of implementation of a decryption device] Fig. 24 is a block diagram showing an implementation example of the decoding device 200 according to embodiment 1. The decoding device 200 includes a circuit 260 and a memory 262. For example, a plurality of components of the decoding device 200 shown in Fig. 10 are implemented by the circuit 260 and the memory 262 shown in Fig. 24.

[0339] The circuit 260 is a circuit that performs information processing and is a circuit that can access the memory 262. For example, the circuit 260 is a dedicated or general-purpose electronic circuit that decodes moving images. The circuit 260 may be a processor such as a CPU. The circuit 260 may also be a collection of multiple electronic circuits. For example, the circuit 260 may play the role of multiple components of the decoding device 200 shown in FIG. 10 and the like, excluding components for storing information.

[0340] The memory 262 is a dedicated or general-purpose memory in which information for the circuit 260 to decode a moving image is stored. The memory 262 may be an electronic circuit and may be connected to the circuit 260. The memory 262 may be included in the circuit 260. The memory 262 may be a collection of multiple electronic circuits. The memory 262 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage or a recording medium, or the like. The memory 262 may be a non-volatile memory or a volatile memory.

[0341] For example, the memory 262 may store a bit string corresponding to an encoded video, or a video corresponding to a decoded bit string, or may store a program for the circuit 260 to decode the video.

[0342] Also, for example, the memory 262 may play the role of a component for storing information among the multiple components of the decoding device 200 shown in Fig. 10 etc. Specifically, the memory 262 may play the role of the block memory 210 and the frame memory 214 shown in Fig. 10. More specifically, the memory 262 may store reconstructed blocks, reconstructed pictures, etc.

[0343] In addition, in the decoding device 200, all of the components shown in Fig. 10 and the like may not be implemented, and all of the above-described processes may not be performed. Some of the components shown in Fig. 10 and the like may be included in another device, and some of the above-described processes may be executed by another device. Then, in the decoding device 200, some of the components shown in Fig. 10 and the like are implemented, and some of the above-described processes are performed, so that motion compensation is efficiently performed.

[0344] [supplement] Furthermore, the encoding device 100 and the decoding device 200 in this embodiment may be used as an image encoding device and an image decoding device, or as a video encoding device and a video decoding device, respectively. Alternatively, the encoding device 100 and the decoding device 200 may be used as an inter prediction device (inter prediction device).

[0345] That is, the encoding device 100 and the decoding device 200 may correspond only to the inter prediction unit (inter prediction unit) 126 and the inter prediction unit (inter prediction unit) 218, respectively. Other components such as the transform unit 106 and the inverse transform unit 206 may be included in other devices.

[0346] In the present embodiment, each component may be implemented by dedicated hardware or by executing a software program suitable for each component. Each component may be implemented by a program execution unit such as a CPU or processor reading and executing a software program recorded on a recording medium such as a hard disk or semiconductor memory.

[0347] Specifically, each of the encoding device 100 and the decoding device 200 may include a processing circuitry and a storage device electrically connected to and accessible from the processing circuitry. For example, the processing circuitry corresponds to the circuit 160 or 260, and the storage device corresponds to the memory 162 or 262.

[0348] The processing circuit includes at least one of dedicated hardware and a program execution unit, and executes processing using a storage device. In addition, when the processing circuit includes a program execution unit, the storage device stores a software program to be executed by the program execution unit.

[0349] Here, the software for realizing the encoding device 100 or the decoding device 200 according to the present embodiment is a program as follows.

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

[0351] Furthermore, a process executed by a specific component may be executed by another component. The order in which the processes are executed may be changed, or multiple processes may be executed in parallel. Furthermore, the encoding / decoding device may include the encoding device 100 and the decoding device 200.

[0352] Although the aspects of the encoding device 100 and the decoding device 200 have been described above based on the embodiment, the aspects of the encoding device 100 and the decoding device 200 are not limited to this embodiment. As long as they do not deviate from the spirit of this disclosure, various modifications conceived by a person skilled in the art to this embodiment and forms constructed by combining components in different embodiments may also be included within the scope of the aspects of the encoding device 100 and the decoding device 200.

[0353] This aspect may be implemented in combination with at least a part of other aspects of the present disclosure. Also, some of the processes, some of the configurations of the device, and some of the syntax described in the flowcharts of this aspect may be implemented in combination with other aspects.

[0354] (Embodiment 2) In each of the above embodiments, each of the functional blocks can usually be realized by an MPU, a memory, etc. Furthermore, the processing by each of the functional blocks is usually realized by a program execution unit such as a processor reading and executing software (programs) recorded on a recording medium such as a ROM. The software may be distributed by downloading, etc., or may be recorded on a recording medium such as a semiconductor memory and distributed. Of course, each functional block can also be realized by hardware (dedicated circuitry).

[0355] Furthermore, the processes described in each embodiment may be realized by centralized processing using a single device (system), or may be realized by distributed processing using multiple devices. The processor that executes the above program may be either single or multiple. That is, centralized processing or distributed processing may be performed.

[0356] The aspects of the present disclosure are not limited to the above-described examples, and various modifications are possible, which are also included within the scope of the aspects of the present disclosure.

[0357] Further, here, application examples of the video coding method (image coding method) or video decoding method (image decoding method) shown in each of the above embodiments and a system using the same will be described. The system is characterized by having an image coding device using the image coding method, an image decoding device using the image decoding method, and an image coding / decoding device equipped with both. Other configurations in the system can be appropriately changed depending on the case.

[0358] [Usage example] 25 is a diagram showing the overall configuration of a content supply system ex100 that realizes a content distribution service. The area where communication services are provided is divided into cells of a desired size, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations, are installed in each cell.

[0359] In this content supply system ex100, devices such as a computer ex111, a game machine ex112, a camera ex113, a home appliance 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 configured to connect any of the above elements in combination. Each device may be directly or indirectly connected to each other via a telephone network or short-distance wireless communication, without going through the base stations ex106 to ex110, which are fixed wireless stations. In addition, the streaming server ex103 is connected to each device such as a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, and a smartphone ex115 via the Internet ex101, etc. In addition, the streaming server ex103 is connected to a terminal in a hot spot in an airplane ex117, etc., via a satellite ex116.

[0360] Instead of the base stations ex106 to ex110, wireless access points or hot spots may be used. The streaming server ex103 may be directly connected to the communication network ex104 without going through the Internet ex101 or the Internet service provider ex102, or may be directly connected to an airplane ex117 without going through a satellite ex116.

[0361] The camera ex113 is a device capable of taking still images and videos, such as a digital camera. The smartphone ex115 is a smartphone, a mobile phone, or a PHS (Personal Handyphone System) that is compatible with a mobile communication system generally called 2G, 3G, 3.9G, 4G, and 5G in the future.

[0362] The home appliance ex118 is a refrigerator or an appliance included in a home fuel cell cogeneration system.

[0363] In the content supply system ex100, a terminal having a photographing function is connected to a streaming server ex103 via a base station ex106 or the like, thereby enabling live distribution and the like. In live distribution, a terminal (such as a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, and a terminal in an airplane ex117) performs the encoding process described in each of the above embodiments on still image or video content photographed by a user using the terminal, multiplexes the video data obtained by the encoding with audio data obtained by encoding audio corresponding to the video, and transmits 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.

[0364] Meanwhile, the streaming server ex103 streams the transmitted content data to the requesting client. The client is a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, a terminal in an airplane ex117, or the like, capable of decoding the encoded data. Each device that receives the distributed data decodes and plays back the received data. That is, each device functions as an image decoding device according to one aspect of the present disclosure.

[0365] [Distributed processing] The streaming server ex103 may be a plurality of servers or computers that process, record, and distribute data in a distributed manner. For example, the streaming server ex103 may be realized by a CDN (Contents Delivery Network), and content distribution may be realized by a network that connects a large number of edge servers distributed around the world. In a CDN, an edge server that is physically close to the client is dynamically assigned according to the client. The content is cached and distributed to the edge server, thereby reducing delays. In addition, when an error occurs or the communication state changes due to an increase in traffic, the processing can be distributed among multiple edge servers, the distribution entity can be switched to another edge server, or distribution can be continued by bypassing the part of the network where a failure has occurred, thereby realizing high-speed and stable distribution.

[0366] In addition to the distributed processing of the distribution itself, the encoding processing of the captured data may be performed by each terminal, may be performed by the server side, or may be shared among the terminals. As an example, in the encoding processing, a processing loop is generally performed twice. In the first loop, the complexity of the image or the amount of code is detected for each frame or scene. In the second loop, processing is performed to maintain the image quality and improve the encoding efficiency. For example, the terminal performs the first encoding processing, and the server side that receives the content performs the second encoding processing, thereby improving 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 almost in real time, the data encoded once by the terminal can be received and played back by other terminals, making it possible to perform more flexible real-time distribution.

[0367] As another example, the camera ex113 etc. extracts features from an image, compresses data related to the features as metadata, and transmits the compressed data to the server. The server performs compression according to the meaning of the image, for example, by determining the importance of an object from the features and switching the quantization precision. The feature data is particularly effective in improving the precision and efficiency of motion vector prediction when the server performs recompression. Alternatively, the terminal may perform simple encoding such as VLC (variable length coding), and the server may perform encoding with a large processing load such as CABAC (context-adaptive binary arithmetic coding).

[0368] As another example, in a stadium, a shopping mall, a factory, etc., there may be a plurality of video data in which almost the same scene has been shot by a plurality of terminals. In this case, using the plurality of terminals that shot the video and, as necessary, other terminals and servers that did not shoot the video, coding processing is assigned to each of them, for example, in units of GOPs (Group of Pictures), in units of pictures, or in units of tiles obtained by dividing a picture, for distributed processing. This reduces delays and realizes better real-time performance.

[0369] In addition, since the multiple video data are of almost the same scene, the server may manage and / or instruct the video data shot by each terminal to be mutually referenced. Alternatively, the server may receive the encoded data from each terminal and change the reference relationship between the multiple data, or correct or replace the pictures themselves and re-encode them. This makes it possible to generate a stream with improved quality and efficiency for each piece of data.

[0370] The server may also perform transcoding to change the encoding format of the video data before distributing it. For example, the server may convert an MPEG-based encoding format into a VP-based encoding format, or convert H.264 into H.265.

[0371] In this way, the encoding process can be performed by a terminal or one or more servers. Therefore, in the following, descriptions such as "server" or "terminal" are used to indicate the entity performing the processing, but some or all of the processing performed by the server may be performed by the terminal, and some or all of the processing performed by the terminal may be performed by the server. The same applies to the decoding process.

[0372] [3D, multi-angle] In recent years, it has become common to integrate and use images or videos of different scenes or the same scene taken from different angles by multiple devices such as cameras ex113 and / or smartphones ex115 that are almost synchronized with each other. The videos taken by the devices are integrated based on the relative positional relationship between the devices that is obtained separately, or on areas where feature points included in the videos match.

[0373] The server may not only encode 2D video, but also encode still images automatically or at a time specified by the user based on scene analysis of the video and transmit them to the receiving terminal. If the server can obtain the relative positional relationship between the shooting terminals, the server may generate a 3D shape of the scene based on not only 2D video but also images of the same scene captured from different angles. The server may separately encode 3D data generated by point clouds, etc., or may generate images to be transmitted to the receiving terminal by selecting or reconstructing images from images captured by multiple terminals based on the results of recognizing or tracking people or objects using the 3D data.

[0374] In this way, the user can enjoy a scene by selecting any video corresponding to each shooting terminal, or can enjoy content in which a video from any viewpoint is cut out from 3D data reconstructed using multiple images or videos. Furthermore, sound may be collected from multiple different angles, just like the video, and the server may multiplex the sound from a specific angle or space with the video and transmit it in accordance with the video.

[0375] In recent years, content that associates the real world with a virtual world, such as Virtual Reality (VR) and Augmented Reality (AR), has also become popular. In the case of VR images, the server creates viewpoint images for the right eye and the left eye, respectively, and may perform encoding that allows reference between each viewpoint video using Multi-View Coding (MVC) or the like, or may encode them as separate streams without mutual reference. When decoding the separate streams, it is preferable to play them in synchronization with each other so that a virtual three-dimensional space is reproduced according to the user's viewpoint.

[0376] In the case of an AR image, the server superimposes virtual object information in the virtual space on camera information in the real space based on the three-dimensional position or the movement of the user's viewpoint. The decoding device may obtain or hold virtual object information and three-dimensional data, generate a two-dimensional image according to the movement of the user's viewpoint, and smoothly connect them to create superimposed data. Alternatively, the decoding device may transmit the movement of the user's viewpoint to the server in addition to a request for virtual object information, and the server may create superimposed data according to the movement of the viewpoint received from the three-dimensional data held by the server, encode the superimposed data, and deliver it to the decoding device. Note that the superimposed data has an α value indicating the transparency in addition to RGB, and the server may set the α value of the part other than the object created from the three-dimensional data to 0, etc., and encode the data in a state in which the part is transparent. Alternatively, the server may generate data in which a predetermined value of RGB value is set to the background like a chromakey, and the part other than the object is the background color.

[0377] Similarly, the decoding process of the distributed data may be performed by each client terminal, or may be performed by the server side, or may be shared among them. 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 other terminals, decoded, and the decoded signal may be transmitted to a device having a display. By distributing the processing and selecting appropriate content regardless of the performance of the communication-enabled terminals themselves, data with good image quality can be reproduced. In another example, while large-sized image data is received by a TV or the like, a part of the area, such as tiles into which the picture is divided, may be decoded and displayed on the viewer's personal terminal. This allows the viewer to share the overall picture while checking his / her own area of ​​responsibility or the area he / she wants to check in more detail at hand.

[0378] In the future, it is expected that content will be seamlessly received by switching appropriate data for the currently connected communication using delivery system standards such as MPEG-DASH under circumstances where multiple short-distance, medium-distance, or long-distance wireless communication is available, regardless of whether indoors or outdoors. This allows users to freely select and switch in real time not only their own terminals but also decoding devices or display devices such as displays installed indoors and outdoors. In addition, decoding can be performed while switching the decoding device and the display device based on the user's location information, etc. This makes it possible to move while displaying map information on the wall or part of the ground of a neighboring building where a displayable device is embedded while moving to a destination. It is also possible to switch the bit rate of the received data based on the accessibility of the encoded data on the network, such as when the encoded data is cached on a server that can be accessed from the receiving terminal in a short time, or when it is copied to an edge server in a content delivery service.

[0379] [Scalable Coding] The switching of contents will be described using a scalable stream compressed and coded by applying the video coding method shown in each of the above embodiments, as shown in FIG. 26. The server may have multiple streams with the same content but different qualities as individual streams, but may be configured to switch contents by taking advantage of the characteristics of a temporal / spatial scalable stream realized by coding in layers as shown in the figure. In other words, the decoding side can freely switch between low-resolution content and high-resolution content by determining which layer to decode according to an internal factor such as performance and an external factor such as the state of the communication band. For example, if you want to continue watching a video you were watching on your smartphone ex115 while on the move on a device such as an Internet TV after you get home, the device can decode the same stream up to a different layer, reducing the burden on the server side.

[0380] Furthermore, as described above, in addition to the configuration that realizes scalability in which pictures are coded for each layer and an enhancement layer exists above a base layer, the enhancement layer may include meta-information based on image statistics, etc., and the decoding side may generate high-quality content by super-resolving pictures of the base layer based on the meta-information. Super-resolution may be either an improvement in the signal-to-noise ratio at the same resolution or an increase in resolution. The meta-information includes information for specifying linear or nonlinear filter coefficients used in the super-resolution process, or information for specifying parameter values ​​in the filter process, machine learning, or least squares calculation used in the super-resolution process.

[0381] Alternatively, a picture may be divided into tiles or the like according to the meaning of an object in an image, and the decoding side may select a tile to decode to decode only a part of the area. Also, by storing the attribute of an object (person, car, ball, etc.) and its position in a video (coordinate position in the same image, etc.) as meta information, the decoding side can identify the position of a desired object based on the meta information and determine the tile containing the object. For example, as shown in FIG. 27, the meta information is stored using a data storage structure different from pixel data such as an SEI message in HEVC. This meta information indicates, for example, the position, size, or color of the main object.

[0382] Meta information may also be stored in units consisting of multiple pictures, such as streams, sequences, or random access units, etc. This allows the decoding side to obtain the time when a specific person appears in the video, and by combining this with picture-by-picture information, it is possible to identify the picture in which an object exists and the position of the object within the picture.

[0383] [Web page optimization] FIG. 28 is a diagram showing an example of a display screen of a web page in a computer ex111 or the like. FIG. 29 is a diagram showing an example of a display screen of a web page in a smartphone ex115 or the like. As shown in FIG. 28 and FIG. 29, a web page may include multiple link images that are links to image content, and the appearance of the web page differs depending on the device used to view the page. When multiple link images are visible on the screen, the display device (decoding device) displays a still image or I-picture that each content has as a link image, displays a video such as a gif animation using multiple still images or I-pictures, or receives only the base layer to decode and display the video, until the user explicitly selects the link image, or until the link image approaches the center of the screen or the entire link image enters the screen.

[0384] When a link image is selected by a user, the display device gives top priority to decoding the base layer. If the HTML constituting the web page contains information indicating that the content is scalable, the display device may decode up to the enhancement layer. In order to ensure real-time performance, before selection or when the communication bandwidth is very tight, the display device decodes and displays only forward-reference pictures (I-pictures, P-pictures, and B-pictures with forward reference only), thereby reducing the delay between the decoding time of the first picture and the display time (the delay from the start of decoding the content to the start of display). The display device may also ignore the reference relationship between pictures and roughly decode all B-pictures and P-pictures with forward reference, and perform normal decoding as the number of received pictures increases over time.

[0385] [Automatic driving] Furthermore, when transmitting and receiving still image or video data such as 2D or 3D map information for automatic driving or driving assistance of a vehicle, the receiving terminal may receive weather or construction information as meta information in addition to image data belonging to one or more layers, and may associate and decode these. Note that the meta information may belong to a layer, or may simply be multiplexed with the image data.

[0386] In this case, since a car, drone, or airplane including a receiving terminal moves, the receiving terminal can realize seamless reception and decoding while switching between base stations ex106 to ex110 by transmitting the location information of the receiving terminal at the time of a reception request. Also, the receiving terminal can dynamically switch how much meta information to receive or how much to update map information according to the user's selection, the user's situation, or the state of the communication band.

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

[0388] [Distribution of personal content] Furthermore, the content supply system ex100 allows not only high-quality, long-duration content from video distributors, but also low-quality, short-duration content from individuals via unicast or multicast distribution. It is expected that such personal content will continue to increase in the future. To improve the quality of personal content, the server may perform editing before encoding. This can be achieved, for example, by the following configuration.

[0389] During shooting, in real time or after accumulating, the server performs recognition processing such as shooting errors, scene search, semantic analysis, and object detection from the original image 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 that are less bright than other pictures or are out of focus, emphasizes object edges, changes color, and performs other editing. The server encodes the edited data based on the editing result. It is also known that if the shooting time is too long, the viewer rating will decrease, and the server may automatically clip not only scenes of less importance as described above but also scenes with little movement based on the image processing result so that the content will be within a specific time range depending on the shooting time. Alternatively, the server may generate a digest based on the result of the semantic analysis of the scene and encode it.

[0390] In addition, there are cases where personal contents contain images that infringe copyrights, moral rights, portrait rights, etc., and the scope of sharing may exceed the intended scope, which may be inconvenient for individuals. Therefore, for example, the server may change the image to an unfocused image of a person's face on the periphery of the screen, or the inside of a house, and encode it. The server may also recognize whether the image to be encoded contains a face of a person other than a person registered in advance, and if so, may perform processing such as blurring the face. Alternatively, as pre-processing or post-processing of encoding, the user may specify a person or background area that he or she wishes to process in the image from the viewpoint of copyright, etc., and the server may replace the specified area with another image or blur the focus. If it is a person, the image of the face part can be replaced while tracking the person in the video.

[0391] In addition, since viewing of personal content with a small amount of data requires real-time performance, the decoding device first receives the base layer as a top priority, and performs decoding and playback, although this depends on the bandwidth. The decoding device may receive an enhancement layer during this time, and when playback is looped or otherwise played two or more times, play high-quality video including the enhancement layer. In this way, if the stream is scalably encoded, it is possible to provide an experience in which the video is rough when not selected or when viewing begins, but 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 the first time and a second stream encoded with reference to the first video are configured as one stream.

[0392] [Other use cases] Moreover, these encoding or decoding processes are generally processed in an LSIex500 possessed by each terminal. The LSIex500 may be a single chip or may be configured with multiple chips. Note that software for encoding or decoding moving images may be incorporated into some kind of recording medium (such as a CD-ROM, a flexible disk, or a hard disk) that can be read by the computer ex111 or the like, and the encoding or decoding process may be performed using the software. Furthermore, if the smartphone ex115 has a camera, video data captured by the camera may be transmitted. The video data in this case is data that has been encoded by the LSIex500 possessed by the smartphone ex115.

[0393] 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 downloads a codec or application software, and then acquires and plays the content.

[0394] Furthermore, at least one of the video encoding device (image encoding device) or video decoding device (image decoding device) of each of the above embodiments can be incorporated into a digital broadcasting system, not limited to the content supply system ex100 via the Internet ex101. Since multiplexed data in which video and audio are multiplexed is carried and transmitted over broadcasting radio waves using a satellite or the like, there is a difference in that it is more suitable for multicast compared to the content supply system ex100, which has a configuration that is easy to use for unicast, but similar applications are possible with regard to the encoding process and decoding process.

[0395] [Hardware configuration] FIG. 30 is a diagram showing a smartphone ex115. FIG. 31 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 taking videos and still images, and a display unit ex458 for displaying the video captured by the camera unit ex465 and the decoded data of the video received by the antenna ex450. 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 encoded data such as captured video or still images, recorded audio, received video or still images, and e-mail, or decoded data, and a slot unit ex464 which is an interface unit with a SIMex468 for identifying a user and authenticating access to various data including a network. In addition, an external memory may be used instead of the memory unit ex467.

[0396] In addition, a main control unit ex460, which comprehensively controls the display unit ex458 and the operation unit ex466, etc., is connected to 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 / separation unit ex453, an audio signal processing unit ex454, a slot unit ex464, and a memory unit ex467 via a bus ex470.

[0397] When the power key is turned on by a user's operation, the power supply circuit unit ex461 starts up the smartphone ex115 into an operational state by supplying power to each unit from the battery pack.

[0398] The smartphone ex115 performs processes such as telephone calls and data communications under the control of a main control unit ex460 having a CPU, a ROM, and a RAM. During a telephone call, a voice signal collected by a voice input unit ex456 is converted into a digital voice signal by a voice signal processing unit ex454, which is then subjected to spectrum spreading processing by a modulation / demodulation unit ex452, and the digital-to-analog conversion processing and frequency conversion processing by a transmission / reception unit ex451 is then transmitted via an antenna ex450. In addition, the received data is amplified, and subjected to frequency conversion processing and analog-to-digital conversion processing, and the spectrum inverse spreading processing by a modulation / demodulation unit ex452 is then performed, and the analog voice signal is converted into an analog voice signal by a voice signal processing unit ex454, which is then output from a voice output unit ex457. During a data communication mode, text, still images, or video data is sent to the main control unit ex460 via an operation input control unit ex462 by operating an operation unit ex466 or the like of the main unit, and transmission and reception processing is performed in the same manner. 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 / separation unit ex453. The audio signal processing unit ex454 also encodes the audio signal collected by the audio input unit ex456 while the camera unit ex465 is capturing the video or still images, and sends the encoded audio data to the multiplexing / separation unit ex453. The multiplexing / separation unit ex453 multiplexes the encoded video data and the encoded audio data by a predetermined method, and performs modulation and conversion processing in the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the transmission / reception unit ex451, and transmits the data via the antenna ex450.

[0399] When receiving a video attached to an e-mail 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 / separation 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, and 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 video encoding method shown in each of the above embodiments, and displays the video or still image contained in the linked video file on the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 also decodes the audio signal, and audio is output from the audio output unit ex457. Note that since real-time streaming is widespread, there may be cases where audio playback is socially inappropriate depending on the user's situation. Therefore, as an initial value, a configuration in which only video data is played without playing audio signals is preferable. The audio may be played in sync only when the user performs an operation such as clicking on the video data.

[0400] In addition, although the smartphone ex115 has been described as an example here, three types of implementation formats are possible for the terminal: a transmitting / receiving terminal having both an encoder and a decoder, a transmitting terminal having only an encoder, and a receiving terminal having only a decoder. Furthermore, in the digital broadcasting system, multiplexed data in which audio data and the like are multiplexed with video data is received or transmitted, but the multiplexed data may include text data related to the video in addition to audio data, or the video data itself may be received or transmitted instead of the multiplexed data.

[0401] Although the main control unit ex460 including the CPU controls the encoding or decoding process, terminals often have a GPU. Therefore, a configuration may be used in which a wide area is processed collectively by utilizing the performance of the GPU using a memory shared by the CPU and GPU, or a memory whose addresses are managed so that they can be used in common. This can shorten the encoding time, ensure real-time performance, and achieve low latency. In particular, it is efficient to perform the processing of motion search, deblocking filter, SAO (Sample Adaptive Offset), and transformation and quantization collectively in units such as pictures by the GPU, rather than by the CPU.

[0402] This aspect may be implemented in combination with at least a part of other aspects of the present disclosure. Also, some of the processes, some of the configurations of the device, and some of the syntax described in the flowcharts of this aspect may be implemented in combination with other aspects. [Industrial Applicability]

[0403] The present disclosure is applicable to, for example, television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, video conference systems, electronic mirrors, and the like. [Explanation of symbols]

[0404] 100 Encoding device 102 Division 104 Subtraction section 106 Conversion unit 108 Quantization section 110 Entropy coding unit 112, 204 Inverse quantization section 114, 206 Inverse conversion unit 116, 208 Addition section 118, 210 Block Memory 120, 212 Loop filter section 122, 214 frame memory 124, 216 Intra prediction section 126, 218 Inter prediction section 128, 220 Predictive control unit 160, 260 circuits 162, 262 memory 200 Decryption device 202 Entropy Decoding Unit

Claims

1. The circuit, A memory, The circuitry performs, using the memory, an inter prediction process, deriving a first motion vector for a first block to be processed using a motion vector of a previous block to be processed; deriving a second motion vector for the first processing target block by performing a motion search process on a peripheral area of ​​the first motion vector, the motion search process including searching for a position having a lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first block to be processed by motion compensation using the second motion vector; When a second target block that is a block to be processed that follows the first target block to be processed belongs to the same picture as the first target block to be processed, deriving a third motion vector of the second target block to be processed using the first motion vector of the first target block to be processed; deriving a third motion vector for the second block to be processed using the second motion vector for the first block to be processed when the second block to be processed belongs to a different picture from the first block to be processed; deriving a fourth motion vector for the second processing target block by performing a motion search process on a peripheral area of ​​the third motion vector; generating a predicted image of the second block to be processed by motion compensation using the fourth motion vector; Encoding device.

2. deriving a first motion vector for a first block to be processed using a motion vector of a previous block to be processed; deriving a second motion vector for the first processing target block by performing a motion search process on a peripheral area of ​​the first motion vector, the motion search process including searching for a position having a lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first block to be processed by motion compensation using the second motion vector; When a second target block that is a block to be processed that follows the first target block to be processed belongs to the same picture as the first target block to be processed, deriving a third motion vector of the second target block to be processed using the first motion vector of the first target block to be processed; deriving a third motion vector for the second block to be processed using the second motion vector for the first block to be processed when the second block to be processed belongs to a different picture from the first block to be processed; deriving a fourth motion vector for the second processing target block by performing a motion search process on a peripheral area of ​​the third motion vector; generating a predicted image of the second block to be processed by motion compensation using the fourth motion vector; Encoding method.

3. The circuit, A memory, The circuitry performs, using the memory, an inter prediction process, deriving a first motion vector for a first block to be processed using a motion vector of a previous block to be processed; deriving a second motion vector for the first processing target block by performing a motion search process on a peripheral area of ​​the first motion vector, the motion search process including searching for a position having a lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first block to be processed by motion compensation using the second motion vector; When a second target block that is a block to be processed that follows the first target block to be processed belongs to the same picture as the first target block to be processed, deriving a third motion vector of the second target block to be processed using the first motion vector of the first target block to be processed; deriving a third motion vector for the second block to be processed using the second motion vector for the first block to be processed when the second block to be processed belongs to a different picture from the first block to be processed; deriving a fourth motion vector for the second processing target block by performing a motion search process on a peripheral area of ​​the third motion vector; generating a predicted image of the second block to be processed by motion compensation using the fourth motion vector; Decryption device.

4. deriving a first motion vector for a first block to be processed using a motion vector of a previous block to be processed; deriving a second motion vector for the first processing target block by performing a motion search process on a peripheral area of ​​the first motion vector, the motion search process including searching for a position having a lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first block to be processed by motion compensation using the second motion vector; When a second target block that is a block to be processed that follows the first target block to be processed belongs to the same picture as the first target block to be processed, deriving a third motion vector of the second target block to be processed using the first motion vector of the first target block to be processed; deriving a third motion vector for the second block to be processed using the second motion vector for the first block to be processed when the second block to be processed belongs to a different picture from the first block to be processed; deriving a fourth motion vector for the second processing target block by performing a motion search process on a peripheral area of ​​the third motion vector; generating a predicted image of the second block to be processed by motion compensation using the fourth motion vector; Decryption method.

Images