Transmitting device and transmitting method

Abstract

To provide a transmission device that can achieve further improvements.SOLUTION: A transmission device performs: dividing a block to be encoded into first to third sub blocks in a first direction; when the second sub block is divided into a plurality of partitions, writing a first parameter indicating a division direction of the second sub block, in a bitstream ; when the first parameter indicates a first direction, skipping writing of a division mode parameter in the bitstream and prohibiting division of the second sub block into two partitions in the first direction; when the first parameter indicates a second direction different from the first direction, writing the division mode parameter in the bitstream and dividing the second sub block into two or three partitions in the second direction according to the division mode parameter; encoding the first to third sub blocks; generating a bitstream including the block to be encoded which has been encoded; and transmitting the generated bitstream.SELECTED DRAWING: Figure 27

Description

[Technical field]

[0001] The present disclosure relates to a transmitting device and a transmitting method. [Background technology]

[0002] A video coding standard called High-Efficiency Video Coding (HEVC) has been standardized by the Joint Collaborative Team on Video Coding (JCT-VC). [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] Further improvements in such encoding and decoding techniques are required.

[0005] Therefore, an object of the present disclosure is to provide a transmitting device and a transmitting method that can achieve further improvements. [Means for solving the problem]

[0006] A transmission device according to one embodiment of the present disclosure includes a circuit and a memory, wherein the circuit uses the memory to divide a block to be coded into a first sub-block, a second sub-block, and a third sub-block in a first direction, the second sub-block being located between the first sub-block and the third sub-block; when the second sub-block is divided into a plurality of partitions, writes a first parameter indicating a division direction of the second sub-block into a bitstream; when the first parameter indicates the first direction, skips writing a division mode parameter into the bitstream and prohibits division of the second sub-block into two partitions in the first direction; when the first parameter indicates a second direction different from the first direction, writes the division mode parameter into the bitstream; divides the second sub-block into two or three partitions in the second direction according to the division mode parameter; codes the first sub-block, the second sub-block, and the third sub-block; generates a bitstream including the coded block to be coded; and transmits the generated bitstream.

[0007] Furthermore, these general or specific aspects may be realized by a system, a method, an integrated circuit, a computer program, or a recording medium such as a computer-readable CD-ROM, or may be realized by any combination of a system, a method, an integrated circuit, a computer program, and a recording medium. Effect of the Invention

[0008] The present disclosure can provide a transmitting device and a transmitting method that can achieve further improvements. [Brief description of the drawings]

[0009] [Figure 1] FIG. 1 is a block diagram showing a functional configuration of a coding device according to the first embodiment. [Diagram 2] FIG. 2 is a diagram showing an example of block division according to the first embodiment. [Diagram 3]FIG. 3 is a table showing the transform basis functions corresponding to each transform type. [Figure 4A] FIG. 4A is a diagram showing an example of the shape of a filter used in ALF. [Figure 4B] FIG. 4B is a diagram showing another example of the shape of the filter used in the ALF. [Figure 4C] FIG. 4C is a diagram showing another example of the shape of the filter used in the ALF. [Figure 5A] FIG. 5A is a diagram showing 67 intra prediction modes in intra prediction. [Figure 5B] FIG. 5B is a flowchart for explaining an outline of the predicted image correction process by the OBMC process. [Figure 5C] FIG. 5C is a conceptual diagram for explaining an overview of the predicted image correction process by the OBMC process. [Figure 5D] FIG. 5D is a diagram showing an example of FRUC. [Figure 6] FIG. 6 is a diagram for explaining pattern matching (bilateral matching) between two blocks along a motion trajectory. [Figure 7] FIG. 7 is a diagram for explaining pattern matching (template matching) between a template in a current picture and a block in a reference picture. [Figure 8] FIG. 8 is a diagram for explaining a model assuming uniform linear motion. [Figure 9A] FIG. 9A is a diagram for explaining derivation of a motion vector for each sub-block based on motion vectors of a plurality of adjacent blocks. [Figure 9B] FIG. 9B is a diagram for explaining an overview of the motion vector derivation process in the merge mode. [Figure 9C] FIG. 9C is a conceptual diagram for explaining an overview of the DMVR process. [Figure 9D] FIG. 9D is a diagram for explaining an outline of a predicted image generating method using luminance correction processing by LIC processing. [Figure 10]FIG. 10 is a block diagram showing a functional configuration of a decoding device according to the first embodiment. As shown in FIG. [Figure 11] FIG. 11 shows an encoding process performed by an encoding method and an encoding device according to a first aspect. [Figure 12] FIG. 12 shows that if the first cost is determined to be lower than all of the second costs, the second block encoding process eliminates the third block encoding process, which includes first dividing the block into three smaller partitions. [Figure 13] FIG. 13 shows another example of the first cost with different binary tree depths. [Figure 14] FIG. 14 shows an encoding process performed by an encoding method and an encoding device according to the second aspect. [Figure 15] FIG. 15 illustrates that if any of the first costs are determined to be less than all of the second costs, then a block encoding process is selected from the second set of block encoding processes. [Figure 16] FIG. 16 shows an encoding process performed by an encoding method and an encoding device according to a third aspect. [Figure 17] FIG. 17 shows that if the vertical gradient of a rectangular block whose height is greater than its width is greater than the horizontal or diagonal gradients, the second set of block encoding processes eliminates the first block encoding process, which includes first splitting the block vertically into three smaller partitions. [Figure 18] FIG. 18 shows that if the horizontal gradient of a rectangular block whose width is greater than its height is greater than the vertical or diagonal gradient, the second set of block encoding processes eliminates the first block encoding process, which includes first splitting the block horizontally into three smaller partitions. [Figure 19A] FIG. 19A shows an example of the calculation of pixel intensity change in the horizontal direction. [Figure 19B] FIG. 19B shows an example of the calculation of pixel intensity change in the horizontal direction. [Figure 20]FIG. 20 shows an encoding process performed by an encoding method and an encoding device according to a fourth aspect. [Figure 21] Figure 21(a) shows that a block coding process from the second set of block coding processes is selected when the block coding process generates a sub-partition area that is half the area of ​​the block and the horizontal gradient is greater than the vertical gradient. Figure 21(b) shows that a block coding process from the second set of block coding processes is selected when the block coding process generates a sub-partition area that is half the area of ​​the block and the vertical gradient is greater than the horizontal gradient. [Figure 22] FIG. 22 shows an encoding process performed by an encoding method and an encoding device according to a fifth aspect. [Figure 23A] FIG. 23A shows an example of splitting a 16×8 block into three smaller partitions in a direction parallel to the height of the 16×8 block when the transform for 16×2 is not implemented. [Figure 23B] FIG. 23B shows an example of dividing a 16×8 block into four smaller partitions in a direction parallel to the height of the 16×8 block when the transform for 16×2 is not implemented. [Figure 24] FIG. 24 shows an encoding process performed by an encoding method and an encoding device according to a sixth aspect. [Figure 25A] FIG. 25A shows examples of candidate partition structures for dividing a 16×16 block. [Figure 25B] FIG. 25B shows examples of candidate partition structures for dividing an 8×8 block. [Figure 26] FIG. 26 shows an encoding process performed by an encoding method and an encoding device according to a seventh aspect. [Figure 27] FIG. 27 shows an example where a 32×32 block is first divided into three sub-blocks, and then the largest sub-block is divided into two partitions. [Figure 28] FIG. 28 shows an encoding process performed by an encoding method and an encoding device according to the eighth aspect. [Figure 29] FIG. 29 shows an example of first dividing a 64×64 block into three sub-blocks, and then dividing every sub-block into two partitions. [Diagram 30] FIG. 30 shows examples of partition modes and directions for splitting a block into two or three partitions. [Diagram 31] FIG. 31 shows an example of the location of parameters in the bitstream. [Diagram 32] FIG. 32 is a diagram showing the overall configuration of a content supply system that realizes a content distribution service. [Diagram 33] FIG. 33 is a diagram showing an example of a coding structure in scalable coding. [Diagram 34] FIG. 34 is a diagram showing an example of a coding structure in scalable coding. [Diagram 35] FIG. 35 is a diagram showing an example of a display screen of a web page. [Diagram 36] FIG. 36 is a diagram showing an example of a display screen of a web page. [Figure 37] FIG. 37 is a diagram illustrating an example of a smartphone. [Figure 38] FIG. 38 is a block diagram showing an example of the configuration of a smartphone. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

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

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

[0012] (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.

[0013] 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.

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

[0015] The manner of implementing the processes and / or configurations described in each aspect of the present disclosure is not limited to the above examples. For example, the processes and / or configurations may be implemented in a device used for a purpose different from the video / image encoding device or video / image decoding device disclosed in the first embodiment, or the processes and / or configurations described in each aspect may be implemented alone. Furthermore, the processes and / or configurations described in different aspects may be implemented in combination.

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

[0017] 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.

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

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

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

[0021] 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.

[0022] 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).

[0023] 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.

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

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

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

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

[0028] 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.

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

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

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

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

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

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

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

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

[0037] 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 a 16x16 transformation matrix is ​​used to transform the array.

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

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

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

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

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

[0043] [Dequantization section] The inverse quantization unit 112 inverse quantizes the quantized coefficients input from the quantization unit 108. Specifically, the inverse quantization unit 112 inverse quantizes the quantized coefficients of the current block in a predetermined scanning order. Then, the inverse quantization unit 112 outputs the inverse quantized transform coefficients of the current block to the inverse transform unit 114.

[0044] [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.

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

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

[0047] [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.

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

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

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

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

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

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

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

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

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

[0057] [Intra prediction section] The intra prediction unit 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also called intra-screen prediction) of the current block with reference to a block in the current picture stored in the block memory 118. Specifically, the intra prediction unit 124 generates an intra prediction signal by performing intra prediction with reference to samples (e.g., luminance values, chrominance values) of blocks adjacent to the current block, and outputs the intra prediction signal to the prediction control unit 128.

[0058] 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.

[0059] 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).

[0060] The multiple directional prediction modes include, for example, 33 prediction modes defined in the H.265 / HEVC standard. The multiple directional prediction modes may include 32 prediction modes in addition to the 33 directions (a total of 65 directional prediction modes). FIG. 5A is a diagram showing 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra prediction. The solid arrows represent the 33 directions defined in the H.265 / HEVC standard, and the dashed arrows represent the additional 32 directions.

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

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

[0063] [Inter prediction section] The inter prediction unit 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also called inter prediction) of the current block with reference to a reference picture stored in the frame memory 122 and different from the current picture. The inter prediction is performed in units of the current block or a sub-block (e.g., 4x4 block) in the current block. For example, the inter prediction unit 126 performs motion estimation in the reference picture for the current block or the sub-block. Then, the inter prediction unit 126 generates an inter prediction signal of the current block or the sub-block by performing motion compensation using motion information (e.g., a motion vector) obtained by the motion estimation. Then, the inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.

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

[0065] In addition, the inter prediction signal may be generated using not only the motion information of the current block obtained by motion search, but also the motion information of the adjacent block. Specifically, the inter prediction signal may be generated for each sub-block in the current block by performing weighted addition of the prediction signal based on the motion information obtained by motion search and the prediction signal based on the motion information of the adjacent block. Such inter prediction (motion compensation) may be called OBMC (overlapped block motion compensation).

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

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

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

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

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

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

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

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

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

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

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

[0077] 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.

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

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

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

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

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

[0083] In the first pattern matching, pattern matching is performed between two blocks in two different reference pictures that are along the motion trajectory of the current block. Therefore, in the first pattern matching, an area in another reference picture along the motion trajectory of the current block is used as a predetermined area for calculating the evaluation value of the above-mentioned candidate.

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

[0085] Under the assumption of continuous motion trajectories, the motion vectors (MV0, MV1) pointing to two reference blocks are proportional to the temporal distances (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, if the current picture is located between two reference pictures in time and the temporal distances from the current picture to the two reference pictures are equal, the first pattern matching derives bidirectional motion vectors that are mirror-symmetric.

[0086] In the second pattern matching, pattern matching is performed between a template in the current picture (a block adjacent to the current block in the current picture (e.g., an upper and / or left adjacent block)) and a block in the reference picture. Therefore, in the second pattern matching, a block adjacent to the current block in the current picture is used as a predetermined area for calculating the evaluation value of the above-mentioned candidate.

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

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

[0089] Here, a mode for deriving a motion vector based on a model assuming uniform linear motion will be described. This mode is based on BIO (bi-directional optical This is sometimes called "flow" mode.

[0090] Fig. 8 is a diagram for explaining a model assuming uniform linear motion. In Fig. 8, (vx, vy) indicates a velocity vector, and τ0 and τ1 indicate the temporal distance between the current picture (Cur Pic) and two reference pictures (Ref0, Ref1), respectively. (MVx0, MVy0) indicates a motion vector corresponding to the reference picture Ref0, and (MVx1, MVy1) indicates a motion vector corresponding to the reference picture Ref1.

[0091] In this case, under the assumption of uniform linear motion of the velocity vector (vx, vy), (MVx0, MVy0) and (MVx1, MVy1) are expressed as (vxτ0, vyτ0) and (-vxτ1, -vyτ1), respectively, and the following optical flow equation (1) holds.

[0092]

number

[0093] Here, I(k) denotes the luminance value of reference image k (k=0,1) after motion compensation. This optical flow equation indicates that the sum of (i) the time derivative of the luminance value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of the reference image, and (iii) the product of the vertical velocity and the vertical component of the spatial gradient of the reference image is equal to zero. Based on a combination of this optical flow equation and Hermite interpolation, block-wise motion vectors obtained from a merge list or the like are corrected pixel by pixel.

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

[0095] Here, a mode in which a motion vector is derived for each sub-block based on the motion vectors of a plurality of adjacent blocks will be described. This mode is sometimes called an affine motion compensation prediction mode.

[0096] Fig. 9A is a diagram for explaining derivation of a motion vector for each subblock based on the motion vectors of multiple adjacent blocks. In Fig. 9A, the current block includes 16 4x4 subblocks. 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 subblocks. Then, using the two motion vectors v0 and v1, the motion vector (vx, vy) of each subblock in the current block is derived by the following formula (2).

[0097]

number

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

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

[0100] [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.

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

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

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

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

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

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

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

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

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

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

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

[0112] 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.

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

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

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

[0116] 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.

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

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

[0119] 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.

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

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

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

[0123] 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.

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

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

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

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

[0128] [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 .

[0129] 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.

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

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

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

[0133] [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.

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

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

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

[0137] 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.

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

[0139] [Inter prediction section] The inter prediction unit 218 predicts the current block by referring to a reference picture stored in the frame memory 214. The prediction is performed in units of the current block or sub-blocks (e.g., 4x4 blocks) in the current block. For example, the inter prediction unit 218 generates an inter prediction signal of the current block or sub-block by performing motion compensation using motion information (e.g., motion vectors) interpreted from the encoded bitstream, and outputs the inter prediction signal to the prediction control unit 220.

[0140] In addition, when the information interpreted from the encoded bitstream indicates that the OBMC mode is to be applied, the inter prediction unit 218 generates an inter prediction signal using not only the motion information of the current block obtained by motion search, but also the motion information of adjacent blocks.

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

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

[0143] [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.

[0144] Next, each aspect of block division in the encoding device 100 and the decoding device 200 will be specifically described with reference to the drawings. Note that, hereinafter, a current block to be encoded or a current block to be decoded will simply be referred to as a block.

[0145] (First aspect) FIG. 11 shows an encoding process performed by an encoding method and an encoding device according to a first aspect.

[0146] In step S1001, a first cost is calculated from a first block encoding process. Here, the first block encoding process does not include dividing the block into a plurality of partitions, and the cost includes distortion. For example, the cost can be calculated by adding a value indicating the encoding distortion and a value obtained by multiplying a value indicating the amount of generated code by a Lagrange undetermined multiplier. The encoding distortion can be calculated based on, for example, the sum of absolute differences between a locally decoded image and an original image.

[0147] In step S1002, a second cost is calculated from a second block encoding process, where the second block encoding process includes first dividing the block into two smaller partitions.

[0148] In step S1003, it is determined whether the first cost is lower than the second cost.

[0149] In step S1004, if it is determined that the first cost is less than the second cost, a block encoding process is selected from a second set of block encoding processes, where the second set of block encoding processes does not include a third block encoding process, and the third block encoding process includes first dividing the block into three smaller partitions.

[0150] 12 illustrates that if the first cost is determined to be lower than all of the second costs, then the second block encoding process set eliminates a third block encoding process that includes first dividing the block into three smaller partitions. The second block division process set is a subset of the first block division process set.

[0151] 12, if it is determined that the first cost is not lower than any of the second costs, a block coding process is selected from the first block coding process set including the third block coding process. On the other hand, if it is determined that the first cost is lower than all of the second costs, a block coding process is selected from the second block coding process set obtained by excluding the third block coding process from the first block coding process set.

[0152] FIG. 13 shows other examples of first costs with different binary tree depths. In the upper example, the cost calculation is performed on the left partition obtained by vertically dividing the block into two partitions. In the lower example, the cost calculation is performed on the top subpartition obtained by horizontally dividing the block into two partitions and then horizontally dividing the top partition into two subpartitions. In both examples, if it is determined that the first cost is lower than all the second costs, the second block encoding process set eliminates the third block encoding process having a step of first dividing the block into three smaller partitions. The second block division process set is a subset of the first block division process set.

[0153] In step S1005, if it is determined that the first cost is not less than the second cost, a block encoding process is selected from a first set of block encoding processes, where the first set of block encoding processes includes at least a third block encoding process.

[0154] In step S1006, the block is encoded using the selected block encoding process.

[0155] [Effect of the first aspect] This aspect reduces the total number of candidates for partition structures on the encoding side, and reduces the encoding complexity.

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

[0157] (Second aspect) FIG. 14 shows an encoding process performed by an encoding method and an encoding device according to the second aspect.

[0158] In step S2001, a first cost is calculated from a first block encoding process, where the first block encoding process includes dividing the block into only two smaller partitions, i.e., in the first block encoding process, the block is divided into two partitions and each partition is not further divided.

[0159] In step S2002, a second cost is calculated from a second block encoding process, where the second block encoding process includes an initial step of dividing the block into two smaller partitions and a subsequent step of dividing into three or more partitions.

[0160] Step S2003 is similar to step S1003.

[0161] Step S2004 is similar to step S1004.

[0162] 15 illustrates that if any of the first costs are determined to be less than all of the second costs, then a block encoding process is selected from the second set of block encoding processes, which excludes a third block encoding process that has a step of first splitting the block into three smaller partitions.

[0163] The second block encoding process set is a subset of the first block encoding process set, i.e., the second block encoding process set is obtained by excluding a predetermined encoding process from the first block encoding process set, where the predetermined encoding process includes at least a third block encoding process.

[0164] Step S2005 is similar to step S1005.

[0165] Step S2006 is similar to step S1006.

[0166] [Effect of the second aspect] This aspect reduces the total number of candidates for partition structures on the encoding side, and reduces the encoding complexity.

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

[0168] (Third aspect) FIG. 16 shows an encoding process performed by an encoding method and an encoding device according to a third aspect.

[0169] In step S3001, at least a first gradient of a rectangular block is calculated in a first direction parallel to a long side of the rectangular block, where the gradient calculation includes a directional change of at least intensity or color.

[0170] In step S3002, a second gradient of at least the rectangular block is calculated in a second direction, where the second direction is different from the first direction.

[0171] In step S3003, it is determined whether the first gradient is greater than the second gradient.

[0172] In step S3004, if it is determined that the first gradient is greater than the second gradient, a block encoding process is selected from a second set of block encoding processes, where the second set of block encoding processes does not include at least the first block encoding process, and the first block encoding process includes initially dividing the block into three smaller partitions in the first direction.

[0173] The second set of block encoding processes is a subset of the first set of block encoding processes, i.e., the second set of block encoding processes is obtained by excluding a predetermined encoding process from the first set of block encoding processes, where the predetermined encoding process includes at least the first block encoding process.

[0174] 17 shows that if the vertical gradient of a rectangular block whose height is greater than its width is greater than the horizontal or diagonal gradient, the second set of block encoding processes excludes the first block encoding process that includes first dividing the block vertically into three smaller partitions. That is, if the vertical gradient is greater than the horizontal or diagonal gradient, a block encoding process is selected from the second set of block encoding processes from which the first block encoding process has been excluded. Conversely, if the vertical gradient is not greater than the horizontal or diagonal gradient, a block encoding process is selected from the first set of block encoding processes that includes the first block encoding process.

[0175] 18 shows that if the horizontal gradient of a rectangular block whose width is greater than its height is greater than the vertical or diagonal gradient, then the second set of block encoding processes excludes the first block encoding process that includes first dividing the block horizontally into three smaller partitions. That is, if the horizontal gradient is greater than the vertical or diagonal gradient, then a block encoding process is selected from the second set of block encoding processes from which the first block encoding process has been excluded. Conversely, if the horizontal gradient is not greater than the vertical or diagonal gradient, then a block encoding process is selected from the first set of block encoding processes, including the first block encoding process.

[0176] 19A and 19B show examples of calculations of pixel intensity changes in the horizontal direction. Horizontal gradients are calculations of intensity or color changes in the horizontal direction. Similarly, vertical gradients can be calculated based on intensity or color changes in the vertical direction. Similarly, diagonal gradients can be calculated based on intensity or color changes in the diagonal direction.

[0177] Specifically, in the example of FIG. 19A, first, the absolute difference between two adjacent pixels in a horizontal pixel row is calculated. For example, in the first row, the absolute difference values ​​h1_12=abs(p1,p2), h1_23, and h1_34 are calculated. Then, in each pixel row, the average absolute difference value (for example, the average absolute difference value H1 in the first row=average(h1_12+h1_23+h1_34)) is calculated. The horizontal gradient is calculated by calculating the average absolute difference value average (average(H1+H2+H3+H4)) of the multiple pixel columns calculated in this way.

[0178] Also, in the example of FIG. 19B, a one-dimensional filter is first applied to three adjacent pixels in a horizontal pixel row. For example, h1_123 (=2×p2-p1-p3) and h1_234 are calculated using filter coefficients (-1, 2, -1). Then, for each pixel row, the average of the filtered values ​​(e.g., H1=average(h1_123+h1_234) for the first row) is calculated. Furthermore, the horizontal gradient is calculated by calculating the average (average(H1+H2+H3+H4)) for multiple pixel rows.

[0179] The first gradient and the second gradient are not limited to only vertical / horizontal gradients. It may include gradients in other directions, such as diagonal, or even other directions. The gradient calculation described in Figures 19A and 19B is just an example, and other methods for gradient calculation may be applied.

[0180] In step S3005, if it is determined that the first gradient is not greater than the second gradient, a block encoding process is selected from a first set of block encoding processes, where the first set of block encoding processes includes the first block encoding process.

[0181] In step S3006, the block is encoded using the selected block encoding process.

[0182] [Effect of the third aspect] This aspect reduces the total number of candidates for partition structures on the encoding side, and reduces the encoding complexity.

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

[0184] (Fourth aspect) FIG. 20 shows an encoding process performed by an encoding method and an encoding device according to a fourth aspect.

[0185] In step S4001, it is determined whether the step of dividing a block in the first block encoding process generates partitions that are half the size of the block.

[0186] In step S4002, if it is determined that the step of dividing the block in the first block encoding process produces partitions that are half the size of the block, then at least the gradient of the block is calculated.

[0187] In step S4003, a second set of block encoding processes is generated from the first set of block encoding processes by eliminating at least block encoding processes that use gradient information, where the eliminated block encoding processes include at least a step of first splitting the block into three smaller partitions.

[0188] In step S4004, a block encoding process is selected from a second set of block encoding processes.

[0189] 21(a) shows that if a block encoding process produces a sub-partition region that is half the area of ​​the block and the horizontal gradient is greater than the vertical gradient, then a block encoding process from the second set of block encoding processes is selected. The second set of encoding processes eliminates the process of encoding a block with multiple partitions and the step of first splitting the block horizontally into three smaller partitions.

[0190] 21(b) shows that if a block encoding process produces a sub-partition region that is half the area of ​​the block and the vertical gradient is greater than the horizontal gradient, then a block encoding process from the second set of block encoding processes is selected. The second set of encoding processes eliminates the process of encoding a block with multiple partitions and the step of first splitting the block vertically into three smaller partitions.

[0191] In step S4005, if it is determined that the step of dividing the block in the first block encoding process does not generate partitions that are half the size of the block, then a block encoding process is selected from the first set of block encoding processes.

[0192] In step S4006, the block is encoded using the selected block encoding process.

[0193] [Effect of the fourth aspect] This aspect reduces the total number of candidates for partition structures on the encoding side, and reduces the encoding complexity.

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

[0195] (Fifth aspect) FIG. 22 shows an encoding process performed by an encoding method and an encoding device according to a fifth aspect.

[0196] In step S5001, a first side of the block is identified as the longer of the two sides, and a second side of the block is identified as the non-long side of the block.

[0197] In step S5002, when a block is divided into three or more smaller partitions, it is determined whether block division in a direction parallel to the first edge generates a partition of a size that is not supported by at least the prediction or transformation process.

[0198] In step S5003, if it is determined that the block division in the direction parallel to the first side generates a partition of a size that is not supported at least in the prediction process or the transformation process, the block is divided into smaller partitions in the direction parallel to the second side. FIG. 23A shows an example of dividing a 16×8 block into three smaller partitions in the direction parallel to the height of the 16×8 block (vertical direction) when the transformation for 16×2 is not implemented. FIG. 23B shows an example of dividing a 16×8 block into four smaller partitions in the direction parallel to the height of the 16×8 block (vertical direction) when the transformation for 16×2 is not implemented. Here, the size 16×2 is the division of the block in the direction parallel to the width of the block (horizontal direction). That is, in FIG. 23A and FIG. 23B, dividing the block into thirds or fourths in the horizontal direction parallel to the first side (long side) is not allowed.

[0199] In step S5004, if it is determined that the block division in the direction parallel to the first side does not generate a partition of a size that is not supported at least in the prediction process or the transformation process, a division direction parameter is written into the bitstream. Here, the division direction parameter indicates the block division direction, and may indicate the horizontal or vertical direction. The position of the division direction parameter is shown in FIG. 31.

[0200] In step S5005, the block is divided into smaller partitions in the direction indicated by the division direction parameter.

[0201] In step S5006, the partition or a sub-partition of the partition is encoded.

[0202] In addition, the terms "write" and "into (the bitstream)" in step S5004 of the encoding process performed by the encoding method and encoding device, and the term "encode" in step S5006 may be replaced with the terms "interpret", "from (the bitstream)" and "decode" for the decoding process performed by the decoding method and image decoding device.

[0203] [Effect of the fifth aspect] This aspect does not need to code the split direction with some specific block size, improving the coding efficiency. The present disclosure also reduces the total number of candidates for split direction on the coding side, and reduces the coding complexity.

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

[0205] (Sixth aspect) FIG. 24 shows an encoding process performed by an encoding method and an encoding device according to a sixth aspect.

[0206] In step S6001, it is determined whether or not dividing a block into three smaller partitions in each of a plurality of directions produces a partition of a size that is not supported in at least the prediction or transformation process.

[0207] In step S6002, if it is determined that splitting the block into three smaller partitions in each of multiple directions would generate at least a partition of a size that is not supported by the prediction or transformation process, the block is split in one direction into two smaller partitions.

[0208] In step S6003, if it is determined that the block division into three smaller partitions in at least one of the multiple directions does not generate a partition of a size that is not supported in at least the prediction process or the transformation process, a parameter is written to the bitstream. Here, the parameter indicates the number of small partitions by dividing the block. Here, the parameter may be a partition mode parameter. Here, the partition mode parameter may indicate the number of sub-blocks having a predetermined division ratio for dividing the block. Also, the partition mode parameter may indicate at least the number of divisions of the block. The location of the partition mode parameter is shown in FIG. 31.

[0209] In step S6004, the block is divided unidirectionally into several partitions according to the parameters. The number can be 2 or 3.

[0210] Step S6005 is similar to step S5006.

[0211] FIG. 25A shows an example of a candidate partition structure for dividing a 16×16 block. FIG. 25B shows an example of a candidate partition structure for dividing an 8×8 block. As shown in FIG. 25A, there are four candidates for the partition structure for dividing a 16×16 block. Meanwhile, as shown in FIG. 25B, there are two candidates for the partition structure for dividing an 8×8 block. In this example, since 8×2 and 2×8 are not supported in the transformation process, the partition structure that divides the 8×8 block into three smaller partitions along the horizontal and vertical directions is excluded from the candidates for the partition structure. That is, since 8×2 and 2×8 sizes are not supported in the transformation process, dividing the 8×8 block into three 3-subblocks is not allowed.

[0212] In addition, the terms "write" and "into (the bitstream)" in step S6003 of the encoding process performed by the encoding method and encoding device, and the term "encode" in step S6005 may be replaced with the terms "interpret", "from (the bitstream)" and "decode" for the decoding process performed by the decoding method and image decoding device.

[0213] [Effect of the 6th aspect] This aspect does not need to code the split direction with some specific block size, improving the coding efficiency. The present disclosure also reduces the total number of candidates for split direction on the coding side, and reduces the coding complexity.

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

[0215] (Seventh aspect) FIG. 26 shows an encoding process performed by an encoding method and an encoding device according to a seventh aspect.

[0216] In step S7001, a block is divided into first to third sub-blocks in the first direction. In this embodiment, as shown in FIG. 30, the division ratio of the three divisions is 1:2:1. Therefore, the second sub-block located between the first and third sub-blocks is larger in size than the first and third sub-blocks. The first to third sub-blocks may be assigned index values ​​of 0 to 2 in order.

[0217] In step S7002, if the second sub-block is divided into multiple partitions, a partition mode parameter is written into the bitstream to indicate the number of partitions. Here, the partition mode parameter may indicate the number of sub-blocks having a predetermined division ratio by dividing the block as shown in Figure 30. Also, the partition mode parameter may indicate only the number of sub-blocks. Also, the partition mode parameter may indicate information other than the division ratio along with the number of sub-blocks. The location of the partition mode parameter is shown in Figure 31.

[0218] In step S7003, it is determined whether the partition mode parameter indicates that the number of partitions is two.

[0219] In step S7004, if it is determined that the partition mode parameter indicates that the number of partitions is two, the second sub-block is partitioned into two partitions in a second direction different from the first direction. That is, partitioning the second sub-block into two partitions in the first direction is prohibited. Therefore, the partition direction parameter is not written to the bitstream. That is, writing of the partition direction parameter to the bitstream is omitted (i.e., skipped).

[0220] FIG. 27 shows an example of a method for dividing a 32×32 block. In (a), the 32×32 block is first divided vertically into two subblocks, and then all subblocks are divided vertically into two partitions. In (b), the 32×32 block is first divided vertically into three subblocks, and then the largest subblock is divided into two partitions. Here, the division direction for dividing the largest subblock is set to be parallel to the short side of the 16×32 block. That is, in (b), the largest subblock is allowed to be divided horizontally into two partitions, but not vertically. Here, the largest subblock corresponds to the second subblock. This prevents the same partition structure (also called a repeated partition structure) from occurring in the division methods (a) and (b) that are different from each other.

[0221] In step S7005, if it is determined that the partition mode parameter does not indicate that the number of partitions is two, a partition direction parameter is written into the bitstream, where the partition direction parameter indicates the partition direction of the block, and may indicate the horizontal or vertical direction as shown in Figure 30. The position of the partition direction parameter is shown in Figure 31.

[0222] In step S7006, the second sub-block is divided into three or more partitions in the direction indicated by the division direction parameter.

[0223] Step S7007 is similar to step S5006.

[0224] In addition, the terms "write" and "into (the bitstream)" in steps S7002 and S7005 of the encoding process performed by the encoding method and encoding device, and the term "encode" in step S7007 may be replaced with the terms "interpret", "from (the bitstream)" and "decode" for the decoding process performed by the decoding method and image decoding device.

[0225] Note that the steps and the order of steps as described above are merely examples, and are not limited thereto. Any order of steps that can be thought of by a person skilled in the art may be changed without departing from the spirit of the present disclosure. For example, in FIG. 26, the division direction parameter may be written into the bitstream before the division mode parameter. That is, in FIG. 31, the positions of the division mode parameter and the division direction parameter in the bitstream may be changed. Also, in FIG. 26, the order of step S7002 and step S7005 may be changed.

[0226] In this case, when the second subblock is divided into a plurality of partitions, first, a division direction parameter is written to the bit stream. Then, it is determined whether or not the division direction parameter indicates a first direction. Here, when the division direction parameter indicates the first direction, the second subblock is divided into three partitions in the first direction. That is, the division of the second block into two partitions in the first direction is prohibited. Therefore, the division mode parameter is not written to the bit stream. That is, writing of the division mode parameter to the bit stream is omitted or skipped. On the other hand, when the division direction parameter indicates a second direction different from the first direction, a division mode parameter indicating the division number of the second subblock is written to the bit stream, and the second subblock is divided in the second direction into the number of partitions indicated by the division mode parameter. Here, the division direction parameter is an example of a first parameter indicating the division direction of the second subblock, and the division mode parameter is an example of a second parameter indicating the division number of the second subblock.

[0227] [Effect of the seventh aspect] This aspect does not need to code the division direction or the number of divisions for some specific block size, improving the coding efficiency. The present disclosure also reduces the total number of candidates for the division direction on the coding side, reducing the coding complexity.

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

[0229] (Eighth aspect) FIG. 28 shows an encoding process performed by an encoding method and an encoding device according to the eighth aspect.

[0230] In step S8001, a block is divided into first to third sub-blocks in a first direction.

[0231] In step S8002, it is determined whether each of the first and second sub-blocks is further divided into two smaller partitions in a second direction different from the first direction.

[0232] In step S8003, if it is determined that each of the first and second sub-blocks is further divided into two smaller partitions in a second direction different from the first direction, the third sub-block is divided into a smaller partition. If the third sub-block is divided into two partitions, the third sub-block is divided in the same direction as the first direction.

[0233] In step S8004, if it is not determined that each of the first and second sub-blocks is further divided into two smaller partitions in a second direction different from the first direction, a split direction parameter is written into the bitstream, where the split direction parameter may indicate a horizontal or vertical direction as shown in Figure 30. The position of the split direction parameter is shown in Figure 31.

[0234] In step S8005, the first sub-block is divided into smaller partitions in the direction indicated by the division direction parameter.

[0235] Step S8006 is similar to step S5006.

[0236] Figure 29 shows examples of how to divide a 64x64 block. In (a), the 64x64 block is first divided vertically into two sub-blocks, and then every sub-block is divided horizontally into three partitions. In (b), the 64x64 block is first divided horizontally into three sub-blocks, and then every sub-block is divided into two partitions.

[0237] In (b), the direction for dividing the 64x64 block into the first to third sub-blocks is horizontal, and the direction for dividing the first two sub-blocks (i.e., the first and second sub-blocks) is vertical. The direction for dividing the third sub-block is horizontal, which is the same direction as the direction used for dividing the 64x64 block. That is, in (b), dividing the third sub-block vertically into two partitions is prohibited. This prevents the same partition structure from occurring in the division methods (a) and (b), which are different from each other.

[0238] In step S8005, the first sub-block is divided into two partitions in a direction indicated by the division direction parameter.

[0239] In addition, the terms "write" and "into (the bitstream)" in step S8004 of the encoding process performed by the encoding method and encoding device, and the term "encode" in step S8006 may be replaced with the terms "interpret", "from (the bitstream)" and "decode" for the decoding process performed by the decoding method and image decoding device.

[0240] [Effect of the 8th aspect] This aspect does not need to code the split direction with some specific block size, improving the coding efficiency. The present disclosure also reduces the total number of candidates for split direction on the coding side, and reduces the coding complexity.

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

[0242] (Modification) In all the above aspects, one or more thresholds can be used to determine the number of smaller partitions and the division direction for dividing the block. The thresholds can be adaptively changed according to the picture type, the temporal layer, the quantization parameter, the pixel value activity in the slice, or according to a combination of division patterns such as a combination of quad-tree, binary tree and other divisions, or according to a combination of other coding tools such as triangular division. The thresholds can also be adaptively changed according to the block size such as the block width, the block height, or the multiplication of the block width and the block height. The thresholds can also be adaptively changed according to the block shape and / or the division depth.

[0243] Note that the positions of the partition mode parameter and the partition direction parameter are not limited to those shown in Fig. 31. That is, the signaling of the partition mode parameter and the partition direction parameter does not need to be limited to the CTU level, and may be at other levels (e.g., the picture level, the slice level, the tile group level, or the tile level).

[0244] In addition, a parameter indicating whether to divide a block into two or three sub-blocks or partitions may be written into the bitstream, in which case the encoding method or decoding method according to each aspect described above may be applied when the parameter indicates to divide the block into two or three sub-blocks or partitions.

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

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

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

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

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

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

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

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

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

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

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

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

[0257] In addition to the distributed processing of the distribution itself, the encoding processing of the captured data may be performed by each terminal, may be performed by the server side, or may be shared among the terminals. As an example, in the encoding processing, a processing loop is generally performed twice. In the first loop, the complexity of the image or the amount of code is detected for each frame or scene. In the second loop, processing is performed to maintain the image quality and improve the encoding efficiency. For example, the terminal performs the first encoding processing, and the server side that receives the content performs the second encoding processing, thereby improving the quality and efficiency of the content while reducing the processing load on each terminal. In this case, if there is a request to receive and decode almost in real time, the data encoded once by the terminal can be received and played back by other terminals, making it possible to perform more flexible real-time distribution.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0282] In addition, since viewing of personal content with a small amount of data requires real-time performance, the decoding device first receives the base layer as a top priority, and performs decoding and playback, although this depends on the bandwidth. The decoding device may receive an enhancement layer during this time, and when playback is looped or otherwise played two or more times, play high-quality video including the enhancement layer. In this way, if the stream is scalably encoded, it is possible to provide an experience in which the video is rough when not selected or when viewing begins, but the stream gradually becomes smarter and the image quality improves. In addition to scalable encoding, a similar experience can be provided even if a rough stream played the first time and a second stream encoded with reference to the first video are configured as one stream.

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

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

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

[0286] [Hardware configuration] FIG. 37 is a diagram showing a smartphone ex115. FIG. 38 is a diagram showing a configuration example of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of taking videos and still images, and a display unit ex458 for displaying data obtained by decrypting the video captured by the camera unit ex465 and the video received by the antenna ex450. The smartphone ex115 further includes an operation unit ex466 such as a touch panel, an audio output unit ex457 such as a speaker for outputting audio or sound, an audio input unit ex456 such as a microphone for inputting audio, a memory unit ex467 capable of storing encoded data such as captured video or still images, recorded audio, received video or still images, and e-mail, or decoded data, and a slot unit ex464 which is an interface unit with a SIMex468 for identifying a user and authenticating access to various data including a network. In addition, an external memory may be used instead of the memory unit ex467.

[0287] In addition, a main control unit ex460, which comprehensively controls the display unit ex458 and the operation unit ex466, etc., is connected to a power supply circuit unit ex461, an operation input control unit ex462, a video signal processing unit ex455, a camera interface unit ex463, a display control unit ex459, a modulation / demodulation unit ex452, a multiplexing / separation unit ex453, an audio signal processing unit ex454, a slot unit ex464, and a memory unit ex467 via a bus ex470.

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

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

[0290] When receiving a video attached to an e-mail or chat, or a video linked to a web page, etc., in order to decode the multiplexed data received via the antenna ex450, the multiplexing / separation unit ex453 separates the multiplexed data into a bit stream of video data and a bit stream of audio data by separating the multiplexed data, and supplies the encoded video data to the video signal processing unit ex455 via the synchronization bus ex470, and supplies the encoded audio data to the audio signal processing unit ex454. The video signal processing unit ex455 decodes the video signal by a video decoding method corresponding to the video encoding method shown in each of the above embodiments, and displays the video or still image contained in the linked video file on the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 also decodes the audio signal, and audio is output from the audio output unit ex457. Note that since real-time streaming is widespread, there may be cases where audio playback is socially inappropriate depending on the user's situation. Therefore, as an initial value, a configuration in which only video data is played without playing audio signals is preferable. The audio may be played in sync only when the user performs an operation such as clicking on the video data.

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

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

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

[0294] 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 200 Decryption device 202 Entropy Decoding Unit

Claims

1. The circuit, A memory, The circuit uses the memory to: Dividing a block to be coded into a first sub-block, a second sub-block, and a third sub-block in a first direction, the second sub-block being located between the first sub-block and the third sub-block; When the second sub-block is divided into a plurality of partitions, writing a first parameter indicating a division direction of the second sub-block into a bitstream; skipping writing a partition mode parameter to the bitstream when the first parameter indicates the first direction, and inhibiting partitioning of the second sub-block into two partitions in the first direction; if the first parameter indicates a second direction different from the first direction, writing the partition mode parameter into a bitstream and partitioning the second sub-block in the second direction into two or three partitions according to the partition mode parameter; encoding the first sub-block, the second sub-block, and the third sub-block; generating a bit stream including the encoded current block; transmitting the generated bitstream; Transmitting device.

2. Dividing a block to be coded into a first sub-block, a second sub-block, and a third sub-block in a first direction, the second sub-block being located between the first sub-block and the third sub-block; When the second sub-block is divided into a plurality of partitions, writing a first parameter indicating a division direction of the second sub-block into a bitstream; skipping writing a partition mode parameter to the bitstream when the first parameter indicates the first direction, and inhibiting partitioning of the second sub-block into two partitions in the first direction; if the first parameter indicates a second direction different from the first direction, writing the partition mode parameter into a bitstream and partitioning the second sub-block in the second direction into two or three partitions according to the partition mode parameter; encoding the first sub-block, the second sub-block, and the third sub-block; generating a bit stream including the encoded current block; transmitting the generated bitstream; Transmission method.

Images