Encoding device, encoding method, decoding device, decoding method, transmitting device, and transmitting method

Abstract

To provide an encoding device that can achieve further improvements. [Solution] The encoding device prohibits dividing the second subblock into two partitions in the first direction, encodes the first to third subblocks, and if the second subblock is divided into multiple partitions, writes a first parameter indicating the division direction of the second subblock to the bitstream. If the first parameter indicates a second direction different from the first direction, writes a second parameter indicating the number of divisions of the second subblock to the bitstream. If the first parameter indicates the first direction, does not write the second parameter to the bitstream.

Description

Technical Field

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

Background Art

[0002] A video coding standard called HEVC (High-Efficiency Video Coding) has been standardized by JCT-VC (Joint Collaborative Team on Video Coding).

Prior Art Documents

Non-Patent Documents

[0003]

Non-Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] In such encoding and decoding technologies, further improvements are required.

[0005] Therefore, an object of the present disclosure is to provide an encoding device, an encoding method, a decoding device, a decoding method, a transmission device, and a transmission method that can achieve further improvements.

Means for Solving the Problems

[0006] An encoding device according to one aspect of the present disclosure is an encoding device for encoding a block to be encoded contained in a picture, comprising a circuit and a memory, wherein the circuit uses the memory to divide the block to be encoded into a first subblock, a second subblock and a third subblock in a first direction, the second subblock is located between the first subblock and the third subblock, the division ratio of the first subblock, the second subblock and the third subblock is 1:2:1, the division of the second subblock into two partitions in the first direction is prohibited, the circuit encodes the first subblock, the second subblock and the third subblock, and if the second subblock is divided into multiple partitions, writes a first parameter indicating the division direction of the second subblock to the bitstream, if the first parameter indicates a second direction different from the first direction, writes a second parameter indicating the number of divisions of the second subblock to the bitstream, and does not write the second parameter to the bitstream if the first parameter indicates the first direction.

[0007] These general or specific embodiments may be implemented as a system, method, integrated circuit, computer program, or recording medium such as a computer-readable CD-ROM, or as any combination of a system, method, integrated circuit, computer program, and recording medium. [Effects of the Invention]

[0008] This disclosure can provide a transmitting device and a transmitting method that can achieve further improvements. [Brief explanation of the drawing]

[0009] [Figure 1] Figure 1 is a block diagram showing the functional configuration of the encoding device according to Embodiment 1. [Figure 2] Figure 2 shows an example of block division in Embodiment 1. [Figure 3]Figure 3 is a table showing the transformation basis functions corresponding to each transformation type. [Figure 4A] Figure 4A shows an example of the filter shape used in ALF. [Figure 4B] Figure 4B shows another example of the filter shape used in ALF. [Figure 4C] Figure 4C shows another example of the filter shape used in ALF. [Figure 5A] Figure 5A shows the 67 intra-prediction modes in intra-prediction. [Figure 5B] Figure 5B is a flowchart illustrating the overview of the predictive image correction process using OBMC processing. [Figure 5C] Figure 5C is a conceptual diagram illustrating the overview of the predictive image correction process using OBMC processing. [Figure 5D] Figure 5D shows an example of FRUC. [Figure 6] Figure 6 illustrates pattern matching (bilateral matching) between two blocks along a motion trajectory. [Figure 7] Figure 7 illustrates pattern matching (template matching) between a template in the current picture and a block in the referenced picture. [Figure 8] Figure 8 is a diagram illustrating a model that assumes uniform linear motion. [Figure 9A] Figure 9A is a diagram illustrating the derivation of subblock-level motion vectors based on the motion vectors of multiple adjacent blocks. [Figure 9B] Figure 9B is a diagram illustrating the overview of the motion vector derivation process using merge mode. [Figure 9C] Figure 9C is a conceptual diagram illustrating the overview of DMVR processing. [Figure 9D] Figure 9D is a diagram illustrating the outline of a predictive image generation method using luminance correction processing by LIC processing. [Figure 10]FIG. 10 is a block diagram showing a functional configuration of a decoding apparatus according to Embodiment 1. [Figure 11] FIG. 11 shows an encoding process performed by an encoding method and an encoding apparatus according to the first aspect. [Figure 12] FIG. 12 shows that when it is determined that the first cost is lower than all of the second costs, the second block encoding process excludes the third block encoding process including a step of first dividing a block into three smaller partitions. [Figure 13] FIG. 13 shows another example of the first cost having different binary tree depths. [Figure 14] FIG. 12 shows an encoding process performed by an encoding method and an encoding apparatus according to the second aspect. [Figure 15] FIG. 15 shows that when it is determined that any of the first costs is lower than all of the second costs, a block encoding process is selected from the second set of block encoding processes. [Figure 16] FIG. 18 shows an encoding process performed by an encoding method and an encoding apparatus according to the third aspect. [Figure 17] FIG. 17 shows that when the vertical gradient of a rectangular block whose height is larger than the width is larger than the horizontal or diagonal gradient, the second set of block encoding processes excludes the first block encoding process including a step of first vertically dividing the block into three smaller partitions. [Figure 18] FIG. 18 shows that when the horizontal gradient of a rectangular block whose width is larger than the height is larger than the vertical or diagonal gradient, the second set of block encoding processes excludes the first block encoding process including a step of first horizontally dividing the block into three smaller partitions. [Figure 19A] FIG. 19A shows an example of calculation of a change in pixel intensity in the horizontal direction. [Figure 19B] FIG. 19B shows an example of calculation of a change in pixel intensity in the horizontal direction. [Figure 20]Figure 20 shows the encoding process performed by the encoding method and encoding apparatus according to the fourth embodiment. [Figure 21] Figure 21(a) shows that a block coding process is selected from the second set of block coding processes when the block coding process generates a subpartition region 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 is selected from the second set of block coding processes when the block coding process generates a subpartition region that is half the area of ​​the block and the vertical gradient is greater than the horizontal gradient. [Figure 22] Figure 22 shows the encoding process performed by the encoding method and encoding apparatus according to the fifth embodiment. [Figure 23A] Figure 23A shows an example of dividing a 16x8 block into three smaller partitions in a direction parallel to the height of the 16x8 block, when a conversion for 16x2 is not implemented. [Figure 23B] Figure 23B shows an example of dividing a 16x8 block into four smaller partitions in a direction parallel to the height of the 16x8 block, when a conversion for 16x2 is not implemented. [Figure 24] Figure 24 shows the encoding process performed by the encoding method and encoding apparatus according to the sixth embodiment. [Figure 25A] Figure 25A shows an example of a candidate partition structure for dividing a 16x16 block. [Figure 25B] Figure 25B shows an example of a candidate partition structure for dividing an 8x8 block. [Figure 26] Figure 26 shows the encoding process performed by the encoding method and encoding apparatus according to the seventh embodiment. [Figure 27] Figure 27 shows an example where a 32x32 block is first divided into three subblocks, and then the largest subblock is divided into two partitions. [Figure 28] Figure 28 shows the encoding process performed by the encoding method and encoding apparatus according to the eighth embodiment. [Figure 29] Figure 29 shows an example where a 64x64 block is first divided into three subblocks, and then all subblocks are divided into two partitions. [Figure 30] Figure 30 shows examples of partitioning modes and directions for dividing a block into two or three partitions. [Figure 31] Figure 31 shows an example of the position of parameters within a bitstream. [Figure 32] Figure 32 is an overall diagram of the content supply system that realizes the content distribution service. [Figure 33] Figure 33 shows an example of an encoding structure during scalable encoding. [Figure 34] Figure 34 shows an example of an encoding structure during scalable encoding. [Figure 35] Figure 35 shows an example of how a web page is displayed. [Figure 36] Figure 36 shows an example of how a web page is displayed. [Figure 37] Figure 37 shows an example of a smartphone. [Figure 38] Figure 38 is a block diagram showing an example of a smartphone configuration. [Modes for carrying out the invention]

[0010] The embodiments will be described in detail below with reference to the drawings.

[0011] The embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, arrangement and connection configurations of components, steps, and the order of steps shown in the following embodiments are examples only and are not intended to limit the scope of the claims. Furthermore, among the components in the following embodiments, those not described in the independent claim representing the highest-level concept will be described as optional components.

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

[0013] When applying the processes and / or configurations described in each aspect of this disclosure to Embodiment 1, for example, one of the following may be performed:

[0014] (1) With respect to the encoding or decoding device of Embodiment 1, replace the component corresponding to the component described in each aspect of the disclosure with the component described in each aspect of the disclosure, among the plurality of components constituting the encoding or decoding device. (2) With respect to the encoding or decoding device of Embodiment 1, any modifications such as adding, replacing, or deleting functions or processes performed by some of the multiple components constituting the encoding or decoding device are made, and then the components corresponding to the components described in each aspect of the Disclosure are replaced with the components described in each aspect of the Disclosure. (3) Adding processing to and / or replacing, deleting, or otherwise modifying some of the processing included in the method performed by the encoding or decoding device of Embodiment 1, and then replacing the processing corresponding to the processing described in each aspect of the Disclosure with the processing described in each aspect of the Disclosure. (4) Combining some of the multiple components constituting the encoding or decoding device of Embodiment 1 with a component described in each aspect of the Disclosure, a component that provides some of the functions of the components described in each aspect of the Disclosure, or a component that performs some of the processing performed by the components described in each aspect of the Disclosure. (5) A component that has some of the functions of some of the components that constitute the encoding or decoding device of Embodiment 1, or a component that performs some of the processing performed by some of the components that constitute the encoding or decoding device of Embodiment 1, in combination with a component described in each aspect of this disclosure, a component that has some of the functions of the components described in each aspect of this disclosure, or a component that performs some of the processing performed by the components described in each aspect of this disclosure. (6) With respect to the method performed by the encoding or decoding device of Embodiment 1, replace with the process corresponding to the process described in each aspect of the Disclosure among the multiple processes included in the method with the process described in each aspect of the Disclosure. (7) Performing some of the processes included in the method performed by the encoding or decoding device of Embodiment 1 in combination with the processes described in each aspect of the present disclosure.

[0015] The methods of implementing the processes and / or configurations described in each aspect of this disclosure are not limited to the examples above. For example, they may be implemented in a device used for a purpose other than the video / image encoding device or video / image decoding device disclosed in Embodiment 1, or the processes and / or configurations described in each embodiment may be implemented individually. Furthermore, the processes and / or configurations described in different embodiments may be implemented in combination.

[0016] [Overview of the coding device] First, an overview of the encoding device according to Embodiment 1 will be described. Figure 1 is a block diagram showing the functional configuration of the encoding device 100 according to Embodiment 1. The encoding device 100 is a video / image encoding device that encodes video / images in block units.

[0017] As shown in Figure 1, the encoding device 100 is a device that encodes an image in block units and comprises 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 can be implemented, for example, by a general-purpose processor and memory. In this case, when a software program stored in memory is executed by the processor, the processor functions as a splitting unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse conversion unit 114, an addition unit 116, a loop filter unit 120, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128. Alternatively, the encoding device 100 may be implemented as one or more dedicated electronic circuits corresponding to the splitting unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse conversion unit 114, an addition unit 116, a loop filter unit 120, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128.

[0019] The following describes each component included in the encoding device 100.

[0020] [Divided part] The splitting unit 102 divides each picture contained in the input video into multiple blocks and outputs each block to the subtraction unit 104. For example, the splitting unit 102 first divides the picture into blocks of a fixed size (e.g., 128x128). These fixed-size blocks are sometimes called coding tree units (CTUs). Then, based on recursive quadtree and / or binary tree block partitioning, the splitting unit 102 divides each of the fixed-size blocks into blocks of a variable size (e.g., 64x64 or less). These variable-size blocks are sometimes called coding units (CUs), prediction units (PUs), or transformation units (TUs). In this embodiment, CUs, PUs, and TUs do not need to be distinguished, and some or all of the blocks in the picture may become processing units for CUs, PUs, and TUs.

[0021] Figure 2 shows an example of block partitioning in Embodiment 1. In Figure 2, solid lines represent block boundaries due to quadtree block partitioning, and dashed lines represent block boundaries due to binary tree block partitioning.

[0022] Here, block 10 is a 128x128 pixel square block (128x128 block). This 128x128 block 10 is first divided into four 64x64 square blocks (quadtree block partitioning).

[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 partitioning). As a result, the top-left 64x64 block is divided into two 16x64 blocks 11 and 12 and a 32x64 block 13.

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

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

[0026] The 64x64 block 23 in the bottom right will not be divided.

[0027] As described above, in Figure 2, block 10 is divided into 13 variable-sized blocks 11-23 based on recursive quad-tree and binary tree block partitioning. Such partitioning is sometimes called QTBT (quad-tree plus binary tree) partitioning.

[0028] In Figure 2, one block was divided into four or two blocks (quadrutree or binary tree block partitioning), but the partitioning is not limited to these. For example, one block may be divided into three blocks (ternary tree block partitioning). Partitioning that includes such ternary tree block partitioning is sometimes called MBT (multi-type tree) partitioning.

[0029] [Subtraction Unit] The subtraction unit 104 subtracts the predicted signal (predicted sample) from the original signal (original sample) in block units divided by the division unit 102. In other words, the subtraction unit 104 calculates the prediction error (also called the residual) of the block to be encoded (hereinafter referred to as the current block). The subtraction unit 104 then outputs the calculated prediction error to the conversion unit 106.

[0030] The source signal is the input signal to the encoding device 100, and is a signal representing the image of each picture that makes up the moving image (for example, a luminance (luma) signal and two chroma (chroma) signals). In the following, the signal representing the image may also be called a sample.

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

[0032] The transformation unit 106 may also adaptively select a transformation type from among several transformation types and use a transformation basis function corresponding to the selected transformation type to convert the prediction error into transformation coefficients. Such a transformation is sometimes called an EMT (explicit multiple core transform) or an AMT (adaptive multiple transform).

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

[0034] Information indicating whether or not to apply such EMT or AMT (e.g., called an AMT flag) and information indicating the selected conversion type are signaled at the CU level. However, the signaling of this information is not 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 transformation unit 106 may retransform the transformation coefficients (transformation results). Such retransformation is sometimes called AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the transformation unit 106 performs retransformation for each subblock (e.g., 4x4 subblock) contained in the block of transformation coefficients corresponding to the intra-prediction error. Information indicating whether or not to apply NSST and information regarding the transformation matrix used for NSST are signaled at the CU level. Note that the signaling of this information is not limited to the CU level, but 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 input is separated into directions equal to the number of dimensions and transformed multiple times, while a non-separable transformation is a method in which, when the input is multidimensional, two or more dimensions are treated as one dimension and transformed together.

[0037] For example, one example of a non-separable transformation is to treat a 4x4 block as a single array with 16 elements and then perform a transformation on that array using a 16x16 transformation matrix.

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

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

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

[0041] Quantization parameters are parameters that define 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 unit] The entropy coding unit 110 generates an encoded signal (encoded bitstream) by variable-length encoding the quantization coefficients, which are input from the quantization unit 108. Specifically, the entropy coding unit 110, for example, binarizes the quantization coefficients and arithmetically encodes the binary signal.

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

[0044] [Inverse Transformation Section] The inverse transform unit 114 restores the prediction error by inversely transforming the transformation coefficients, which 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 transformation coefficients that corresponds to the transformation by the transformation unit 106. The inverse transform unit 114 then outputs the restored prediction error to the summation unit 116.

[0045] Furthermore, the recovered prediction error does not match the prediction error calculated by the subtraction unit 104 because information is lost due to quantization. In other words, the recovered prediction error includes quantization errors.

[0046] [Addition section] The adder 116 reconstructs the current block by adding the prediction error, which is the input from the inverse transformer 114, and the prediction sample, which is the 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 the local decoded block.

[0047] [Block memory] The block memory 118 is a storage unit for storing blocks within the picture to be encoded (hereinafter referred to as the current picture) that are referenced in intra prediction. 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. A loop filter is a filter used within the encoding loop (in-loop filter), and includes, for example, a deblocking filter (DF), sample adaptive offset (SAO), and adaptive loop filter (ALF).

[0049] In ALF, a least-squares error filter is applied to remove coding distortion. For example, for each 2x2 subblock within the current block, one filter selected from several filters is applied based on the direction and activity of the local gradient.

[0050] Specifically, first, subblocks (e.g., 2x2 subblocks) are classified into multiple classes (e.g., 15 or 25 classes). The classification of subblocks is based on the direction and activity of the gradient. For example, a classification value C (e.g., C = 5D + A) is calculated using the gradient direction value D (e.g., 0-2 or 0-4) and the gradient activity value A (e.g., 0-4). Then, based on the classification value C, the subblocks are classified into multiple 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). The gradient activation value A is derived, for example, by adding the gradients in multiple directions and quantizing the sum.

[0052] Based on the results of this classification, a filter for the subblock is determined from among multiple filters.

[0053] For example, a circularly symmetric shape is used as the filter shape in ALF. Figures 4A to 4C show several examples of filter shapes used in ALF. Figure 4A shows a 5x5 diamond-shaped filter, Figure 4B shows a 7x7 diamond-shaped filter, and Figure 4C shows a 9x9 diamond-shaped filter. Information indicating the filter shape is signaled at the picture level. However, the signaling of information indicating the filter shape is not limited to the picture level and may be at other levels (e.g., sequence level, slice level, tile level, CTU level, or CU level).

[0054] The on / off status of ALF is determined, for example, at the picture level or CU level. For instance, the decision to apply ALF to luminance is made at the CU level, and the decision to apply ALF to color difference is made at the picture level. Information indicating whether ALF is on or off is signaled at the picture level or CU level. However, the signaling of information indicating whether ALF is on or off is not limited to the picture level or CU level, but may be at other levels (e.g., sequence level, slice level, tile level, or CTU level).

[0055] The coefficient sets of multiple selectable filters (e.g., up to 15 or 25 filters) are signaled at the picture level. However, the signaling of the coefficient sets is not limited to the picture level; it may be at other levels (e.g., sequence level, slice level, tile level, CTU level, CU level, or subblock level).

[0056] [Frame memory] The frame memory 122 is a storage unit for storing reference pictures used for interpretation, and is sometimes called a frame buffer. Specifically, the frame memory 122 stores the reconstructed blocks filtered by the loop filter unit 120.

[0057] [Intra Prediction Unit] The intra-prediction unit 124 generates a prediction signal (intra-prediction signal) by performing intra-prediction (also called in-screen prediction) of the current block by referring to the block in the current picture stored in the block memory 118. Specifically, the intra-prediction unit 124 generates an intra-prediction signal by performing intra-prediction by referring to samples (e.g., luminance values, color difference 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 predetermined set of intra-prediction modes. The set of intra-prediction modes includes one or more non-directional prediction modes and multiple directional prediction modes.

[0059] One or more non-directional prediction modes include, for example, the Planar prediction mode and DC prediction mode as defined in the H.265 / HEVC (High-Efficiency Video Coding) standard (Non-Patent Document 1).

[0060] Multiple directional prediction modes include, for example, the 33 directional prediction modes defined in the H.265 / HEVC standard. Note that multiple directional prediction modes may also include 32 additional directional prediction modes (a total of 65 directional prediction modes). Figure 5A shows 67 intra-prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra-prediction. Solid arrows represent the 33 directions defined in the H.265 / HEVC standard, and dashed arrows represent the additional 32 directions.

[0061] Furthermore, in the intra-prediction of a color difference block, a luminance block may be referenced. That is, the color difference component of the current block may be predicted based on the luminance component of the current block. Such intra-prediction is sometimes called CCLM (cross-component linear model) prediction. Such an intra-prediction mode for a color difference block that references a luminance block (e.g., called the CCLM mode) may be added as one of the intra-prediction modes for a color difference block.

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

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

[0064] The motion information used for motion compensation is converted into a signal. A motion vector predictor may be used to convert the motion vector into a signal. In other words, the difference between the motion vector and the predicted motion vector may be converted into a signal.

[0065] Furthermore, an inter-prediction signal may be generated using not only the motion information of the current block obtained through motion search, but also the motion information of adjacent blocks. Specifically, an inter-prediction signal may be generated for each sub-block within the current block by weighted addition of a prediction signal based on motion information obtained through motion search and a prediction signal based on the motion information of adjacent blocks. Such inter-prediction (motion compensation) is sometimes called OBMC (overlapped block motion compensation).

[0066] In this OBMC mode, information indicating the size of the subblock for OBMC (e.g., called the OBMC block size) is signaled at the sequence level. Information indicating whether or not to apply OBMC mode (e.g., called the OBMC flag) is signaled at the CU level. Note that the signaling levels for this information are not limited to the sequence and CU levels; other levels (e.g., picture level, slice level, tile level, CTU level, or subblock level) may also be used.

[0067] Let's explain the OBMC mode in more detail. Figures 5B and 5C are flowcharts and conceptual diagrams illustrating the overview of the predictive image correction process using OBMC processing.

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

[0069] Next, the motion vector (MV_L) of the encoded left adjacent block is applied to the block to be encoded to obtain a predicted image (Pred_L), and the first correction of the predicted image is performed by superimposing the predicted image and Pred_L with weights.

[0070] Similarly, the motion vector (MV_U) of the encoded upper adjacent block is applied to the block to be encoded to obtain a predicted image (Pred_U). The predicted image is then corrected a second time by weighting the first corrected predicted image and Pred_U, and this is used as the final predicted image.

[0071] While this explanation describes a two-stage correction method using the left adjacent block and the upper adjacent block, it is also possible to use the right adjacent block and the lower adjacent block to perform corrections more than two times.

[0072] Furthermore, the area to be superimposed does not have to be the entire pixel area of ​​the block, but rather only a portion of the area near the block boundary.

[0073] Although this explanation describes the predictive image correction process using a single reference picture, the process is similar when correcting predictive images from multiple reference pictures. After obtaining corrected predictive images from each reference picture, the resulting predictive images are superimposed to create the final predictive image.

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

[0075] One method for determining whether or not to apply OBMC processing is to use an obmc_flag signal, which indicates whether or not to apply OBMC processing. Specifically, in an encoding device, it is determined whether or not the block to be encoded belongs to a region with complex motion. If it belongs to a region with complex motion, the obmc_flag is set to a value of 1 and OBMC processing is applied to perform encoding. If it does not belong to a region with complex motion, the obmc_flag is set to a value of 0 and encoding is performed without applying OBMC processing. On the other hand, in a decoding device, the obmc_flag written in the stream is decoded, and the device switches whether or not to apply OBMC processing depending on its value and performs decoding.

[0076] Furthermore, motion information may be derived by the decoder without being converted into a signal. For example, the merge mode specified in the H.265 / HEVC standard may be used. Alternatively, motion information may be derived by performing a motion search on the decoder side. In this case, the motion search is performed without using the pixel values ​​of the current block.

[0077] Here, we will explain the mode in which motion detection is performed on the decoding device side. This mode in which motion detection is performed on the decoding device side is sometimes called PMMVD (pattern matched motion vector derivation) mode or FRUC (frame rate up-conversion) mode.

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

[0079] Then, based on the motion vectors of the selected candidates, a motion vector for the current block is derived. Specifically, for example, the motion vector of the selected candidate (best candidate MV) is directly derived as the motion vector for the current block. Alternatively, for example, the motion vector for the current block may be derived by performing pattern matching in the area surrounding the position in the reference picture corresponding to the motion vector of the selected candidate. That is, a similar search is performed in the area surrounding the best candidate MV, and if an MV with a better evaluation value is found, the best candidate MV may be updated to this MV and used as the final MV for the current block. It is also possible to configure the system so that this process is not performed.

[0080] The same processing method can be used when processing at the sub-block level.

[0081] The evaluation value is calculated by determining the difference value of the reconstructed image through pattern matching between a region in the reference picture corresponding to the motion vector and a predetermined region. Alternatively, the evaluation value may be calculated using other information in addition to the difference value.

[0082] For pattern matching, either first-order pattern matching or second-order pattern matching is used. First-order pattern matching and second-order 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 aligned with the motion trajectory of the current block. Therefore, in the first pattern matching, a region in another reference picture aligned with the motion trajectory of the current block is used as a predetermined region for calculating the evaluation value of the candidate described above.

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

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

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

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

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

[0089] Here, we will explain the mode for deriving motion vectors based on a model that assumes uniform linear motion. This mode is called BIO (bi-directional optical). This is sometimes called flow mode.

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

[0091] Under the assumption of uniform linear motion of the velocity vector (vx, vy), (MVx0, MVy0) and (MVx1, MVy1) can be expressed as (vxτ0, vyτ0) and (-vxτ1, -vyτ1), respectively, and the following optical flow equality (1) holds.

[0092]

number

[0093] Here, I(k) represents the luminance value of the reference image k (k=0,1) after motion compensation. This optical flow equation shows 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 this optical flow equation and Hermite interpolation, block-level motion vectors obtained from merge lists, etc., are corrected on a pixel-by-pixel basis.

[0094] Furthermore, motion vectors may be derived on the decoding side using a method different from that used for deriving motion vectors based on a model that assumes uniform linear motion. For example, motion vectors may be derived on a sub-block basis based on the motion vectors of multiple adjacent blocks.

[0095] Here, we will describe a mode in which motion vectors are derived at the sub-block level based on the motion vectors of multiple adjacent blocks. This mode is sometimes called the affine motion compensation prediction mode.

[0096] Figure 9A illustrates the derivation of subblock-level motion vectors based on the motion vectors of multiple adjacent blocks. In Figure 9A, the current block contains 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 within the current block is derived by equation (2) below.

[0097]

number

[0098] Here, x and y represent the horizontal and vertical positions of the subblock, respectively, and w represents a predetermined weighting coefficient.

[0099] Such affine motion compensation prediction modes may include several modes in which the motion vectors of the upper-left and upper-right corner control points are derived. Information indicating such affine motion compensation prediction modes (e.g., called affine flags) is signaled at the CU level. Note that the signaling of this information indicating affine motion compensation prediction modes is not limited to the CU level, but may be at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or subblock level).

[0100] [Prediction Control Unit] The prediction control unit 128 selects either the intra-prediction signal or the inter-prediction signal and outputs the selected signal as the prediction signal to the subtraction unit 104 and the addition unit 116.

[0101] Here, we will explain an example of deriving the motion vector of a picture to be encoded using merge mode. Figure 9B is a diagram illustrating the overview of the motion vector derivation process using merge mode.

[0102] First, a list of predicted MVs is generated, containing registered candidates for predicted MVs. Candidates for predicted MVs include spatially adjacent predicted MVs, which are the MVs of multiple encoded blocks located spatially around the block to be encoded; temporally adjacent predicted MVs, which are the MVs of nearby blocks projected onto the location of the block to be encoded in the encoded reference picture; combined predicted MVs, which are generated by combining the MV values ​​of spatially adjacent predicted MVs and temporally adjacent predicted MVs; and zero predicted MVs, which are MVs with a value of zero.

[0103] Next, one predicted MV is selected from the multiple predicted MVs registered in the predicted MV list to determine it as the MV for the block to be encoded.

[0104] Furthermore, the variable-length coding unit encodes the merge_idx signal, which indicates which predicted MV was selected, by writing it to a stream.

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

[0106] Alternatively, the final MV may be determined by performing the DMVR process described later using the MV of the target block to be encoded derived by merge mode.

[0107] Here, we will explain an example of determining the MV using DMVR processing.

[0108] Figure 9C is a conceptual diagram illustrating the overview of DMVR processing.

[0109] First, the optimal MVP set for the block to be processed is used as a candidate MV. According to the candidate MV, 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, and a template is generated by taking the average of each reference pixel.

[0110] Next, using the template, the surrounding regions of candidate MVs for the first and second reference pictures are searched, and the MV with the lowest cost is determined as the final MV. The cost value is calculated using the difference between each pixel value of the template and each pixel value of the search region, as well as the MV value, etc.

[0111] Note that the general outline of the processing described here is basically the same for both encoding and decoding devices.

[0112] Note that any process that can explore the vicinity of a candidate MV and derive the final MV may be used instead of the exact process described here.

[0113] Here, we will explain the mode for generating predictive images using LIC processing.

[0114] Figure 9D is a diagram illustrating the outline of a predictive image generation method using luminance correction processing by LIC processing.

[0115] First, we derive a Music Model (MV) to obtain the reference image corresponding to the block to be encoded from the reference picture, which is an encoded picture.

[0116] Next, for the block to be encoded, information indicating how the luminance values ​​have changed between the reference picture and the image to be encoded is extracted using the luminance pixel values ​​of the left-adjacent and top-adjacent encoded surrounding reference regions, and the luminance pixel values ​​at the equivalent positions in the reference picture specified by MV, and a luminance correction parameter is calculated.

[0117] By performing brightness correction processing on the reference image within the reference picture specified in MV using the brightness correction parameter, a predicted image for the encoding target block is generated.

[0118] Note that the shape of the surrounding reference region in Figure 9D is just one example, and other shapes may be used.

[0119] Furthermore, while this explanation describes the process of generating a predicted image from a single reference picture, the process is similar when generating predicted images from multiple reference pictures. Brightness correction processing is performed on each reference image obtained from a single reference picture in the same manner before generating the predicted image.

[0120] One method for determining whether or not to apply LIC processing is to use a signal called lic_flag, which indicates whether or not to apply LIC processing. Specifically, in an encoding device, it is determined whether or not the block to be encoded belongs to a region where brightness changes occur. If it belongs to a region where brightness changes occur, the value of lic_flag is set to 1 and LIC processing is applied and encoding is performed. If it does not belong to a region where brightness changes occur, the value of lic_flag is set to 0 and encoding is performed without applying LIC processing. On the other hand, in a decoding device, the lic_flag written in the stream is decoded, and the device switches whether or not to apply LIC processing according to its value and performs decoding.

[0121] Another way to determine whether to apply LIC processing is, for example, by checking whether LIC processing has been applied to surrounding blocks. A specific example is that if the block to be encoded is in merge mode, during the MV derivation in merge mode processing, it is determined whether the surrounding encoded blocks selected were encoded with LIC processing. Based on this result, the application of LIC processing is switched, and encoding is performed accordingly. In this example, the decoding process is exactly the same.

[0122] [Overview of the decryption device] Next, an overview of a decoding device capable of decoding the encoded signal (encoded bitstream) output from the above-mentioned encoding device 100 will be described. Figure 10 is a block diagram showing the functional configuration of the decoding device 200 according to Embodiment 1. The decoding device 200 is a video / image decoding device that decodes video / images in block units.

[0123] As shown in Figure 10, the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transform unit 206, an adder 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 can be implemented, for example, by a general-purpose processor and memory. In this case, when the software program stored in memory is executed by the processor, the processor functions as an entropy decoding unit 202, an inverse quantization unit 204, an inverse transformation unit 206, an addition unit 208, a loop filter unit 212, an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220. Alternatively, the decoding device 200 may be implemented as one or more dedicated electronic circuits corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220.

[0125] The following describes each component included in the decoding device 200.

[0126] [Entropy Decoder] The entropy decoding unit 202 entropically decodes the encoded bitstream. Specifically, the entropy decoding unit 202 arithmetically decodes the encoded bitstream into a binary signal, for example. Then, the entropy decoding unit 202 debinarizes the binary signal. As a result, the entropy decoding unit 202 outputs the quantization coefficients in block units to the inverse quantization unit 204.

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

[0128] [Inverse Transformation Section] The inverse transform unit 206 restores the prediction error by inversely transforming the transformation coefficients, which are input from the inverse quantization unit 204.

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

[0130] For example, if the information decoded from the encoded bitstream indicates that NSST should be applied, the inverse transform unit 206 applies inverse retransformation to the transformation coefficients.

[0131] [Addition section] The adder 208 reconstructs the current block by adding the prediction error, which is the input from the inverse transformer 206, and the prediction sample, which is the 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 located within the decoded picture (hereinafter referred to as the current picture). Specifically, the block memory 210 stores the reconstructed blocks 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 the frame memory 214 and the display device, etc.

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

[0135] [Frame memory] The frame memory 214 is a memory unit for storing reference pictures used for interpretation, and is sometimes called a frame buffer. Specifically, the frame memory 214 stores the reconstructed blocks filtered by the loop filter unit 212.

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

[0137] Furthermore, if an intra-prediction mode that references a luminance block is selected in the intra-prediction of a color difference block, the intra-prediction unit 216 may predict the color difference component of the current block based on the luminance component of the current block.

[0138] Furthermore, if the information decoded from the encoded bitstream indicates the application of PDPC, the intra-prediction unit 216 corrects the pixel value after intra-prediction based on the gradient of the reference pixels in the horizontal / vertical directions.

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

[0140] Furthermore, if the information decoded from the encoded bitstream indicates that OBMC mode should be applied, the interpretation unit 218 generates an interpretation 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] Furthermore, if the information decoded from the encoded bitstream indicates that FRUC mode should be applied, the interpretation unit 218 derives motion information by performing a motion search according to the pattern matching method (bilateral matching or template matching) decoded from the encoded stream. Then, the interpretation unit 218 performs motion compensation using the derived motion information.

[0142] Furthermore, when the BIO mode is applied, the inter-prediction unit 218 derives motion vectors based on a model that assumes uniform linear motion. Also, if the information decoded from the encoded bitstream indicates that the affine motion compensation prediction mode should be applied, the inter-prediction unit 218 derives motion vectors on a sub-block basis based on the motion vectors of multiple adjacent blocks.

[0143] [Prediction Control Unit] The prediction control unit 220 selects either the intra-prediction signal or the inter-prediction signal and outputs the selected signal as the prediction signal to the adder 208.

[0144] Next, each mode of block division in the encoding device 100 and decoding device 200 will be described in detail with reference to the drawings. In the following, the blocks to be encoded or the blocks to be decoded will simply be referred to as "blocks."

[0145] (First aspect) Figure 11 shows the encoding process performed by the encoding method and encoding apparatus according to the first embodiment.

[0146] In step S1001, the first cost is calculated from the first block coding process. Here, the first block coding process does not involve dividing the block into multiple partitions, and the cost includes distortion. For example, the cost can be obtained by adding a value indicating coding distortion to a value indicating the generated code amount multiplied by Lagrange multipliers. Coding distortion can be determined, for example, based on the sum of the absolute differences between the locally coded image and the original image.

[0147] In step S1002, the second cost is calculated from the second block encoding process, which first includes the step of 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 lower than the second cost, a block coding process is selected from the second block coding process set. Here, the second block coding process set does not include the third block coding process, which includes the step of first dividing the block into three smaller partitions.

[0150] Figure 12 shows that if the first cost is determined to be lower than all second costs, the second block coding set eliminates the third block coding process, which involves first dividing the block into three smaller partitions. The second block partitioning set is a subset of the first block partitioning set.

[0151] Specifically, in Figure 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, which includes 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, which is obtained by removing the third block coding process from the first block coding process set.

[0152] Figure 13 shows other examples of first costs with different binary tree depths. In the upper example, the cost is calculated on the left partition obtained by vertically dividing the block into two partitions. In the lower example, the cost is calculated on the upper subpartition obtained by horizontally dividing the block into two partitions and then horizontally dividing the upper partition into two subpartitions. In both examples, if the first cost is determined to be lower than all second costs, the second block coding set eliminates the third block coding process, which has the step of first dividing the block into three smaller partitions. The second block partitioning set is a subset of the first block partitioning set.

[0153] In step S1005, if it is determined that the first cost is not lower than the second cost, a block coding process is selected from the first block coding process set. Here, the first block coding process set includes at least a third block coding process.

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

[0155] [Effects of the first embodiment] This embodiment reduces the total number of candidate partition structures on the encoding side, thereby reducing the complexity of encoding.

[0156] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0157] (Second aspect) Figure 14 shows the encoding process performed by the encoding method and encoding apparatus according to the second embodiment.

[0158] In step S2001, the first cost is calculated from the first block coding process. Here, the first block coding process involves dividing the block into only two smaller partitions. That is, in the first block coding process, the block is divided into two partitions, and each partition is not divided any further.

[0159] In step S2002, the second cost is calculated from the second block coding process. Here, the second block coding process includes the step of first dividing the block into two smaller partitions, and the subsequent step of dividing it into three or more partitions.

[0160] Step S2003 is the same as step S1003.

[0161] Step S2004 is the same as step S1004.

[0162] Figure 15 shows that a block coding process is selected from the second set of block coding processes if any of the first costs are determined to be lower than all of the second costs. The second set of block coding processes eliminates the third block coding process, which has the step of first dividing the block into three smaller partitions.

[0163] The second block coding process set is a subset of the first block coding process set. That is, the second block coding process set is obtained by removing a predetermined coding process from the first block coding process set. In this case, the predetermined coding process includes at least a third block coding process.

[0164] Step S2005 is the same as Step S1005.

[0165] Step S2006 is the same as step S1006.

[0166] [Effects of the second embodiment] This embodiment reduces the total number of candidate partition structures on the encoding side, thereby reducing the complexity of encoding.

[0167] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0168] (Third aspect) Figure 16 shows the encoding process performed by the encoding method and encoding apparatus according to the third embodiment.

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

[0170] In step S3002, at least the second slope of the rectangular block is calculated in the 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 coding process is selected from the second block coding process set. Here, the second block coding process set does not include at least the first block coding process, and the first block coding process includes the step of first dividing the block into three smaller partitions in the first direction.

[0173] The second block coding process set is a subset of the first block coding process set. That is, the second block coding process set is obtained by removing a predetermined coding process from the first block coding process set. In this case, the predetermined coding process includes at least the first block coding process.

[0174] Figure 17 shows that when the vertical slope of a rectangular block whose height is greater than its width is greater than the horizontal or diagonal slope, the second block coding set eliminates the first block coding process, which includes the step of first vertically dividing the block into three smaller partitions. In other words, when the vertical slope is greater than the horizontal or diagonal slope, a block coding process is selected from the second block coding set, from which the first block coding process has been eliminated. Conversely, when the vertical slope is not greater than the horizontal or diagonal slope, a block coding process is selected from the first block coding set, which includes the first block coding process.

[0175] Figure 18 shows that when the horizontal slope of a rectangular block whose width is greater than its height is greater than the vertical or diagonal slope, the second block coding set eliminates the first block coding process, which includes the step of first horizontally dividing the block into three smaller partitions. In other words, when the horizontal slope is greater than the vertical or diagonal slope, a block coding process is selected from the second block coding set, from which the first block coding process has been eliminated. Conversely, when the horizontal slope is not greater than the vertical or diagonal slope, a block coding process is selected from the first block coding set, which includes the first block coding process.

[0176] Figures 19A and 19B show examples of calculations for changes in pixel intensity in the horizontal direction. The horizontal gradient is a calculation related to changes in intensity or color in the horizontal direction. Similarly, the vertical gradient can be calculated based on changes in intensity or color in the vertical direction. Similarly, the diagonal gradient can be calculated based on changes in intensity or color in the diagonal direction.

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

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

[0179] The first and second gradients are not limited to vertical / horizontal gradients only. They may include gradients in other directions, such as diagonals, or gradients in yet other directions. The gradient calculations shown in Figures 19A and 19B are merely examples, 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 coding process is selected from the first block coding process set. Here, the first block coding process set includes the first block coding process.

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

[0182] [Effects of the third embodiment] This embodiment reduces the total number of candidate partition structures on the encoding side, thereby reducing the complexity of encoding.

[0183] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0184] (Fourth aspect) Figure 20 shows the encoding process performed by the encoding method and encoding apparatus according to the fourth embodiment.

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

[0186] In step S4002, if it is determined that the block division step in the first block encoding process generates a partition half the size of the block, at least the gradient of the block is calculated.

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

[0188] In step S4004, a block coding process is selected from the second block coding process set.

[0189] Figure 21(a) shows that a block coding process is selected from the second set of block coding processes when the block coding process generates a subpartition region that is half the area of ​​the block, and the horizontal gradient is greater than the vertical gradient. The second set of coding processes eliminates the process of coding a block with multiple partitions and the step of first horizontally dividing the block into three smaller partitions.

[0190] Figure 21(b) shows that a block coding process is selected from the second set of block coding processes when the block coding process generates a subpartition region that is half the area of ​​the block, and the vertical gradient is greater than the horizontal gradient. The second set of coding processes eliminates the process of coding a block with multiple partitions and the step of first vertically dividing the block into three smaller partitions.

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

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

[0193] [Effects of the fourth aspect] This embodiment reduces the total number of candidate partition structures on the encoding side, thereby reducing the complexity of encoding.

[0194] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0195] (Fifth aspect) Figure 22 shows the encoding process performed by the encoding method and encoding apparatus according to the fifth embodiment.

[0196] In step S5001, the first side of the block is identified as the longer side of the two sides, and the second side of the block is identified as the side that is not the longer side of the block.

[0197] In step S5002, if the block is divided into three or more smaller partitions, it is determined whether the block division in a direction parallel to the first edge will generate partitions of a size not supported in the prediction or transformation process.

[0198] In step S5003, if it is determined that dividing the block in a direction parallel to the first side would generate a partition of a size not supported in at least the prediction or transformation process, the block is divided into smaller partitions in a direction parallel to the second side. Figure 23A shows an example of dividing a 16x8 block into three smaller partitions in a direction parallel to the height of the 16x8 block (vertical direction) when a transformation for 16x2 is not implemented. Figure 23B shows an example of dividing a 16x8 block into four smaller partitions in a direction parallel to the height of the 16x8 block (vertical direction) when a transformation for 16x2 is not implemented. Here, the size 16x2 is a division of the block in a direction parallel to the width of the block (horizontal direction). In other words, in Figures 23A and 23B, dividing the block into three or four in a horizontal direction parallel to the first side (long side) is not permitted.

[0199] In step S5004, the partitioning direction parameter is written to the bitstream if it is determined that partitioning the block in a direction parallel to the first edge does not generate a partition of a size not supported in at least the prediction or transformation process. Here, the partitioning direction parameter indicates the direction of the block partitioning and may be horizontal or vertical. The position of the partitioning direction parameter is shown in Figure 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 subpartition of that partition is encoded.

[0202] Furthermore, the terms "write" and "to (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 "read," "from (bitstream)," and "decode" for the decoding process performed by the decoding method and image decoding device.

[0203] [Effects of the 5th aspect] This embodiment eliminates the need to encode the partitioning direction for several specific block sizes, thereby improving encoding efficiency. This disclosure also reduces the total number of candidate partitioning directions on the encoding side, thereby reducing encoding complexity.

[0204] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0205] (Sixth aspect) Figure 24 shows the encoding process performed by the encoding method and encoding apparatus according to the sixth embodiment.

[0206] In step S6001, it is determined whether, in each of the multiple directions, dividing the block into three smaller partitions would generate partitions of a size not supported in the prediction or transformation process.

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

[0208] In step S6003, if it is determined that dividing the block into three smaller partitions in at least one of multiple directions does not produce partitions of sizes not supported in the prediction or transformation process, then a parameter is written to the bitstream. Here, the parameter indicates the number of smaller partitions obtained by dividing the block. Here, the parameter may be a division mode parameter. Here, the division mode parameter may indicate the number of subblocks having a predetermined division ratio for dividing the block. Alternatively, the division mode parameter may indicate at least the number of divisions of the block. The location of the division mode parameter is shown in Figure 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 the same as step S5006.

[0211] Figure 25A shows an example of a candidate partition structure for dividing a 16x16 block. Figure 25B shows an example of a candidate partition structure for dividing an 8x8 block. As shown in Figure 25A, there are four candidate partition structures for dividing a 16x16 block. On the other hand, as shown in Figure 25B, there are two candidate partition structures for dividing an 8x8 block. In this example, since 8x2 and 2x8 are not supported in the conversion process, partition structures that divide an 8x8 block into three smaller partitions along the horizontal and vertical directions are excluded from the candidate partition structures. In other words, since 8x2 and 2x8 sizes are not supported in the conversion process, dividing an 8x8 block into three sub-blocks is not permitted.

[0212] Furthermore, the terms "write" and "to (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 "read," "from (bitstream)," and "decode" for the decoding process performed by the decoding method and image decoding device.

[0213] [Effects of the 6th aspect] This embodiment eliminates the need to encode the partitioning direction for several specific block sizes, thereby improving encoding efficiency. This disclosure also reduces the total number of candidate partitioning directions on the encoding side, thereby reducing encoding complexity.

[0214] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0215] (7th aspect) Figure 26 shows the encoding process performed by the encoding method and encoding apparatus according to the seventh embodiment.

[0216] In step S7001, the block is divided in the first direction into first to third subblocks. In this embodiment, as shown in Figure 30, the division ratio of the three divisions is 1:2:1. Therefore, the second subblock, located between the first and third subblocks, is larger in size than the first and third subblocks. Note that the first to third subblocks may be assigned index values ​​from 0 to 2 in order.

[0217] In step S7002, if the second subblock is divided into multiple partitions, a partitioning mode parameter is written to the bitstream to indicate the number of partitions. Here, the partitioning mode parameter may indicate the number of subblocks having a predetermined partitioning ratio, as shown in Figure 30. Alternatively, the partitioning mode parameter may indicate only the number of subblocks. Furthermore, the partitioning mode parameter may indicate information other than the partitioning ratio along with the number of subblocks. The position of the partitioning 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 2.

[0219] In step S7004, if the split mode parameter is determined to indicate that the number of partitions is 2, the second subblock is split into two partitions in a second direction different from the first direction. In other words, splitting the second subblock into two partitions in the first direction is prohibited. Therefore, the split direction parameter is not written to the bitstream. That is, the writing of the split direction parameter to the bitstream is omitted (i.e., skipped).

[0220] Figure 27 shows examples of how to divide a 32x32 block. In (a), the 32x32 block is first divided vertically into two subblocks, and then all subblocks are divided vertically into two partitions. In (b), the 32x32 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 shorter side of the 16x32 block. In other words, in (b), horizontal division into two partitions is permitted for the largest subblock, but vertical division is not. Here, the largest subblock corresponds to the second subblock. This prevents the occurrence of the same partition structure (also called a repeating partition structure) in the different division methods of (a) and (b).

[0221] In step S7005, if the partition mode parameter is not determined to indicate that the number of partitions is 2, the partition direction parameter is written to the bitstream. Here, the partition direction parameter indicates the direction of block partitioning and may indicate horizontal or vertical directions, as shown in Figure 30. The position of the partition direction parameter is shown in Figure 31.

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

[0223] Step S7007 is the same as step S5006.

[0224] Furthermore, the terms "write" and "to (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 "read," "from (bitstream)," and "decode" for the decoding process performed by the decoding method and image decoding device.

[0225] As stated above, the steps and their order are merely examples and are not limited thereto. The order of the steps can be rearranged as a person skilled in the art could conceive, as long as it does not deviate from the spirit of this disclosure. For example, in Figure 26, the division direction parameter may be written to the bitstream before the division mode parameter. That is, in Figure 31, the positions of the division mode parameter and the division direction parameter in the bitstream may be swapped. Also, in Figure 26, the order of step S7002 and step S7005 may be swapped.

[0226] In this case, when the second subblock is to be divided into multiple partitions, the division direction parameter is first written to the bitstream. Then, it is determined whether the division direction parameter indicates the first direction. If the division direction parameter indicates the first direction, the second subblock is divided into three partitions in the first direction. In other words, dividing the second block into two partitions in the first direction is prohibited. Therefore, the division mode parameter is not written to the bitstream. That is, the writing of the division mode parameter to the bitstream is omitted or skipped. On the other hand, if the division direction parameter indicates a second direction different from the first direction, a division mode parameter indicating the number of divisions of the second subblock is written to the bitstream, and the second subblock is divided into the number of partitions indicated by the division mode parameter in the second direction. 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 number of divisions of the second subblock.

[0227] [Effects of the 7th aspect] This embodiment improves encoding efficiency by eliminating the need to encode the division direction or number of divisions for several specific block sizes. This disclosure also reduces the complexity of encoding by reducing the total number of candidate division directions on the encoding side.

[0228] [Combined with other embodiments] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0229] (8th aspect) Figure 28 shows the encoding process performed by the encoding method and encoding apparatus according to the eighth embodiment.

[0230] In step S8001, the block is divided in the first direction into first to third subblocks.

[0231] In step S8002, it is determined whether each of the first and second subblocks 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 subblocks can be further divided into two smaller partitions in a second direction different from the first direction, the third subblock is divided into smaller partitions. If the third subblock is to be divided into two partitions, the third subblock 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 subblocks is further divided into two smaller partitions in a second direction different from the first direction, the division direction parameter is written to the bitstream. Here, the division direction parameter may indicate the horizontal or vertical direction, as shown in Figure 30. The position of the division direction parameter is shown in Figure 31.

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

[0235] Step S8006 is the same as step S5006.

[0236] FIG. 29 shows an example of a method for dividing a 64×64 block. In (a), the 64×64 block is first divided vertically into two sub-blocks, and then all the sub-blocks are divided horizontally into three partitions. In (b), the 64×64 block is first divided horizontally into three sub-blocks, and then all the sub-blocks are divided into two partitions.

[0237] In (b), the direction for dividing the 64×64 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 in the same direction as the direction used for dividing the 64×64 block. That is, in (b), it is prohibited to divide the third sub-block vertically into two partitions. This suppresses the occurrence of the same partition structure in the different division methods of (a) and (b).

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

[0239] Note that the terms "write" and "(to the bit stream)" 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 "decode", "(from the bit stream)", and "decode" for the decoding process performed by the decoding method and image decoding device.

[0240] [Effect of the Eighth Aspect] This aspect does not require encoding the division direction for some specific block sizes, improving the encoding efficiency. The present disclosure also reduces the total number of candidates for the division direction on the encoding side, reducing the complexity of encoding.<>

[0241] [Combination with Other Aspects] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0242] (modified version) In all of the above embodiments, one or more thresholds can be used to determine the number of smaller partitions and the partitioning direction for dividing the block. The thresholds can be adaptively modified according to the picture type, time layer, quantization parameters, pixel value activity in the slice, or according to a combination of partitioning patterns such as a quadtree, binary tree and other partitioning combinations, or according to a combination of other encoding tools such as triangular partitioning. The thresholds can also be adaptively modified according to the block size such as block width, block height, or a multiplication of block width and block height. The thresholds can also be adaptively modified according to the block shape and / or partitioning depth.

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

[0244] Furthermore, a parameter indicating whether or not to divide a block into two or three subblocks or partitions may be written to the bitstream. In this case, when the parameter indicates that the block should be divided into two or three subblocks or partitions, the encoding or decoding method according to each of the above embodiments may be applied.

[0245] (Other forms) In each of the above embodiments, each functional block can typically be implemented by an MPU and memory, etc. Furthermore, the processing performed by each functional block is typically implemented by a program execution unit such as a processor reading and executing software (program) recorded on a recording medium such as ROM. This software may be distributed by download, etc., or it may be recorded on a recording medium such as semiconductor memory and distributed. Of course, it is also possible to implement each functional block by hardware (dedicated circuitry).

[0246] Furthermore, the processing described in each embodiment may be implemented by centralized processing using a single device (system), or by distributed processing using multiple devices. Also, the processor executing the above program may be one or multiple. In other words, centralized processing may be performed, or distributed processing may be performed.

[0247] The embodiments of this disclosure are not limited to those described above, and various modifications are possible, which are also included within the scope of the embodiments of this disclosure.

[0248] Furthermore, here we will describe application examples of the video encoding method (image encoding method) or video decoding method (image decoding method) shown in each of the above embodiments, and a system using the same. The system is characterized by having an image encoding device using the image encoding method, an image decoding device using the image decoding method, and an image encoding and decoding device that includes both. Other configurations in the system can be appropriately modified as needed.

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

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

[0251] Note that instead of base stations ex106~ex110, wireless access points or hotspots may be used. Also, streaming server ex103 may be connected directly to the communication network ex104 without going through the internet ex101 or internet service provider ex102, or it may be connected directly to the airplane ex117 without going through satellite ex116.

[0252] Camera ex113 is a device capable of taking still images and videos, such as a digital camera. Smartphone ex115 is a smartphone, mobile phone, or PHS (Personal Handyphone System) that supports mobile communication systems generally known as 2G, 3G, 3.9G, 4G, and the upcoming 5G.

[0253] Home appliance ex118 refers to appliances such as refrigerators or equipment included in household fuel cell cogeneration systems.

[0254] In the content supply system ex100, live streaming becomes possible when a terminal with a shooting function is connected to the streaming server ex103 via a base station ex106 or the like. In live streaming, the terminal (computer ex111, game console ex112, camera ex113, home appliance ex114, smartphone ex115, and terminal inside an airplane ex117, etc.) performs the encoding process described in each of the above embodiments on still images or video content captured by the user using the terminal, multiplexes the video data obtained by encoding with sound data encoded from the sound corresponding to the video, and transmits the obtained data to the streaming server ex103. In other words, each terminal functions as an image encoding device according to one aspect of this disclosure.

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

[0256] [Distributed Processing] Furthermore, the streaming server ex103 may consist of multiple servers or computers that distribute data processing, recording, and distribution. For example, the streaming server ex103 may be implemented using a CDN (Content Delivery Network), where content delivery is achieved through a network connecting numerous edge servers distributed worldwide. In a CDN, the physically closest edge server is dynamically assigned depending on the client. Latency can be reduced by caching and delivering content to the edge server. In addition, if an error occurs or the communication state changes due to an increase in traffic, processing can be distributed among multiple edge servers, the delivery entity can be switched to another edge server, or delivery can be continued by bypassing the failed part of the network, thus enabling high-speed and stable delivery.

[0257] Furthermore, beyond the distributed processing of the distribution itself, the encoding process of the captured data can be performed on each terminal, on the server side, or shared among them. For example, encoding generally involves two processing loops. In the first loop, the complexity or code amount of the image at the frame or scene level is detected. In the second loop, processing is performed to improve encoding efficiency while maintaining image quality. For example, if the terminal performs the first encoding process and the server that receives the content performs the second encoding process, it is possible to improve the quality and efficiency of the content while reducing the processing load on each terminal. In this case, if there is a request to receive and decode near real time, the first encoded data from the terminal can be received and played back on other terminals, enabling more flexible real-time distribution.

[0258] As another example, cameras such as ex113 perform feature extraction from images, compress data related to the features as metadata, and transmit it to the server. The server performs compression according to the meaning of the image, for example, determines the importance of an object from the features and switches the quantization accuracy. Feature data is particularly effective for improving the accuracy and efficiency of motion vector prediction during re-compression on the server. Also, simple encoding such as VLC (Variable Length Coding) may be performed on the terminal, and encoding with a large processing load such as CABAC (Context Adaptive Binary Arithmetic Coding) may be performed on the server.

[0259] As yet another example, in a stadium, shopping mall, factory, etc., there may be a plurality of video data in which substantially the same scene is captured by a plurality of terminals. In this case, using the plurality of terminals that performed the shooting, and other terminals and servers that did not perform shooting as necessary, encoding processing is respectively assigned and distributed processing is performed, for example, in units of GOP (Group of Picture), picture units, or tile units obtained by dividing a picture. This can reduce latency and achieve more real-time performance.

[0260] Also, since the plurality of video data is of substantially the same scene, the server may manage and / or give instructions so that the video data captured by each terminal can refer to each other. Alternatively, the encoded data from each terminal may be received by the server, and the reference relationship may be changed between the plurality of data, or the picture itself may be corrected or replaced and re-encoded. This can generate a stream with improved quality and efficiency for each piece of data.

[0261] Also, the server may perform transcoding to change the encoding method of the video data and then distribute the video data. For example, the server may convert an MPEG-based encoding method to a VP-based method, or convert H.264 to H.265.

[0262] Thus, the encoding process can be performed by a terminal or one or more servers. Therefore, in the following, the terms "server" or "terminal" will be used to refer to 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 increasingly common to integrate and utilize images or videos of different scenes, or the same scene, captured from different angles, using multiple cameras ex113 and / or smartphones ex115, which are nearly synchronized with each other. The videos captured by each device are integrated based on the relative positional relationship between the devices, or on areas where feature points contained in the videos coincide, which are acquired separately.

[0264] The server may not only encode 2D video but also encode still images automatically based on scene analysis of the video, or at a time specified by the user, and send them to the receiving terminal. Furthermore, if the server can obtain the relative positional relationship between the shooting terminals, it can generate a 3D shape of the scene based not only on 2D video but also on video of the same scene taken from different angles. The server may also separately encode 3D data generated by a point cloud, or it may select or reconstruct video to send to the receiving terminal from video taken by multiple terminals based on the results of recognizing or tracking a person or object using the 3D data.

[0265] In this way, users can enjoy scenes by arbitrarily selecting each video corresponding to each shooting terminal, or they can enjoy content in which video from an arbitrary viewpoint is extracted from 3D data reconstructed using multiple images or videos. Furthermore, just like the video, sound can also be collected from multiple different angles, and the server may multiplex and transmit sound from a specific angle or space in conjunction with the video.

[0266] In recent years, content that links 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 may create separate viewpoint images for the right and left eyes and perform encoding that allows referencing between the viewpoint images using Multi-View Coding (MVC), or it may encode them as separate streams without referencing each other. When decoding the separate streams, it is advisable to synchronize playback so that the virtual 3D space is reproduced according to the user's viewpoint.

[0267] In the case of AR images, the server superimposes virtual object information from the virtual space onto camera information from the real space, based on its three-dimensional position or the user's viewpoint movement. The decoding device may acquire or store the virtual object information and three-dimensional data, generate a two-dimensional image according to the user's viewpoint movement, and create superimposed data by smoothly stitching them together. Alternatively, the decoding device may send the user's viewpoint movement to the server in addition to requesting virtual object information, and the server may create superimposed data from the three-dimensional data held by the server according to the received viewpoint movement, encode the superimposed data, and distribute it to the decoding device. The superimposed data may have an α value indicating transparency in addition to RGB, and the server may set the α value of parts other than the object created from the three-dimensional data to 0, etc., so that those parts are transparent, and encode the data. Alternatively, the server may set a predetermined RGB value to the background, like chroma keying, and generate data in which parts other than the object are the background color.

[0268] Similarly, the decryption process of the distributed data can be performed on each client terminal, on the server side, or shared between them. For example, one terminal may send a reception request to the server, and other terminals may receive the content corresponding to that request, perform the decryption process, and then transmit the decrypted signal to a device with a display. By distributing the processing and selecting appropriate content regardless of the performance of the communication-capable terminals themselves, it is possible to play back data with good image quality. Another example is that while receiving large image data on a TV or similar device, a portion of the picture, such as tiles, may be decrypted and displayed on the viewer's personal terminal. This allows for sharing the overall picture while allowing users to check their own area of ​​responsibility or areas they want to examine in more detail on their own device.

[0269] In the future, it is expected that content will be seamlessly received by switching appropriate data for the connected communication, using distribution system standards such as MPEG-DASH, in situations where multiple short-range, medium-range, or long-range wireless communications are available both indoors and outdoors. This will allow users to freely select and switch in real time between decoding devices or display devices, such as displays installed indoors or outdoors, as well as their own terminals. Furthermore, decoding can be performed while switching between the decoding terminal and the display terminal based on the user's location information. This will make it possible to display map information on the wall or part of the ground of an adjacent building with a displayable device embedded, while traveling to a destination. It will also be possible to switch the bitrate of the received data based on the ease of access to the encoded data on the network, such as when the encoded data is cached on a server that can be accessed quickly from the receiving terminal, or copied to an edge server in the content delivery service.

[0270] [Scalable encoding] Regarding content switching, we will explain using a scalable stream compressed and encoded using the video encoding method described in each of the embodiments above, as shown in Figure 33. The server may have multiple streams with the same content but different qualities as individual streams, but it may also be configured to switch content by taking advantage of the characteristics of a temporally / spatially scalable stream realized by encoding it in layers, as shown in the figure. In other words, the decoding side can freely switch between decoding low-resolution and high-resolution content by deciding which layer to decode according to internal factors such as performance and external factors such as the state of the communication bandwidth. For example, if you want to watch the rest of a video that you were watching on your smartphone ex115 while traveling, on a device such as an internet TV when you get home, that device only needs to decode the same stream to a different layer, thus reducing the burden on the server.

[0271] Furthermore, in addition to the configuration described above, in which pictures are encoded for each layer and an enhancement layer exists above the base layer to achieve scalability, the enhancement layer may include metadata based on statistical information of the image, and the decoding side may generate high-quality content by super-resolution the picture in the base layer based on the metadata. Super-resolution may refer to either an improvement in the signal-to-noise ratio at the same resolution or an increase in resolution. The metadata may include information for identifying linear or nonlinear filter coefficients used in the super-resolution process, or information for identifying parameter values ​​in the filtering process, machine learning, or least-squares operation used in the super-resolution process.

[0272] Alternatively, the picture may be divided into tiles or similar structures according to the meaning of objects within the image, and the decoding side may select tiles to decode, thereby decoding only a portion of the area. Furthermore, by storing object attributes (people, cars, balls, etc.) and their positions within the image (coordinate positions within the same image, etc.) as metadata, the decoding side can identify the location of a desired object based on the metadata and determine the tile containing that object. For example, as shown in Figure 34, the metadata is stored using a data storage structure different from pixel data, such as the SEI message in HEVC. This metadata may indicate, for example, the position, size, or color of the main object.

[0273] Furthermore, metadata may be stored in units consisting of multiple pictures, such as streams, sequences, or random access units. This allows the decryption side to obtain information such as the time when a specific person appears in the video, and by combining this with the picture-level information, it can identify the picture in which the object exists and the object's position within that picture.

[0274] [Web page optimization] Figure 35 shows an example of a web page display screen on a computer ex111, etc. Figure 36 shows an example of a web page display screen on a smartphone ex115, etc. As shown in Figures 35 and 36, a web page may contain multiple linked images, which are links to image content, and their appearance will differ depending on the viewing device. When multiple linked images are visible on the screen, the display device (decoder) will display still images or iPictures from each content as linked images, display video such as a GIF animation using multiple still images or iPictures, or receive only the base layer and decode and display the video, until the user explicitly selects a linked image, or until the linked image approaches the center of the screen or the entire linked image is within the screen.

[0275] When a linked image is selected by the user, the display device prioritizes decoding the base layer. If the HTML of the web page contains information indicating that the content is scalable, the display device may decode up to the enhancement layer. Furthermore, to ensure real-time performance, before selection or when bandwidth is very limited, the display device can decode and display only forward-referenced pictures (I-pictures, P-pictures, and B-pictures that only use forward references), thereby reducing the delay between the decoding time and display time of the first picture (the delay from the start of content decoding to the start of display). Alternatively, the display device may deliberately ignore the reference relationships between pictures and roughly decode all B-pictures and P-pictures using forward references, then perform normal decoding as time passes and more pictures are received.

[0276] [Autonomous driving] Furthermore, when transmitting and receiving still images or video data such as 2D or 3D map information for autonomous driving or driving assistance of a vehicle, the receiving terminal may receive metadata such as weather or construction information in addition to image data belonging to one or more layers, and decode these in association with each other. The metadata may belong to a layer, or it may simply be multiplexed with the image data.

[0277] In this case, since the vehicle, drone, or airplane containing the receiving terminal is in motion, the receiving terminal can transmit its location information when a reception request is made, enabling seamless reception and decoding while switching between base stations ex106 to ex110. Furthermore, the receiving terminal can dynamically switch how much metadata is received or how much map information is updated, depending on the user's selection, the user's situation, or the state of the communication bandwidth.

[0278] As described above, the content supply system ex100 allows the client to receive, decode, and play back encoded information transmitted by the user in real time.

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

[0280] During shooting, or after shooting, the server performs recognition processing such as detecting shooting errors, searching for scenes, analyzing semantics, and detecting objects from the original images or encoded data in real time. Based on the recognition results, the server manually or automatically edits the images, correcting out-of-focus or shaky images, deleting less important scenes such as those with lower brightness or out of focus compared to other pictures, emphasizing object edges, and changing color tones. The server then encodes the edited data based on the editing results. It is also known that viewership decreases if the shooting time is too long, so the server may automatically clip scenes with little movement, as well as less important scenes, based on the image processing results, to ensure that the content falls within a specific time range according to the shooting time. Alternatively, the server may generate and encode a digest based on the results of the semantic analysis of the scenes.

[0281] Furthermore, personal content may contain elements that infringe on copyright, moral rights, or portrait rights, and the scope of sharing may exceed the intended scope, which can be inconvenient for the individual. Therefore, for example, the server may intentionally change the image to one that is out of focus, such as the faces of people at the edges of the screen or the interior of a house, before encoding. The server may also recognize whether the face of a person other than those previously registered is visible in the image to be encoded, and if so, it may apply a mosaic effect to the face. Alternatively, as a pre- or post-processing step before encoding, the user can specify a person or background area that they want to process from a copyright perspective, and the server can replace the specified area with a different image or blur the focus. In the case of a person, the server can track the person in a video and replace the image of their face.

[0282] Furthermore, because viewing personal content with small data volumes requires real-time processing, depending on the bandwidth, the decoder prioritizes receiving, decoding, and playing the base layer first. During this time, the decoder can receive the enhancement layer, and if playback is looped or if the content is played more than once, it may play the high-quality video including the enhancement layer. With a stream that uses this scalable encoding, it is possible to provide an experience where the video is rough when unselected or at the beginning of viewing, but gradually the stream becomes smarter and the image quality improves. In addition to scalable encoding, a similar experience can be provided even if the rough stream played the first time and the second stream encoded by referencing the first video are configured as a single stream.

[0283] [Other usage examples] Furthermore, these encoding or decoding processes are generally performed by the LSIex500 present in each terminal. The LSIex500 may be a single chip or a multi-chip configuration. Alternatively, video encoding or decoding software may be embedded in some recording medium (such as a CD-ROM, flexible disk, or hard disk) that can be read by a computer ex111, and the encoding or decoding process may be performed using that software. In addition, if the smartphone ex115 has a camera, video data acquired by that camera may be transmitted. In this case, the video data is data encoded by the LSIex500 present in the smartphone ex115.

[0284] The LSIex500 may also be configured to be activated by downloading application software. In this case, the terminal first determines whether it supports the content encoding method or whether it has the capability to perform the specific service. If the terminal does not support the content encoding method or does not have the capability to perform the specific service, the terminal downloads the codec or application software, and then acquires and plays the content.

[0285] Furthermore, not only the content supply system ex100 via the Internet ex101, but also digital broadcasting systems can incorporate at least one of the video encoding device (image encoding device) or video decoding device (image decoding device) of each of the above embodiments. While the content supply system ex100 has a configuration that is more suited to multicast than unicast, as it transmits and receives multiplexed data with video and sound multiplexed onto broadcast radio waves using satellites, etc., the encoding and decoding processes are similar and can be applied in the same way.

[0286] [Hardware configuration] Figure 37 shows the smartphone ex115. Figure 38 shows an example of the configuration of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves with the base station ex110, a camera unit ex465 capable of taking video and still images, and a display unit ex458 that displays video captured by the camera unit ex465 and data decoded from video received by the antenna ex450. The smartphone ex115 further includes an operation unit ex466, which is a touch panel, an audio output unit ex457, which is a speaker for outputting voice or sound, an audio input unit ex456, which is a microphone for inputting voice, a memory unit ex467 capable of storing captured video or still images, recorded audio, received video or still images, encoded data such as emails, or decoded data, and a slot unit ex464, which is an interface unit with SIM ex468 for identifying the user and authenticating access to various data, including the network. External memory may be used instead of the memory unit ex467.

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

[0288] The power supply circuit unit ex461, when the power key is turned on by the user, supplies power from the battery pack to each component, thereby starting up the smartphone ex115 and making it operational.

[0289] The smartphone ex115 performs tasks such as phone calls and data communication based on the control of the main control unit ex460, which has a CPU, ROM, RAM, etc. During a call, the audio signal picked up by the audio input unit ex456 is converted into a digital audio signal by the audio signal processing unit ex454, which is then subjected to spread spectrum processing by the modulation / demodulation unit ex452, and after digital-to-analog conversion and frequency conversion processing by the transmission / reception unit ex451, it is transmitted via the antenna ex450. Similarly, received data is amplified, subjected to frequency conversion and analog-to-digital conversion processing, despread spectrum processing by the modulation / demodulation unit ex452, converted into an analog audio signal by the audio signal processing unit ex454, and then output from the audio output unit ex457. In data communication mode, text, still images, or video data are sent to the main control unit ex460 via the operation input control unit ex462 by the operation unit ex466 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 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 using the video encoding method shown in each of the above embodiments, and sends the encoded video data to the multiplexing / decoding unit ex453. The audio signal processing unit ex454 encodes the audio signal picked up by the audio input unit ex456 while the camera unit ex465 is capturing video or still images, and sends the encoded audio data to the multiplexing / decoding unit ex453. The multiplexing / decoding unit ex453 multiplexes the encoded video data and encoded audio data in a predetermined manner, 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 video attached to an email or chat, or video linked to a webpage, etc., the multiplexing / decomposition unit ex453 separates the multiplexed data received via antenna ex450 to decode it, dividing the multiplexed data into a video data bitstream and an audio data bitstream. It then supplies the encoded video data to the video signal processing unit ex455 and the encoded audio data to the audio signal processing unit ex454 via the synchronization bus ex470. The video signal processing unit ex455 decodes the video signal using a video decoding method corresponding to the video encoding method shown in each embodiment above, and displays the video or still image contained in the linked video file from the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 decodes the audio signal, and audio is output from the audio output unit ex457. However, since real-time streaming is widespread, there may be situations where audio playback is socially inappropriate depending on the user's circumstances. Therefore, as an initial setting, it is preferable to have a configuration that plays only video data and does not play audio signals. Audio may be synchronized and played only when the user performs an action, such as clicking on video data.

[0291] Furthermore, although the smartphone ex115 was used as an example here, there are three possible implementation formats for terminals: a transceiver-type terminal that has both an encoder and a decoder, a transmitting terminal that has only an encoder, and a receiving terminal that has only a decoder. In addition, although it was explained that multiplexed data, in which audio data etc. is multiplexed onto video data, is received or transmitted in a digital broadcasting system, the multiplexed data may also include text data related to the video in addition to audio data, or the video data itself may be received or transmitted instead of multiplexed data.

[0292] Although it was explained that the main control unit ex460, including the CPU, controls the encoding or decoding process, terminals often also have a GPU. Therefore, a configuration that leverages the GPU's performance to process a wide area at once using memory shared by the CPU and GPU, or memory whose addresses are managed so that it can be used in common, is also possible. This can shorten the encoding time, ensure real-time performance, and achieve low latency. In particular, it is efficient to perform motion detection, deblocking filters, SAO (Sample Adaptive Offset), and transformation / quantization processes at once on the GPU, rather than on the CPU, in units such as pictures. [Industrial applicability]

[0293] This disclosure can be used, for example, in television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, or digital video cameras. [Explanation of Symbols]

[0294] 100 Encoding device 102 Division 104 Subtraction Unit 106 Conversion Unit 108 Quantization section 110 Entropy coding unit 112, 204 Inverse quantization section 114, 206 Inverse Transform Section 116, 208 Addition section 118, 210 block memory 120, 212 Loop filter section 122,214 frame memory 124, 216 Intra Prediction Unit 126, 218 Interpretation Unit 128, 220 Prediction Control Unit 200 Decoders 202 Entropy Decoder

Claims

1. An encoding device for encoding a block to be encoded contained in a picture, Circuits and, Equipped with memory, The circuit uses the memory, The encoding target block is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock and the third subblock are encoded, When the second subblock is divided into multiple partitions, A first parameter indicating the division direction of the second subblock is written to the bitstream. If the first parameter indicates a second direction different from the first direction, a second parameter indicating the number of divisions of the second subblock is written to the bitstream. If the first parameter indicates the first direction, the second parameter is not written to the bitstream. Encoding device.

2. An encoding method for encoding a block to be encoded contained in a picture, The encoding target block is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock and the third subblock are encoded, When the second subblock is divided into multiple partitions, A first parameter indicating the division direction of the second subblock is written to the bitstream. If the first parameter indicates a second direction different from the first direction, a second parameter indicating the number of divisions of the second subblock is written to the bitstream. If the first parameter indicates the first direction, the second parameter is not written to the bitstream. Encoding method.

3. A decoding device that decodes the target block contained in an encoded picture, Circuits and, Equipped with memory, The circuit uses the memory, The decryption target block is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock, and the third subblock are decoded, When the second subblock is divided into multiple partitions, The first parameter indicating the division direction of the second subblock is read from the bitstream, If the first parameter indicates a second direction different from the first direction, the second parameter indicating the number of divisions of the second subblock is read from the bitstream. When the first parameter indicates the first direction, the second parameter is not read from the bitstream. Decoding device.

4. A decoding method for decoding a block to be decoded contained in an encoded picture, The decryption target block is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock, and the third subblock are decoded, When the second subblock is divided into multiple partitions, The first parameter indicating the division direction of the second subblock is read from the bitstream, If the first parameter indicates a second direction different from the first direction, the second parameter indicating the number of divisions of the second subblock is read from the bitstream. When the first parameter indicates the first direction, the second parameter is not read from the bitstream. Decryption method.

5. Circuits and, Equipped with memory, The circuit uses the memory, The block to be encoded is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock and the third subblock are encoded, A bitstream containing the encoded target block is generated, The generated bitstream is transmitted, When the second subblock is divided into multiple partitions, A first parameter indicating the division direction of the second subblock is written to the bitstream. If the first parameter indicates a second direction different from the first direction, a second parameter indicating the number of divisions of the second subblock is written to the bitstream. If the first parameter indicates the first direction, the second parameter is not written to the bitstream. Transmitter.

6. The block to be encoded is divided in the first direction into a first subblock, a second subblock, and a third subblock, the second subblock being located between the first subblock and the third subblock, and the division ratio of the first subblock, the second subblock, and the third subblock being 1:2:

1. The division of the second subblock into two partitions in the first direction is prohibited. The first subblock, the second subblock and the third subblock are encoded, The first subblock, the second subblock and the third subblock are encoded, A bitstream containing the encoded target block is generated, The generated bitstream is transmitted, When the second subblock is divided into multiple partitions, A first parameter indicating the division direction of the second subblock is written to the bitstream. If the first parameter indicates a second direction different from the first direction, a second parameter indicating the number of divisions of the second subblock is written to the bitstream. If the first parameter indicates the first direction, the second parameter is not written to the bitstream. Sending method.

Images