Encoding device, encoding method, decoding device, 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 known as HEVC (High Efficiency Video Coding). [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 uses the memory to, in inter prediction processing, derive a first motion vector for a first block to be processed using a motion vector of a past block to be processed, derive a second motion vector for the first block to be processed by performing motion estimation processing 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, generate a predicted image for the first block to be processed by motion compensation using the second motion vector, and generate a predicted image for a second block to be processed that is a block to be processed after the first block to be processed. If the block belongs to the same picture as the first block to be processed, a third motion vector of the second block to be processed is derived using the first motion vector of the first block to be processed; if the second block to be processed belongs to a different picture from the first block to be processed, a third motion vector of the second block to be processed is derived using the second motion vector of the first block to be processed, and a fourth motion vector of the second block to be processed is derived by performing a motion search process on a peripheral area of ​​the third motion vector, and a predicted image of the second block to be processed is generated by motion compensation using the fourth motion vector.

[0007] These comprehensive or specific aspects may be realized as 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 as any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium. [Effects 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 explanation 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. [Figure 2] FIG. 2 is a diagram showing an example of block division according to the first embodiment. [Figure 3] FIG. 3 is a table showing the transformation basis functions corresponding to each transformation 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 ALF. [Figure 4C] FIG. 4C is a diagram showing another example of the shape of the filter used in 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 using the OBMC process. [Figure 5C] FIG. 5C is a conceptual diagram for explaining an outline of the predicted image correction process using 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 outline of the motion vector derivation process in the merge mode. [Figure 9C]FIG. 9C is a conceptual diagram for explaining an outline of the DMVR process. [Figure 9D] FIG. 9D is a diagram for explaining an outline of a predicted image generation 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. [Figure 11] FIG. 11 is a schematic diagram illustrating 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 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 inter prediction processing in a first example of a pipeline configuration according to the first embodiment. [Figure 15] FIG. 15 is a schematic diagram illustrating 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 the inter prediction process in the second example of the pipeline configuration according to the first embodiment. [Figure 18] FIG. 18 is a schematic diagram illustrating 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 the 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 an encoding device. [Figure 24] FIG. 24 is a block diagram showing an implementation example of a decoding device. [Figure 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 for scalable coding. [Figure 27] FIG. 27 is a diagram showing an example of a coding structure for 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. [Figure 30] FIG. 30 is a diagram illustrating an example of a smartphone. [Figure 31] FIG. 31 is a block diagram showing an example of the configuration of a smartphone. DETAILED DESCRIPTION OF THE INVENTION

[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 the 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 current 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 latency in the pipeline control of the decoding device can be reduced, and processing delay can be reduced.

[0012] For example, in deriving the first motion vector, (i) a predicted motion vector list indicating multiple predicted motion vectors may be 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 multiple 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 merge mode, and the second motion vector may be derived by performing motion search processing on the 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 motion search processing around 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 the second motion vector is derived by (i) determining a third motion vector from the plurality of predicted motion vectors indicated in the predicted motion vector list, and (ii) performing motion search processing 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 motion vector predictors indicated in the motion vector predictor list.

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

[0018] For example, when 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 when determining the first motion vector, the first motion vector may be determined from a predicted motion vector candidate derived using the second motion vector among the multiple predicted motion vectors indicated in the predicted 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 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 if the processed block belongs to the same picture as the target block, the predicted 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, the predicted 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, when 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, when generating the predicted 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, the predicted 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 predicted motion vector may be derived using a second motion vector of the processed block.

[0024] According to 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 encoding the current block in low latency mode, the first motion vector of the current block may be derived using the 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 delay 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 current block in the low delay mode may be switched depending on the size of the current picture including the current 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, it may be possible to switch whether or not to encode the current block in the low delay mode depending on the profile or level information assigned to the stream to be encoded.

[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 the 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 the 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 current 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 latency in the pipeline control of the decoding device can be reduced, and processing delay can be reduced.

[0037] For example, in deriving the first motion vector, (i) a predicted motion vector list indicating multiple predicted motion vectors may be 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 multiple 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 merge mode, and the second motion vector may be derived by performing motion search processing on the 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 motion search processing around 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 the second motion vector is derived by (i) determining a third motion vector from the plurality of predicted motion vectors indicated in the predicted motion vector list, and (ii) performing motion search processing 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, when determining the first motion vector, the predictor motion vector indicated at the top of the predictor motion vector list may be determined as the first motion vector from among the plurality of predictor motion vectors indicated in the predictor motion vector list.

[0043] For example, when 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 when determining the first motion vector, the first motion vector may be determined from a predicted motion vector candidate derived using the second motion vector among the multiple predicted motion vectors indicated in the predicted 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 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 if the processed block belongs to the same picture as the target block, the predicted 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, the predicted 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, when 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, when generating the predicted 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, the predicted 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 predicted motion vector may be derived using a second motion vector of the processed block.

[0049] According to 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 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 the first motion vector of the processed block.

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

[0056] For example, information indicating whether 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 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 the first stage processing of the target block may be started when the first stage processing of the block immediately preceding the target block in processing order is completed, without waiting for the second stage processing of the blocks up to M blocks before the target block in processing order to be completed.

[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 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 in processing order.

[0059] For example, M may be 1.

[0060] In one embodiment of the encoding method of the present disclosure, when a target block is encoded in an inter-prediction mode that performs motion search in a decoding device, a first motion vector for the target block is derived, the derived first motion vector is stored in the memory, a second motion vector for the target block is derived, and a predicted image of the target block is generated by motion compensation using the second motion vector, and in deriving the first motion vector, the first motion vector for the target block is derived using the 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 current 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 latency in the pipeline control of the decoding device can be reduced, and 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 estimation 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 the first motion vector of a processed block.

[0063] According to this, in the pipeline control of 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 current block can be started 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 latency in the pipeline control of the decoding device can be reduced, and processing delay can be reduced.

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

[0065] Hereinafter, the embodiments will be specifically described with reference to the drawings.

[0066] The embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, component placement and connection configurations, steps, and step order 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 the independent claims that represent the highest concepts 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 decoding device of the first embodiment, among the multiple components constituting the encoding device or 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) Any modification, such as addition, replacement, or deletion, of the functions or processes performed by some of the components constituting the encoding device or decoding device of the first embodiment may be made to the encoding device or decoding device, and then components corresponding to the components described in each aspect of the present disclosure may be replaced with the components described in each aspect of the present disclosure. (3) The method implemented by the encoding device or decoding device of the first embodiment may be modified by adding a process and / or replacing or deleting some of the processes included in the method, and then replacing 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) A component having some of the functions of some of the components constituting the encoding device or decoding device of the first embodiment, or a component that performs some of the processing performed by some of the components constituting the encoding device or decoding device of the first embodiment, is implemented in combination with a component described in each aspect of the present disclosure, a component having some of the functions of the components described in each aspect of the present disclosure, or a component that performs some of the processing performed by the components described in each aspect of the present disclosure. (6) In the method implemented by the encoding device or decoding device of the first embodiment, among the multiple processes included in the method, processes corresponding to the processes described in each aspect of the present disclosure are replaced with the processes described in each aspect of the present disclosure. (7) Some of the processes included in the method implemented by the encoding device or 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, they may be implemented in a device used for a purpose different from the video / image encoding device or video / image decoding device disclosed in Embodiment 1, 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, an overview of a coding device according to Embodiment 1 will be described. 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 memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as the division unit 102, the subtraction unit 104, the 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. Alternatively, the encoding device 100 may be realized as one or more dedicated electronic circuits corresponding to the division unit 102, the subtraction unit 104, the 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 are sometimes 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 are sometimes called coding units (CUs), prediction units (PUs), or transform units (TUs). Note that in this embodiment, there is no need to distinguish between CUs, PUs, and TUs, and some or all of the blocks in a picture may serve as 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 and 15 (binary tree block division).

[0080] The lower-left 64x64 block is divided into four square 32x32 blocks (quadtree block decomposition). Of the four 32x32 blocks, the upper-left and lower-right blocks are further divided. The upper-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 decomposition). The lower-right 32x32 block is divided horizontally into two 32x16 blocks (binary tree block decomposition). As a result, the lower-left 64x64 block is divided into 16x32 block 16, two 16x16 blocks 17 and 18, two 32x32 blocks 19 and 20, and two 32x16 blocks 21 and 22.

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

[0082] 2, block 10 is divided into 13 variable-sized blocks 11 to 23 based on recursive quad-tree and binary tree block division. This type of 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 referred to as a residual) 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 an image may also be referred to as a sample.

[0086] [Conversion section] The transform unit 106 transforms the spatial domain prediction errors into frequency domain transform coefficients 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 spatial domain prediction errors.

[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 is sometimes 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. Fig. 3 is a table showing transform basis functions corresponding to each transform type. In Fig. 3, N represents the number of input pixels. Selection of a transform type from among these multiple transform types may depend, for example, on the type of prediction (intra prediction or inter prediction) or the intra prediction mode.

[0089] Information indicating whether EMT or AMT is applied (e.g., referred to as an AMT flag) and information indicating the selected transformation type are signaled at the CU level. Note that 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).

[0090] Furthermore, the transform unit 106 may retransform the transform coefficients (transform results). Such retransformation may be referred to as an adaptive secondary transform (AST) or a non-separable secondary transform (NSST). For example, the transform unit 106 performs retransformation for each sub-block (e.g., 4x4 sub-block) included in a block of transform coefficients corresponding to intra-prediction errors. Information indicating whether or not to apply NSST and information regarding the transform matrix used for NSST are signaled at the CU level. Note that signaling of this information does not need to be limited to the CU level, and may be at other levels (e.g., the 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 all at once.

[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] Similarly, a non-separable transformation is one that treats a 4x4 input block as a single array with 16 elements and then performs multiple Givens rotations on that array (Hypercube Givens Transform).

[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 quantization parameters (QP) corresponding to the scanned transform coefficients. The quantization unit 108 then 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 quantizing / dequantizing the transform coefficients. For example, the predetermined scanning order is defined as an ascending order (low frequency to high frequency) or a descending order (high frequency to low frequency).

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

[0097] [Entropy coding section] 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. The inverse quantization unit 112 then 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. In other words, the restored prediction error includes a quantization error.

[0101] [Adder] 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 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] ALF applies a least squares error filter to remove coding artifacts, for example, for each 2x2 sub-block in the current block, one filter selected from 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 sub-blocks are classified 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 by, for example, comparing gradients in multiple directions (e.g., horizontal, vertical, and two diagonal directions), and the gradient activity value A is derived by, for example, 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 filter shape used in ALF is, for example, a circularly symmetric shape. FIGS. 4A to 4C are diagrams showing several examples of filter shapes used in ALF. FIG. 4A shows a 5x5 diamond-shaped filter, FIG. 4B shows a 7x7 diamond-shaped filter, and FIG. 4C shows a 9x9 diamond-shaped filter. Information indicating the filter shape is signaled at the picture level. Note that signaling of the information indicating the filter shape does not need to be limited to the picture level, and may be at other levels (e.g., sequence level, slice level, tile level, CTU level, or CU level).

[0109] Whether ALF is turned on or off is determined, for example, at the picture level or the CU level. For example, whether ALF is applied to luminance is determined at the CU level, and whether ALF is applied to chrominance is determined at the picture level. Information indicating whether ALF is turned on or off is signaled at the picture level or the CU level. Note that signaling of information indicating whether ALF is turned on or off does not need to be 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 also 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 is sometimes called a frame buffer. Specifically, the frame memory 122 stores the reconstructed blocks 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 referred to as intra-picture prediction) of the current block with reference to blocks in the current picture stored in the block memory 118. Specifically, the intra prediction unit 124 generates the 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, the 33 prediction modes defined in the H.265 / HEVC standard. Note that the multiple directional prediction modes may also include 32 prediction modes in addition to the 33 directions (65 directional prediction modes in total). Fig. 5A is a diagram showing 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra prediction. Solid arrows represent the 33 directions defined in the H.265 / HEVC standard, and dashed arrows represent the additional 32 directions.

[0116] Note that a luminance block may be referenced in intra prediction of a chrominance block. That is, the chrominance component of the current block may be predicted based on the luminance component of the current block. This type of intra prediction is sometimes called CCLM (cross-component linear model) prediction. An intra prediction mode of a chrominance block that references such a luminance block (e.g., called a CCLM mode) may be added as one of the intra prediction modes for the chrominance block.

[0117] The intra prediction unit 124 may correct pixel values ​​after intra prediction based on gradients of reference pixels in the horizontal / vertical directions. Intra prediction involving such correction is sometimes called PDPC (position dependent intra prediction combination). Information indicating whether PDPC is applied (e.g., called a PDPC flag) is signaled, for example, at the CU level. Note that 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 referred to as inter prediction) on the current block with reference to a reference picture stored in the frame memory 122 that is different from the current picture. The inter prediction is performed in units of the current block or sub-blocks (e.g., 4x4 blocks) within the current block. For example, the inter prediction unit 126 performs motion estimation on the current block or sub-block within the reference picture. The inter prediction unit 126 then generates an inter prediction signal for the current block or sub-block by performing motion compensation using motion information (e.g., a motion vector) obtained by the motion estimation. The inter prediction unit 126 then outputs the generated inter prediction signal to the prediction control unit 128.

[0119] The motion information used for 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] Note that an inter-prediction signal may be generated using not only the motion information of the current block obtained by motion estimation, but also the motion information of adjacent blocks. Specifically, an inter-prediction signal may be generated for each sub-block in the current block by weighting and adding a prediction signal based on the motion information obtained by motion estimation and a prediction signal based on the motion information of adjacent blocks. 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 an OBMC block size) is signaled at the sequence level. Also, information indicating whether the OBMC mode is applied (e.g., called an OBMC flag) is signaled at the CU level. Note that the signaling level of this information is not limited to the sequence level and the CU level, and may be other levels (e.g., the 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 outline of the predictive image correction process using the OBMC process.

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

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

[0125] Similarly, the motion vector (MV_U) of the already coded upper adjacent block is applied to the block to be coded 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 then 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 correction is performed more than two times using the right adjacent block or the lower adjacent block.

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

[0128] Although the process of correcting a predicted image 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 superimposed to form the final predicted image.

[0129] The target 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 for determining whether to apply OBMC processing, for example, there is a method using obmc_flag, which is a signal indicating whether to apply OBMC processing. As a specific example, an encoding device determines whether a block to be encoded belongs to an area with complex motion, and if it belongs to an area with complex motion, sets the value of obmc_flag to 1 and performs encoding by applying OBMC processing, and if it does not belong to an area with complex motion, sets the value of obmc_flag to 0 and performs encoding without applying OBMC processing. On the other hand, a decoding device decodes obmc_flag described in a stream, and switches whether to apply OBMC processing depending on the value, and performs decoding.

[0131] Alternatively, 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. Alternatively, 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 Figure 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 coded blocks spatially or temporally adjacent to the current block. Next, a best candidate MV is selected from the 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, a motion vector for the current block is derived based on the motion vector of the selected candidate. Specifically, for example, the motion vector of the selected candidate (best candidate MV) is derived as the motion vector for the current block as is. Also, for example, the motion vector for the current block may be derived by performing pattern matching in a peripheral area of ​​a position in a reference picture corresponding to the motion vector of the selected candidate. That is, a search is performed in a similar manner in a peripheral area of ​​the best candidate MV, and if an MV with a better evaluation value is found, the best candidate MV may be updated to the MV and used as the final MV for the current block. Note that a configuration may be adopted in which this process is not performed.

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

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

[0137] As the pattern matching, first pattern matching or second pattern matching is used. The first pattern matching and 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 that is along the motion trajectory of the current block is used as a predetermined area for calculating the evaluation value of the candidate.

[0139] FIG. 6 is a diagram illustrating 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 the most closely matched pair of two blocks along the motion trajectory of a current block (Cur block) in two different reference pictures (Ref0, Ref1). Specifically, for the current block, a difference is derived between a reconstructed image at a specified position in a first coded reference picture (Ref0) specified by a candidate MV and a reconstructed image at a specified position in a second coded reference picture (Ref1) specified by a symmetric MV obtained by scaling the candidate MV by the display time interval, and an evaluation value is calculated using the obtained difference value. The candidate MV with the best evaluation value among multiple candidate MVs may be selected as the final MV.

[0140] Under the assumption of continuous motion trajectories, motion vectors (MV0, MV1) pointing to two reference blocks are proportional to the temporal distances (TD0, TD1) between a current picture (CurPic) and two reference pictures (Ref0, Ref1). For example, if the current picture is located between two reference pictures temporally 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, the block adjacent to the current block in the current picture is used as a predetermined area for calculating the evaluation value of the candidate.

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

[0143] Information indicating whether such a FRUC mode is applied (e.g., called an FRUC flag) is signaled at the CU level. Furthermore, 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., called an FRUC mode flag) is signaled at the CU level. Note that signaling of this information does not need to be limited to the CU level, and may be at other levels (e.g., the sequence level, the picture level, the slice level, the tile level, the CTU level, or the sub-block level).

[0144] Here, we will explain a mode in which motion vectors are derived based on a model that assumes uniform linear motion. This mode is sometimes called BIO (bi-directional optical flow) mode.

[0145] FIG. 8 is a diagram for explaining a model assuming uniform linear motion. In FIG. 8, (v x ,v y) denotes a velocity vector, and τ0 and τ1 denote the temporal distance between the current picture (Cur Pic) and two reference pictures (Ref0 and Ref1), respectively. (MVx0,MVy0) denotes a motion vector corresponding to reference picture Ref0, and (MVx1,MVy1) denotes a motion vector corresponding to reference picture Ref1.

[0146] At this time, the velocity vector (v x ,v y ), (MVx0,MVy0) and (MVx1,MVy1) 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] where 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 motion vectors using a method other than that based on a model assuming constant-velocity linear motion. For example, a 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 neighboring blocks will be described. This mode is sometimes called an affine motion compensation prediction mode.

[0151] FIG. 9A is a diagram for explaining the derivation of motion vectors 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 v0 of the upper left corner control point of the current block is derived based on the motion vectors of the adjacent blocks, and the motion vector v1 of the upper right corner control point of the current block is derived based on the motion vectors of the adjacent sub-blocks. Then, using the two motion vectors v0 and v1, 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 coefficient.

[0154] Such an affine motion compensation prediction mode may include several modes in which the methods of deriving the motion vectors of the upper-left and upper-right corner control points are different. Information indicating such an affine motion compensation prediction mode (e.g., called an 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., the sequence level, the picture level, the slice level, the tile level, the CTU level, or the sub-block 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 merge mode will be described. Fig. 9B is a diagram for explaining an overview of the motion vector derivation process in 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 spatially located around the block to be coded, temporally adjacent prediction MVs, which are MVs held by blocks in the vicinity of the block to be coded projected onto the coded reference picture, joint prediction MVs, which are MVs generated by combining the MV values ​​of the spatially adjacent prediction MVs and the 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 plurality of 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 encodes the stream by describing merge_idx, which is a signal indicating which predicted MV has been selected.

[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 predicted MVs other than the types of predicted MVs shown in the figure.

[0161] The final MV may be determined by performing the DMVR process, 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 outline 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 averaging each reference pixel.

[0165] Next, the template is used to search the surrounding areas of the candidate MVs in 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 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 for generating a predicted image using LIC processing will be described.

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

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

[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 predicted image for the block to be coded is generated by performing luminance correction processing on a reference image in a reference picture specified by the MV using the luminance correction parameters.

[0173] The shape of the peripheral reference region in FIG. 9D is 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 for determining whether to apply LIC processing, for example, there is a method using lic_flag, which is a signal indicating whether to apply LIC processing. As a specific example, an encoding device determines whether 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, sets the value of lic_flag to 1 and performs encoding by applying LIC processing, and if it does not belong to an area where a luminance change occurs, sets the value of lic_flag to 0 and performs encoding without applying LIC processing. On the other hand, a decoding device decodes lic_flag described in the stream, and switches whether to apply LIC processing depending on the value, and performs decoding.

[0176] As another method for determining whether to apply LIC processing, for example, there is also a method for determining whether LIC processing has been applied to surrounding blocks.As a specific example, when the block to be coded is in merge mode, it is determined whether the surrounding coded blocks selected when deriving MV in merge mode processing have been coded using LIC processing, and depending on the result, whether to apply LIC processing is switched and coded.In addition, in this example, the process in decoding is exactly the same.

[0177] [Overview of the decoding device] Next, an overview will be given of a decoding device capable of decoding the coded signal (coded bitstream) output from the above coding device 100. Fig. 10 is a block diagram showing the functional configuration of a decoding device 200 according to Embodiment 1. The decoding device 200 is a video / image decoding device that decodes video / images 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 memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as the entropy decoding unit 202, the inverse quantization unit 204, the inverse 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. Alternatively, the decoding device 200 may be realized as one or more dedicated electronic circuits corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse 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] The entropy decoding unit 202 entropy-decodes the coded bitstream. Specifically, the entropy decoding unit 202 arithmetically decodes the coded bitstream into a binary signal. 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. The inverse quantization unit 204 then outputs the inverse 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 decoded from the coded bitstream indicates that NSST is to be applied, then inverse transform unit 206 applies an inverse re-transform to the transform coefficients.

[0186] [Adder] The adder 208 reconstructs the current block by adding the prediction error input from the inverse transformer 206 and the prediction sample 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 blocks 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 that ALF is on, one filter is selected from 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 is sometimes 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 based on the intra prediction mode interpreted from the encoded bitstream, by referring to blocks in the current picture stored in the block memory 210. Specifically, the intra prediction unit 216 generates the intra prediction signal by performing intra prediction by referring 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 coded 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 and 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) within the current block. For example, the inter prediction unit 218 generates an inter prediction signal for the current block or sub-block by performing motion compensation using motion information (e.g., motion vectors) interpreted from the coded bitstream, and outputs the inter prediction signal to the prediction control unit 220.

[0195] In addition, if 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] Furthermore, if the information interpreted from the coded bitstream indicates that the FRUC mode is to be applied, the inter prediction unit 218 derives motion information by performing motion search according to the pattern matching method (bilateral matching or template matching) interpreted from the coded bitstream. Then, the inter prediction unit 218 performs motion compensation using the derived motion information.

[0197] Furthermore, when the BIO mode is applied, the inter prediction unit 218 derives a motion vector based on a model assuming constant-velocity linear motion. Furthermore, when information interpreted from the coded bitstream indicates that the affine motion compensation prediction mode is to be applied, the inter prediction unit 218 derives a motion vector for each sub-block 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 entropy decoding processing on the input stream to be decoded, thereby obtaining information necessary for decoding (S101).

[0201] In the second stage, the decoding device 200 uses the information to derive motion vectors (MVs) in inter-prediction processing. Specifically, the decoding device 200 first references neighboring decoded blocks to derive one or more motion vector predictors (hereinafter referred to as MVPs), which are motion vector candidates (S102). Next, the decoding device 200 transfers a reference image to memory according to the derived MVPs (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 the predicted image by intra prediction processing (S108). If the current block is an inter block, the decoding device 200 decodes the 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 peripheral reference motion vector for deriving an MVP in the decoding process of the subsequent block, and is therefore fed back as 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 must be contained within one stage. As a result, as shown in Figure 11, the second stage is composed of a large number of processes, resulting in a stage with a long processing time.

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

[0208] 12 is a schematic diagram showing an example of block division used to explain pipeline processing. The example of block division shown in FIG. 12 shows two coding tree units. 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, in time sequence, the processing timing of the stage processing of each block to be decoded in the first example of the outline of the pipeline configuration described in Fig. 11. Fig. 13 shows the processing timing of five blocks to be decoded, encoding units CU0 to CU4, shown in Fig. 12. Furthermore, S1 to S4 in Fig. 13 indicate the 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 at each stage is also twice as long.

[0212] Furthermore, 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] The processing of each stage begins after waiting for the same stage of the immediately preceding block in the processing order to finish. For example, the processing of the second stage of the coding unit CU1 begins at time t6, when the second stage of the coding unit CU0 finishes. At this time, because the processing time of the second stage of the coding unit CU0 is twice as long, a waiting time occurs in the coding unit CU1 from time t4, when the processing of the first stage finishes, to time t6, when the processing of the second stage starts.

[0214] In this way, a waiting time always occurs at the start of the second stage, and this waiting time accumulates as the processing of the block to be decoded progresses. As a result, in the encoding 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 for 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 for one picture.

[0216] Fig. 14 is a flowchart of inter prediction processing in the first example of the outline of the pipeline configuration described in Fig. 11. The processing shown in Fig. 14 is repeatedly performed for each prediction block, which is the processing unit of the 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 following mainly describes the operation of the inter prediction unit 126 included in the encoding device 100, 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 normal inter mode, merge mode, and 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 multiple predicted motion vectors (MVPs) by referring to the motion vectors of neighboring processed blocks, and creates a normal MVP list indicating the acquired multiple MVPs. The inter prediction unit 126 designates one MVP from the multiple 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 the motion vector by adding the transmitted differential motion vector to the predicted motion vector.

[0219] When 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 neighboring 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 determines a final motion vector by performing DMVR processing, which searches for a position with the smallest cost value in the area surrounding the optimal MVP using the processed picture (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 that minimizes the 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 the minimum cost in the surrounding area of ​​the derived optimal MVP using the same 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 peripheral reference MV memory to be used as peripheral reference MVs for deriving MVPs of subsequent blocks.

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

[0223] Thus, when processing a current block using merge mode or FRUC mode, much more processing is required to derive a final motion vector than when using other modes, resulting in longer processing times and causing longer wait times in the stages of the pipeline control described in FIG.

[0224] The processing flow shown here is 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 the signals required for processing are 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. Unlike the first example described in Fig. 11, the decoding device 200 in the second example shown in Fig. 15 uses a temporary motion vector (first motion vector) generated using one or more MVPs acquired in the MVP derivation process, rather than using a final motion vector (second motion vector) obtained after all processes related to motion vector derivation have been 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 peripheral 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 cross stages.

[0228] Note that this outline of the pipeline configuration is just an example, and some of the processes described may be omitted, 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 the processing timing of the stage processing of each block to be decoded in the second example of the outline of the pipeline configuration described in FIG.

[0230] Fig. 16, like Fig. 13, shows the processing timing for the five blocks to be decoded, from coding unit CU0 to 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. Furthermore, the length of each of the second stage and the third stage is the same as that of the other stages.

[0231] The processing of each stage begins after the same stage of the previous block in the processing order has finished. For example, the processing of the second stage of the coding unit CU1 begins at time t4, when the second stage of the coding unit CU0 has finished. In this case, since the processing time of the second stage of the coding unit CU0 is the same as that of the other stages, the processing of the second stage of the coding unit CU1 can begin without waiting after the processing of the first stage has finished.

[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, but this waiting time is not accumulated, and the waiting time has disappeared 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 possibility that 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 outline of the pipeline configuration described in Fig. 15. The processing shown in Fig. 17 is repeatedly performed for each prediction block, which is the processing unit of the 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 vectors derived by each method are not stored in the peripheral reference motion vector memory, but tentative motion vectors derived using one or more MVPs obtained by each method are stored in the peripheral reference motion vector memory.

[0236] This allows feedback of surrounding reference motion vectors for deriving MVPs in the processing of subsequent blocks at an early stage in the processing flow, which increases the possibility of significantly reducing the waiting time of stages in pipeline control, as explained in Figure 16.

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

[0238] (1) In normal inter mode, the inter prediction unit 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 tentative motion vector, an MVP (optimal MVP) designated by a merge index from 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 nearest reference picture. The inter prediction unit 126 calculates the average or median 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 temporary motion vectors from the multiple MVPs indicated in the MVP list for FRUC, and derive temporary 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 also be used as the peripheral reference motion vector in other processing such as loop filter processing. Note that in other processing such as loop filter processing, a 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, this final motion vector may be used in processing from the fourth stage onwards.

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

[0244] Note that this processing flow is an example, and some of the processes described may be omitted or processes not described may be added. For example, in merge mode, if the peripheral search process for 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 the signals required for processing are encoded into a stream or decoded from a stream.

[0246] [Effect of the second example of inter-prediction processing] 15 to 17, it is possible to perform feedback of surrounding reference motion vectors for deriving MVPs in processing of subsequent blocks at an early stage in the processing flow. This significantly reduces the waiting time of the pipeline control stages that occurred in the first example. This increases the likelihood that even a decoding device with low processing performance can complete 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 a schematic 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 surrounding reference motion vector of the surrounding decoded blocks used in MVP derivation in the inter prediction process, but uses a temporary motion vector before performing an optimal MVP surrounding search when the inter prediction mode is the FRUC mode, and uses a temporary motion vector before performing DMVR processing when the inter prediction mode is the merge mode.

[0248] In this way, by using the tentative motion vector as the peripheral reference motion vector for deriving the MVP in the decoding process of the subsequent block, the length of the feedback loop becomes relatively short. 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 subsequent block can be delayed until the tentative motion vector is determined, 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.

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

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

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

[0252] The processing of each stage begins after the same stage of the immediately preceding block in the processing order has finished. However, in the third example, as an exception, the second stage begins after the provisional motion vector has been determined in the third stage of the immediately preceding block in the processing order. Therefore, for example, the processing of the second stage of the coding unit CU1 begins at time t4, when the first half of the processing of the third stage of the coding unit CU0 has finished. In this case, since the processing time of the second stage of the coding unit CU0 is sufficiently short compared to the other stages, the processing of the second stage of the coding unit CU1 can begin without waiting after the processing of the first stage has finished.

[0253] On the other hand, for example, the processing of the second stage of encoding unit CU3 begins after the first half of the processing of the third stage of encoding unit CU2 is completed, but since the processing time of the second stage of encoding 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 Figure 16, a waiting time from time t8 to time t9 occurs between the first stage and the second stage when encoding unit CU4 is processed. However, compared to the first example described in Figure 13, the waiting time is significantly reduced, and even when decoding processing for one picture is completed, the processing time including the waiting time is almost the same as the original processing time. Therefore, it is more likely that 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 third example of the outline of the pipeline configuration described in Fig. 18. The processing shown in Fig. 20 is repeatedly performed for each prediction block, which is the processing unit of the inter prediction processing. Furthermore, 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 temporary 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 allows feedback of surrounding reference motion vectors for deriving MVPs in the processing of subsequent blocks at an early stage in the processing flow, which increases the possibility of significantly reducing the waiting time of stages in pipeline control, as explained in Figure 19.

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

[0259] (1) In normal inter mode, the inter prediction unit 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 tentative motion vector, an MVP (optimal MVP) designated by a merge index from among a plurality of MVPs indicated in the MVP list for merging.

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

[0262] Also, in FIG. 20, the motion vectors stored in the peripheral reference motion vector memory are used as peripheral reference motion vectors for deriving the MVP, but the provisional motion vectors may be used as peripheral reference motion vectors in other processes such as loop filter processing. Note that in other processes such as loop filter processing, a 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, this final motion vector may be used in the processes from the fourth stage onwards.

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

[0264] Note that this processing flow is an example, and some of the described processes may be omitted or processes not described may be added. For example, in merge mode or FRUC mode, if the peripheral search process for 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 the signals required for processing are encoded into a stream or decoded from a stream.

[0266] [Effect of the third example of inter-prediction processing] 18 to 20, it is possible to perform feedback of surrounding reference motion vectors for deriving MVPs in processing of subsequent blocks at an early stage in the processing flow. This significantly reduces the waiting time of stages in pipeline control that occurred in the first example. This increases the likelihood that even a decoding device with low processing performance can complete processing of all blocks within the processing time allocated to one picture.

[0267] 17, when the inter prediction mode is the FRUC mode, the motion vector that has undergone 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 coding efficiency.

[0268] [Peripheral reference motion vectors, combining the final motion vector and the provisional motion vector] In the second example described in Figure 17 and the third example described in Figure 20, in addition to storing temporary motion vectors in the peripheral reference motion vector memory, final motion vectors may also be stored therein, as in the first example described in Figure 14.

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

[0270] 21 and 22 are diagrams illustrating neighboring blocks referenced for deriving the MVP of a 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 in another picture for which processing has already been completed.

[0271] 21 is a diagram showing an example of a case where a final motion vector cannot be obtained for the block immediately preceding the current block in 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 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 for which processing has already been completed. Therefore, the inter prediction unit 126 obtains the final motion vector for the coding unit CU col as the peripheral reference motion vector.

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

[0273] In this way, the inter prediction unit 126 acquires the final motion vectors from the peripheral reference blocks for which the final motion vectors can be acquired as the peripheral reference motion vectors, thereby enabling the MVP to be derived by referencing more reliable motion vectors compared to when all temporary motion vectors are acquired as peripheral reference motion vectors, which increases the possibility of improving coding efficiency.

[0274] Note that the inter prediction unit 126 may switch the motion vectors that can be referenced depending on whether the boundary of the current block is the boundary of a CTU. For example, when the current block is not adjacent to the upper boundary of a CTU, the inter prediction unit 126 determines whether to reference a final motion vector or a provisional motion vector for a block adjacent to the upper side of the current block, using the method described in FIG. 21 and FIG. 22. On the other hand, when the current block is adjacent to the upper boundary of a CTU, derivation of a final motion vector has been completed for the block adjacent to the upper side of the current block, so the inter prediction unit 126 always references the final motion vector. Similarly, when the current block is adjacent to the left boundary of a CTU, the inter prediction unit 126 always references the final motion vector for the block adjacent to the left side of the current 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, when the inter prediction mode is 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 FRUC mode, the inter prediction unit 126 may use the provisional motion vector before performing the optimal MVP peripheral search as the peripheral reference motion vector as in the third example. Because the processing amount in merge mode is smaller than that in FRUC mode, even if the processing waits until the final motion vector is determined and then feeds back the final motion vector as the peripheral reference motion vector, it is possible to complete the processing of the subsequent block within the required processing time. Therefore, it is possible to perform processing without accumulating the waiting time of the stages in the pipeline control. Furthermore, by making it possible to use more reliable motion vectors as peripheral reference motion vectors in merge mode, it is more likely that the coding efficiency will be improved.

[0277] [Switching by low latency mode signal] The inter prediction unit 126 determines whether 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 vectors is shortened, which increases the possibility of significantly reducing the waiting time of the stages in the pipeline control. On the other hand, when the low-latency mode is not used, waiting time of the stages in the pipeline control occurs, but since highly reliable motion vectors can be referenced as peripheral reference motion vectors, there is a high possibility of improving the coding efficiency.

[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 written in a sequence header area, picture header area, slice header area, or auxiliary information area of ​​the stream to be processed.

[0280] For example, the encoding device 100 may switch whether to process in low-delay 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-delay mode because the number of blocks to be processed is small and there is ample processing time, but when the picture size is large, the number of blocks to be processed is large and there is not enough processing time and so the encoding device 100 sets the low-delay mode.

[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 at the destination of the stream. For example, if 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 process a lot in a certain processing time. On the other hand, if 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 process a lot 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 decoding device processing capabilities are assigned to the 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 decoding device processing capabilities are assigned to the stream, the encoding device 100 sets the stream to low delay mode.

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

[0284] As described above, when encoding a current block in an inter prediction mode in which motion estimation 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 current block (S203 or S205), stores the derived first motion vector in memory, derives a second motion vector for the current block (S204 or S207), and generates a predicted image for the current block by motion compensation using the second motion vector (S208). When deriving the first motion vector (S203 or S205), the encoding device 100 derives the first motion vector for the current block using the first motion vector of a processed block.

[0285] According to this, in pipeline control, the decoding device 200 can start deriving the first motion vector of the current 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 therefore processing delay can be reduced.

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

[0287] For example, the inter prediction mode used for motion search in the decoding device 200 is merge mode, and the encoding device 100 derives the second motion vector by performing motion search processing around 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 around 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 (optimal MVP) from multiple predicted motion vectors indicated in the predicted motion vector list (e.g., S206 in Figure 17), and (ii) derives the second motion vector by performing motion search processing around the third motion vector (e.g., S207 in Figure 17).

[0290] For example, in determining the first motion vector (for example, 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 the multiple predicted motion vectors indicated in the predicted motion vector list.

[0291] For example, when determining the first motion vector (for example, 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 from among the multiple predictor motion vectors indicated in the predictor motion vector list.

[0292] For example, when generating a motion vector predictor list (e.g., 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. When determining the first motion vector (e.g., 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 motion vector predictor list (for example, S203 or S205 in FIG. 17), if the processed block belongs to the same picture as the target block, the encoding device 100 derives a motion vector predictor using the first motion vector of the processed block, and if the processed block belongs to a different picture from the target block, the encoding device 100 derives a motion vector predictor using the second motion vector of the processed block.Accordingly, if the processed block belongs to a different picture from the target block, the encoding device 100 can improve the reliability of the motion vector predictor by using the second motion vector.

[0294] For example, when generating a predicted motion vector list (e.g., S203 or S205 in Figure 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, the encoding device 100 uses the second motion vector of the processed block to derive the predicted motion vector.

[0296] For example, when generating a predicted motion vector list (e.g., S203 or S205 in Figure 17), the encoding device 100 derives a predicted 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 N blocks before the target block in processing order, using the 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, using the 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 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, such as loop filter processing.

[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 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 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 decoding device 200 according to this embodiment encodes a current block in an inter prediction mode in which motion estimation is performed in decoding device 200 (for example, merge mode or FRUC mode in S201 of FIG. 17), it derives a first motion vector for the current block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector for the current block (S204 or S207), and generates a predicted image of the current block by motion compensation using the second motion vector (S208). In deriving the first motion vector (S203 or S205), decoding device 200 derives the first motion vector for the current block using the first motion vector of a processed block.

[0308] According to this, in pipeline control, the decoding device 200 can start deriving the first motion vector of the current 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 therefore processing delay can be reduced.

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

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

[0311] For example, the inter prediction mode in which motion search is performed in the decoding device 200 is the FRUC mode, and the decoding device 200 derives the second motion vector by performing motion search processing around 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 (optimal MVP) from multiple predicted motion vectors indicated in the predicted motion vector list (e.g., S206 in Figure 17), and (ii) derives the second motion vector by performing motion search processing around the third motion vector (e.g., S207 in Figure 17).

[0313] For example, in determining the first motion vector (for example, 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 the multiple predicted motion vectors indicated in the predicted motion vector list.

[0314] For example, when determining the first motion vector (for example, S205 in FIG. 17), decoding device 200 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.

[0315] For example, when generating a motion vector predictor list (e.g., S203 or S205 in FIG. 17), 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. When determining the first motion vector (e.g., S205 in FIG. 17), 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 motion vector predictor list (for example, S203 or S205 in FIG. 17), if the processed block belongs to the same picture as the target block, the decoding device 200 uses the first motion vector of the processed block to derive a motion vector predictor, and if the processed block belongs to a different picture from the target block, the decoding device 200 uses the second motion vector of the processed block to derive a motion vector predictor.Accordingly, if the processed block belongs to a different picture from the target block, the decoding device 200 can improve the reliability of the motion vector predictor by using the second motion vector.

[0317] For example, when generating a predicted motion vector list (e.g., S203 or S205 in Figure 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 Figure 17), if the processed block belongs to a processing unit different from the processing unit (e.g., CTU) that includes the current block, the decoding device 200 uses the second motion vector of the processed block to derive the predicted motion vector.

[0319] For example, when generating a predicted motion vector list (e.g., S203 or S205 in Figure 17), decoding device 200 derives a predicted 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 N blocks before the target block in processing order, using the 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, using the 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 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, such as loop filter processing.

[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 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 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 decoding device 200 includes a first stage (second stage in Fig. 15) that performs processing to derive a first motion vector for a current block, and a second stage (third stage in Fig. 15) that is separate from the first stage and performs processing to derive a second motion vector for the current block. Decoding device 200 starts first-stage processing of the current block upon completion of first-stage processing of the block immediately preceding it in processing order, without waiting for completion of second-stage processing of up to M blocks before the current block in processing order.

[0328] For example, as shown in Fig. 18, the pipeline structure of decoding device 200 includes a first stage (second stage in Fig. 18) that performs processing to derive a first motion vector for a current block, and a second stage (third stage in Fig. 18) that is separate from the first stage and performs processing to derive a second motion vector for the current block. Decoding device 200 starts the first stage processing of the current block as soon as the first motion vector for the block M blocks before it in processing order has been derived, without waiting for the completion of the second stage processing of the blocks up to M blocks before it in processing order.

[0329] For example, M is 1.

[0330] Furthermore, 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 the blocks included in the image, a transformation 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 bitstream by variable-length coding the quantized coefficients. When encoding a current block in an inter prediction mode in which motion estimation 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 for the current block (S203 or S205), stores the derived first motion vector in memory, derives a second motion vector for the current block (S204 or S207), and generates a predicted image of the current 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 for the current 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 inversely 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 reference pictures included in the image, an inter prediction unit 218 that predicts blocks included in the image using reference blocks included in another image different from the image, and a loop filter unit 212 that applies a filter to blocks included in the image. When encoding a current block in an inter prediction mode in which motion estimation 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 for the current block (S203 or S205), stores the derived first motion vector in a memory, derives a second motion vector for the current block (S204 or S207), and generates a predicted image of the current 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 for the current block using the first motion vector of a processed block.

[0332] [Example of an encoder implementation] 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, multiple components of the encoding device 100 shown in FIG. 1 are implemented by the circuit 160 and 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 fulfill 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 that stores information used by the circuit 160 to encode moving images. The memory 162 may be an electronic circuit and may be connected to the circuit 160. The memory 162 may also be included in the circuit 160. The memory 162 may also be a collection of multiple electronic circuits. The memory 162 may also be a magnetic disk, an optical disk, or the like, and may also be expressed as a storage, a recording medium, or the like. The memory 162 may also 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] Furthermore, for example, the memory 162 may serve as a component for storing information among the multiple components of the encoding device 100 shown in Fig. 1 etc. Specifically, the memory 162 may serve as 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] Note that not all of the components shown in Figure 1 and the like need to be implemented in the encoding device 100, and not all of the above-described processes need to be performed. Some of the components shown in Figure 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 Figure 1 and the like are implemented, and some of the above-described processes are performed, thereby efficiently performing motion compensation.

[0338] [Example of implementation of a decryption device] 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, multiple 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 fulfill the roles 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 that stores information for the circuit 260 to decode moving images. The memory 262 may be an electronic circuit and may be connected to the circuit 260. The memory 262 may also be included in the circuit 260. The memory 262 may also be a collection of multiple electronic circuits. The memory 262 may also be a magnetic disk, an optical disk, or the like, and may also be expressed as a storage, a recording medium, or the like. The memory 262 may also 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] Furthermore, for example, the memory 262 may serve as a component for storing information among the multiple components of the decoding device 200 shown in Fig. 10 etc. Specifically, the memory 262 may serve as 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] Note that the decoding device 200 does not necessarily have to implement all of the components shown in Figure 10 and the like, and does not necessarily have to perform all of the above-described processes. Some of the components shown in Figure 10 and the like may be included in another device, and some of the above-described processes may be executed by another device. Then, the decoding device 200 implements some of the components shown in Figure 10 and the like, and performs some of the above-described processes, thereby efficiently performing motion compensation.

[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 addition, in this embodiment, each component may be configured with dedicated hardware, or may be realized by executing a software program suitable for each component. Each component may be realized 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. If the processing circuit includes a program execution unit, the storage device stores the software program 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 the following program.

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

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

[0352] Although aspects of the encoding device 100 and the decoding device 200 have been described above based on the embodiments, the aspects of the encoding device 100 and the decoding device 200 are not limited to these embodiments. As long as they do not deviate from the spirit of this disclosure, various modifications conceivable by those skilled in the art to the present embodiments and configurations constructed by combining components of 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 device configurations, and some syntaxes 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 typically be realized by an MPU, memory, etc. Furthermore, the processing by each of the functional blocks is typically 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 circuits).

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

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

[0357] Furthermore, here, we will explain 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. 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 that includes both. Other components of the system can be appropriately changed depending on the situation.

[0358] [Usage example] 25 is a diagram showing the overall configuration of a content supply system ex100 that provides 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 console 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 a combination of any of the above elements. The devices may be connected to each other directly or indirectly via a telephone network or short-range wireless communication, without using the base stations ex106 to ex110, which are fixed wireless stations. Furthermore, a streaming server ex103 is connected to devices such as the computer ex111, the game console ex112, the camera ex113, the home appliance ex114, and the smartphone ex115 via the Internet ex101, etc. Furthermore, the streaming server ex103 is connected to a terminal in a hotspot on an airplane ex117, etc., via a satellite ex116.

[0360] Note that wireless access points, hotspots, etc. may be used instead of the base stations ex106 to ex110. Furthermore, 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, mobile phone, or PHS (Personal Handyphone System) that is compatible with mobile communication systems generally known as 2G, 3G, 3.9G, 4G, and 5G.

[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 streaming and the like. In live streaming, a terminal (such as a computer ex111, a game console ex112, a camera ex113, a home appliance ex114, a smartphone ex115, or a terminal on an airplane ex117) performs the encoding process described in each of the above embodiments on still images or video content captured by a user using the terminal, multiplexes the video data obtained by 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 console ex112, a camera ex113, a home appliance ex114, a smartphone ex115, a terminal on an airplane ex117, or the like, which is 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 also be multiple servers or multiple computers that process, record, and distribute data in a distributed manner. For example, the streaming server ex103 may be implemented as a CDN (Content Delivery Network), where content distribution is achieved through a network connecting numerous edge servers distributed around the world. In a CDN, a physically nearby edge server is dynamically assigned depending on the client. Content is then cached and distributed to that edge server, thereby reducing delays. Furthermore, if an error occurs or communication conditions change due to increased traffic, 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 affected network portion, thereby achieving high-speed and stable distribution.

[0366] In addition to the distributed processing of the distribution itself, the encoding of captured data can be performed on each device, on the server side, or shared among devices. For example, encoding generally involves two processing loops. The first loop detects the image complexity or code size for each frame or scene. The second loop maintains image quality while improving encoding efficiency. For example, a device can perform the first encoding process, and the server that receives the content can perform the second encoding process, thereby improving content quality and efficiency while reducing the processing load on each device. In this case, if there is a request for near-real-time reception and decoding, the data encoded by a device can be received and played back on another device, enabling more flexible real-time distribution.

[0367] As another example, the camera ex113 or the like extracts features from an image, compresses the data related to the features as metadata, and transmits the 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 accordingly. The feature data is particularly effective in improving the accuracy and efficiency of motion vector prediction when the server recompresses the image. Alternatively, the terminal may perform simple encoding such as VLC (variable length coding), and the server may perform encoding with a heavy processing load such as CABAC (context-adaptive binary arithmetic coding).

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

[0369] Furthermore, since multiple pieces of video data are of nearly 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 encoded data from each terminal and change the reference relationships between multiple pieces of data, or correct or replace the pictures themselves and re-encode them. This allows for the generation of streams with improved quality and efficiency for each piece of data.

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

[0371] In this way, the encoding process can be performed by a terminal or one or more servers. Therefore, although the following uses terms such as "server" or "terminal" to refer to the entity performing the process, 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, there has been an increasing trend 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 nearly synchronized with each other. The videos taken by each device are integrated based on the relative positional relationship between the devices 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. Furthermore, if the server can acquire the relative positional relationship between the capturing terminals, it can generate a 3D shape of the scene based on not only the 2D video but also images of the same scene captured from different angles. The server may also separately encode 3D data generated by point clouds, or may select or reconstruct images to be transmitted to the receiving terminal 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, users can enjoy scenes by selecting any video corresponding to each camera device, or can enjoy content in which video from any viewpoint is extracted from 3D data reconstructed using multiple images or videos. Furthermore, like the video, sound may also be collected from multiple different angles, and the server may multiplex and transmit sound from a specific angle or space 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 left eye, and may perform encoding that allows reference between the viewpoint images 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 AR images, the server superimposes virtual object information in virtual space onto camera information in real space based on the 3D position or the user's viewpoint movement. The decoding device may acquire or store virtual object information and 3D data, generate a 2D image according to the user's viewpoint movement, and smoothly connect the images to create superimposed data. Alternatively, the decoding device may send the user's viewpoint movement to the server in addition to a request for virtual object information, and the server may create superimposed data based on the viewpoint movement received from the 3D data stored on the server, encode the superimposed data, and distribute it to the decoding device. Note that the superimposed data may also have an α value indicating transparency in addition to RGB, and the server may set the α value of parts other than the object created from the 3D data to 0, etc., to encode the parts in a transparent state. Alternatively, the server may generate data by setting a predetermined RGB value as the background, like a chromakey, and using the background color for parts other than the object.

[0377] Similarly, the decoding of distributed data may be performed by each client terminal, by the server, or by multiple terminals. For example, one terminal may first send a reception request to the server, and then other terminals may receive and decode content according to the request, after which the decoded signal is transmitted to a device with a display. By distributing the processing and selecting appropriate content regardless of the capabilities of the communication terminals themselves, high-quality data can be reproduced. As another example, large-sized image data may be received on a TV or other device, and only a portion of the picture, such as a tile into which the picture is divided, may be decoded and displayed on the viewer's personal device. This allows the viewer to share the overall picture while checking their own area of ​​responsibility or an area of ​​interest in more detail.

[0378] In the future, it is expected that content will be seamlessly received by switching the appropriate data for the current connection using delivery system standards such as MPEG-DASH in situations where multiple short-, medium-, or long-distance wireless communications are available, both indoors and outdoors. This will allow users to freely select and switch between decoding and display devices, such as their own devices, indoors and outdoors, in real time. Decoding can also be performed by switching between decoding and display devices based on user location information. This will enable users to display map information on the wall or ground of a neighboring building with an embedded display device while traveling to their destination. It is also possible to switch the bit rate of received data based on the accessibility of the encoded data on the network, such as if the encoded data is cached on a server that can be quickly accessed from the receiving device or copied to an edge server in a content delivery service.

[0379] [Scalable Coding] Content switching will be described using a scalable stream, shown in FIG. 26, compressed and encoded using the video encoding method described in each of the above embodiments. The server may have multiple streams with the same content but different qualities, but may also switch content by taking advantage of the temporal / spatial scalability achieved by encoding the stream in layers, as shown. In other words, the decoder determines which layer to decode based on internal factors such as performance and external factors such as communication bandwidth, allowing the decoder to freely switch between low-resolution and high-resolution content. For example, if a user wants to continue watching a video they were watching on their smartphone ex115 while on the go on a device such as an Internet TV after returning home, the device can simply decode the same stream up to different layers, thereby reducing the burden on the server.

[0380] Furthermore, in addition to the above-described scalability configuration 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 in the base layer based on the meta-information. Super-resolution may mean either improving the signal-to-noise ratio at the same resolution or increasing the resolution. The meta-information may include 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 objects in the image, and the decoding side may select tiles to decode and decode only a portion of the area. Furthermore, by storing the object's attributes (such as a person, a car, or a ball) and its position in the video (such as a coordinate position in the same image) 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 that of 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] Furthermore, meta information may be stored in units consisting of multiple pictures, such as streams, sequences, or random access units, which allows the decoding side to obtain the time when a specific person appears in the video, and by combining this with information in units of pictures, it is possible to identify the picture in which the object exists and the position of the object within the picture.

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

[0384] When a link image is selected by a user, the display device decodes the base layer with the highest priority. 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. To ensure real-time performance, before a selection is made or when the communication bandwidth is very limited, the display device decodes and displays only forward-referenced pictures (I-pictures, P-pictures, and forward-reference-only B-pictures), thereby reducing the delay between the decoding time of the first picture and the display time (the delay from the start of content decoding to the start of display). Alternatively, the display device may intentionally ignore the picture reference relationships and roughly decode all B-pictures and P-pictures using forward reference, and then perform normal decoding as the number of received pictures increases over time.

[0385] [Autonomous 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 vehicle, drone, airplane, etc. 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 depending on the user's selection, user situation, or communication bandwidth status.

[0387] In this way, in the content supply system ex100, the client can receive, decode, and play back the encoded information sent 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 distribution companies, but also unicast or multicast distribution of low-quality, short-duration content from individuals. 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, with the following configuration.

[0389] During shooting, either in real time or after accumulating the footage, the server performs recognition processing such as detecting shooting errors, scene search, semantic analysis, and object detection from the original image or encoded data. Based on the recognition results, the server manually or automatically corrects out-of-focus or camera shake, deletes less important scenes (e.g., scenes with lower brightness or out-of-focus compared to other pictures), emphasizes object edges, changes color, and performs other editing. The server then encodes the edited data based on the editing results. It is also known that viewing rates decrease if the shooting time is too long. Therefore, the server may automatically clip not only less important scenes as described above but also scenes with little movement, based on the image processing results, so that the content falls within a specific time range depending on the shooting time. Alternatively, the server may generate and encode a digest based on the results of the semantic analysis of the scene.

[0390] In some cases, personal content may contain content that infringes copyright, moral rights, or portrait rights, or may cause the scope of sharing to exceed the intended scope, resulting in inconvenience to individuals. Therefore, for example, the server may intentionally defocus images of people's faces on the periphery of the screen or the interior of a house before encoding. The server may also recognize whether the image to be encoded contains the face of a person other than a pre-registered person, and if so, perform processing such as blurring the face. Alternatively, as pre- or post-processing before encoding, the user may specify a person or background area they wish to modify in the image for copyright or other reasons, and the server may replace the specified area with another image or blur the focus. For a person, the server may track the person in the video and replace the image of the face.

[0391] Furthermore, because viewing personal content with small data volumes requires real-time performance, the decoding device first receives the base layer as a top priority, and then decodes and plays it back, depending on the bandwidth. The decoding device may also receive an enhancement layer during this time, and if the content is played back more than twice, such as when playback is looped, it may play back high-quality video, including the enhancement layer. A stream that has undergone scalable encoding in this way can provide an experience in which the video appears rough when not selected or when viewing begins, but gradually becomes smoother and the image quality improves. In addition to scalable encoding, a similar experience can also be provided by configuring a single stream consisting of a rough stream played the first time and a second stream that is encoded with reference to the first video.

[0392] [Other use cases] Furthermore, these encoding or decoding processes are generally performed by the LSIex500 possessed by each terminal. The LSIex500 may be a single chip or may be configured with multiple chips. It is also possible to incorporate video encoding or decoding software into some kind of recording medium (such as a CD-ROM, flexible disk, or hard disk) that can be read by the computer ex111, and perform the encoding or decoding process using that software. Furthermore, if the smartphone ex115 is equipped with a camera, video data captured by the camera may be transmitted. This video data 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 it supports the content encoding method or has the capability to execute a specific service. If the terminal does not support the content encoding method or does not have the capability to execute a specific service, the terminal downloads the 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 transmitted and received over broadcast radio waves using a satellite or the like, the content supply system ex100 is more suited to multicast than the content supply system ex100, which is more suited to unicast, but similar applications are possible with regard to encoding and decoding processes.

[0395] [Hardware configuration] FIG. 30 is a diagram illustrating a smartphone ex115. FIG. 31 is a diagram illustrating an example configuration of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of capturing video and still images, and a display unit ex458 for displaying video captured by the camera unit ex465 and decoded data of the video and other data 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 voice or sound, an audio input unit ex456 such as a microphone for inputting voice, a memory unit ex467 capable of storing encoded data or decoded data such as captured video or still images, recorded voice, received video or still images, and email, and a slot unit ex464 that serves as an interface with a SIM ex468 for identifying users and authenticating access to various data, including networks. In addition, an external memory may be used instead of the memory unit ex467.

[0396] In addition, a main control unit ex460 that comprehensively controls the display unit ex458 and 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, the power supply circuit unit ex461 supplies power from the battery pack to each unit, thereby starting up the smartphone ex115 into an operational state.

[0398] The smartphone ex115 processes calls, data communications, and other communications under the control of a main control unit ex460, which includes a CPU, ROM, RAM, and the like. During calls, the audio signal collected by the audio input unit ex456 is converted into a digital audio signal by the audio signal processing unit ex454, which then undergoes spectrum spread processing by the modulation / demodulation unit ex452, digital-to-analog conversion processing and frequency conversion processing by the transmission / reception unit ex451, and then transmitted via the antenna ex450. The received data is amplified, frequency-converted, and analog-to-digital converted, then subjected to spectrum despreading processing by the modulation / demodulation unit ex452, and converted into an analog audio signal by the audio signal processing unit ex454, which then outputs the amplified data from the audio output unit ex457. During data communications mode, text, still images, or video data is sent to the main control unit ex460 via the operation input control unit ex462 by operating the operation unit ex466, etc., of the main unit, and similar transmission and reception processing is performed. When transmitting video, still images, or video and audio in the data communication mode, the video signal processing unit ex455 compression-encodes the video signal stored in the memory unit ex467 or the video signal input from the camera unit ex465 using the video encoding method described in each of the above embodiments, and sends the encoded video data to the multiplexing / demultiplexing unit ex453. The audio signal processing unit ex454 also encodes the audio signal picked up by the audio input unit ex456 while the camera unit ex465 is capturing video, still images, etc., and sends the encoded audio data to the multiplexing / demultiplexing unit ex453. The multiplexing / demultiplexing unit ex453 multiplexes the encoded video data and encoded audio data using a predetermined method, and modulates and converts the data in the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the transmission / reception unit ex451 before transmitting the data via the antenna ex450.

[0399] When receiving video attached to an email or chat, or video linked to a web page, etc., the multiplexed data received via the antenna ex450 is decoded by the multiplexing / separation unit ex453, which separates the multiplexed data into a video data bitstream and an audio data bitstream. The multiplexing / separation unit ex453 then 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 using a video decoding method corresponding to the video encoding method described in each of the above embodiments, and displays the video or still image included in the linked video file on the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 decodes the audio signal, and the audio is output from the audio output unit ex457. Note that with the widespread use of real-time streaming, audio playback may be socially inappropriate depending on the user's circumstances. Therefore, a configuration that initially plays only the video data without playing the audio signal is desirable. The audio may be played in synchronization only when the user performs an operation such as clicking on the video data.

[0400] Although the smartphone ex115 has been used as an example, three types of implementation 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 onto video data is received or transmitted, but the multiplexed data may also 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] While the main control unit ex460, which includes a CPU, controls the encoding and decoding processes, devices often also include a GPU. Therefore, a configuration is possible in which a memory shared by the CPU and GPU, or a memory with addresses managed for common use, is used to take advantage of the GPU's performance and process a large area at once. This shortens encoding time, ensures real-time performance, and achieves low latency. It is particularly efficient to perform motion estimation, deblocking filtering, SAO (Sample Adaptive Offset), and transformation and quantization processes at a picture level or other unit in the GPU rather than 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 device configurations, 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 and a memory; The circuit uses the memory to perform, in 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 the lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first target block by motion compensation using the second motion vector; deriving a third motion vector for the second block to be processed using the first motion vector for the first block to be processed, when a second block to be processed that is a block to be processed after the first block to be processed belongs to the same picture as the first 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 that of 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 the lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first target block by motion compensation using the second motion vector; deriving a third motion vector for the second block to be processed using the first motion vector for the first block to be processed, when a second block to be processed that is a block to be processed after the first block to be processed belongs to the same picture as the first 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 that of 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 and a memory; The circuit uses the memory to perform, in 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 the lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first target block by motion compensation using the second motion vector; deriving a third motion vector for the second block to be processed using the first motion vector for the first block to be processed, when a second block to be processed that is a block to be processed after the first block to be processed belongs to the same picture as the first 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 that of 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 the lowest evaluation value in the peripheral area of ​​the first motion vector; generating a predicted image of the first target block by motion compensation using the second motion vector; deriving a third motion vector for the second block to be processed using the first motion vector for the first block to be processed, when a second block to be processed that is a block to be processed after the first block to be processed belongs to the same picture as the first 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 that of 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