ENCODER AND DECODER

Description

ENCODER AND DECODER

[001] Divided from BR112020022773-0, filed on July 2, 2019. TECHNICAL FIELD

[002] The present invention relates to an encoder, etc., that encodes a video. PREVIOUS TECHNIQUE

[003] Conventionally there is H. 265, which is also referred to as a high-efficiency video coding (HEVC) standard for encoding a video (Non-Patent Literature (NPL) 1). Citation List Non-patented literature LNP 1

[004] H. 265 (ISO / IEC 23008-2 HEVC) / High Efficiency Video Coding (HEVC) SUMMARY OF THE INVENTION TECHNICAL PROBLEMS

[005] For such encoding and decoding methods, it is desirable that a new scheme be proposed in order to increase processing efficiency, improve image quality, reduce circuit scale, etc.

[006] Each of the configurations and methods disclosed in the embodiments or part of the embodiments according to the present invention may contribute to, for example, at least one of: an improvement in coding efficiency; a reduction in the amount of coding / decoding processing; a reduction in circuit scale; an improvement in coding / decoding speed; appropriate selection of a constituent element / operation for a filter, a block, a size, a motion vector, a reference image. Petition 870250005547, dated 23 / 01 / 2025, page 12 / 364 2 / 136 reference, a reference block, etc., in encoding and decoding.

[007] It should be noted that the present invention also includes descriptions of an configuration or method that may provide benefits other than those described above. An example of such descriptions includes a configuration or method that may improve coding efficiency while reducing an increase in the amount of processing. SOLUTIONS TO THE PROBLEMS

[008] An encoder according to one aspect of the present invention is an encoder that encodes a video. The encoder includes: circuitry; and memory coupled to the circuit. In the encoder, the circuitry, in operation, stores a first parameter in a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by overlaying an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a non-rectangular mode in which a prediction image is generated for each non-rectangular partition in the current block, and encodes the current block according to the prediction mode.

[009] A decoder according to one aspect of the present invention is a decoder that decodes a video. The decoder includes: circuitry; and memory coupled to the circuit. In the decoder, the circuitry, in operation, analyzes a first parameter of a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a non-rectangular mode in which a prediction image is generated for each non-rectangular partition. Petition 870250005547, dated 01 / 23 / 2025, page 13 / 364 3 / 136 in the current block, and decodes the current block according to the prediction mode.

[0010] It should be noted that these general and specific aspects can be implemented using a system, a device, a method, an integrated circuit, a computer program, or a non-transient computer-readable recording medium such as a compact disc for read-only memory (CD-ROM), or any combination of systems, devices, integrated circuit methods, computer programs, or recording media.

[0011] Additional benefits and advantages of the disclosed embodiments will be apparent from the Report and Drawings. The benefits and / or advantages can be individually obtained through the various embodiments and elements of the Report and Drawings, which do not all need to be provided in order to obtain one or more such benefits and / or advantages. ADVANTAGEOUS EFFECT OF THE INVENTION

[0012] The present invention is capable of providing an encoder, a decoder, an encoding method or a decoding method that allows for an increase in encoding efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] FIG. 1 is a block diagram illustrating a functional configuration of an encoder according to a modality.

[0014] FIG. 2 is a flowchart showing an example of a general coding process performed by the coder.

[0015] FIG. 3 is a diagram illustrating an example of block division.

[0016] FIG. 4A is a diagram illustrating an example of a slice configuration.

[0017] FIG. 4B is a diagram illustrating an example of a fragment configuration. Petition 870250005547, dated 01 / 23 / 2025, page 14 / 364 4 / 136

[0018] FIG. 5A is a graph indicating basic transformation functions for each type of transformation.

[0019] FIG. 5B is a diagram illustrating spatially varying transformations (SVT).

[0020] FIG. 6A is a diagram illustrating an example of a filter format used in an adaptive loop filter (ALF).

[0021] FIG. 6B is a diagram illustrating another example of a filter format used in an ALF.

[0022] FIG. 6C is a diagram illustrating another example of a filter format used in an ALF.

[0023] FIG. 7 is a block diagram showing an example of a specific configuration of a loop filter that functions as a DBF.

[0024] FIG. 8 is a diagram showing an example of a block filter having a symmetrical filtering characteristic with respect to a block boundary.

[0025] FIG. 9 is a diagram illustrating a block boundary where a deblocking filtering process is performed.

[0026] FIG. 10 is a diagram showing examples of Bs values.

[0027] FIG. 11 is a diagram illustrating an example of a process performed by an encoder prediction processor.

[0028] FIG. 12 is a diagram illustrating another example of a process performed by the encoder's prediction processor.

[0029] FIG. 13 is a diagram illustrating another example of a process performed by the encoder's prediction processor.

[0030] FIG. 14 is a diagram illustrating sixty-seven intra-prediction modes used in intra-prediction.

[0031] FIG. 15 is a flowchart illustrating a basic inter-prediction processing flow. Petition 870250005547, dated 01 / 23 / 2025, page 15 / 364 5 / 136

[0032] FIG. 16 is a flowchart illustrating an example of deriving motion vectors.

[0033] FIG. 17 is a flowchart illustrating another example of deriving motion vectors.

[0034] FIG. 18 is a flowchart illustrating another example of deriving motion vectors.

[0035] FIG. 19 is a flowchart illustrating an example of inter-normal prediction in inter-normal mode.

[0036] FIG. 20 is a flowchart illustrating an example of inter-prediction in fusion mode.

[0037] FIG. 21 is a diagram illustrating an example of a motion vector derivation process in fusion mode.

[0038] FIG. 22 is a flowchart illustrating an example of frame rate up conversion (FRUC).

[0039] FIG. 23 is a diagram illustrating an example of pattern matching (bilateral matching) between two blocks along a motion path.

[0040] FIG. 24 is a diagram illustrating an example of pattern matching (model matching) between a model in a current image and a block in a reference image.

[0041] FIG. 25A is a diagram illustrating an example of deriving a motion vector for each sub-block based on motion vectors of a plurality of neighboring blocks.

[0042] FIG. 25B is a diagram illustrating an example of deriving a motion vector for each sub-block in affine mode where three control points are used.

[0043] FIG. 26A is a conceptual diagram illustrating an affine fusion mode.

[0044] FIG. 26B is a conceptual diagram to illustrate a Petition 870250005547, dated 01 / 23 / 2025, page 16 / 364 6 / 136 affine fusion mode in which two control points are used.

[0045] FIG. 26C is a conceptual diagram illustrating an affine fusion mode in which three control points are used.

[0046] FIG. 27 is a flowchart illustrating an example of a process in affine fusion mode.

[0047] FIG. 28A is a diagram illustrating an affine intermode in which two control points are used.

[0048] FIG. 28B is a diagram illustrating an affine intermode in which three control points are used.

[0049] FIG. 29 is a flowchart illustrating an example of an inter-affine process.

[0050] FIG. 30A is a diagram illustrating an affine intermode in which a current block has three control points and a neighboring block has two control points.

[0051] FIG. 30B is a diagram illustrating an affine intermode in which a current block has two control points and a neighboring block has three control points.

[0052] FIG. 31A is a diagram illustrating a relationship between a fusion mode and dynamic motion vector update (DMVR).

[0053] FIG. 31B is a conceptual diagram to illustrate an example of a DMVR process.

[0054] FIG. 32 is a flowchart illustrating an example of generating a predictive image.

[0055] FIG. 33 is a flowchart illustrating another example of generating a predictive image.

[0056] FIG. 34 is a flowchart illustrating another example of generating a predictive image.

[0057] FIG. 35 is a flowchart illustrating an example of a predictive image correction process performed using a Petition 870250005547, dated 01 / 23 / 2025, page 17 / 364 7 / 136 Overlapping Block Motion Compensation (OBMC) process.

[0058] FIG. 36 is a conceptual diagram illustrating an example of a prediction image correction process performed using an OBMC process.

[0059] FIG. 37 is a diagram illustrating the generation of two triangular prediction images.

[0060] FIG. 38 is a diagram illustrating a model assuming uniform linear motion.

[0061] FIG. 39 is a diagram illustrating an example of a prediction image generation method using a luminance correction process performed by a local illumination compensation (LIC) process.

[0062] FIG. 40 is a block diagram illustrating an example of encoder assembly.

[0063] FIG. 41 is a block diagram illustrating a functional configuration of a decoder according to a mode.

[0064] FIG. 42 is a flowchart illustrating an example of a general decoding process performed by the decoder.

[0065] FIG. 43 is a diagram illustrating an example of a process performed by a decoder prediction processor.

[0066] FIG. 44 is a diagram illustrating another example of a process performed by the decoder's prediction processor.

[0067] FIG. 45 is a flowchart illustrating an example of inter prediction in normal inter mode in the decoder.

[0068] FIG. 46 is a block diagram illustrating an example of decoder assembly.

[0069] FIG. 47 is a flowchart illustrating an example of prediction processing according to a first aspect.

[0070] FIG. 48 is a diagram to explain more specifically Petition 870250005547, dated 01 / 23 / 2025, page 18 / 364 8 / 136 gives an example of prediction processing according to the first aspect.

[0071] FIG. 49 is a diagram illustrating an example of an actual block being divided into a plurality of partitions that include at least one non-quadrilateral partition.

[0072] FIG. 50 is a diagram illustrating an example of an actual block being divided into two triangular partitions.

[0073] FIG. 51 is a diagram to explain an example of coding processing according to Variation 1 of the first aspect.

[0074] FIG. 52 is a diagram to explain an example of coding processing according to Variation 2 of the first aspect.

[0075] FIG. 53 is a flowchart illustrating an example of coding processing according to a second aspect.

[0076] FIG. 54 is a diagram to explain more specifically an example of coding processing according to the second aspect.

[0077] FIG. 55 is a diagram to explain an example of coding processing according to Variation 1 of the second aspect.

[0078] FIG. 56 is a diagram to explain an example of coding processing according to Variation 2 of the second aspect.

[0079] FIG. 57 is a diagram to explain an example of coding processing according to one aspect of a combination of the first aspect and the second aspect.

[0080] FIG. 58 is a flowchart illustrating an example of coding processing according to a third aspect.

[0081] FIG. 59 is a diagram to explain more specifically Petition 870250005547, dated 01 / 23 / 2025, p. 19 / 364 9 / 136 gives an example of encoding processing according to the third aspect.

[0082] FIG. 60 is a flowchart illustrating an example of coding processing according to a fourth aspect.

[0083] FIG. 61 is a diagram to explain more specifically an example of coding processing according to the fourth aspect.

[0084] FIG. 62 is a diagram explaining an example of coding processing according to a variation of the fourth aspect.

[0085] FIG. 63 is a diagram illustrating a general configuration of a content provisioning system for implementing a content distribution service.

[0086] FIG. 64 is a diagram illustrating an example of a coding structure in scalable coding.

[0087] FIG. 65 is a diagram illustrating an example of a coding structure in scalable coding.

[0088] FIG. 66 is a diagram illustrating an example of a web page display screen.

[0089] FIG. 67 is a diagram illustrating an example of a web page display screen.

[0090] FIG. 68 is a diagram illustrating an example of a smartphone.

[0091] FIG. 69 is a block diagram illustrating an example of a smartphone configuration. DESCRIPTION OF EXEMPLARY MODALITIES Underlying Knowledge Forming the Basis of the Present Invention

[0092] For example, when encoding a video, etc., an encoder that encodes a video derives a prediction error by subtracting a Petition 870250005547, dated 01 / 23 / 2025, page 20 / 364 10 / 136 Image prediction of an image included in a video, when the video is encoded by performing prediction processing in a more refined way while reducing an increase in the amount of processing. Then, the encoder performs frequency transformation and quantization on the prediction error, and encodes the results as image data. At this point, when performing motion prediction processing, by block or sub-block included in the block, in a unit to be encoded such as a block included in the video, a combination of prediction modes is controlled, thus improving encoding efficiency.

[0093] However, when encoding, etc., a block included in a video, an uncontrolled combination of prediction mode leads to an increase in the amount of processing, and then the encoding efficiency is reduced.

[0094] In view of the above, an encoder according to one aspect of the present invention is an encoder that encodes a video. The encoder includes: circuitry; and memory coupled to the circuit. In the encoder, the circuitry, in operation, writes a first parameter to a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions, and encodes the current block according to the prediction mode.

[0095] In this way, the encoder is able to perform encoding with a parameter for applying a plurality of prediction modes to the current block. It is then possible to improve processing efficiency. Petition 870250005547, dated 01 / 23 / 2025, page 21 / 364 11 / 136

[0096] For example, when the current block is not predicted in multiple prediction mode, the circuit can write a second parameter to the bitstream, the second parameter indicating whether the prediction mode is triangular mode.

[0097] In this way, the encoder is able to apply exclusively the multiple prediction mode and the triangular mode as the prediction modes, and then it is possible to improve coding efficiency.

[0098] For example, the circuit can switch between enabling and disabling the use of triangular mode as the prediction mode, depending on whether the current block satisfies a given condition.

[0099] Also, for example, the determined condition may be the size of the current block.

[00100] Also, for example, the determined condition may be a way of encoding the current block.

[00101] In this way, the encoder switches between prediction modes, based on a given condition such as the size or encoding mode of the current block, and then it is possible to improve encoding efficiency.

[00102] For example, the first parameter could be a flag.

[00103] Also, for example, the second parameter could be a flag.

[00104] In this way, the encoder is able to generate encoded data with less code.

[00105] Furthermore, a decoder according to one aspect of the present invention is a decoder that decodes a video. The decoder includes: circuit; and memory coupled to the circuit. In the decoder, the circuit, in operation, analyzes a first parameter of a bit stream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which an image of Petition 870250005547, dated 01 / 23 / 2025, page 22 / 364 12 / 136 prediction is generated by overlaying an inter prediction image of a current block and an intra prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions, and decodes the current block according to the prediction mode.

[00106] In this way, the decoder is able to perform decoding by analyzing a parameter to apply a plurality of prediction modes to the current block. It is then possible to improve processing efficiency.

[00107] For example, when the current block is not predicted in multiple prediction mode, the circuit can analyze a second parameter of the bit stream, the second parameter indicating whether the prediction mode is triangular mode.

[00108] In this way, the decoder is able to apply exclusively the multiple prediction mode and the triangular mode as the prediction modes, and then it is possible to improve processing efficiency.

[00109] For example, the circuit can switch between enabling and disabling the use of triangular mode as the prediction mode, depending on whether the current block satisfies a given condition.

[00110] Also, for example, the determined condition could be the size of the current block.

[00111] Also, for example, the determined condition may be a way of encoding the current block.

[00112] In this way, the decoder switches between prediction modes, based on a given condition such as the size or encoding mode of the current block, and then it is possible to improve processing efficiency.

[00113] For example, the first parameter could be a flag. Petition 870250005547, dated 01 / 23 / 2025, page 23 / 364 13 / 136 For example, the second parameter could be a flag.

[00114] In this way, the decoder is able to decode encoded data with less code.

[00115] Furthermore, a coding method according to an aspect of the present description is a coding method for encoding a video. The coding method includes writing a first parameter to a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions; and encoding the current block according to the prediction mode.

[00116] In this way, with the coding method, it is possible to perform coding with a parameter for applying a plurality of prediction modes to the current block. It is then possible to improve processing efficiency.

[00117] Furthermore, a decoding method according to one aspect of the present invention is a decoding method for decoding a video. The decoding method includes: analyzing a first parameter of a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions; and decoding the current block according to the prediction mode.

[00118] In this way, with the decoding method, it is possible Petition 870250005547, dated 01 / 23 / 2025, page 24 / 364 14 / 136 perform decoding by analyzing a parameter to apply a plurality of prediction modes to the current block. It is then possible to improve processing efficiency.

[00119] Furthermore, these general and specific aspects can be implemented using a system, a device, a method, an integrated circuit, a computer program, or a non-transient computer-readable recording medium such as a compact disc for read-only memory (CD-ROM), or any combination of systems, devices, integrated circuit methods, computer programs, or recording media.

[00120] From here on, the embodiments will be described with reference to the drawings. Note that the embodiments described below each show a general or specific example. The numerical values, formats, materials, components, the arrangement and connection of the components, steps, the reaction and order of the steps, etc., indicated in the embodiments that follow are mere examples, and are not intended to limit the scope of the embodiments.

[00121] The embodiments of an encoder and a decoder will be described below. The embodiments are examples of an encoder and a decoder to which the processes and / or configurations presented in the description of aspects of the present invention are applicable. The processes and / or configurations may also be implemented in an encoder and a decoder different from those according to the embodiments. For example, with respect to processes and / or configurations as applied to the embodiments, any of the following may be implemented.

[00122] (1) any of the components of the encoder or decoder according to the embodiments presented in the description of aspects of the present invention may be replaced or combined with another component presented anywhere in the description. Petition 870250005547, dated 23 / 01 / 2025, page 25 / 364 15 / 136 description of aspects of the present invention.

[00123] (2) In the encoder or decoder according to the embodiments, discretionary changes may be made to functions or processes performed by one or more components of the encoder or decoder, such as adding, replacing, removing, etc., functions or processes. For example, any function or process may be replaced or combined with another function or process presented anywhere in the description of aspects of the present invention.

[00124] (3) In methods implemented by the encoder or decoder according to the modalities, discretionary changes may be made such as adding, replacing and removing one or more of the processes included in the method. For example, any process in the method may be replaced or combined with another process presented anywhere in the description of aspects of the present invention.

[00125] (4) One or more components included in the encoder or decoder according to embodiments may be combined with a component presented anywhere in the description of aspects of the present invention, may be combined with a component including one or more functions presented anywhere in the description of aspects of the present invention and may be combined with a component that implements one or more processes implemented by a component presented in the description of aspects of the present invention.

[00126] (5) A component including one or more encoder or decoder functions according to the embodiments, or a component that implements one or more encoder or decoder processes according to the embodiments, may be combined or replaced with a component presented anywhere in Petition 870250005547, dated 01 / 23 / 2025, p. 26 / 364 16 / 136 description of aspects of the present invention, with a component including one or more functions presented anywhere in the description of aspects of the present invention, or with a component that implements one or more processes presented anywhere in the description of aspects of the present invention.

[00127] (6) In methods implemented by the encoder or decoder according to the embodiments, any of the processes included in the method may be replaced or combined with a process presented anywhere in the description of aspects of the present invention or with any corresponding or equivalent process.

[00128] (7) One or more processes included in methods implemented by the encoder or decoder according to the embodiments may be combined with a process presented anywhere in the description of aspects of the present invention.

[00129] (8) The implementation of the processes and / or configurations presented in the description of aspects of the present invention is not limited to the encoder or decoder according to the embodiments. For example, the processes and / or configurations may be implemented in a device used for a purpose other than the motion picture encoder or motion picture decoder disclosed in the embodiments. MODE 1 Encoder

[00130] First, an encoder according to this modality will be described. FIG. 1 is a block diagram illustrating a functional configuration of the 100 decoder according to this modality. The 100 encoder is a video encoder that encodes a video into one-block units.

[00131] As illustrated in FIG. 1, encoder 100 is a device Petition 870250005547, dated 01 / 23 / 2025, page 27 / 364 17 / 136 which encodes an image in block units, and includes divider 102, substrate 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, block memory 118, loop filter 120, frame memory 122, intra predictor 124, inter predictor 126 and prediction controller 128.

[00132] Encoder 100 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in memory is executed by the processor, the processor functions as a divider 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128. Alternatively, the encoder 100 can be implemented as one or more dedicated electronic circuits corresponding to divider 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128.

[00133] From here on, a general flow of processes performed by encoder 100 is described, and then each of the constituent elements included in encoder 100 will be described. General Coding Process Flow

[00134] FIG. 2 is a flowchart showing an example of a general coding process performed by encoder 100.

[00135] First, the 102 splitter of the 100 encoder divides each of the images included in an input image that is a video into a plurality of blocks having a fixed size (128x128 pixels) (Step Sa_1). The 102 splitter then selects a splitting pattern for the fixed-size block (also referred to as block format). Petition 870250005547, dated 01 / 23 / 2025, page 28 / 364 18 / 136 (Step Sa_2). In other words, the divider 102 further divides the fixed-size block into a plurality of blocks that form the selected division pattern. The encoder 100 performs, for each of the plurality of blocks, Steps Sa_3 to Sa_9 for the block (i.e., an actual block to be encoded).

[00136] In other words, a prediction processor that includes all or part of intra predictor 124, inter predictor 126 and prediction controller 128 generates a prediction signal (also referred to as a prediction block) from the current block to be encoded (also referred to as a current block) (Step Sa_3).

[00137] Next, subtractor 104 generates a difference between the current block and a prediction block as a prediction residual (also referred to as a difference block) (Step Sa_4).

[00138] Next, transformer 106 transforms the difference block and quantizer 108 quantizes the result, to generate a plurality of quantized coefficients (Step Sa_5). It should be noted that the block having the plurality of quantized coefficients is also referred to as a coefficient block.

[00139] Next, the entropy encoder 110 encodes (specifically, entropy encodes) the coefficient block and a prediction parameter related to generating a prediction signal to generate an encoded signal (Step Sa_6). It should be noted that the encoded signal is also referred to as an encoded bitstream, a compressed bitstream, or a stream.

[00140] Next, the inverse quantizer 112 performs inverse quantization of the coefficient block and the inverse transformer 114 performs inverse transformation of the result, to restore a plurality of prediction residues (i.e., a difference block) (Step Sa_7).

[00141] Next, adder 116 adds the prediction block to the restored difference block to reconstruct the current block. Petition 870250005547, dated 01 / 23 / 2025, page 29 / 364 19 / 136 as a reconstructed image (also referred to as a reconstructed block or a decoded image block) (Step Sa_8). In this way, the reconstructed image is generated.

[00142] When the reconstructed image is generated, loop filter 120 performs filtering of the reconstructed image as needed (Step Sa_9).

[00143] Encoder 100 then determines if encoding of the entire image has finished (Step Sa_10). When it determines that encoding has not yet finished (Not in Step Sa_10), processes in Step Sa_2 are executed repeatedly.

[00144] Although encoder 100 selects a division pattern for a fixed-size block, and encodes each block according to the division pattern in the example described above, it should be noted that each block can be encoded according to a corresponding plurality of division patterns. In this case, encoder 100 can evaluate a cost for each of the plurality of division patterns and, for example, can select the encoded signal obtainable by encoding according to the division pattern that yields the lowest cost as an encoded signal that is finally produced.

[00145] Alternatively, the processes in Steps Sa_1 to Sa_10 can be performed sequentially by decoder 100, or two or more of the processes can be performed in parallel, or they can be reordered. Divider

[00146] The 102 divider splits each of the images included in an input video into a plurality of blocks, and sends each block to the 104 subtractor. For example, the 102 divider first splits an image into blocks of a fixed size (e.g., 128x128). The fixed-size block is also referred to as a coding tree unit (CTU). The 102 divider then splits each block into Petition 870250005547, dated 01 / 23 / 2025, page 30 / 364 20 / 136 fixed size in blocks of variable sizes (e.g., 64x64 or smaller), based on quadtree block splitting and / or recursive binary tree. In other words, the 102 splitter selects a splitting pattern. The variable-size block is also referred to as an encoding unit (CU), a prediction unit (PU), or a transformation unit (TU). It should be noted that in many types of assembly examples, there is no need to differentiate between CU, PU, ​​and TU; all some of the blocks in an image can be processed into units of a CU, a PU, or a TU.

[00147] FIG. 3 is a diagram illustrating an example of block splitting according to the present embodiment. In FIG. 3, the solid lines represent block boundaries of block splitting by quadtree block splitting, and the dashed lines represent block boundaries of block splitting by binary tree block splitting.

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

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

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

[00151] The bottom left 64x64 block is first divided into four 32x32 square blocks (block division by quadtree). The Petition 870250005547, dated 01 / 23 / 2025, page 31 / 364 The top left and bottom right blocks of the 32x32 square blocks are further divided. The top left 32x32 block is vertically divided into two 16x32 rectangular blocks, and the right 16x32 block is further divided horizontally 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.

[00152] The bottom right block of 64x64 23 is not divided.

[00153] As described above, in FIG. 3, block 10 is divided into thirteen blocks of varying size 11 to 23 based on block division by quadtree or recursive binary tree. This type of division is also referred to as quadtree plus binary tree (QTBT) division.

[00154] It should be noted that in FIG. 3, a block is divided into four or two blocks (block division by quadtree or binary tree), but division is not limited to these examples. For example, a block can be divided into three blocks (ternary block division). Division including such ternary block division is also referred to as multi-type tree (MBT) division. Image Structure: Slice / Fragment

[00155] An image can be configured in units of one or more slices or fragments in order to decode the image in parallel. The image configured in units of one or more slices or fragments can be configured by the divider 102.

[00156] Slices are basic encoding units included in an image. An image may include, for example, one or more slices. Furthermore, a slice includes one or more successive encoding tree units (CTUs). Petition 870250005547, dated 01 / 23 / 2025, page 32 / 364 22 / 136

[00157] FIG. 4A is a diagram illustrating an example of a slice configuration. For example, an image includes 11x8 CTUs, and is divided into four slices (slices 1 to 4). Slice 1 includes sixteen CTUs, slice 2 includes twenty-one CTUs, slice 3 includes twenty-nine CTUs, and slice 4 includes twenty-two CTUs. Here, each CTU in the image belongs to one of the slices. The shape of each slice is a shape obtainable by dividing the image horizontally. A boundary of each slice does not need to coincide with an end of the image, and can coincide with any of the boundaries between CTUs in the image. The processing order of the CTUs in a slice (an encoding order or a decoding order) is, for example, a raster scan order. A slice includes header information and encoded data. The elements of the slice can be described in header information. The elements include a CTU address of a higher-level CTU in the slice, a slice type, etc.

[00158] A fragment is a unit of a rectangular region included in an image. Each fragment can be assigned a number referred to as TileId in raster scan order.

[00159] FIG. 4B is a diagram showing an example of a fragment configuration. For example, an image includes 11x8 CTUs and is divided into four fragments of rectangular regions (fragments 1 to 4). When fragments are used, the processing order of CTUs is changed from the processing order in the case where no fragments are used. When no fragments are used, CTUs in an image are processed in raster scan order. When fragments are used, at least one CTU in each of the fragments is processed in raster scan order. For example, as illustrated in FIG. 4B, the processing order of the CTUs included in fragment 1 is the order that starts from the leftmost end of the first column of fragment 1 towards the leftmost end. Petition 870250005547, dated 01 / 23 / 2025, page 33 / 364 23 / 136 right end of the first column of fragment 1 and then starts from the left end of the second column of fragment 1 towards the right end of the second column of fragment 1.

[00160] It should be noted that a fragment may include one or more slices, and a slice may include one or more fragments. Subtractor

[00161] Subtractor 104 subtracts a prediction signal (prediction sample that is entered from prediction controller 128 indicated below) from an original signal (original sample) in units of a block insertion from the divider 102 and divided by the divider 102. In other words, subtractor 104 calculates the prediction errors (also referred to as residuals) of a block to be encoded (hereinafter also referred to as a current block). Subtractor 102 then sends the calculated prediction errors (residuals) to transformer 106.

[00162] The original signal is a signal that was fed into encoder 100 and represents one image from each image included in a video (for example, one luma signal and two chroma signals). Hereafter, a signal representing an image is also referred to as a sample. Transformer

[00163] Transformer 106 transforms spatial domain prediction errors into frequency domain transformation coefficients, and sends the transformation coefficients to quantizer 108. More specifically, transformer 106 applies, for example, a predefined discrete cosine transform (DCT) or discrete sine transform (DST) to spatial domain prediction errors.

[00164] It should be noted that transformer 106 can adaptively select one type of transformation from a plurality of transformation types, and transforms prediction errors into coefficients. Petition 870250005547, dated 01 / 23 / 2025, page 34 / 364 24 / 136 transformation entities using a transformation basis function corresponding to the selected transformation type. This type of transformation is also referred to as explicit multiple core transformation (EMT) or adaptive multiple transformation (AMT).

[00165] Transformation types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. FIG. 5A is a graph indicating basic transformation functions for each transformation type. In FIG. 5A, N indicates the number of insertion pixels. For example, selection of a transformation type from among the plurality of transformation types may depend on a prediction type (an intra-prediction and an inter-prediction), and may depend on an intra-prediction mode.

[00166] Information indicating whether to apply such EMT or AMT (referred to as, for example, an EMT flag or an AMT flag) and information indicating the selected transformation type is normally signaled at the CU level. It should be noted that signaling of such information does not necessarily need to be done at the CU level, and may be done at another level (e.g., bit sequence level, image level, slice level, fragment level, or CTU level).

[00167] Furthermore, the 106 transformer can retransform the transformation coefficients (result of the transformation). Such retransformation is also referred to as adaptive secondary transformation (AST) or non-separable secondary transformation (NSST). For example, the 106 transformer performs retransformation in units of a sub-block (e.g., 4x4 sub-block) included in a transformation coefficient block corresponding to an intra-prediction error. Information indicating whether NSST applies and information related to a transformation matrix for use in NSST is normally signaled at the CU level. It should be noted that signaling of such information does not necessarily need to be done at the level of Petition 870250005547, dated 01 / 23 / 2025, p. 35 / 364 25 / 136 CU, and can be performed at another level (for example, at the sequence level, image level, slice level, fragment level, or CTU level).

[00168] The 106 transformer can employ a separable transformation and a non-separable transformation. A separable transformation is a method in which a transformation is performed a plurality of times by separately performing a transformation for each of several directions according to the number of insertion dimensions. A non-separable transformation is a method of performing a collective transformation in which two or more dimensions in multidimensional insertions are collectively considered as a single dimension.

[00169] In an example of a non-separable transformation, when an insertion is a 4x4 block, the 4x4 block is considered a single array including sixteen elements, and the transformation applies a 16x16 transformation matrix to the array.

[00170] In another example of a non-separable transformation, a 4x4 insertion block is considered a single array including sixteen elements, and then a transformation (hypercube data transformation) in which data revolution is performed on the array a plurality of times is carried out.

[00171] In the 106 transformer transformation, the types of basis sets to be transformed in the frequency domain according to the regions in a CU can be changed. Examples include spatially variable transforms (SVT). In SVT, as illustrated in FIG. 5B, CUs are divided into two equal regions horizontally or vertically, and only one of the regions is transformed in the frequency domain. A type of basis set can be defined for each region. For example, DST7 and DST8 are used. In this example, only one of these regions in the CU is transformed, and the other Petition 870250005547, dated 01 / 23 / 2025, page 36 / 364 26 / 136 is not transformed. However, both regions can be transformed. Furthermore, the splitting method is not limited to splitting into two equal regions and can be more flexible. For example, the CU can be split into four equal regions, or information indicating splitting can be encoded separately and signaled in the same way as the CU split. It should be noted that SVT is also referred to as sub-block transformation (SBT). Quantizer

[00172] Quantizer 108 performs quantization of the output of the transformation coefficients from transformer 106. More specifically, the quantizer sweeps, in a determined sweep order, the transformation coefficients of the current block, and performs quantization of the swept transformation coefficients based on quantization parameters (QP) corresponding to the transformation coefficients. Quantizer 108 then sends the quantized transformation coefficients (hereinafter also referred to as quantized coefficients) of the current block to the entropy encoder 110 and inverse quantizer 112.

[00173] A determined sweep order is an order for quantization / inverse quantization of transformation coefficients. For example, a determined sweep order is defined as ascending frequency order (from low frequency to high) or descending frequency order (from high frequency to low).

[00174] A quantization parameter (QP) is a parameter defining a quantization step (quantization width). For example, when the value of the quantization parameter increases, the quantization step also increases. In other words, when the value of the quantization parameter increases, the quantization error increases.

[00175] Furthermore, a quantization matrix can be used for quantization. For example, various types of quantization matrices Petition 870250005547, dated 01 / 23 / 2025, page 37 / 364 27 / 136 can be used correspondingly to frequency transformation sizes such as 4x4 and 8x8, prediction modes such as intra-prediction and inter-prediction, and pixel components such as luma and chroma pixel components. It should be noted that quantization means digitizing sampled values ​​at predetermined intervals corresponding to predetermined levels. In this technical field, quantization can be represented by other expressions such as rounding and scaling.

[00176] Methods using quantization matrices include a method using a quantization matrix that has been defined directly on the encoder side and a method using a quantization matrix that has been defined as a default (default matrix). On the decoder side, a suitable quantization matrix for elements of an image can be defined by directly defining a quantization matrix. This case, however, has a disadvantage of increasing the encoding quantity for encoding the quantization matrix.

[00177] There is a method for quantizing a high-frequency coefficient and a low-frequency coefficient without using a quantization matrix. It should be noted that this method is equivalent to a method using a quantization matrix (planar matrix) whose coefficients have the same value.

[00178] The quantization matrix can be specified using, for example, a sequence parameter setting (SPS) or an image parameter setting (PPS). The SPS includes a parameter that is used for a sequence, and the PPS includes a parameter that is used for an image. Each of the SPS and PPS can simply be referred to as a parameter setting. Entropy Encoder

[00179] The entropy encoder 110 generates an encoded signal (flu Petition 870250005547, dated 01 / 23 / 2025, page 38 / 364 28 / 136 xo of encoded bits) based on quantized coefficients that were inserted from the 108 quantizer. More specifically, the 110 entropy encoder, for example, binarizes quantized coefficients, and arithmetically encodes the binary signal, and sends a compressed bit stream or sequence. Inverse Quantizer

[00180] The inverse quantizer 112 inverse quantizes quantized coefficients that were inserted from the quantizer 108. More specifically, the inverse quantizer 112 inverse quantizes, in a determined sweep order, quantized coefficients of the current block. The inverse quantizer 112 then sends the inverse quantized transform coefficients of the current block to the inverse transformer 114. Reversing Transformer

[00181] The inverse transformer 114 restores (residual) prediction errors by inversely transforming the transformation coefficients that were inserted from the inverse quantizer 12. More specifically, the inverse transformer 114 restores the prediction errors of the current block by applying an inverse transformation corresponding to the transformation applied by transformer 106 to the transformation coefficients. The inverse transformer 114 then sends the restored prediction errors to the adder 116.

[00182] It should be noted that since information is lost in quantization, the restored prediction errors do not correspond to the prediction errors calculated by the subtractor 104. In other words, the restored prediction errors typically include quantization errors. Adder

[00183] Adder 116 reconstructs the current block by adding prediction errors that were inserted from the inverse transformer. Petition 870250005547, dated 01 / 23 / 2025, page 39 / 364 29 / 136 114 and prediction samples that were inserted from the prediction controller 128. The adder 116 then sends the reconstructed block to the block memory 118 and loop filter 120. A reconstructed block is also referred to as a local decoded block. Block memory

[00184] Block memory 118 is, for example, storage for storing blocks in an image to be encoded (hereafter referred to as a current image) which is referred to in intra prediction. More specifically, block memory 118 stores the reconstructed block output of adder 116. Memory of Paintings

[00185] Frame memory 122 is, for example, storage for storing reference images for use in inter-prediction, and is also referred to as a frame buffer. More specifically, frame memory 122 stores reconstructed blocks filtered by loop filter 120. Loop Filter

[00186] Loop filter 120 applies a loop filter to blocks reconstructed by adder 116, and sends the filtered reconstructed blocks to frame memory 122. A loop filter is a filter used in an encoding loop (loop filter) and includes, for example, a deblock filter (DF or DBF), a sample adaptive shift filter (SAO), and an adaptive loop filter (ALF).

[00187] In an ALF, a least squares error filter for removing compression artifacts is applied. For example, a filter selected from a plurality of filters based on direction and local gradient activity is applied to each of the 2x2 sub-blocks in the current block.

[00188] More specifically, first, each sub-block (for example, each 2x2 sub-block) is categorized into one of a plurality Petition 870250005547, dated 01 / 23 / 2025, page 40 / 364 30 / 136 of classes (e.g., fifteen or twenty-five classes). The sub-block classification is based on gradient directionality and activity. For example, the classification index C (e.g., C = 5D + A) is derived based on gradient directionality D (e.g., 0 to 2 or 0 to 4) and gradient activity A (e.g., 0 to 4). Then, based on the classification index C, each sub-block is categorized into one of a plurality of classes.

[00189] For example, gradient directionality D is calculated by comparing gradients of a plurality of directions (e.g., the horizontal, vertical, and two diagonal directions). Additionally, for example, gradient activity A is calculated by adding gradients of a plurality of directions and quantizing the result of the addition.

[00190] The filter to be used for each sub-block is determined from among a plurality of filters based on the result of such categorization.

[00191] The filter format to be used in an ALF is, for example, a circular symmetrical filter format. FIG. 6A to FIG. 6C illustrate examples of filter formats used in ALFs. FIG. 6A illustrates a 5x5 diamond-shaped filter, FIG. 6B illustrates a 7x7 diamond-shaped filter, and FIG. 6C illustrates a 9x9 diamond-shaped filter. Information indicating the filter format is normally marked at the image level. It should be noted that the marking of such information indicating the filter format does not necessarily need to be done at the image level, and can be done at another level (e.g., sequence level, slice level, fragment level, CTU level, or CU level).

[00192] The ON or OFF of ALF is determined, for example, at the image level or CU level. For example, the decision to apply ALF to a luma can be made at the CU level, and the decision to Petition 870250005547, dated 01 / 23 / 2025, p. 41 / 364 31 / 136 If ALP is applied, chroma can be taken at the image level. Information indicating ALF ON or OFF is normally signaled at the image level or CU level. It should be noted that signaling information indicating ALF ON or OFF does not necessarily need to be performed at the image level or CU level, and can be performed at another level (e.g., sequence level, slice level, fragment level, or CTU level).

[00193] The coefficient defined for the plurality of selectable filters (e.g., fifteen or even twenty-five filters) is normally signaled at the image level. It should be noted that signaling the coefficient definition does not necessarily need to be done at the image level, and can be done at another level (e.g., sequence level, slice level, fragment level, CTU level, CU level, or sub-block level). Loop Filter > Unlock Filter

[00194] In an unlock filter, the 120 loop filter performs a filtering process on a block boundary in a reconstructed image in order to reduce distortion that occurs at the block boundary.

[00195] FIG. 7 is a block diagram illustrating an example of a specific configuration of a 120 loop filter that functions as an unblocking filter.

[00196] The 120 loop filter includes: limit determiner 1201; filter determiner 1203; filter executor 1205; process determiner 1208; filter characteristic determiner 1207; and switches 1202, 1204 and 1206.

[00197] Boundary determinant 1201 determines whether a pixel to be unblocked-filtered (i.e., a current pixel) is present around a block boundary. Boundary determinant 1201 then sends the result of the determination to switch 1202 and processing determinant 1208. Petition 870250005547, dated 01 / 23 / 2025, page 42 / 364 32 / 136

[00198] In the case where boundary determiner 1201 has determined that a current pixel is present around the block boundary, switcher 1202 sends an unfiltered image to switcher 1204. In the opposite case where boundary determiner 1201 has determined that no current pixel is present around the block boundary, switcher 1202 sends an unfiltered image to switcher 1206.

[00199] Filter determinant 1203 determines whether to perform unlock filtering of the current pixel, based on the pixel value of at least one surrounding pixel located around the current pixel. Filter determinant 1203 then sends the determination result to switch 1204 and processing determinant 1208.

[00200] In the case where filter determiner 1203 determined to perform unlock filtering of the current pixel, switch 1204 sends the unfiltered image obtained through switch 1202 to filter executor 1205. In the opposite case where filter determiner 1203 determined not to perform unlock filtering of the current pixel, switch 1204 sends the unfiltered image obtained through switch 1202 to switch 1206.

[00201] When obtaining the unfiltered image through switches 1202 and 1204, filter executor 1205 performs, for the current pixel, unlock filtering with the filter characteristic determined by filter characteristic determiner 1207. Filter executor 1205 then sends the filtered pixel to switch 1206.

[00202] Under the control of processing determinant 1208, switch 1206 selectively outputs a pixel that has not been unlocked-filtered and a pixel that has been unlocked-filtered by filtering executor 1205.

[00203] The processing determinant 1208 controls the switch 1206 based on the results of determinations made by the limit determinant 1201 and filter determinant 1203. In other words, Petition 870250005547, dated 01 / 23 / 2025, page 43 / 364 33 / 136 Lavras, processing determinant 1208 causes switch 1206 to output the pixel that was unlocked-filtered when boundary determinant 1201 determined that the current pixel is present around the block boundary and filter determinant 1203 determined to perform unlock filtering of the current pixel. However, unlike the case above, processing determinant 1208 causes switch 1206 to output the pixel that was not unlocked-filtered. A filtered image is output from switch 1206 by repeatedly outputting a pixel in this manner.

[00204] FIG. 8 is a diagram showing an example of a block filter having a symmetrical filtering characteristic with respect to the block limit.

[00205] In a deblocking filter process, one of two deblocking filters having different characteristics, i.e., a strong filter and a weak filter, are selected using pixel values ​​and quantization parameters. In the case of the strong filter, pixels p0 to p2 and pixels q0 to q2 are present across a block boundary as illustrated in FIG. 8, the pixel values ​​of the respective pixels q0 to p2 are changed to pixel values ​​q'0 to q'2 by performing computations according to the expression below. q'0 = (p1 + 2 x p0 + 2 χ q0 + 2 χ q1 + q2 + 4) / 8 q'1 = (p0 +q0 + q1 + q2 + 2) / 4 q'2 = (p0 + q0 + q1 +3 x q2 + 2 x q3 +4) / 8

[00206] It should be noted that, in the expressions above, p0 to p2 and q0 to q2 are the pixel values ​​of the respective pixels p0 to p2 and pixels q0 to q2. Furthermore, q3 is the pixel value of the neighboring pixel q3 located on the opposite side of pixel q2 with respect to the block boundary. Also, on the right-hand side of each expression, the coefficients that are multiplied with the respective pixel values ​​of the pixels to be used are shown. Petition 870250005547, dated 01 / 23 / 2025, p. 44 / 364 34 / 136 for unlock filtering are filter coefficients.

[00207] Furthermore, in unlock filtering, clipping can be performed so that the calculated pixel values ​​do not change above a threshold value. In the clipping process, the pixel values ​​calculated according to the expressions above are clipped to a value obtained according to a pre-computation pixel value ± 2 x a threshold value using the threshold value determined based on a quantization parameter. In this way, it is possible to avoid excessive smoothing.

[00208] FIG. 9 is a diagram to illustrate a block boundary in which an unblocking filter process is performed. FIG. 10 is a diagram showing examples of Bs values.

[00209] The block boundary at which the unlocking filter process is performed is, for example, a boundary between prediction units (PU) having 8x8 pixel blocks as illustrated in FIG. 9 or a boundary between transformation units (TU). The unlocking filter process is performed in four-row or four-column units. First, the boundary resistance (Bs) values ​​are determined as indicated in FIG. 10 for block P and block Q illustrated in FIG. 9.

[00210] According to the Bs values ​​in FIG. 10, whether to perform unlocking filter processes on block boundaries belonging to the same image using different resistances is determined. The unlocking filter process for a chroma signal is performed when a Bs value is 2. The unlocking filter process for a luma signal is performed when a Bs value is 1 or more and a certain condition is met.It should be noted that conditions for determining Bs values ​​are not limited to those indicated in FIG. 10, and a Bs value may be determined based on another parameter. Prediction Processor (Intra Predictor, Inter Predictor, Petition Control 870250005547, dated 01 / 23 / 2025, page 45 / 364) 35 / 136 Prediction Pain)

[00211] FIG. 11 is a diagram illustrating an example of a process performed by the prediction processor of encoder 100. It should be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 124; inter predictor 126; and prediction controller 128.

[00212] The prediction processor generates a prediction image of a current block (Step Sb_1). This prediction image is also referred to as a prediction signal or a prediction block. It should be noted that the prediction signal is, for example, an intra-prediction signal or an inter-prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image that has already been obtained through the generation of a prediction block, generation of a difference block, generation of a coefficient block, restoration of a difference block, and generation of a decoded image block.

[00213] The reconstructed image can be, for example, an image within a reference image or an image of a block encoded in a current image that is the image including the current block. The block encoded in the current image is, for example, a block neighboring the current block.

[00214] FIG. 12 is a diagram illustrating another example of a process performed by the prediction processor of encoder 100.

[00215] The prediction processor generates a prediction image using a first method (Step Sc_1a), generates a prediction image using a second method (Step Sc_1b), and generates a prediction image using a third method (Step Sc_1c). The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each Petition 870250005547, dated 01 / 23 / 2025, page 46 / 364 36 / 136 One of the first to third methods can be an inter-prediction method, an intra-prediction method, or another prediction method. The reconstructed image described above can be used in these prediction methods.

[00216] Next, the prediction processor selects any one of a plurality of prediction methods generated in Steps Sc_1a, Sc_1b, and Sc_1c (Step Sc_2). The selection of the prediction image, that is, the selection of a method or mode to obtain a final prediction image, can be done by calculating a cost for each of the generated prediction images and based on the cost. Alternatively, the selection of the prediction image can be done based on a parameter that is used in an encoding process. Encoder 100 can transform information to identify a selected prediction image, method, or mode into an encoded signal (also referred to as an encoded bitstream). The information can be, for example, a flag or similar. In this way, the decoder is able to generate a prediction image according to the method or mode selected based on the information in decoder 100. It should be noted that, in the example illustrated in FIG.12. The prediction processor selects any of the prediction images after the prediction images have been generated using the respective methods. However, the prediction processor can select a method or mode based on a parameter for use in the encoding process described above before the generation of prediction images, and can generate a prediction image according to the selected method or mode.

[00217] For example, the first method and the second method can be intra-prediction and inter-prediction, respectively, and the prediction processor can select a final prediction image for a current block of prediction images generated according to the Petition 870250005547, dated 01 / 23 / 2025, page 47 / 364 37 / 136 all predictions.

[00218] FIG. 13 is a diagram illustrating another example of a process performed by the prediction processor of encoder 100.

[00219] First, the prediction processor generates a prediction image using intra prediction (Step Sd_1a), and generates a prediction image using inter prediction (Step Sd_1b). It should be noted that the prediction image generated through intra prediction is also referred to as an intra prediction image, and the prediction image generated by inter prediction is also referred to as an inter prediction image.

[00220] Next, the prediction processor evaluates each of the intra-prediction images and the inter-prediction images (Step Sd_2). A cost can be used in the evaluation. In other words, the prediction processor calculates the cost C for each of the intra-prediction images and the inter-prediction images. The cost C is calculated according to an expression from an RD optimization model, for example, C = D + λ x R. In this expression, D indicates a coding distortion of a prediction image, and is represented as, for example, a sum of absolute differences between the pixel value of a current block and the pixel value of a prediction image. Furthermore, R indicates a predicted coding amount of a prediction image, specifically, the amount of coding required to encode motion information for the generation of a prediction image, etc. λ indicates, for example, a multiplier according to the Lagrange multiplier method.

[00221] The prediction processor then selects the prediction image for which the lowest C cost was calculated from among the intra-prediction image and the inter-prediction image, as the final prediction image for the current block (Step Sd_3). In other words, the Petition 870250005547, dated 01 / 23 / 2025, page 48 / 364 38 / 136 prediction method or the mode for generating the prediction image for the current block is selected. Intrapredictor

[00222] The intra predictor 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as intra-frame prediction) of the current block by referencing a block or blocks in the current image and stored in block memory 118. More specifically, the intra predictor 124 generates an intra prediction signal by performing intra prediction by referencing samples (e.g., luma and / or chroma values) of a block or blocks neighboring the current block, and then sends the intra prediction signal to the prediction controller 128.

[00223] For example, the intra predictor 124 performs intra prediction using one mode from among a plurality of predefined intra prediction modes. The intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes.

[00224] One or more non-directional prediction modes include, for example, planar prediction mode and DC prediction mode defined in the H.265 / High Efficiency Video Coding (HEVC) standard.

[00225] The plurality of directional prediction modes includes, for example, the thirty-three directional prediction modes defined in the H.265 / HEVC standard. It should be noted that the plurality of directional prediction modes may also include thirty-two directional prediction modes in addition to the thirty-three directional prediction modes (for a total of sixty-five directional prediction modes). FIG. 14 is a diagram illustrating sixty-seven intra-prediction modes in total used in intra-prediction (two non-directional prediction modes and sixty-five directional prediction modes). Petition 870250005547, dated 01 / 23 / 2025, page 49 / 364 39 / 136 onais). The solid arrows represent the thirty-three directions defined in the H.265 / HEVC standard, and the dashed arrows represent the thirty-two additional directions (the two non-directional prediction modes are not illustrated in FIG. 14).

[00226] In several types of assembly examples, a luma block can be referred to in intra-prediction of a chroma block. In other words, a chroma component of the current block can be predicted based on a luma component of the current block. Such intra-prediction is also referred to as a cross-component linear model (CCLM) prediction. The intra-prediction mode for a chroma block in which such a luma block is referred to (also referred to as, for example, a CCLM mode) can be added as one of the intra-prediction modes for chroma blocks.

[00227] The intra 124 predictor can correct intrapredicted pixel values ​​based on horizontal / vertical reference pixel gradients. Intra prediction accompanied by this type of correction is also referred to as position-dependent intra prediction combination (PDPC). Information indicating whether to apply PDPC (referred to as, for example, a PDPC signal) is normally signaled at the CU level. It should be noted that signaling of such information does not necessarily need to be performed at the CU level, and can be performed at another level (e.g., sequence level, image level, slice level, fragment level, or CTU level). Inter predictor

[00228] The inter-frame predictor 126 generates a prediction signal (inter-prediction signal) by performing inter-prediction (also referred to as inter-frame prediction) of the current block by referencing a block or blocks in a reference image, which is different from the current image and is stored in frame memory 122. Prediction Petition 870250005547, dated 01 / 23 / 2025, page 50 / 364 40 / 136 inter is performed in units of a current block or a current sub-block (e.g., a 4x4 block) within the current block. For example, the inter 126 predictor performs motion estimation on a reference image for the current block or sub-block, and finds a reference block or sub-block that best matches the current block or sub-block. The inter 126 predictor then obtains motion information (e.g., a motion vector) that compensates for a motion or change from the reference block or sub-block to the current block or sub-block. The inter 126 predictor generates an inter prediction signal of the current block or sub-block by performing motion compensation (or motion prediction) based on the motion information. The inter 126 predictor sends the generated inter prediction signal to the 128 prediction controller.

[00229] Motion information used in motion compensation can be signaled as inter-prediction signals in various forms. For example, a motion vector can be signaled. As another example, the difference between a motion vector and a motion vector predictor can be signaled. Basic Prediction Flow

[00230] FIG. 15 is a flowchart illustrating a basic inter-prediction processing flow.

[00231] First, the inter predictor 126 generates a prediction signal (Steps Se_1 to Se_3). Then, the subtractor 104 generates the difference between a current block and a prediction image as a prediction residue (Step Se_4).

[00232] Here, in the generation of the prediction image, the inter 126 predictor generates the prediction image by determining a motion vector (MV) of the current block (Steps Se_1 and Se_2) and motion compensation (Step Se_3). Furthermore, in determining an MV, the inter 126 predictor determines the MV by selecting a candidate. Petition 870250005547, dated 01 / 23 / 2025, page 51 / 364 41 / 136 motion vector (MV candidate) (Step Se_1) and derivation of an MV (Step Se_2). The selection of the MV candidate is done by, for example, selecting at least one MV candidate from a list of MV candidates. Alternatively, in derivation of an MV, the inter 126 predictor can still select at least one MV candidate from the at least one MV candidate, and determine the selected at least one MV candidate as the MV for the current block. Alternatively, the inter 126 predictor can determine the MV for the current block by performing estimation on a reference image region specified by each of the selected at least one MV candidate. It should be noted that estimation on a reference image region can be referred to as motion estimation.

[00233] Furthermore, although Steps Se_1 to Se_3 are performed by the inter 126 predictor in the example described above, a process that is, for example, Step Se_1, Step Se_2 or similar may be performed by another constituent element included in the 100 encoder. Flow Derivation of the Motion Vector

[00234] FIG. 16 is a flowchart illustrating an example of deriving motion vectors.

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

[00236] Alternatively, the inter 126 predictor derives a MV in a mode where motion information is not encoded. In this case, no motion information is included in an encoded signal.

[00237] Here, the MV derivation modes include an inter mode Petition 870250005547, dated 01 / 23 / 2025, page 52 / 364 42 / 136 normal, a fusion mode, a FRUC mode, an affine mode, etc., which are described later. The modes in which motion information is encoded among the modes include the internormal mode, the fusion mode, the affine mode (specifically, an interaffine mode and an affine fusion mode), etc. It should be noted that motion information may include not only a MV, but also motion vector predictor selection information, which is described later. The inter126 predictor selects a mode for deriving a MV from the current block of modes, and derives the MV from the current block using the selected mode.

[00238] FIG. 17 is a flowchart illustrating another example of deriving motion vectors.

[00239] The inter 126 predictor derives a MV from a current block in a mode where an MV difference is encoded. In this case, for example, the MV difference is encoded as a prediction parameter, and is signaled. In other words, the encoded MV difference is included in an encoded signal. The MV difference is the difference between the MV of the current block and the MV predictor.

[00240] Alternatively, the inter 126 predictor derives an MV in a mode where no MV difference is encoded. In this case, no encoded MV difference is included in an encoded signal.

[00241] Here, as described above, the MV derivation modes include the internormal mode, the fusion mode, the FRUC mode, the affine mode, etc., which are described later. Modes in which an MV difference is encoded between modes include the internormal mode, the affine mode (specifically, the interaffine mode), etc. Modes in which no MV difference is encoded include the FRUC mode, the fusion mode, the affine mode (specifically, the affine fusion mode), etc. The inter 126 predictor selects a mode to derive. Petition 870250005547, dated 01 / 23 / 2025, page 53 / 364 43 / 136 tion of a MV from the current block of mode plurality, and derives the MV from the current block using the selected mode. Vector Flow Derivation

[00242] FIG. 18 is a flowchart illustrating another example of motion vector derivation. The MV derivation modes that are inter-prediction modes include a plurality of modes and are roughly divided into modes where an MV difference is encoded and modes where no motion vector difference is encoded. The modes where no MV difference is encoded include the fusion mode, the FRUC mode, the affine mode (specifically, the affine fusion mode), etc. These modes are described in detail later. Simply, the fusion mode is a mode for deriving an MV from a current block by selecting a motion vector from a surrounding encoded block, and the FRUC mode is a mode for deriving an MV from a current block by performing estimation between encoded regions.The affine mode is a mode for derivation, like a motion vector of a current block, of a motion vector of each of a plurality of subblocks included in the current block, assuming an affine transformation.

[00243] More specifically, when the inter prediction mode information indicates 0 (0 in Sf_1), the inter 126 predictor derives a motion vector using the fusion mode (Sf_2). When the prediction mode information indicates 1 (1 in Sf_1), the inter 126 predictor derives a motion vector using the FRUC mode (Sf_3). When the inter prediction mode information indicates 2 (2 in Sf_1), the inter 126 predictor derives a motion vector using the affine mode (specifically, the affine fusion mode) (Sf_4). When the prediction mode information indicates 3 (3 in Sf_1), the inter 126 predictor derives a motion vector using a mode in which a MV difference is encoded (e.g., an inter normal mode (Sf_5). Petition 870250005547, dated 01 / 23 / 2025, page 54 / 364 44 / 136 MV Derivation > Inter Normal Mode

[00244] Internormal mode is an inter-prediction mode for deriving a MV from a current block by defining a block similar to the current block image from a reference image region specified by a candidate MV. In this internormal mode, a MV difference is encoded.

[00245] FIG. 19 is a flowchart illustrating an example of inter-normal prediction in inter-normal mode.

[00246] First, the inter 126 predictor obtains a plurality of MV candidates for a current block based on information such as MVs from a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sg_1). In other words, the inter 126 predictor generates a list of MV candidates.

[00247] Next, the inter 126 predictor extracts N candidates for MV (an integer of 2 or greater) from the plurality of MV candidates obtained in Step Sg_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a predetermined priority order (Step Sg_2). It should be noted that the priority order is predetermined for each of the N candidates for MV.

[00248] Next, the inter 126 predictor selects a motion vector predictor candidate from the N motion vector predictor candidates as the motion vector predictor (also referred to as a MV predictor) of the current block (Step Sg_3). At this point, the inter 126 predictor encodes, in a stream, motion vector predictor selection information to identify the selected motion vector predictor. It should be noted that the stream is an encoded signal or a bit-encoded stream as described above.

[00249] Next, the inter 126 predictor derives a MV from a block. Petition 870250005547, dated 01 / 23 / 2025, page 55 / 364 45 / 136 current through reference to an encoded reference image (Step Sg_4). At this point, the inter 126 predictor further encodes, in the stream, the difference value between the derived MV and the motion vector predictor as a MV difference. It should be noted that the encoded reference image is an image including a plurality of blocks that were reconstructed after being encoded.

[00250] Finally, the inter 126 predictor generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference image (Step Sg_5). It should be noted that the prediction image is an inter prediction signal as described above.

[00251] Furthermore, information indicating the inter prediction mode (normal inter mode in the example above) used to generate the prediction image is, for example, encoded as a prediction parameter.

[00252] It should be noted that the MV candidate list can also be used as a list for use in another mode. Furthermore, processes related to the MV candidate list can be applied to processes related to the list for use in another mode. Processes related to the MV candidate list include, for example, extracting or selecting an MV candidate from the MV candidate list, reordering the MV candidates, or deleting an MV candidate. MV Derivation > Fusion Mode

[00253] The merge mode is an inter-prediction mode for selecting a MV candidate from a list of MV candidates as an MV of a current block, thereby deriving the MV.

[00254] FIG. 20 is a flowchart illustrating an example of inter-prediction in fusion mode.

[00255] First, the inter 126 predictor obtains a plurality of MV candidates for a current block based on such information Petition 870250005547, dated 01 / 23 / 2025, page 56 / 364 46 / 136 as MVs of a plurality of encoded blocks temporarily or spatially surrounding the current block (Step Sh_1). In other words, the inter 126 predictor generates a list of MV candidates.

[00256] Next, the inter 126 predictor selects a MV candidate from the plurality of MV candidates obtained in Step Sh_1, thus deriving an MV from the current block (Step Sh_2). At this point, the inter 126 predictor encodes MV selection information into a stream to identify the selected MV candidate.

[00257] Finally, the inter 126 predictor generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference image (Step Sh_3).

[00258] Furthermore, information indicating the inter prediction mode (fusion mode in the example above) used to generate the prediction image and included in the encoded signal is, for example, encoded as a prediction parameter.

[00259] FIG. 21 is a diagram illustrating an example of a motion vector derivation process from a current image in fusion mode.

[00260] First, a list of MV candidates is generated in which MV predictor candidates are registered. Examples of MV predictor candidates include: spatially neighboring MV predictors which are MVs of a plurality of spatially located encoded blocks surrounding a current block; temporarily neighboring MV predictors which are MVs of surrounding blocks onto which the position of a current block in an encoded reference image is projected; combined MV predictors which are MVs generated by combining the MV value of a spatially neighboring MV predictor and the MV of a temporarily neighboring MV predictor; and a zero MV predictor which is an MV having a value of zero. Petition 870250005547, dated 01 / 23 / 2025, page 57 / 364 47 / 136

[00261] Next, an MV predictor is selected from a plurality of MV predictors registered in an MV predictor list, and the selected MV predictor is determined as the MV of the current block.

[00262] Furthermore, the variable-length encoder describes and encodes, in a stream, merge_idx which is a signal indicating that the MV predictor has been selected.

[00263] It should be noted that the MV predictors listed in the MV predictor list described in FIG. 21 are examples. The number of MV predictors may differ from the number of MV predictors in the diagram, the MV predictor list may be configured in such a way that some of the types of MV predictors in the diagram may not be included, or that one or more MV predictors different from other types of MV predictors in the diagram are included.

[00264] A final MV can be determined by performing a dynamic motion vector update (DMVR) process to be described later using the MV of the current block derived in fusion mode.

[00265] It should be noted that the MV predictor candidates are the MV candidates described above, and the MV predictor list is the list of MV candidates described above. It should be noted that the list of MV candidates may be referred to as a list of candidates. Also, merge_idx is the MV selection information. Derivation of MV > FRUC Model

[00266] Motion information can be derived on the decoder side without being signaled from the encoder side. It should be noted that, as described above, the fusion mode defined in the H.265 / HEVC standard can be used. Also, for example, motion information can be derived by performing motion estimation on the decoder side. At that point, on the decoder side... Petition 870250005547, dated 01 / 23 / 2025, page 58 / 364 48 / 136 encoder, motion estimation is performed without using any pixel values ​​in a current block.

[00267] Here, a mode for performing motion estimation on the decoder side is described. The mode for performing motion estimation on the decoder side may be referred to as a pattern-compliant motion vector derivation (PMMVD) mode or a frame evaluation conversion (FRUC) mode.

[00268] An example of a FRUC process is illustrated in FIG. 22. First, a list of a plurality of candidates, each having a motion vector (MV) predictor (i.e., a list of MV candidates can also be used as a merge list), is generated by referencing a motion vector in an encoded block that is spatially or temporally adjacent to a current block (Step Si_1). Then, a best MV candidate is selected from the plurality of MV candidates listed in the MV candidate list (Step Si_2). For example, the evaluation values ​​of the respective MV candidates in the MV candidate list are calculated, and an MV candidate is selected based on the evaluation values. Based on the selected motion vector candidates, a motion vector for the current block is then derived (Step Si_4).More specifically, for example, the selected motion vector candidate (best MV candidate) is directly derived as the motion vector for the current block. Alternatively, for example, the motion vector for the current block can be derived using pattern matching in a surrounding region of a position in a reference image where the position in the reference image corresponds to the selected motion vector candidate. In other words, estimation using pattern matching and evaluation values ​​can be performed in the surrounding region. Petition 870250005547, dated 01 / 23 / 2025, page 59 / 364 49 / 136 secondary to the best candidate MV, and when there is an MV that provides a better valuation, the best candidate MV can be updated to the MV that provides the best valuation, and the updated MV can be determined as the final MV for the current block. A configuration in which no such process for updating the best candidate MV to the MV having a better valuation is performed is also possible.

[00269] Finally, the inter 126 predictor generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference image (Step Si_5).

[00270] A similar process can be performed on units of a sub-block.

[00271] Evaluation values ​​can be calculated using various methods. For example, a comparison is made between an image reconstructed in a region within a reference image corresponding to a motion vector and an image reconstructed in a given region (the region could be, for example, a region in another reference image or a region in a neighboring block of a current image, as indicated below). The difference between the pixel values ​​of the two reconstructed images can be used for an evaluation value of the motion vectors. It should be noted that an evaluation value can be calculated using information other than the difference value.

[00272] Next, pattern matching is described in detail. First, a candidate MV included in a list of MV candidates (e.g., a merger list) is selected as a starting point for estimation by pattern matching. As pattern matching, either a first pattern match or a second pattern match is used. The pri Petition 870250005547, dated 01 / 23 / 2025, page 60 / 364 50 / 136 first pattern matching and second pattern matching are also referred to as bilateral matching and model matching, respectively. Derivation of MV > FRUC > Bilateral Correspondence

[00273] In the first pattern matching, pattern matching is performed between two blocks along a movement path of a current block that are two blocks in two different reference images. Therefore, in the first pattern matching, a region in another reference image along the movement path of the current block is used as a determined region for calculating the candidate evaluation value described above.

[00274] FIG. 23 is a diagram illustrating an example of the first pattern matching (bilateral matching) between the two blocks in the two reference images along the motion path. As illustrated in FIG. 23, in the first pattern matching, two motion vectors (MV0, MV1) are derived by estimating a best-matching pair among the pairs in the two blocks in the two different reference images (Ref0, Ref1) that are the two blocks along the motion path of the current block (Bloco atu).More specifically, a difference between the reconstructed image at a specified location in the first encoded reference image (Ref0) specified by a MV candidate and the reconstructed image at a specified location in the second encoded reference image (Ref1) specified by a symmetrical MV obtained by measuring the MV candidate over a displayed time interval is derived for the current block, and an evaluation value is calculated using the obtained difference value. It is best to select, as the final MV, the MV candidate that provides the best evaluation value among the plurality of MV candidates. Petition 870250005547, dated 01 / 23 / 2025, page 61 / 364 51 / 136

[00275] Assuming a continuous motion trajectory, the motion vectors (MV0, MV1) specifying the two reference blocks are proportional to the temporal distances (TD0, TD1) between the current image (Imag Atu) and the two reference images (Ref0, Ref1). For example, when the current image is temporally located between the two reference images and the temporal distances from the current image to the respective two reference images are equal to each other, mirror-symmetric bidirectional motion vectors are derived in the first pattern matching. Derivation of MV > FRUC > Model Matching

[00276] In the second pattern matching (model matching), pattern matching is performed between a block in a reference image and a model in the current image (the model is a block that is adjacent to a current block in the current image (the neighboring block is, for example, a top and / or left neighboring block(s))). Therefore, in the second pattern matching, the block adjacent to the current block in the current image is used as the determined region for calculating the candidate evaluation value described above.

[00277] Fig. 24 is a diagram illustrating an example of pattern matching (model matching) between a model in a current image and a block in a reference image. As illustrated in FIG. 24, in the second pattern matching, the motion vector of the current block (Block Atu) is derived by estimating, in the reference image (Ref0), the block that best matches the block neighboring the current block in the current image (Imag Atu). More specifically, it is excellent that the difference between an image reconstructed in a coded region that is neighboring both to the left and above or left or above and an image reconstructed that is in a matching region in the coded reference image (Ref0) and is specified by a candidate MV if Petition 870250005547, dated 01 / 23 / 2025, page 62 / 364 52 / 136 already derived, an appraisal value is calculated using the value of the difference obtained, and the MV candidate that provides the best appraisal value among a plurality of MV candidates is selected as the best MV candidate.

[00278] Information indicating whether the FRUC model applies (referred to as, for example, a FRUC flag) can be signaled at the CU level. Furthermore, when the FRUC mode is applied (for example, when a FRUC signal is true), information indicating an applicable pattern matching method (either the first pattern match or the second pattern match) can be signaled at the CU level. It should be noted that signaling of such information does not necessarily need to be done at the CU level, and can be done at another level (for example, sequence level, image level, slice level, fragment level, CTU level, or sub-block level). Derivation of MV > Affine Mode

[00279] Next, the affine mode for deriving a motion vector in units of a sub-block based on motion vectors of a plurality of neighboring blocks is described. This mode is also referred to as an affine motion compensation prediction mode.

[00280] FIG. 25A is a diagram illustrating an example of deriving a motion vector for each sub-block based on motion vectors from a plurality of neighboring blocks. In FIG. 25A, the current block includes sixteen 4x4 sub-blocks. Here, the principal vector V0 at an upper-left corner control point in the current block is derived based on a motion vector from a neighboring block, and similarly, the motion vector Vi at an upper-right corner control point in the current block is derived based on a motion vector from a neighboring sub-block. Two Petition 870250005547, dated 01 / 23 / 2025, page 63 / 364 53 / 136 motion vectors Vo and Vi are projected according to an expression (1A) indicated below, and motion vectors (Vx, Vy) for the respective sub-blocks in the current block are derived. Mat. 1 <vls- vOs) (ví - v0) ------x —— y+ ww (yiy-v0) (v^-VoJ —--- χ —-------y+v0V w w (IA)

[00281] Here, xey indicate the horizontal and vertical positions of the sub-block, respectively, and ew indicates a predetermined weighting coefficient.

[00282] Such information indicating the affine mode (e.g., referred to as affine signaling) can be signaled at the CU level. It should be noted that signaling of information indicating the affine mode does not necessarily need to be performed at the CU level, and can be performed at another level (e.g., sequence level, image level, slice level, fragment level, CU level, or sub-block level).

[00283] Furthermore, the affine mode can include several modes for different methods for deriving motion vectors at the upper left and upper right field control points. For example, the affine mode includes two modes which are the inter affine mode (also referred to as an inter normal affine mode) and the union affine mode. Derivation of MV > Affine Mode

[00284] FIG. 25B is a diagram illustrating an example of a derivative of a motion vector for each subblock in affine mode where three control points are used. In FIG. 25B, the current block includes sixteen 4x4 blocks. Here, the motion vector Vo at the upper left corner control point for the current block is derived based on a motion vector of a Petition 870250005547, dated 01 / 23 / 2025, page 64 / 364 54 / 136 neighboring block and, in the same way, the motion vector Vi at the upper right corner control point for the current block is derived based on a motion vector of a neighboring block, and a motion vector V2 at the lower left corner control point for the current block is derived based on a motion vector of a neighboring block. Three motion vectors Vo, V1 and V2 are projected according to an expression (1B) shown below, and motion vectors (Vx, Vy) for the respective sub-blocks in the current block are derived. Mat. 2=wr_ (Vly-Vpy) yw C1B)

[00285] Here, x and y indicate the horizontal and vertical positions of the sub-block center, respectively, w indicates the width of the current block, and eh indicates the height of the current block.

[00286] Affine modes in which different numbers of control points (e.g., two and three control points) are used can be changed and signaled at the CU level. Note that information indicating the number of control points in affine mode used at the CU level can be signaled at another level (e.g., sequence level, image level, slice level, fragment level, CTU level, or sub-block level).

[00287] Furthermore, such an affine mode in which three control points are used may include different methods for deriving motion vectors at the upper left, upper right, and lower left corner control points. For example, affine modes include two modes which are the inter affine mode (also referred to as the inter normal affine mode) and the affine fusion mode. Petition 870250005547, dated 01 / 23 / 2025, page 65 / 364 55 / 136 Derivation of MV < Affine Fusion Model

[00288] FIGS. 26A, 26B and 26C are conceptual diagrams illustrating the affine fusion mode.

[00289] As illustrated in FIG. 26A, in affine fusion mode, for example, motion vector predictors at respective control points of a current block are calculated based on a plurality of motion vectors corresponding to blocks coded according to the affine mode among block A (left), block B (top), block C (top right), block D (bottom left), and block E (top left) that are neighbors of the current block. More specifically, the coded blocks A (left), B (top), C (top right), D (bottom left), and E (top left) are checked in the listed order, and the first effective block coded according to the affine mode is identified.

[00290] For example, as illustrated in FIG. 26B, when block A, which is the left neighbor of the current block, has been encoded according to an affine mode in which two control points are used, the motion vectors V3 and V4 projected onto the upper-left corner position and the upper-right corner position of the encoded block including block A are derived. The motion vector predictor V0 at the upper-left corner control point of the current block and the motion vector predictor Vi at the upper-right corner control point of the current block are then calculated from the derived motion vectors V3 and V4.

[00291] For example, as illustrated in FIG. 26C, when block A, which is adjacent to the left of the current block, has been encoded according to an affine mode in which three control points are used, the motion vectors V3, V4, and V5 projected onto the upper left corner position, the upper right corner position, and the lower left corner position of the encoded block including block A are derived Petition 870250005547, dated 01 / 23 / 2025, page 66 / 364 56 / 136 of the. The motion vector predictor V0 at the upper left corner control point of the current block, the motion vector predictor Vi at the upper right corner control point of the current block, and the motion vector predictor V2 at the lower left corner control point of the current block are then calculated from the derived motion vectors V3, V4, and V5.

[00292] It should be noted that this method for deriving motion vector predictors can be used to derive motion vector predictors from the respective control points of the current block in Step Sj_1 in FIG. 29 described later.

[00293] FIG. 27 is a flowchart illustrating an example of affine fusion mode.

[00294] In affine fusion mode, first, the inter 126 predictor derives MV predictors from respective control points of a current block (Step Sk_1). The control points are a point in the upper left corner of the current block and a point in the upper right corner of the current block as illustrated in FIG. 25A, or a point in the upper left corner of the current block, a point in the upper right corner of the current block and a point in the lower left corner of the current block as illustrated in FIG. 25B.

[00295] In other words, as illustrated in FIG. 26A, the inter 126 predictor checks the encoded block A (left), block B (top), block C (top right), block D (bottom left) and block E (top left) in the listed order, and identifies the first effective encoded block according to the affine mode.

[00296] When block A is identified and block A has two control points, as illustrated in FIG. 26B, the inter 126 predictor calculates the motion vector v0 at the control point in the upper left corner of the current block and the motion vector vi at the control point in the upper right corner of the current block from the motion vectors. Petition 870250005547, dated 01 / 23 / 2025, page 67 / 364 57 / 136 motion vectors V3 and V4 in the upper left and upper right corners of the encoded block, including block A. For example, the predictor inter 126 calculates the motion vector vo at the control point in the upper left corner of the current block and the motion vector vi at the control point in the upper right corner of the current block by projecting motion vectors v3 and v4 from the upper left and upper right corners of the encoded block onto the current block.

[00297] Alternatively, when block A is identified and block A has three control points, as illustrated in FIG. 26C, the inter 126 predictor calculates the motion vector v0 at the control point in the upper left corner of the current block, the motion vector vi at the control point in the upper right corner of the current block, and the motion vector v2 at the control point in the lower left corner of the current block from the vectors v3, v4, and v5 in the upper left, upper right, and lower left corners of the encoded block including block A.For example, the inter 126 predictor calculates the motion vector v0 at the control point in the upper left corner of the current block, the motion vector vi at the control point in the upper right corner of the current block, and the motion vector v2 at the control point in the lower left corner of the current block by projecting motion vectors v3, v4, and v5 from the upper left, upper right, and lower left corners of the encoded block onto the current block.

[00298] Next, the inter 126 predictor performs motion compensation for each of the plurality of sub-blocks included in the current block. In other words, the inter 126 predictor calculates, for each of the plurality of sub-blocks, a motion vector of the sub-blocks of the sub-block as an affine MV, using either (i) two motion vector predictors vo and vi and expression (1A) described above or (ii) three motion vector predictors v0, vi and v2 and expression (1B) Petition 870250005547, dated 01 / 23 / 2025, page 68 / 364 58 / 136 described above (Step Sk_2). The inter 126 predictor then performs motion compensation of the sub-blocks using these affine MVs and encoded reference images (Step Sk_3). As a result, motion compensation of the current block is performed to generate a prediction image of the current block. Derivation of MV > Affine Interchange Mode

[00299] FIG. 28A is a diagram illustrating an affine intermode in which two control points are used.

[00300] In affine inter-block mode, as illustrated in FIG. 28A, a motion vector selected from the encoded motion vectors of block A, block B, and block C that are neighbors of the current block is used as a motion vector predictor v0 at the control point in the upper left corner of the current block. Similarly, a motion vector selected from the encoded motion vectors of block D and block E that are neighbors of the current block is used as a motion vector predictor vi at the control point in the upper right corner of the current block.

[00301] FIG. 28B is a diagram illustrating an affine intermode in which three control points are used.

[00302] In affine interlock mode, as illustrated in FIG. 28B, a motion vector selected from the encoded motion vectors of block A, block B, and block C that are neighbors of the current block is used as the motion vector predictor vo at the control point in the upper-left corner of the current block. Similarly, a motion vector selected from the encoded motion vectors of block D and block E that are neighbors of the current block is used as the motion vector predictor vi at the control point in the upper-right corner of the current block. Furthermore, a motion vector selected from the encoded motion vectors of block F and block G that are neighbors of the current block is used as the motion vector predictor v2 at the point Petition 870250005547, dated 01 / 23 / 2025, page 69 / 364 59 / 136 control in the lower left corner of the current block.

[00303] FIG. 29 is a flowchart illustrating an example of an affine intermode.

[00304] In affine inter mode, first, the inter 126 predictor derives MV (vo, vi) or (vo, vi, V2) predictors from respective two or three control points of a current block (Step Sj_1). The control points are a point in the upper left corner of the current block and a point in the upper right corner of the current block as illustrated in FIG. 25A or a point in the upper left corner of the current block, a point in the upper right corner of the current block and a point in the upper left corner of the current block as illustrated in FIG. 25B.

[00305] In other words, the inter 126 predictor derives the motion vector predictors (vo, vi) or (vo, vi, V2) from the respective two or three control points of the current block by selecting motion vectors from any of the blocks among the blocks encoded in the vicinity of the respective control points of the current block illustrated in FIG. 28A or FIG. 28B. At this point, the inter 126 predictor encodes, in a stream, motion vector predictor selection information to identify the two selected motion vectors.

[00306] For example, the inter 126 predictor can determine, using a cost evaluation or similar, the block from which a motion vector as a motion vector predictor at a control point is selected from among the encoded blocks that are neighbors of the current block, and can describe, in a bitstream, a signal indicating which motion vector predictor was selected.

[00307] Next, the inter 126 predictor performs motion estimation (Steps Sj_3 and Sj_4) while updating a motion vector predictor selected or derived in Step Sj_1 (Step Sj_2). In other words, the inter 126 predictor calculates, as an affine MV, a motion vector for each of the sub-blocks that corresponds to a Petition 870250005547, dated 01 / 23 / 2025, page 70 / 364 60 / 136 updated motion vector predictor, using either expression (1a) or expression (1B) described above (Step Sj_3). The inter 126 predictor then performs motion compensation of the sub-blocks using these affine MVs and the encoded reference images (Step Sj_4). As a result, for example, the inter 126 predictor determines the motion vector predictor that yields the lowest cost as the motion vector at a control point in a motion estimation loop (Step Sj_5). At this point, the inter 126 predictor further encodes, in the stream, the difference value between the determined MV and the motion vector predictor as a MV difference.

[00308] Finally, the inter 126 predictor generates a prediction image for the current block by performing motion compensation of the current block using the determined MV and the encoded reference image (Step Sj_6). Derivation of MV > Affine Interchange Mode

[00309] When affine modes in which different numbers of control points (e.g., two and three control points) are used can be changed and signaled at the CU level, the number of control points in a coded block and the number of control points in an actual block may differ from each other. FIG. 30A and FIG. 30B are conceptual diagrams illustrating methods for deriving motion vector predictors at control points when the number of control points in a coded block and the number of control points in an actual block differ from each other.

[00310] For example, as illustrated in FIG. 30A, when a current block has three control points at the upper left corner, the upper right corner, and the lower left corner, and block A, which is adjacent to the left of the current block, has been coded according to an affine mode in which two control points are used, the motion vectors Petition 870250005547, dated 01 / 23 / 2025, page 71 / 364 61 / 136 V3 and V4, projected at the position in the upper left corner and the position in the upper right corner of the coded block including block A, are derived. The motion vector predictor vo at the control point in the upper left corner of the current block and the motion vector predictor vi at the control point in the upper right corner of the current block are then calculated from the derived motion vectors v3 and v4. Furthermore, the motion vector predictor V2 at the control point in the lower left corner is calculated from the derived motion vectors vo and vi.

[00311] For example, as illustrated in FIG. 30B, when a current block has two control points at the upper left and upper right corners, and block A, which is adjacent to the left of the current block, has been coded according to the affine mode in which three control points are used, the motion vectors V3, V4, and V5 projected onto the upper left position, the upper right position, and the lower left position on the coded block including block A are derived. The motion vector predictor vo at the control point in the upper left corner of the current block and the motion vector predictor vi at the control point in the upper right corner of the current block are then calculated from the derived motion vectors V3, V4, and V5.

[00312] It should be noted that this method for deriving motion vector predictors can be used to derive motion vector predictors from the respective control points of the current block in Step Sj_1 in FIG. 29. Derivation of MV > DMVR

[00313] FIG. 31A is a diagram illustrating a relationship between fusion mode and DMVR.

[00314] The inter 126 predictor derives a motion vector from a current block according to the fusion mode (Step Sl_1). Then, Petition 870250005547, dated 01 / 23 / 2025, page 72 / 364 62 / 136 the inter 126 predictor determines whether to perform an estimate of a motion vector, that is, motion estimation (Step Sl_2). Here, when determining not to perform motion estimation (Not in Step Sl_2), the inter 126 predictor determines the motion vector derived in Step Sl_1 as the final motion vector for the current block (Step Sl_4). In other words, in this case, the motion vector of the current block is determined according to the fusion mode.

[00315] When determining to perform motion estimation in Step Sl_1 (Yes in Step Sl_2), the inter 126 predictor derives the final motion vector for the current block by estimating a surrounding region of the reference image specified by the motion vector derived in Step Sl_1 (Step Sl_3). In other words, in this case, the motion vector of the current block is determined according to the DMVR.

[00316] FIG. 31B is a conceptual diagram illustrating an example of a DMVR process for determining a MV.

[00317] First, (for example, in fusion mode), the best MVP that has been defined for the current block is determined to be a candidate MV. A reference pixel is identified from a first reference image (L0) which is an image encoded in the LO direction according to a candidate MV (LO). Similarly, a reference pixel is identified from a second reference image (L1) which is an image encoded in the L1 direction according to a candidate MV (L1). A model is generated by calculating an average of these reference pixels.

[00318] Next, each of the surrounding regions of MV candidates from the first reference image (L0) and the second reference image (L1) is stimulated, and the MV that yields the lowest cost is determined to be the final MV. It should be noted that the cost value can be calculated using a difference value between each of the Petition 870250005547, dated 01 / 23 / 2025, page 73 / 364 63 / 136 pixel values ​​in the model and a corresponding set of pixel values ​​in the estimation region, the values ​​of MV candidates, etc.

[00319] It should be noted that the processes, configurations and operations described here are basically common between the encoder and a decoder to be described later.

[00320] Exactly the same processes described here do not always have to be performed. Any process to allow derivation of the final MV through estimation in surrounding regions of MV candidates can be used. Motion Compensation > BIO / OBMC

[00321] Motion compensation involves a method for generating a prediction image and correcting the prediction image. The method is, for example, BIO and OBMC, which will be described later.

[00322] FIG. 32 is a flowchart illustrating an example of generating a predictive image.

[00323] The inter 126 predictor generates a prediction image (Step Sm_1) and corrects the prediction image according to any of the modes described above (Step Sm_2).

[00324] FIG. 33 is a flowchart illustrating another example of generating a predictive image.

[00325] The inter 126 predictor determines a motion vector of a current block (Step Sn_1). Then, the inter 126 predictor generates a prediction image (Step Sn_2) and determines whether to perform a correction process (Step Sn_3). Here, when determining whether to perform a correction process (Yes in Step Sn_3), the inter 126 predictor generates the final prediction image by correcting the prediction image (Step Sn_4). When determining not to perform a correction process (No in Step Sn_3), the inter 126 predictor outputs the prediction image as the final prediction image without correcting the prediction image (Step Sn_5). Petition 870250005547, dated 01 / 23 / 2025, page 74 / 364 64 / 136

[00326] Furthermore, motion compensation involves a mode for correcting the luminance of a prediction image when generating the prediction image. The mode is, for example, LIC, to be described later.

[00327] FIG. 34 is a flowchart illustrating yet another example of generating a predictive image.

[00328] The inter 126 predictor derives a motion vector from a current block (Step So_1). Then, the inter 126 predictor determines whether to perform a luminance correction process (Step So_2). Here, when determining whether to perform a luminance correction process (Yes in Step So_2), the inter 126 predictor generates the prediction image while performing a luminance correction process (Step So_3). In other words, the prediction image is generated using LIC. When determining not to perform a luminance correction process (No in Step So_2), the inter 126 predictor generates a prediction image by performing normal motion compensation without performing a luminance correction process (Step So_4). Motion Compensation > OBMC

[00329] It should be noted that an inter-prediction signal can be generated using motion information for a neighboring block in addition to the motion information for the current block obtained from the motion estimate. More specifically, the inter-prediction signal can be generated in units of a sub-block in the current block by performing a weighted addition of a prediction signal based on motion information obtained from the motion estimate (in the reference image) and a prediction signal based on motion information for a neighboring block (in the current image). Such inter-prediction (motion compensation) is also referred to as overlapping block motion compensation. Petition 870250005547, dated 01 / 23 / 2025, page 75 / 364 65 / 136 (OBMC).

[00330] In OBMC mode, information indicating a sub-block size for OBMC (referred to as, for example, an OBMC block size) can be signaled at the sequence level. Additionally, information indicating whether to apply OBMC mode (referred to as, for example, an OBMC signal) can be signaled at the CU level. It should be noted that signaling of such information does not necessarily need to be performed at the sequence level and the CU level, and can be performed at another level (e.g., image level, slice level, fragment level, CTU level, or sub-block level).

[00331] The OBMC mode will be described in more detail. FIGS. 35 and 36 are flowcharts and a conceptual diagram illustrating a description of a prediction image correction process performed via an OBMC process.

[00332] First, as illustrated in FIG. 36, a prediction image (Pred) is obtained through normal motion compensation using a motion vector (MV) assigned to the processing target block (current). In FIG. 36, the MV arrow points to a reference image, and indicates to which current block the current image refers in order to obtain a prediction image.

[00333] Next, a prediction image (Pred_L) is obtained by applying a motion vector (MV_L) that has already been derived for the encoded block that is left-neighboring to the current block to the current block (reusing the motion vector for the current block). The motion vector (MV_L) is indicated by an arrow MV_L pointing to a reference image from a current block. A first correction of a prediction image is performed by overlaying two prediction images Pred and Pred_L. This provides a blending effect of the boundary between neighboring blocks. Petition 870250005547, dated 01 / 23 / 2025, page 76 / 364 66 / 136

[00334] Similarly, a prediction image (Pred_U) is obtained by applying a motion vector (MV_U) that has already been derived for the encoded block that is above the current block to the current block (reusing the motion vector for the current block). The motion vector (MV_U) is indicated by an arrow MV_U pointing to a reference image from a current block. A second correction of a prediction image is performed by overlaying the prediction image Pred_U onto the prediction images (e.g., Pred and Pred_L) on which the first correction was performed. This provides a blending effect of the boundary between neighboring blocks. The prediction image obtained by the second correction is one in which the boundary between neighboring blocks has been blended (smoothed), and is therefore the final prediction image of the current block.

[00335] Although the example above is a two-way correction method using left and top neighbor blocks, it should be noted that the correction method can be a three-way or more-way correction method also using the right neighbor block and / or the bottom neighbor block.

[00336] It should be noted that the region where such overlapping is performed may be only part of a region near a block boundary rather than the pixel region of the entire block.

[00337] It should be noted that the process of correcting a prediction image according to OBMC to obtain a Pred prediction image from a reference image through overlay of additional Pred_L and Pred_U prediction images was described above. However, when a prediction image is corrected based on a plurality of reference images, a similar process can be applied to each of the plurality of reference images. In such a case, after corrected prediction images are obtained from the respective reference images through Petition 870250005547, dated 01 / 23 / 2025, page 77 / 364 67 / 136 of performing OBMC image correction based on a plurality of reference images, the corrected prediction images obtained are further superimposed to obtain the final prediction image.

[00338] It should be noted that, in OBMC, the unit of a current block can be the unit of a prediction block or the unit of a sub-block obtained through further division of the prediction block.

[00339] An example of a method for determining whether to apply an OBMC process is a method of using an obmc_flag, which is a signal indicating whether to apply an OBMC process. As a specific example, an encoder determines whether the current block belongs to a region having complicated motion. The encoder sets the obmc_flag to a value of 1 when the block belongs to a region having complicated motion and applies an OBMC process when encoding, and sets the obmc_flag to a value of 0 when the block does not belong to a region having complicated motion and encodes the block without applying an OBMC process.The decoder switches between application and non-application of an OBMC process by decoding the obmc_flag written in the stream (e.g., a compressed sequence) and decoding the block switching between application and non-application of the OBMC process according to the flag value.

[00340] The inter 126 predictor generates a rectangular prediction image for a rectangular current block in the example above. However, the inter 126 predictor can generate a plurality of prediction images, each having a different shape from a rectangle, for the rectangular current block, and can combine the plurality of prediction images to generate the final rectangular prediction image. The shape other than a rectangle could be, for example, a triangle.

[00341] FIG. 37 is a diagram to illustrate the generation of two triangular prediction images. Petition 870250005547, dated 01 / 23 / 2025, page 78 / 364 68 / 136

[00342] The inter 126 predictor generates a triangular prediction image by performing motion compensation on a first partition having a triangular shape in a current block using a first MV from the first partition, to generate a triangular prediction image. Similarly, the inter 126 predictor generates a triangular prediction image by performing motion compensation on a second partition having a triangular shape in a current block using a second MV from the second partition, to generate a triangular prediction image. The inter 126 predictor then generates a prediction image having the same triangular shape as the triangular shape of the current block by combining these prediction images.

[00343] It should be noted that although the first partition and the second partition are triangles in the example illustrated in FIG. 37, the first partition and the second partition may be trapezoidal, or other shapes different from each other. Also, although the actual block includes two partitions in the example illustrated in FIG. 37, the actual block may include three or more partitions.

[00344] Furthermore, the first partition and the second partition may overlap each other. In other words, the first partition and the second partition may include the same pixel region. In this case, a prediction image for a current block may be generated using a prediction image in the first partition and a prediction image in the second partition.

[00345] Also, although an example in which a prediction image is generated for each of the two partitions using inter-prediction, a prediction image can be generated for at least one partition using intra-prediction. Motion Compensation > BIO

[00346] Next, a method for deriving a vector of Petition 870250005547, dated 01 / 23 / 2025, page 79 / 364 69 / 136 motion is described. First, a method for deriving a motion vector based on a model assuming uniform linear motion will be described. This method is also referred to as a bidirectional optical flow (BIO) method.

[00347] FIG. 38 is a diagram illustrating a model assuming uniform linear motion. In FIG. 38, (vx, xy) indicates a velocity vector, and tO and t1 indicate time distances between a current image (Imag Atu) and two reference images (RefO, Ref1). (MVxO, MVyO) indicate motion vectors corresponding to the reference image RefO and (MVx1, MVy1) indicate motion vectors corresponding to the reference image Ref1.

[00348] Here, under the assumption of uniform linear motion exhibited by the velocity vectors (vx, vy), (MVxo, MVyo) and (MVxi, MVy-ι) are represented as (vxto, vyTo) and (-vxti, -v / γ-ι), respectively, and the optical flux equation (2) that follows is given. MAT. 3 ôjW / ât + VsâjW / dx + ^31^7 = 0.(2)

[00349] Here, l(k) indicates a motion-compensated luma value of reference image k (k = 0, 1). This optical flow equation shows that the sum of (i) the time derivative of the luma value, (ii) the product of the horizontal velocity and horizontal component of the spatial gradient of a reference image, and (iii) the product of the vertical velocity and vertical component of the spatial gradient of a reference image is equal to zero. A motion vector of each block obtained from, for example, a merge list can be corrected in pixel units, based on a combination of the optical flow equation and Hermite interpolation.

[00350] It should be noted that a motion vector can be derived on the decoder side using a different method than de Petition 870250005547, dated 01 / 23 / 2025, page 80 / 364 70 / 136 Derivation of a motion vector based on a model assuming uniform linear motion. For example, a motion vector can be derived in units of a sub-block based on the motion vectors of neighboring blocks. Motion Compensation > LIC

[00351] Next, an example of a mode in which a prediction image (prediction) is generated using a local illumination compensation (LIC) process will be described.

[00352] FIG. 39 is a diagram to illustrate an example of a predictive image generation method using a luminance correction process performed via a LIC process.

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

[00354] Next, information indicating how the luma value changed between the reference image and the current image is extracted for the current block. This extraction is performed based on the luma pixel values ​​for the encoded left neighboring reference region (surrounding reference region) and the encoded top neighboring reference region (surrounding reference region), and the luma pixel value at the corresponding position in the reference image specified by the derived MV. A luminance correction parameter is calculated using the information indicating how the luma value changed.

[00355] The prediction image for the current block is generated by performing a luminance correction process in which the luminance correction parameter is applied to the reference image in the reference image specified by the MV.

[00356] It should be noted that the shape of the surrounding reference region illustrated in FIG. 39 is only an example; the surrounding reference region may have a different shape. Petition 870250005547, dated 01 / 23 / 2025, page 81 / 364 71 / 136

[00357] Furthermore, although the process in which a prediction image is generated from a single reference image has been described here, cases in which a prediction image is generated from a plurality of reference images can be described in the same way. The prediction image can be generated after performing a luminance correction process on the reference images obtained from the reference images in the same way as described above.

[00358] An example of a method for determining whether to apply a LIC process is a method for using a lic_signal, which is a signal indicating whether to apply the LIC process. As a specific example, the encoder determines whether the current block belongs to a region having a luminance change. The encoder sets the lic_signal to a value of 1 when the block belongs to a region having a luminance change and applies a LIC process when encoding, and sets the lic_signal to a value of 0 when the block does not belong to a region having a luminance change and encodes the current block without applying a LIC process. The decoder can decode the lic_signal written in the stream and decodes the current block by switching between applying and not applying a LIC process according to the signal value.

[00359] An example of a different method of determining whether to apply a LIC process is a method of determining whether a LIC process has been applied to a surrounding block. In a specific example, when the merge mode is used on the current block, whether a LIC process has been applied to the encoding of the surrounding encoded block selected when deriving the MV in the merge mode process is determined. According to the result, encoding is performed by switching between applying and not applying a LIC process. It should be noted that, also in this example Petition 870250005547, dated 01 / 23 / 2025, page 82 / 364 72 / 136 plo, the same processes are applied in processes on the decoder side.

[00360] The luminance correction (LIC) process described with reference to FIG. 39 is described in detail below.

[00361] First, the inter 126 predictor derives a motion vector to obtain a reference image corresponding to a current block to be encoded from a reference image that is an encoded image.

[00362] Next, the inter 126 predictor extracts information indicating how the luma value of the reference image has changed to the luma value of the current image, using the luma pixel value of an encoded surrounding reference region that is adjacent to the left or above the current block and the luma value at the corresponding position in the reference image specified by a motion vector, and calculates a luminance correction parameter. For example, the luma pixel value of a given pixel in the surrounding reference region in the current image is assumed to be p0, and the luma pixel value of the pixel corresponding to the given pixel in the surrounding reference region in the reference image is assumed to be p1. The inter 126 predictor calculates the coefficients A and B for optimization A x p1 + B = p0 as the luminance correction parameter for a plurality of pixels in the surrounding reference region.

[00363] Next, the inter 126 predictor performs a luminance correction process using the luminance correction parameter for the reference image in the reference image specified by the motion vector, to generate a prediction image for the current block. For example, it is assumed that the luma pixel value in the reference image is p2, and that the luminance-corrected luma pixel value in the prediction image is p3. The inter 126 predictor generates the prediction image after undergoing the correction process. Petition 870250005547, dated 01 / 23 / 2025, page 83 / 364 73 / 136 of luminance through the calculation of A x p2 + B = p3 for each of the pixels in the reference image.

[00364] It should be noted that the shape of the surrounding reference region illustrated in FIG. 39 is an example; a different shape than the surrounding reference region shape may be used. However, part of the surrounding reference region illustrated in FIG. 39 may be used. For example, a region having a determined number of pixels extracted from each of the top neighbor pixels and one left neighbor pixel may be used as a surrounding reference region. Furthermore, the surrounding reference region is not limited to a region that is adjacent to the current block, and may be a region that is not adjacent to the current block. In the example illustrated in FIG. 39, the surrounding reference region in the reference image is a region specified by a motion vector in a current image, from a surrounding reference region in the current image. However, a region specified by another motion vector is also possible.For example, the other motion vector could be a motion vector in a surrounding reference region in the current image.

[00365] Although operations performed by decoder 100 have been described here, it should be noted that decoder 200 performs similar operations.

[00366] It should be noted that the LIC process can be applied not only to luma, but also to chroma. At this point, a correction parameter can be derived individually for each of Y, Cb, and Cr, or a common correction parameter can be used for any of Y, Cb, and Cr.

[00367] Furthermore, the LIC process can be applied to units within a sub-block. For example, a correction parameter can be derived using a surrounding reference region in a sub Petition 870250005547, dated 01 / 23 / 2025, page 84 / 364 74 / 136 current block and a surrounding reference region in a reference sub-block in a reference image specified by a MV of the current sub-block. Prediction Controller

[00368] Inter predictor 128 selects one of an intra prediction signal (an output signal from intra predictor 124) and an inter prediction signal (an output signal from inter predictor 126) and outputs the selected signal to subtractor 104 and adder 116 as a prediction signal.

[00369] As illustrated in FIG. 1, in various types of assembly examples, the prediction controller 128 can output a prediction parameter that is fed into the entropy encoder 110. The entropy encoder 110 can generate an encoded bitstream (or sequence), based on the prediction parameter fed from the prediction controller 128 and quantized coefficients fed from the quantizer 108. The prediction parameter can be used in a decoder. The decoder can receive and decode the encoded bitstream, and performs the same processes as the prediction processes performed by the intra predictor 124, inter predictor 126, and prediction controller 128.The prediction parameter may include (i) a selection prediction signal (for example, a motion vector, a prediction type, or a prediction mode used by intra predictor 124 or inter predictor 126) or (ii) an optional index, a flag, or a value that is based on a prediction process performed in each of the intra predictor 124, inter predictor 126, and prediction controller 128, or that indicates the prediction process. Example of Encoder Assembly

[00370] FIG. 40 is a block diagram illustrating an example of encoder 100 assembly. Encoder 100 includes processor a1 and memory a2. For example, the plurality of constituent elements Petition 870250005547, dated 01 / 23 / 2025, page 85 / 364 75 / 136 of the encoder 100 illustrated in FIG. 1 is mounted on processor a1 and memory a2 illustrated in FIG. 40.

[00371] Processor a1 is a circuit that performs information processing and is accessible to memory a2. For example, processor a1 is a dedicated or general electronic circuit that encodes a video. Processor a1 can be a processor such as a CPU. Furthermore, processor a1 can be an aggregate of a plurality of electronic circuits. Also, for example, processor a1 can assume the roles of two or more different constituent elements of the information storage element outside the plurality of encoder constituent elements illustrated in FIG. 1, etc.

[00372] Memory a2 is dedicated or general memory for storing information that is used by processor a1 to encode a video. Memory a2 can be an electronic circuit and can be connected to processor a1. Alternatively, memory a2 can be included within processor a1. Additionally, memory a2 can be an aggregate of a plurality of electronic circuits. Furthermore, memory a2 can be a magnetic disk, an optical disk, or similar, or it can be represented as storage, a recording medium, or similar. Furthermore, memory a2 can be non-volatile or volatile memory.

[00373] For example, memory a2 can store a video to be encoded or a bitstream corresponding to an encoded video. Furthermore, memory a2 can store a program to cause processor a1 to encode a video.

[00374] Furthermore, for example, memory a2 can assume the roles of two or more constituent elements to store information outside the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc. Specifically, memory a2 can assume the roles of block memory 118 and frame memory 122 illustrated in FIG. 1. More specifically, memory a2 can store a Petition 870250005547, dated 01 / 23 / 2025, p. 86 / 364 76 / 136 reconstructed block, a reconstructed image, etc.

[00375] It should be noted that, in decoder 100, not all of the plurality of constituent elements indicated in FIG. 1, etc., may be implemented, and not all of the processes described above may be performed. Some of the constituent elements shown in FIG. 1, etc., may be included in another device, or some of the processes described above may be performed by another device. Decoder

[00376] Next, a decoder capable of decoding an encoded signal (encoded bitstream) emitted from the decoder 100 described above will be described. FIG. 41 is a block diagram illustrating a functional configuration of the decoder 200 according to this embodiment. The decoder 200 is a video decoder that decodes a video into one-block units.

[00377] As illustrated in FIG. 41, the decoder 200 includes entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, block memory 210, loop filter 212, frame memory 214, intra predictor 216, inter predictor 218 and prediction controller 220.

[00378] The decoder 200 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in memory is executed by the processor, the processor functions as an entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220. Alternatively, the decoder 200 can be implemented as one or more dedicated electronic circuits corresponding to the entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220. Petition 870250005547, dated 01 / 23 / 2025, page 87 / 364 77 / 136

[00379] From here on, a general flow of processes performed by the decoder 200 is described, and then each of the constituent elements included in the decoder 200 will be described. General Decoding Process Flow

[00380] FIG. 42 is a flowchart illustrating an example of a general decoding process performed by decoder 200.

[00381] First, the entropy decoder 202 or decoder 200 identifies a block splitting pattern having a fixed size (128x128 pixels) (Step Sp_1). This splitting pattern is a splitting pattern selected by the encoder 100. The decoder 200 then performs the processes from Step Sp_2 to Sp_6 for each of the block plurality of the splitting pattern.

[00382] In other words, the entropy decoder 202 decodes (specifically, decodes entropy) encoded quantized coefficients and a prediction parameter of a current block to be decoded (also referred to as a current block) (Sp_2 Step).

[00383] Next, the inverse quantizer 204 performs inverse quantization of the plurality of quantized coefficients and the inverse transformer 206 performs inverse transformation of the result, to restore a plurality of prediction residues (i.e., a difference block) (Step Sp_3).

[00384] Next, the prediction processor including all or part of the intra predictor 216, inter predictor 218 and prediction controller 220 generates a prediction signal (also referred to as a prediction block) from the current block (Step Sp_4).

[00385] Next, adder 208 adds the prediction block to the difference block to generate a reconstructed image (also referred to as a decoded image block) of the current block (Step Sp_5).

[00386] When the reconstructed image is generated, the loop filter Petition 870250005547, dated 01 / 23 / 2025, page 88 / 364 78 / 136 Step 212 performs filtering of the reconstructed image (Step Sp_6).

[00387] Decoder 200 then determines if decoding of the entire image has been completed (Step Sp_7). When it determines that decoding has not yet been completed (Not at Step Sp_7), decoder 200 repeatedly executes the processes starting with Step Sp_1.

[00388] It should be noted that the processes in these Steps Sp_1 to Sp_7 can be performed sequentially by decoder 200, or two or more of the processes can be performed in parallel. The processing order of the two or more processes can be modified. Entropy Decoder

[00389] The entropy decoder 202 decodes the entropy of an encoded bit stream. More specifically, for example, the entropy decoder 202 arithmetically decodes an encoded bit stream into a binary signal. The entropy decoder 202 then de-binarizes the binary signal. Thus, the entropy decoder 202 outputs quantized coefficients of each block to the inverse quantizer 204. The entropy decoder 202 can output a prediction parameter included in an encoded bitstream (see FIG. 1) to the intra predictor 216, inter predictor 218, and predictor controller 220. The intra predictor 216, the inter predictor 218, and the prediction controller 220 are capable of performing the same prediction processes as those performed by the intra predictor 124, inter predictor 216, and prediction controller 128 on the decoder side. Inverse Quantizer

[00390] The inverse quantizer 204 inversely quantizes the quantized coefficients of a block to be decoded (hereafter referred to as a current block) that are emitted from the entropy decoder 202. More specifically, the inverse quantizer Petition 870250005547, dated 01 / 23 / 2025, page 89 / 364 79 / 136 204 inversely quantizes the quantized coefficients of the current block, based on quantization parameters corresponding to the quantized coefficients. The inverse quantizer 204 then outputs the inversely quantized transformation coefficients of the current block to the inverse transformer 206. Reversing Transformer

[00391] The inverse transformer 206 restores prediction errors by inversely transforming the transformation coefficients that are entered from the inverse quantizer 204.

[00392] For example, when information analyzed from an encoded bitstream indicates that EMT or AMT should be applied (for example, when an AMT signal is true), the inverse transformer 206 inversely transforms the transformation coefficients of the current block based on information indicating the type of transformation analyzed.

[00393] Furthermore, for example, when information analyzed from an encoded bitstream indicates that NSST should be applied, the inverting transformer 206 applies a secondary inversion transformation to the transformation coefficients. Adder

[00394] Adder 208 reconstructs the current block by adding prediction errors that are inserted from the inverse transformer 206 and prediction samples that are inserted from the prediction controller 220. Adder 208 then sends the reconstructed block to the block memory 210 and loop filter 212. Block memory

[00395] Block memory 210 is storage for storing blocks in an image to be decoded (hereinafter referred to as a current image) and referenced in intra-prediction. More specifically, block memory 210 stores reconstructed blocks. Petition 870250005547, dated 01 / 23 / 2025, page 90 / 364 80 / 136 of those sent from adder 208. Loop Filter

[00396] Loop filter 212 applies a loop filter to blocks reconstructed by adder 208, and sends the filtered reconstructed blocks to frame memory 214, display device, etc.

[00397] When information indicating ON or OFF of an ALF analyzed from an encoded bitstream indicates that an ALF is ON, a filter from a plurality of filters is selected based on the direction and activity of local gradients, and the selected filter is applied to the reconstructed block. Memory of Paintings

[00398] Frame memory 214 is, for example, storage for storing reference images for use in inter-prediction, and is also referred to as a frame buffer. More specifically, frame memory 214 stores a reconstructed block filtered by loop filter 212. Prediction Process (Intrapredictor, Interpredictor, Prediction Controller)

[00399] FIG. 43 is a diagram illustrating an example of a process performed by a prediction processor of the decoder 200. It should be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 216; inter predictor 218; and prediction controller 220.

[00400] The prediction processor generates a prediction image of a current block (Step Sq_1). This prediction image is also referred to as a prediction signal or a prediction block. It should be noted that the prediction signal is, for example, an intra-prediction signal or an inter-prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image that has already been obtained through the generation of a Petition 870250005547, dated 01 / 23 / 2025, page 91 / 364 81 / 136 prediction block, generation of a difference block, generation of a coefficient block, restoration of a difference block, and generation of a decoded image block.

[00401] The reconstructed image can be, for example, an image within a reference image, or an image of a decoded block within a current image that is the image including the current block. The decoded block in the current image is, for example, a neighboring block of the current block.

[00402] FIG. 44 is a diagram illustrating another example of a process performed by the prediction processor of decoder 200.

[00403] The prediction processor determines either a method or a mode for generating a prediction image (Step Sr_1). For example, the method or mode can be determined based on, for example, a prediction parameter, etc.

[00404] When determining a first method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the first method (Step Sr_2a). When determining a second method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the second method (Step Sr_2b). When determining a third method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the third method (Step Sr_2c).

[00405] The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first through third methods may be an inter-prediction method, an intra-prediction method, or another prediction method. The reconstructed image described above may Petition 870250005547, dated 01 / 23 / 2025, page 92 / 364 82 / 136 can be used in these prediction methods. Intrapredictor

[00406] The intra predictor 216 generates a prediction signal (intra prediction signal) by performing intra prediction by referencing a block or blocks in the current image stored in block memory 210, based on the intra prediction mode analyzed from the encoded bitstream. More specifically, the intra predictor 216 generates an intra prediction signal by performing intra prediction by referencing samples (e.g., luma and / or chroma values) of a block or blocks that are neighbors of the current block, and then sends the intra prediction signal to the prediction controller 220.

[00407] It should be noted that when an intra prediction mode in which a luma block is referenced in intra prediction of a chroma block is selected, the intra predictor 216 can predict the chroma component of the current block based on the luma component of the current block.

[00408] Furthermore, when information analyzed from an encoded bitstream indicates that PDPC should be applied, the intra 216 predictor corrects intrapredicted pixel values ​​based on horizontal / vertical reference pixel gradients. Inter predictor

[00409] The inter predictor 218 predicts the current block by reference to a reference image stored in frame memory 214. Inter prediction is performed in units of a current block or a sub-block (e.g., a 4x4 block) within the current block. For example, the inter predictor 218 generates an inter prediction signal of the current block or sub-block by performing motion compensation using motion information (e.g., a motion vector) parsed from an encoded bitstream (e.g., a prediction parameter sent from the center decoder). Petition 870250005547, dated 01 / 23 / 2025, page 93 / 364 83 / 136 sink 202), and emits the inter prediction signal to the 220 prediction controller.

[00410] It should be noted that when information analyzed from the encoded bitstream indicates that the OBMC mode should be applied, the inter 218 predictor generates the inter prediction signal using motion information from a neighboring block in addition to the motion information of the current block obtained from motion estimation.

[00411] Furthermore, when the information analyzed from the encoded bitstream indicates that the FRUC mode should be applied, the inter 218 predictor derives motion information by performing motion estimation according to the pattern matching method (bilateral matching or model matching) analyzed from the encoded bitstream. The inter 218 predictor then performs motion compensation (prediction) using the derived motion information.

[00412] Furthermore, when the BIO mode should be applied, the inter 218 predictor derives a motion vector based on a model assuming uniform linear motion. Additionally, when the information analyzed from the encoded bitstream indicates that the affine motion compensation mode should be applied, the inter 218 predictor derives a motion vector for each sub-block based on motion vectors of neighboring blocks. MV Derivation > Inter Normal Mode

[00413] When analyzed information from a bitstream indicates that the normal inter mode should be applied, the inter 218 predictor derives a motion compensation (MV) based on the analyzed information from the encoded bitstream and performs motion compensation (prediction) using the MV.

[00414] FIG. 45 is a flowchart illustrating an example of inter prediction in normal inter mode on the 200 decoder. Petition 870250005547, dated 01 / 23 / 2025, page 94 / 364 84 / 136

[00415] The inter 218 predictor of the 200 decoder performs motion compensation for each block. At this point, first, the inter 218 predictor obtains a plurality of MV candidates for a current block based on information such as MVs from a plurality of decoded blocks temporally or spatially surrounding the current block (Step Ss_1). In other words, the inter 218 predictor generates a list of MV candidates.

[00416] Next, the inter 218 predictor extracts MV candidates N (an integer of 2 or more) from the plurality of MV candidates obtained in Step Ss_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a predetermined priority order (Step Ss_2). It should be noted that the priority order is predetermined for each of the MV predictor candidates N.

[00417] Next, the inter 218 predictor decodes motion vector predictor selection information from an input stream (i.e., an encoded bit stream) and selects an MV predictor candidate from the N MV predictor candidates using the motion vector predictor selection information decoded as a motion vector (also referred to as an MV predictor) from the current block (Step Ss_3).

[00418] Next, predictor 218 decodes an MV difference from the input stream, and derives an MV for a current block by adding a difference value that is the decoded MV difference and a selected motion vector predictor (Step Ss_4).

[00419] Finally, the inter 218 predictor generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the decoded reference image (Step Ss_5). Prediction Controller Petition 870250005547, dated 01 / 23 / 2025, page 95 / 364 85 / 136

[00420] Prediction controller 220 selects either the intra prediction signal or the inter prediction signal, and sends the selected prediction signal to adder 208. As a whole, the settings, functions, and processes of prediction controller 220, intra predictor 216, and inter predictor 218 on the decoder side can correspond to the settings, functions, and processes of prediction controller 128, intra predictor 122, and intra predictor 126 on the encoder side. Example of Decoder Assembly

[00421] FIG. 46 is a block diagram illustrating an example of decoder 200 assembly. Decoder 200 includes processor b1 and memory b2. For example, the plurality of constituent elements of decoder 200 illustrated in FIG. 41 is assembled in processor b1 and memory b2 illustrated in FIG. 46.

[00422] Processor b1 is a circuit that performs information processing and is accessible to memory b2. For example, processor b1 is a dedicated or general electronic circuit that decodes a video (i.e., a coded bitstream). Processor b1 can be a processor such as a CPU. Furthermore, processor b1 can be an aggregate of a plurality of electronic circuits. Also, for example, processor b1 can assume the roles of two or more different constituent elements of a single constituent element for information storage outside the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc.

[00423] Memory b2 is dedicated or general memory for storing information that is used by processor b1 to decode an encoded bit stream. Memory b2 can be an electronic circuit and can be connected to processor b1. Alternatively, memory b2 can be included within processor b1. Furthermore, memory b2 can be an aggregate of multiple electronic circuits. Additionally, memory b2 can be a magnetic disk, an optical disk, or similar. Petition 870250005547, dated 01 / 23 / 2025, page 96 / 364 86 / 136 or it can be represented as storage, a recording medium, or similar. Furthermore, b2 memory can be either non-volatile or volatile memory.

[00424] For example, memory b2 can store a video or a bitstream. Also, memory b2 can store a program to cause processor b1 to decode an encoded bitstream.

[00425] Furthermore, for example, memory b2 can assume the roles of two or more constituent elements for storing information outside the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc. Specifically, memory b2 can assume the roles of block memory 210 and structure memory 214 illustrated in FIG. 41. More specifically, memory b2 can store a reconstructed block, a reconstructed image, etc.

[00426] It should be noted that, in decoder 200, all of the plurality of constituent elements illustrated in FIG. 41, etc., can be implemented, and not all of the processes described above can be performed. Some of the constituent elements shown in FIG. 41, etc., can be included in another device, or some of the processes described above can be performed by another device. Definitions of Terms

[00427] The respective terms can be defined as indicated below by way of example.

[00428] An image is an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2 and 4:4:4 color format. An image can be either a frame or a field.

[00429] A frame is composed of an upper field and a lower field, where sample rows 0, 2, 4, ... originate from Petition 870250005547, dated 01 / 23 / 2025, page 97 / 364 87 / 136 upper field and sample rows 1, 3, 5, ... originate from the lower field.

[00430] A slice is an integer number of encoding tree units contained within an independent slice segment and all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit.

[00431] A fragment is a rectangular region of encoding tree blocks within a particular fragment column and a particular fragment row in an image. A fragment can be a rectangular region of the frame that is intended to be able to be decoded and encoded independently, although loop filtering at the fragment edges may still be applied.

[00432] A block is an MxN (M-column by N-row) array of samples or an MxN array of transformation coefficients. A block can be a square or rectangular region of pixels including a Luma matrix and two Chroma matrices.

[00433] A coding tree unit (CTU) can be a coding tree block of luma samples from an image that has three sample arrangements or two corresponding coding tree blocks of chroma samples. Alternatively, a CTU can be a coding tree block of samples from a monochrome image and an image that is encoded using three separate color planes and syntax structures used to encode the samples.

[00434] A superblock can be a 64x64 pixel square block consisting of 1 or 2 mode info blocks or is recursively partitioned into four 32x32 blocks, which can be further partitioned. First Aspect Petition 870250005547, dated 01 / 23 / 2025, page 98 / 364 88 / 136

[00435] In the first aspect, syntax for a triangular partitioning mode (hereinafter referred to as triangular mode) and a multiple prediction mode is planned as a prediction mode for predicting a current block that is a block to be processed.

[00436] In triangular mode, a first quadrilateral partition (hereinafter also referred to as a current block) is divided into a plurality of partitions including at least one triangular partition, and motion compensation is performed for each of the partitions using a different motion vector. More specifically, for example, two quadrilateral prediction images are generated for the first quadrilateral partition. Then, weighted addition according to each region of two triangular partitions in the first partition is performed on the two quadrilateral prediction images. In this way, a prediction image corresponding to the first quadrilateral partition is generated based on two prediction images for the two triangular partitions.

[00437] In multiple prediction mode, a prediction image for the current block is generated using at least two prediction information items. More specifically, in multiple prediction mode, a plurality of prediction images is generated for the current block using at least two prediction information items obtained through a plurality of prediction methods, and a prediction image of the current block is generated by overlaying the generated plurality of prediction images. For example, in multiple prediction mode, a prediction image of the current block can be generated by overlaying an inter-prediction image of the current block with an intra-prediction image of the current block. Also, for example, in multiple prediction mode, a prediction image of the current block can be generated by overlaying prediction images predicted in a plurality of inter-prediction modes. Again, for example, a prediction image Petition 870250005547, dated 01 / 23 / 2025, page 99 / 364 89 / 136 of the current block can be generated by overlaying an inter-prediction image resulting from bidirectional prediction with an inter-prediction image resulting from unidirectional prediction. Furthermore, for example, in multiple prediction mode, a prediction image of the current block can be generated by overlaying three or more prediction images. It should be noted that an example of at least two prediction information items will be described later.

[00438] In the first aspect, a first parameter (hereinafter also referred to as a first signal) indicating whether the prediction mode is the triangular mode is encoded before a second parameter (hereinafter also referred to as a second signal) indicating whether the prediction mode is the multiple prediction mode.

[00439] FIG. 47 is a flowchart illustrating an example of coding processing according to the first aspect. FIG. This is a diagram to explain more specifically an example of coding processing according to the first aspect.

[00440] As illustrated in FIG. 47, in Step S1001, a first parameter, which indicates whether a current block is divided into a plurality of partitions including at least one non-quadrilateral partition, is written in a bitstream. A non-quadrilateral partition is a partition having a shape different from a quadrilateral shape; that is, different from a square and a rectangle.

[00441] In the example illustrated in FIG. 48, the non-quadrilateral partition is a triangular partition. As illustrated in FIG. 48, in Step S1001, a first parameter, which indicates whether a current block is divided into a plurality of partitions including at least one triangular partition; that is, a first parameter, which indicates whether a prediction mode is the triangular mode, is written in a bitstream. When the first parameter, which indicates that the prediction mode is the triangular mode Petition 870250005547, dated 01 / 23 / 2025, page 100 / 364 90 / 136 angular, is written in a bitstream (Yes in Step S1001), the current block is predicted in triangular mode (Step S1005). At this point, the current block is divided into a plurality of partitions that includes at least one triangular partition.

[00442] FIG. 49 is a diagram illustrating an example of a current block being divided into a plurality of partitions that includes at least one non-quadrilateral partition. In the example identified as (a) in FIG. 49, the current block is divided into two triangular partitions. In the example identified as (b) in FIG. 49, the current block is divided into one quadrilateral partition and one L-shaped partition. In the example identified as (c) in FIG. 49, the current block is divided into one triangular partition and one pentagonal partition. In the example identified as (d) in FIG. 49, the current block is divided into one pentagonal partition and one polygonal partition. In the example identified as (e) in FIG. 49, the current block is divided into two polygonal partitions.

[00443] FIG. 50 is a diagram illustrating an example of a current block being divided into two triangular partitions. When a current block is divided into two triangular partitions, the direction of division is one of two ways. In one example, as illustrated in (a) in FIG. 50, the current block is divided from an upper left corner to a lower right corner. In another example, as illustrated in (b) in FIG. 50, the current block is divided from the upper right corner to the lower left corner.

[00444] Next, in Step S1002, when the current block is not divided into a plurality of partitions including at least one non-quadrilateral partition, a second parameter is written in a bitstream. For example, as illustrated in FIG. 48, when the first parameter, which indicates that the prediction mode is not the triangular mode, is written in a bitstream (Not in Step S1001 of FIG. 48), a Petition 870250005547, dated 01 / 23 / 2025, page 101 / 364 91 / 136 second parameter, which indicates whether the prediction mode is multiple prediction mode, is written to the bitstream (Step S1002).

[00445] As described above, in multiple prediction mode, a prediction image can be generated by overlaying an inter-block prediction image with an intra-block prediction image. In this case, at least two items of prediction information are the inter-block prediction image and the intra-block prediction image. However, prediction information is not limited to this example. Prediction information can be, for example, an intra-block prediction direction, an index of a candidate list generated for a prediction mode such as a merge mode, a one-way motion vector predictor, or a two-way motion vector predictor.

[00446] For example, the current block can be predicted using the one-way motion vector predictor and the index of a candidate list generated for a prediction mode such as a merge mode.

[00447] Also, for example, the current block can be predicted using a first merge index and a second merge index from the list of candidates generated for a prediction mode such as a merge mode. The first merge index is different from the second merge index.

[00448] Also, for example, the current block can be predicted using the intra prediction direction and the index of a candidate list generated for a prediction mode such as a merge mode.

[00449] Also, for example, the current block can be predicted using the two-way motion vector predictor and the one-way motion vector predictor.

[00450] Also, for example, the current block can be predicted using the bidirectional motion vector predictor and two vector predictors. Petition 870250005547, dated 01 / 23 / 2025, page 102 / 364 92 / 136 one-way motion.

[00451] Also, for example, the current block can be predicted using the intra-prediction direction and the unidirectional motion vector predictor or the bidirectional motion vector predictor.

[00452] Returning to the explanation of an example of encoding processing according to the first aspect with reference to FIG. 47 again, in Step S1003, the current block is encoded according to the prediction mode indicated by the first parameter and the second parameter. More specifically, as illustrated in FIG. 48, when the first parameter, which indicates that the prediction mode is not the triangular mode, is written to a bitstream (No in Step S1001) and the second, which indicates that the prediction mode is the multiplex prediction mode, is written to the bitstream (Yes in Step S1002), the current block is predicted in the multiplex prediction mode (Step S10031).However, when the first parameter, which indicates that the prediction mode is not the triangular mode, is written to a bitstream (Not in Step S1001) and also the second parameter, which indicates that the prediction mode is not the multiplex prediction mode, is written to the bitstream (Not in Step S1002), the current block is predicted in another inter-prediction mode (Step S10032).

[00453] The other inter prediction mode is, for example, a motion vector difference (MMVD) fusion mode, a fusion mode in a sub-block unit, or a normal fusion mode.

[00454] It should be noted that the encoding of the first parameter and the second parameter can be controlled using information that is already determined, such as a size or a prediction mode (hereinafter also referred to as an encoding mode) of the current block. Variation 1 of the First Aspect

[00455] The following describes encoding processing of Petition 870250005547, dated 01 / 23 / 2025, page 103 / 364 93 / 136 in accordance with Variation 1 of the first aspect. The present variation differs from the first aspect in that the first parameter is not encoded into a bitstream according to the size of a current block or the encoding mode of the current block. More specifically, when the current block has a size greater than or equal to a specific size, or when an encoding mode of the current block is not a specific mode, both the first parameter and the second parameter are encoded. On the other hand, when the current block has a size smaller than the specific size, or when an encoding mode of the current block is the specific mode, only the second parameter is encoded.

[00456] FIG. 51 is a diagram to explain an example of coding processing for Variation 1 of the first aspect.

[00457] As illustrated in FIG. 51, if the current block size is greater than or equal to a threshold (e.g., 8x8 pixels), it is determined (Step S1101). When the current block size is greater than or equal to the threshold (Yes in Step S1101), the first parameter, which indicates whether the prediction mode is the triangular mode, is written to a bitstream (Step S1102). When the first parameter, which indicates that the prediction mode is the triangular mode, is written to the bitstream (Yes in Step S1102), the current block is divided into a plurality of partitions including at least one triangular partition (Step S1103). On the other hand, when the first parameter, which indicates that the prediction mode is not the triangular mode, is written in a bitstream (Not in Step S1102), the second parameter, which indicates whether the prediction mode is the multiple prediction mode, is written in the bitstream (Step S1104).When the second parameter, which indicates that the prediction mode is multiplex prediction mode, is written to the bitstream (Yes in Step S1104), the current block is predicted in multiplex prediction mode (Step S1105). On the other hand, when the second parameter... Petition 870250005547, dated 01 / 23 / 2025, page 104 / 364 94 / 136 indicates that the prediction mode is not the multiplex prediction mode, it is written in the bitstream (Not in Step S1104), the current block is predicted in another inter-prediction mode (Step S1106).

[00458] However, when the current block size is less than the threshold (No in Step S1101), a second parameter, indicating whether the prediction mode is multiplex prediction mode, is written to a bitstream (Step S1107). When the second parameter, indicating that the prediction mode is multiplex prediction mode, is written to the bitstream (Yes in Step S1107), the current block is predicted in multiplex prediction mode (Step 1108). Conversely, when the second parameter, indicating that the prediction mode is not multiplex prediction mode, is written to the datastream (No in Step S1107), the current block is predicted in another inter-prediction mode (Step S1109).

[00459] Note that the threshold for the size of a current block can be greater than or equal to 64 pixels.

[00460] As described above, according to Variation 1 of the first aspect, when an actual block has a size greater than or equal to a threshold, both the first and second parameters are coded so that both modes are selectable. Conversely, when the actual block has a size smaller than the threshold, the first parameter is not coded (in other words, only the second parameter is coded), to exclude the triangular mode from the options. Variation 2 of the First Aspect

[00461] The following describes encoding processing according to Variation 2 of the first aspect. The present variation differs from the first aspect and Variation 1 in that the second parameter is not encoded into a bitstream according to a current block size or current block encoding mode. More Petition 870250005547, dated 01 / 23 / 2025, page 105 / 364 Specifically, in 95 / 136, when the current block is larger than or equal to a specified size, or when the current block's encoding mode is not a specified mode, both the first and second parameters are encoded. Conversely, when the current block is smaller than the specified size, or when the current block's encoding mode is the specified mode, only the first parameter is encoded.

[00462] FIG. 52 is a diagram to explain an example of coding processing according to Variation 2 of the first aspect.

[00463] As illustrated in FIG. 52, the first parameter, which indicates whether a prediction mode is the triangular mode, is written to a bitstream (Step S1201). When the first parameter, which indicates that the prediction mode is the triangular mode, is written to the bitstream (Yes in Step S1201), the current block is divided into a plurality of partitions including at least one triangular partition (Step S1202). Conversely, when the first parameter, which indicates that the prediction mode is not the triangular mode, is written to the bitstream (No in Step S1201), the encoding mode of the current block is a jump mode (Step S1203). When the encoding mode of the current block is the jump mode (Yes in Step S1203), the current block is encoded in jump mode where triangular prediction processing and multiplex prediction processing are not used (Step S1204).On the other hand, when the current block encoding mode is not the jump mode (No in Step S1203), the second parameter, which indicates whether the prediction mode is the multiplex prediction mode, is written to the bitstream (Step S1205). When the second parameter, which indicates that the prediction mode is the multiplex prediction mode, is written to the bitstream (Yes in Step S1205), the current block is predicted in multiplex prediction mode (Step S1206). On the other hand, when the second... Petition 870250005547, dated 01 / 23 / 2025, page 106 / 364 The 96 / 136 parameter, which indicates that the prediction mode is not the multiplex prediction mode, is written to the bitstream (Not in Step S1205), the current block is predicted in another inter-prediction mode (Step S1207).

[00464] As described above, according to Variation 2 of the first aspect, when the encoding mode of a current block is not a specific mode (e.g., jump mode), both the first and second parameters are encoded so that both modes are selectable. On the other hand, when the encoding mode of the current block is the specific mode (jump mode), the second parameter is not encoded (in other words, only the first parameter is encoded), to exclude the multiple prediction mode from the options.

[00465] It should be noted that, in the description of the present aspect, the terms write and encode used in the description for the encoding method and encoding processing performed by the encoder may be replaced by the terms analyze and decode for an encoding method and encoding processing performed by a decoder. Technical Advantages of the First Aspect

[00466] In the first aspect, a syntax design for triangular partition mode (in other words, triangular mode) and multiple prediction mode is introduced. With the syntax design, it is possible to combine multiple prediction mode with triangular mode, and thus coding efficiency is improved. According to the first aspect, it is possible to implement a combination of triangular mode and multiple prediction mode without increasing the worst-case memory access required for each block (in other words, without increasing the worst-case memory access of each block as memory access). Combination Including Other Aspects Petition 870250005547, dated 01 / 23 / 2025, page 107 / 364 97 / 136

[00467] At least one option of this aspect may be combined with at least a portion of one or more other aspects. A portion of the flowchart processing, a portion of the devices, syntax and / or other elements may be combined with the other aspects.

[00468] It should be noted that not all of the processes / elements described above are always necessary. The device / method may contain a portion of the processes / elements. The processes described above can be performed by a decoder in the same way as an encoder. Second Aspect

[00469] In the second aspect, syntax for a triangular mode and a multiple prediction mode is planned as a prediction mode for predicting a current block.

[00470] According to the first aspect, the first parameter is a signal indicating whether the prediction mode is the triangular mode, and the second parameter is a signal indicating whether the prediction mode is the multiple prediction mode. The second aspect differs from the first aspect in that the first and second parameters are signals related respectively to the prediction modes opposite to the prediction modes of the first aspect.

[00471] In the second aspect, a first signal indicating whether the prediction mode is the multiple prediction mode is encoded before a second signal indicating whether the prediction mode is the triangular mode.

[00472] FIG. 53 is a flowchart illustrating an example of coding processing for the second aspect. FIG. 54 is a diagram to explain more specifically an example of coding processing according to the second aspect.

[00473] As illustrated in FIG. 53, in Stage S2001, a first Petition 870250005547, dated 01 / 23 / 2025, page 108 / 364 Parameter 98 / 136, which indicates whether a prediction mode for a current block is multiplex prediction mode, is written to a bitstream. As described in the first aspect, in multiplex prediction mode, for example, a prediction image of the current block is generated by overlaying an inter-prediction image of the current block with an intra-prediction image of the current block. As illustrated in FIG. 54, in Step S2001, a first parameter, which indicates whether a prediction mode for predicting a current block is multiplex prediction mode, is written to a bitstream. When the first parameter, which indicates that the prediction mode is multiplex prediction mode, is written to the bitstream (Yes in Step S2001), the current block is predicted in multiplex prediction mode (Step S2005).

[00474] Next, in Step S2002, when the current block is not predicted using at least two prediction information items, a second parameter is written to the bitstream. For example, as illustrated in FIG. 54, when the first parameter, which indicates that the prediction mode is not the multiple prediction mode, is written to a bitstream (Not in Step S2001), a second parameter, which indicates whether the prediction mode is the triangular mode, is written to the bitstream (Step S2002).

[00475] Next, in Step S2003, the current block is encoded according to the prediction mode indicated by the first and second parameters. More specifically, as illustrated in FIG. 54, when the first parameter, which indicates that the prediction mode is not the multiple mode, is written in a bitstream (No in Step S2001) and the second parameter, which indicates that the prediction mode is the triangular mode, is written in the bitstream (Yes in Step S2002), the current block is predicted in triangular mode (Step S2003). On the other hand, when the first parameter, which indicates that the prediction mode is not the multiple mode, is written in a bitstream (No in Step Petition 870250005547, dated 01 / 23 / 2025, page 109 / 364 99 / 136 S2001) and also the second parameter, which indicates that the prediction mode is not the triangular mode, is written in the bitstream (Not in Step S2002), the current block is predicted in another inter-prediction mode (Step S20032). It should be noted that the other inter-prediction mode was described in the first aspect, and therefore description for the other prediction mode will be omitted here.

[00476] According to the second aspect, the first parameter, which indicates whether the prediction mode is the multiple prediction mode, is encoded in syntax, and then the second parameter, which encodes whether the prediction mode is the triangular mode, is encoded in syntax. Therefore, the second aspect and the first aspect are the same in that the multiple prediction mode and the triangular mode are not used at the same time (in other words, one excludes the other).

[00477] Also, in the second aspect, the first parameter, which indicates whether the prediction mode is the multiple prediction mode, is coded, and when (i) the first parameter indicates that the prediction mode is not the multiple prediction mode and (ii) the determined condition is satisfied, the current block can be predicted in triangular mode without a signal. On the other hand, when the determined condition is not satisfied, the current block can be predicted in the other inter-prediction mode (for example, a normal fusion mode).

[00478] For example, the condition is (a) the current block size is greater than or equal to 64 pixels, (b) the current block encoding mode is not a specific mode, or (c) the triangular mode can be used. At this point, when the current block size is less than 64 pixels, the above-described condition can be determined not to be met. Furthermore, when the current block encoding mode is the specific mode, the above-described condition can be determined not to be met. Furthermore, when the use of the triangular mode is prohibited, the above-described condition can be determined not to be met. It must be Petition 870250005547, dated 01 / 23 / 2025, page 110 / 364 100 / 136 observed that the determined condition may be a predetermined condition.

[00479] It should be noted that, in the second aspect as with the first aspect, encoding of the first parameter and the second parameter can be controlled using information that is already determined such as the size or prediction mode of the current block. Variation 1 of the Second Aspect

[00480] The following describes encoding processing according to Variation 1 of the second aspect. The present variation differs from the second aspect in that the first parameter is not encoded into a bitstream according to the size of a current block or the encoding mode of the current block. More specifically, when the current block has a size greater than or equal to a specific size, or when an encoding mode of the current block is not a specific mode, both the first parameter and the second parameter are encoded. Conversely, when the current block has a size smaller than the specific size, or when an encoding mode of the current block is the specific mode, only the second parameter is encoded.

[00481] FIG. 55 is a diagram to explain an example of coding processing according to Variation 1 of the second aspect.

[00482] As illustrated in FIG. 55, if the encoding mode of a current block is the jump mode, it is determined (Step S2101). When the encoding mode of the current block is the jump mode (Yes in Step S2101), the second parameter, which indicates whether the prediction mode is the triangular mode, is written to a bitstream (Step S2102). When the second parameter, which indicates that the prediction mode is the triangular mode, is written to the bitstream (Yes in Step S2102), the current block is predicted in triangular mode (Step S2103). On the other hand, Petition 870250005547, dated 01 / 23 / 2025, page 111 / 364 101 / 136 when the second parameter, which indicates that the prediction mode is not the triangular mode, is written to the bitstream (Not in Step S2102), the current block is encoded in jump mode where triangular prediction processing and multiplex prediction processing are not used (Step S2104).

[00483] On the other hand, when the prediction mode of the current block is not the jump mode (Not in Step S2101), the first parameter, which indicates whether the prediction mode is the multiple prediction mode, is written in a bitstream (Step S2105). When the first parameter, which indicates that the prediction mode is multiple prediction mode, is written to the bitstream (Yes in Step S2105), the current block is predicted in multiplex prediction mode (Step S2106). Conversely, when the first parameter, which indicates that the prediction mode is not multiple prediction mode, is written to the bitstream (No in Step S2105), a second parameter, which indicates whether the prediction mode is triangular mode, is written to the bitstream (Step S2107). When the second parameter, which indicates that the prediction mode is triangular mode, is written to the bitstream (Yes in Step S2107), the current block is predicted in triangular mode (Step S2108).On the other hand, when the second parameter, which indicates that the prediction mode is not the triangular mode, is written to the bitstream (Not in Step S2107), the current block is predicted in another inter-prediction mode (Step S2109).

[00484] As described above, according to Variation 1 of the second aspect, when the current block's encoding mode is not the specific mode (e.g., jump mode), both the first and second parameters are encoded so that both modes are selectable. Conversely, when the current block's encoding mode is the specific mode (e.g., jump mode), the first parameter is not encoded (in other words, only the second parameter is encoded), to exclude the prediction mode. Petition 870250005547, dated 01 / 23 / 2025, page 112 / 364 102 / 136 multiple of the options. Variation 2 of the Second Aspect

[00485] The following describes encoding processing according to Variation 2 of the second aspect. The present variation differs from the second aspect and Variation 1 in that the second parameter is not encoded into a bitstream according to the size of a current block or the encoding mode of the current block. More specifically, when the current block has a size greater than or equal to the specified size, or when an encoding mode of the current block is not the specified mode, both the first parameter and the second parameter are encoded. Conversely, when the current block has a size smaller than the specified size, or when an encoding mode of the current block is the specified mode, only the first parameter is encoded.

[00486] FIG. 56 is a diagram to explain an example of coding processing according to Variation 2 of the second aspect.

[00487] As illustrated in FIG. 56, the first parameter, which indicates whether a prediction mode is the multiple prediction mode, is written to a bit stream (Step S2201). When the first parameter, which indicates that the prediction mode is the multiple prediction mode, is written to the bit stream (Yes in Step S2201), the current block is predicted in the multiple prediction mode (Step S2202). Conversely, when the first parameter, which indicates that the prediction mode is not the multiple prediction mode, is written to the bit stream (No in Step S2201), whether the size of the current block is greater than or equal to a threshold (here, 8x8 pixels) is determined (Step S2203). When the size of the current block is less than the threshold (here, 8x8 pixels) (No in Step S2203), the current block is predicted in another prediction mode (Step S2204). On the other hand, when the current block size is greater than or equal to the threshold. Petition 870250005547, dated 01 / 23 / 2025, page 113 / 364 103 / 136 (8x8 pixels) (Yes in Step S2203), the second parameter, which indicates whether the prediction mode is triangular mode, is written to a bitstream (Step S2205). When the second parameter, which indicates that the prediction mode is triangular mode, is written to the bitstream (Yes in Step S2205), the current block is divided into a plurality of partitions including at least one triangular partition (Step S2206). Conversely, when the second parameter, which indicates that the prediction mode is not triangular mode, is written to the bitstream (No in Step S2205), the current block is predicted in another inter-prediction mode (Step S2207).

[00488] It should be noted that the threshold for the size of a current block may be greater than or equal to 64 pixels.

[00489] As described above, according to Variation 2 of the second aspect, when a current block has a size greater than or equal to a specific size (e.g., 8x8 pixels), both the first parameter and the second parameter are encoded so that both modes are selectable. Conversely, when the current block has a size smaller than the specific size, the second parameter is not encoded (in other words, only the first parameter is encoded), to exclude the triangular mode from the options.

[00490] It should be noted that, in the description of the present aspect, the terms write and encode used in the description for the encoding method and encoding processing performed by the encoder may be replaced by the terms analyze and decode for a decoding method and decoding processing by a decoder. Technical Advantages of the Second Aspect

[00491] In the second aspect, a syntax design for triangular mode and multiple prediction mode is introduced. With the design Petition 870250005547, dated 01 / 23 / 2025, page 114 / 364 Regarding syntax 104 / 136, it is possible to combine multiple prediction mode with triangular mode, thus improving coding efficiency. Secondly, it is possible to implement a combination of triangular mode and multiple prediction mode without increasing the worst-case memory access required for each block. Combination Including Other Aspects

[00492] At least one portion of this aspect may be combined with at least one portion of one or more other aspects. A portion of the flowchart processing, a portion of the devices, syntax and / or other elements may be combined with the other aspects.

[00493] It should be noted that not all of the processes / elements described above are always necessary. The device / method may contain a portion of the processes / elements. The processes described above can be performed by a decoder in the same way as an encoder.

[00494] For example, the second aspect can be combined with the first aspect. FIG. 57 is a diagram to explain an example of encoding processing according to an aspect of a combination of the first aspect and the second aspect.

[00495] According to one aspect of a combination of the first aspect and the second aspect, an encoding order of a parameter indicating whether a prediction image is generated by dividing a current block into a plurality of partitions including at least one non-quadrilateral partition (e.g., a triangular partition) and a parameter indicating whether a current block is predicted using at least two items of prediction information is determined based on a current block size or a current block encoding mode.

[00496] As illustrated in FIG. 57, a signal indicating whether the current block encoding mode is the jump mode is written in a Petition 870250005547, dated 01 / 23 / 2025, page 115 / 364 105 / 136 bitstream (Step S2301). When the prediction mode of the current block is the jump mode (Yes in Step S2301), a parameter indicating whether the prediction mode is the triangular mode is written to the bitstream (Step S2302). When the parameter indicating that the prediction mode is the triangular mode is written to the bitstream (Yes in Step S2302), the current block is predicted in triangular mode (Step S2303). Conversely, when the parameter indicating that the prediction mode is not the triangular mode is written to the bitstream (No in Step S2302), a parameter indicating whether the prediction mode is the multiple prediction mode is written to the bitstream (Step S2304). When the parameter, which indicates that the prediction mode is multiple prediction mode, is written to the bitstream (Yes in Step S2304), the current block is predicted in multiple prediction mode (Step S2305).On the other hand, when the parameter, which indicates that the prediction mode is not the multiple prediction mode, is written to the bitstream (Not in Step S2304), the current block is encoded in jump mode where triangular prediction processing and multiple prediction processing are not used (Step S2306).

[00497] However, when the current block encoding mode is not the jump mode (No in Step S2301), a parameter indicating whether the prediction mode is the multiple prediction mode is written to a bitstream (Step S2307). When the parameter indicating that the prediction mode is the multiple prediction mode is written to the bitstream (Yes in Step S2307), the current block is predicted in the multiple prediction mode (Step S2308). Conversely, when the parameter indicating that the current block prediction mode is not the multiple prediction mode is written to the bitstream (No in Step S2307), a parameter indicating whether the prediction mode is the triangular mode is written to the bitstream (Step S2309). When the parameter indicating that the prediction mode is the triangular mode is written to the bitstream Petition 870250005547, dated 01 / 23 / 2025, page 116 / 364 106 / 136 (Yes in Step S2309), the current block is predicted in triangular mode (Step S2310). Conversely, when the parameter, which indicates that the prediction mode is not triangular mode, is written to the bitstream (No in Step S2309), the current block is predicted in another inter-prediction mode (Step S2311).

[00498] As described above, according to the aspect of combining the first aspect and the second aspect, an encoding processing flow can be switched between the encoding processing flow in the first aspect and the encoding processing flow in the second aspect, based on whether the current block satisfies a given condition (here, the given condition is that the encoding mode is the jump mode). For example, the encoding processing flow of the first aspect is performed when the encoding mode of the current block is the specific mode (e.g., the jump mode), and the encoding processing flow of the second aspect is performed when the prediction mode of the current block is not the specific mode. In this way, the encoding order of the triangular mode and the multiple prediction mode can be switched according to the size of the current block or the encoding mode of the current block. Third Aspect

[00499] According to the third aspect, syntax for a triangular mode and a multiple prediction mode is planned as a prediction mode for predicting a current block.

[00500] In the third aspect, a first parameter indicating: whether at least one additional prediction information is used for the current block; or whether the current block is divided into a plurality of partitions including at least one particular division is encoded.

[00501] FIG. 58 is a flowchart illustrating an example of coding processing according to the third aspect. FIG. Petition 870250005547, dated 01 / 23 / 2025, page 117 / 364 107 / 136 is a diagram to explain more specifically an example of encoding processing according to the third aspect.

[00502] As illustrated in FIG. 58, in Step S3001, a first parameter is written in a bitstream. The first parameter indicates, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of the current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions. For example, as illustrated in FIG. 59, in Step S3001, the first parameter, which indicates that one of (i) the multiple prediction mode and (ii) one of the plurality of prediction modes including the triangular mode is the prediction mode of the current block, is written in a bitstream.It should be noted that the first parameter may be, instead of the parameter having a binary value indicating one of (i) the multiple prediction mode and (ii) one of the plurality of prediction modes including the triangular mode, a parameter having a ternary value indicating one of (i) the multiple prediction mode, (ii) the triangular mode and (iii) another inter-prediction mode, or a parameter having a multiple value greater than the ternary value.

[00503] Next, in Step S3002, the current block is encoded according to the prediction mode indicated by the first parameter. For example, as illustrated in FIG. 59, when the first parameter, which indicates that the prediction mode is the multiple prediction mode, is written to the bitstream, the current block is predicted in the multiple prediction mode (Step S30021). When the first parameter, which indicates that the prediction mode is the triangular mode, is written to the bitstream, the current block is predicted in the triangular mode (Step S30022). When the first parameter, which indicates that the prediction mode is another mode Petition 870250005547, dated 01 / 23 / 2025, page 118 / 364 108 / 136 inter-prediction, is written to the bitstream, the current block is predicted in the other inter-prediction mode (Step S30023).

[00504] It should be noted that, in the description of the present aspect, the terms write and encode used in the description for the encoding method and encoding processing performed by the encoder may be replaced by the terms analyze and decode for a decoding method and decoding processing performed by a decoder. Technical Advantages of the Third Aspect

[00505] In the third aspect, a syntax design for triangular mode and multiple prediction mode is introduced. With the syntax design, it is possible to combine multiple prediction mode with triangular mode, and thus coding efficiency is improved. According to the third aspect, it is possible to implement a combination of triangular mode and multiple prediction mode without increasing the worst-case memory access required for each block. Combination Including Other Aspects

[00506] At least one portion of this aspect may be combined with at least one portion of one or more other aspects. A portion of the flowchart processing, a portion of the devices, syntax and / or other elements may be combined with the other aspects.

[00507] It should be noted that not all processes / elements described above are always necessary. The device / method may contain a portion of the processes / elements. The processes described above can be performed by a decoder in the same way as an encoder. Fourth Aspect

[00508] According to a fourth aspect, syntax for a triangular mode and a multiple prediction mode is planned. Petition 870250005547, dated 01 / 23 / 2025, p. 119 / 364 109 / 136

[00509] According to the fourth aspect, a first signal indicating whether a prediction mode is a triangular mode in which a current block is divided into a plurality of partitions including at least one triangular partition is encoded, and then a second signal indicating whether a prediction mode is a multiple prediction mode in which at least one triangular partition is predicted using at least two prediction information items is encoded. In other words, according to a fourth aspect, different from the first through third aspects, when a parameter indicating that the prediction mode is the triangular mode and a parameter indicating that the prediction mode is the multiple prediction mode are both encoded, both the triangular mode and the multiple prediction mode are applied to a current block.

[00510] FIG. 60 is a flowchart illustrating an example of coding processing according to the fourth aspect. FIG. 61 is a diagram to explain more specifically an example of coding processing according to the fourth aspect.

[00511] As illustrated in FIG. 60, in Step S4001, a first parameter, which indicates whether a prediction mode is the triangular mode, is written in a bit stream. For example, as illustrated in FIG. 61, the first parameter, which indicates whether a prediction mode is the triangular mode, is written in a bit stream.

[00512] Next, in Step S4002, a second parameter, which indicates whether the prediction mode is the multiple prediction mode, is written to a bitstream. For example, in FIG. 61, when the first parameter, which indicates that the prediction mode for a current block is not the triangular mode, is written to the bitstream (Not in Step S4001), the current block is predicted in another inter-prediction mode (Step S4005). On the other hand, when the first parameter, which indicates that the prediction mode for the current block is the triangular mode, is written to the Petition 870250005547, dated 01 / 23 / 2025, page 120 / 364 110 / 136 bitstream (Yes in Step S4001), a second parameter, which indicates whether the prediction mode is multiple prediction mode, is written in the bitstream (Step S4002).

[00513] Next, in Step S4003, at least one non-quadrilateral partition is encoded according to the prediction mode indicated by the first parameter and the second parameter. For example, in FIG. 61, when the second parameter, which indicates that the prediction mode for the current block is the multiple prediction mode, is written to the bitstream (Yes in Step S4002), at least one triangular partition of the current block is predicted in the multiple prediction mode (Step S4003). On the other hand, when the second parameter, which indicates that the prediction mode is not the multiplex prediction mode, is written to the bitstream (No in Step S4002), the current block is predicted in triangular mode (Step S4004). Variation of the Fourth Aspect

[00514] What follows describes encoding processing according to a variation of the fourth aspect. This variation differs from the fourth aspect in that the second parameter is encoded before the first parameter.

[00515] FIG. 62 is a diagram explaining an example of encoding processing according to the variation of the fourth aspect. As illustrated in FIG. 62, the second parameter, which indicates whether a prediction mode for a current block is the multiplex mode, is written to a bitstream (Step S4101). When the second parameter, which indicates that the prediction mode is not the multiplex prediction mode, is written to the bitstream (No in Step S4101), the current block is predicted in another inter-prediction mode (Step S4105). On the other hand, when the second parameter, which indicates that the prediction mode is the multiplex prediction mode, is written to the bitstream (Yes in Step S4101), a first parameter, which indicates whether the prediction mode is the multiplex prediction mode, is written to the bitstream (Petition 870250005547, 23 / 01 / 2025, page 121 / 364 111 / 136 tion is the triangular mode, it is written in the bitstream (Step S4102).

[00516] When the first parameter, which indicates that the prediction mode is triangular mode, is written to the bitstream (Yes in Step S4102), at least one triangular partition of the current block is predicted in multiple prediction mode (Step S4103). Conversely, when the first parameter, which indicates that the prediction mode is not triangular mode, is written to the bitstream (No in Step S4102), the current block is predicted in multiple prediction mode (Step S4104).

[00517] As described above, according to the fourth aspect, the first parameter and the second parameter are both encoded, and the current block is encoded according to the prediction mode indicated by the first parameter and the second parameter.

[00518] It should be noted that, in the description of the present aspect, the terms write and encode used in the description for the encoding method and encoding processing performed by the encoder may be replaced by the terms analyze and decode for a decoding method and decoding processing performed by a decoder. Technical Advantages of the Fourth Aspect

[00519] In the fourth aspect, a syntax design for triangular mode and multiple prediction mode is introduced. With the syntax design, it is possible to combine multiple prediction mode with triangular mode, and thus coding efficiency is improved. Combination Including Other Aspects

[00520] At least one portion of this aspect may be combined with at least one portion of one or more other aspects. A portion of the flowchart processing, a portion of the devices, syntax and / or other elements may be combined with the other aspects.

[00521] It should be noted that all processes / elements Petition 870250005547, dated 01 / 23 / 2025, page 122 / 364 The processes described above (112 / 136) are not always necessary. The device / method may contain a portion of the processes / elements. The processes described above can be performed by a decoder in the same way as an encoder.

[00522] It should be noted that a non-quadrilateral partition can be a triangular partition.

[00523] Also, the first parameter can be a flag or an index. Similarly, the second parameter can be a flag or an index. Supplements

[00524] The encoder 100 and the decoder 200 according to the present embodiment can be used as an image encoder and an image decoder, respectively, or as a video encoder and a video decoder, respectively.

[00525] Alternatively, encoder 100 and decoder 200 can be used as an entropy encoder and an entropy decoder, respectively. In other words, encoder 100 and decoder 200 can only correspond to entropy encoder 110 and entropy decoder 202, respectively. Other constituent elements may be included in another device.

[00526] Furthermore, at least part of the present embodiment can be used as an encoding method, a decoding method, an entropy encoding method, an entropy decoding method, or other methods.

[00527] It should be noted that each of the constituent elements in the present embodiment may be configured in the form of a unique hardware product or may be obtained by running a software program suitable for the constituent element. Each of the constituent elements may be obtained by means of a unit Petition 870250005547, dated 01 / 23 / 2025, page 123 / 364 113 / 136 of program execution, such as a CPU and a processor, reading and executing software programs stored on a recording medium such as a hard disk or semiconductor memory.

[00528] More specifically, each of the encoder 100 and decoder 200 may include processing and storage circuitry that is electrically connected to the processing circuit and accessible from the processing circuit. For example, the processing circuit corresponds to processor a1 or b1, and the storage corresponds to memory a2 or b2.

[00529] The processing circuit includes at least one of the dedicated hardware and program execution units, and performs processing using storage. Furthermore, when the processing circuit includes the program execution unit, the storage stores a software program that is executed by the program execution unit.

[00530] Here, the software for implementing encoder 100, decoder 200 or similar according to this modality includes programs as indicated below.

[00531] For example, the program can cause a computer to execute an encoding method for encoding a video. The encoding method includes: writing a first parameter in a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by overlaying an inter-prediction image of a current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions; and encoding the current block according to the prediction mode.

[00532] Also, for example, the program can cause a Petition 870250005547, dated 01 / 23 / 2025, page 124 / 364 114 / 136 computer execute a decoding method for decoding a video. The decoding method includes: analyzing a first parameter of a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by overlaying an inter prediction image of a current block and an intra prediction image of the current block and (ii) one of a plurality of prediction modes including a triangular mode in which a prediction image is generated by dividing the current block into triangular regions; and decoding the current block according to the prediction mode.

[00533] Furthermore, each of the constituent elements can be circuit as described above. The circuit can be configured as a single circuit as a whole or as separate circuits. Also, each of the constituent elements can be implemented as a general-purpose processor or as a dedicated processor.

[00534] Furthermore, the processes executed by a specific constituent element can be performed by a different constituent element. Also, the order in which the processes are performed can be changed, or a plurality of processes can be performed in parallel. Also, an encoder / decoder can include encoder 100 and decoder 200.

[00535] Ordinal numbers such as first, second, etc., used for explanation may be arbitrarily substituted. Also, an ordinal number may be newly added to a given constituent element, or similar, or the ordinal number of a given constituent element, or similar, may be removed.

[00536] Aspects of encoder 100 and decoder 200 have been described above based on embodiments. However, aspects of encoder 100 and decoder 200 are not limited to the embodiments described above. One or more aspects of the present invention Petition 870250005547, dated 01 / 23 / 2025, p. 125 / 364 115 / 136 may comprise modalities obtainable by adding to the modalities various types of modifications that a person skilled in the art would arrive at, and configurable modalities by combining constituent elements in different modalities within the scope of the encoder 100 and decoder 200 aspects.

[00537] One aspect can be achieved by combining at least part of the other aspects in the present invention. Furthermore, one aspect can be achieved by combining, with other aspects, part of the processes indicated in any of the flowcharts according to the aspects, part of the configuration of any of the devices, part of the syntax, etc. MODE 2 Implementations and Applications

[00538] As described in each of the above embodiments, each functional or operational block can typically be obtained as an MPU (microprocessing unit) and memory, for example. Furthermore, the processes performed by each of the functional blocks can be performed as a program execution unit, such as a processor that reads and executes software (a program) stored on a storage medium such as ROM. The software can be distributed. The software can be stored on a variety of storage media such as semiconductor memory. Note that each functional block can also be obtained as hardware (dedicated circuit).

[00539] The processing described in each of the embodiments can be performed by means of integrated processing using a single device (system) and, alternatively, it can be performed by means of decentralized processing using a plurality of devices. Furthermore, the processor that executes the program described above can be a single processor or a plurality of processors. Petition 870250005547, dated 01 / 23 / 2025, page 126 / 364 116 / 136 terminators. In other words, integrated processing can be performed and, alternatively, decentralized processing can be performed.

[00540] The embodiments of the present invention are not limited to the exemplary embodiments above; various embodiments can be made of the exemplary embodiments, the results of which are also included within the scope of the embodiments of the present invention.

[00541] Next, examples of applications of the moving image encoding method (image encoding method) and the moving image decoding method (image decoding method) described in each of the above embodiments will be described, as well as various systems that implement the application examples. Such a system may be characterized as including an image encoder employing the image encoding method, an image decoder employing the image decoding method, or an image encoder-decoder that includes both the image encoder and the image decoder. Other configurations of such a system may be modified on a case-by-case basis. Examples of Use

[00542] FIG. 63 illustrates a general ex100 content provisioning system configuration suitable for implementing a content distribution service. The area where the communication service is provided is divided into cells of desired sizes, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations in the illustrated example, are located in the respective cells.

[00543] In the content delivery system ex100, devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114 and smartphone ex115 are connected to the internet. Petition 870250005547, dated 01 / 23 / 2025, page 127 / 364 117 / 136 ex101 via the internet service provider ex102 or communications network ex104 and base stations ex106 to ex110. The content provisioning system ex100 can combine and connect any combination of the above devices. In various implementations, devices can be directly or indirectly connected together via a telephone network or near-field communication, rather than near-field communication, rather than base stations ex106 to ex110. Furthermore, the streaming server ex103 can be connected to devices including a computer ex111, gaming device ex112, camera ex113, household appliance ex114, and smartphone ex115 via, for example, the internet ex101. The streaming server ex103 can also be connected to, for example, a terminal in an on-plane hotspot ex117 via satellite ex116.

[00544] Note that instead of ex106 to ex110 base stations, wireless access points or hotspots can be used.The streaming server ex103 can be connected to the communications network ex104 directly instead of the internet ex101 or internet service provider ex102, and can be connected to the aircraft ex117 directly instead of via the satellite ex116.

[00545] The ex113 camera is a device capable of capturing still images and video, just like a digital camera. The ex115 smartphone is a smartphone device, mobile phone or handset of the Personal Accessible Telephone System (PHS) that can operate under the mobile communications system standards of the 2G, 3G, 3.9G and 4G systems, as well as the next-generation 5G system.

[00546] The ex114 household appliance is, for example, a refrigerator or a device included in a domestic fuel cell cogeneration system.

[00547] In the ex100 content delivery system, a terminal including an image and / or video capture function is capable of, Petition 870250005547, dated 01 / 23 / 2025, page 128 / 364 118 / 136 for example, live streaming connecting the streaming server ex103 via, for example, base station ex106. When live streaming, a terminal (e.g., computer ex111, gaming device ex112, camera ex113, household appliance ex114, smartphone ex115 or an in-airplane terminal ex117) can perform the encoding processing described in the embodiments above on still image or video captured by a user via the terminal, can multiplex video data obtained through encoding and audio data obtained through audio encoding corresponding to the video, and can transmit the obtained data to the streaming server ex103. In other words, the terminal functions as an image encoder according to one aspect of the present invention.

[00548] The streaming server ex103 transmits the streamed content data to clients requesting the transmission. Client examples include computer ex111, gaming device ex112, camera ex113, household appliance ex114, smartphone ex115, and in-airplane terminals ex117, which are capable of decoding the encoded data described above. The devices receiving the transmitted data decode and reproduce the received data. In other words, the devices can each function as the image decoder, according to one aspect of the present invention. Decentralized Processing

[00549] The ex103 streaming server can be understood as a plurality of servers or computers among which tasks such as data processing, recording, and transmission are divided. For example, the ex103 streaming server can be understood as a content delivery network (CDN) that transmits content through a network connecting multiple edge servers located around the world. In a CDN, a physical edge server Petition 870250005547, dated 01 / 23 / 2025, page 129 / 364 119 / 136 The client's closest pointer is dynamically assigned to the client. Content is cached and transmitted to the edge server to reduce loading times. In the event of, for example, some kind of error or change in connectivity due to, for example, a traffic spike, it is possible to transmit data stably at high speeds, since it is possible to avoid affected parts of the network by, for example, dividing the processing between a plurality of edge servers, or changing the transmission tasks to a different edge server and continuing the transmission.

[00550] Decentralization is not limited only to the division of processing for transmission: the encoding of captured data can be divided between and performed by the terminals on the server side, or both. In one example, in typical encoding, processing is performed in two cycles.The first cycle is to detect how complex the image is on a frame-by-frame or scene-by-scene basis, or to detect the encoding load. The second cycle is for processing that maintains image quality and improves encoding efficiency. For example, it is possible to reduce the processing load on the terminal and improve the quality and efficiency of content encoding by having the terminals perform the first encoding cycle and the server side that received the content perform the second encoding cycle. In such a case, when a decoding request is received, the encoded data resulting from the first cycle performed by one terminal can be received and played back on another terminal in approximately real-time. This makes it possible to perform regular, real-time transmission.

[00551] In another example, the ex113 camera or similar extracts a number of elements from an image, compresses the data related to the number of elements as metadata, and transmits it. Petition 870250005547, dated 01 / 23 / 2025, page 130 / 364 120 / 136 the compressed metadata is sent to a server. For example, the server determines the significance of an object based on the number of elements and changes the quantization precision accordingly to perform compression appropriate for the meaning (or content significance) of the image. Characterizing quantity data is particularly effective in providing accuracy and efficiency of motion vector prediction during the second compression pass performed by the server. Furthermore, encoding that has a relatively low processing load, such as variable-length encoding (VLC), can be handled by the terminal, and encoding that has a relatively high processing load, such as context-adaptive binary arithmetic encoding (CABAC), can be handled by the server.

[00552] In yet another example, there are cases where a plurality of videos of approximately the same scene are captured by a plurality of terminals in, for example, a stadium, shopping mall, or factory. In such a case, for example, encoding can be decentralized by dividing the processing tasks among the plurality of terminals that captured the videos and, if necessary, other terminals that did not capture the videos, and the server, on a per-unit basis. The units can be, for example, groups of images (GOPs), images, or fragments resulting from the division of an image. This makes it possible to reduce loading times and obtain transmission that is closer to real-time.

[00553] Since the videos are approximately of the same scene, management and / or instructions can be performed by the server so that the videos captured by the terminals can be cross-referenced. Furthermore, the server can receive encoded data from the terminals, change the reference relationship between data items, or correct or replace the images themselves, and then Petition 870250005547, dated 01 / 23 / 2025, page 131 / 364 121 / 136 perform the encoding. This makes it possible to generate a transmission with increased quality and efficiency for individual data items.

[00554] Furthermore, the server can transmit video data after performing transcoding to convert the encoding format of the video data. For example, the server can convert the encoding format from MPEG to VP (e.g., VP9), and it can convert H.264 to H.265.

[00555] In this way, encoding can be performed by a terminal or one or more servers. Therefore, although the device that performs the encoding is referred to as a server or terminal in the description that follows, some or all of the processes performed by the server can be performed by the terminal, and similarly, some or all of the processes performed by the terminal can be performed by the server. This also applies to decoding processes. 3D, Multi-angle

[00556] There has been an increase in the use of combined images or videos of images or videos of different scenes captured simultaneously, or the same scene captured from different angles, by a plurality of terminals such as cameras ex113 and / or smartphones ex115. Videos captured by the terminals are combined based on, for example, the relative positional relationship obtained separately between the terminals, or regions in a video having corresponding element points.

[00557] In addition to encoding two-dimensional moving images, the server can encode a still image based on scene analysis of a moving image, either automatically or at a point in time specified by the user, and transmit the encoded still image to a receiving terminal. Furthermore, the server can obtain the relative positional relationship between the Petition 870250005547, dated 01 / 23 / 2025, page 132 / 364 With 122 / 136 video capture terminals, the server can generate three-dimensional geometry of a scene based on video of the same scene captured from different angles. The server can separately encode three-dimensional data generated from, for example, a time cloud and, based on a recognition or tracking result of a person or object using three-dimensional data, can select or reconstruct and generate a video to be transmitted to a receiving terminal, from videos captured by a plurality of terminals.

[00558] This allows the user to enjoy a scene by freely selecting videos corresponding to the video capture terminals, and allows the user to enjoy the content obtained by extracting a video from a selected viewpoint from three-dimensional data reconstructed from a plurality of images or videos. Furthermore, as with video, sound can be recorded from relatively different angles, and the server can multiplex audio from a specific angle or space with the corresponding video, and transmit the multiplexed video and audio.

[00559] In recent years, content that is a composite of the real world and a virtual world, such as virtual reality (VR) and augmented reality (AR) content, has also become popular. In the case of VR images, the server can create images from the viewpoints of both the left and right eyes, and performs encoding that tolerates reference between the two viewpoint images, such as multiview encoding (MVC), and alternatively, it can encode the images as separate streams without reference. When the images are decoded as separate streams, the streams can be synchronized when played back, so as to recreate a virtual three-dimensional space according to the user's viewpoint. Petition 870250005547, dated 01 / 23 / 2025, page 133 / 364 123 / 136

[00560] In the case of images and AR, the server overlays virtual object information existing in a virtual space onto camera information representing a real-world space, based on a three-dimensional position or movement from the user's perspective. The decoder can obtain or store virtual object information and three-dimensional data, generate two-dimensional images based on movement from the user's perspective, and then generate superimposed data by seamlessly connecting the images. Alternatively, the decoder can transmit movement from the user's perspective to the server in addition to a request for virtual object information. The server can generate superimposed data based on three-dimensional data stored on the server according to the received movement, and encode and transmit the generated superimposed data to the decoder.Note that the superimposed data includes, in addition to RGB values, an α value indicating transparency, and the server sets the α value for different sections of the object generated from three-dimensional data to, for example, 0, and can perform encoding while these sections are transparent. Alternatively, the server can set the base to a specific RGB value, such as a chroma key, and generate data where different areas of the object are defined as the base.

[00561] Decoding of similarly transmitted data can be performed by the client (i.e., the terminals), on the server side, or divided between them. In one example, a terminal can transmit a reception request to a server, the requested content can be received and decoded by another terminal, and a decoded signal can be transmitted to a device having a display device. It is possible to reproduce high-quality image data through decentralized processing and appropriately selecting the content regardless of the processing capabilities of the Petition 870250005547, dated 01 / 23 / 2025, page 134 / 364 124 / 136 communication terminals themselves. In yet another example, while a TV, for instance, is receiving image data that is large in size, a region of an image, such as a fragment obtained by splitting the image, can be decoded and displayed on a personal terminal or terminals of a TV viewer or viewers. This makes it possible for viewers to share an overview as well as for each viewer to check their assigned area, or inspect a region in more detail up close.

[00562] In situations where a plurality of wireless connections is possible over short, medium, or long distances, indoors or outdoors, it may be possible to seamlessly receive content using a standard transmission system such as MPEG-DASH. The user can switch between data in real time while freely selecting a decoder or display device, including the user's terminal, display devices located indoors or outdoors, etc. Furthermore, using, for example, information about the user's position, decoding can be performed while switching which terminal handles decoding and which terminal handles content display. This makes it possible to map and display information, while the user is on their way to a destination, onto the wall of a nearby building where a content-displaying device is embedded, or onto a part of the ground.Furthermore, it is also possible to change the bitrate of the received data based on the accessibility of the encoded data on a network, such as when the encoded data is cached on a server that is quickly accessible from the receiving terminal, or when encoded data is copied to an edge server in a content delivery service. Scalable Coding

[00563] The change in content will be described with reference to Petition 870250005547, dated 01 / 23 / 2025, page 135 / 364 125 / 136 a scalable transmission, illustrated in FIG. 64, which is encoded by compression through implementation of the moving image coding method described in the modalities above. The server may have a configuration in which the content is changed while making use of the temporal and / or spatial scalability of a transmission, which is achieved by dividing and encoding layers, as illustrated in FIG. 64. Note that there may be a plurality of individual transmissions that are of the same content but different quality. In other words, by determining which layer to decode based on internal factors, such as processing ability on the decoder side, and external factors, such as communication bandwidth, the decoder side can freely switch between low-resolution and high-resolution content while decoding.For example, in a case where the user wants to continue watching, for instance, at home on a device such as an internet-connected TV, a video that the user was previously watching on their smartphone while commuting, the device can simply decode the same stream up to a different layer, which reduces the load on the server side.

[00564] Furthermore, in addition to the configuration described above, where scalability is achieved as a result of images being encoded layer by layer, with the enhancement layer being above the base layer, the enhancement layer can include metadata based on, for example, statistical information about the image. The decoder side can generate high-quality image content by performing super-resolution imaging on an image in the base layer based on the metadata. Super-resolution imaging can improve the SN ratio while maintaining resolution and / or increasing resolution. Metadata includes information to identify a Petition 870250005547, dated 01 / 23 / 2025, pp. 136 / 364 126 / 136 linear or non-linear filter coefficient, as used in superresolution processing, or information identifying a parameter value in filter processing, machine learning, or a least squares method used in superresolution processing.

[00565] Alternatively, a configuration can be provided where an image is divided into, for example, fragments according to, for example, the meaning of an object in the image. On the decoder side, only a partial region is decoded by selecting a fragment to decode. Furthermore, by storing an attribute of the object (person, car, ball, etc.) and a position of the object in the video (coordinates in identical images) as metadata, the decoder side can identify the position of a desired object based on the metadata and determine which fragment or fragments include that object. For example, as illustrated in FIG. 65, metadata can be stored using a data storage structure different from pixel data, such as a SEI (supplementary enhancement information) message in HEVC. This metadata indicates, for example, the position, size, or color of the main object.

[00566] Metadata can be stored in units of a plurality of images, such as transmission, sequence, or random access units. The decoder side can obtain, for example, the moment when a specific person appears in the video, and by matching the time information with image unit information, can identify an image in which the object is present, and can determine the object's position in the image. Web Page Optimization

[00567] FIG. 66 illustrates an example of a web page display screen on computer ex111, for example. FIG. 67 Petition 870250005547, dated 01 / 23 / 2025, page 137 / 364 Figures 127 / 136 illustrate an example of a web page display screen on a smartphone, for example, ex115. As illustrated in FIG. 66 and FIG. 67, a web page may include a plurality of image links that are links to image content, and the appearance of the web page differs depending on the device used to view the web page. When a plurality of image links is visible on the screen, until the user explicitly selects an image link, or until the image link is approximately centered on the screen, or the entire image link fits on the screen, the display device (decoder) may display, as the image links, static images included in the content or I-images; it may display video such as an animated GIF using a plurality of static images or I-images; or it may receive only the base layer, and decode and display the video.

[00568] When an image link is selected by the user, the display device performs decoding while giving the highest priority to the base layer. Note that if there is information in the web page's HTML code indicating that the content is scalable, the display device may decode up to the enhancement layer. Furthermore, in order to guarantee real-time playback, before a selection is made or when bandwidth is severely limited, the display device may reduce the delay between the point in time at which the main image is decoded and the point in time at which the decoded image is displayed (i.e., the delay between the start of content decoding and content display) by decoding and displaying only the forward reference images (forward reference image I, image P, forward reference image B).Furthermore, the display device may intentionally ignore the reference relationship between the images, and roughly decode all B and P images as forward reference images, and then perform normal decoding as the number of images received corresponds. Petition 870250005547, dated 01 / 23 / 2025, page 138 / 364 128 / 136 the time increases. Autonomous Driving

[00569] When transmitting and receiving still image or video data such as two-dimensional or three-dimensional map information for autonomous driving or assisted driving of a car, the receiving terminal may receive, in addition to image data belonging to one or more layers, information about, for example, weather or road construction as metadata, and associate the metadata with the image data during decoding. Note that metadata may be assigned by layer and, alternatively, may simply be multiplexed with the image data.

[00570] In such a case, since the automobile, drone, airplane, etc., containing the receiving terminal is mobile, the receiving terminal can perfectly receive and perform decoding while switching between base stations from ex106 to ex110 by transmitting information indicating the position of the receiving terminal. Furthermore, according to the user's selection, the user's situation and / or the connection bandwidth, the receiving terminal can dynamically select the extent to which metadata is received, or the extent to which map information, for example, is updated.

[00571] In the ex100 content delivery system, the client can receive, decode and reproduce, in real time, encoded information transmitted by the user. Individual Content Transmission

[00572] In the ex100 content provisioning system, in addition to high picture quality, long content distributed by a video distribution entity, unicast or multicast transmission of low picture quality, and short content from an individual are Petition 870250005547, dated 01 / 23 / 2025, page 139 / 364 129 / 136 are also possible. Such content from individuals is likely to increase in popularity. The server may first perform editing processing on the content before encoding processing in order to refine the individual's content. This can be achieved using the following configuration, for example.

[00573] In real time while capturing video or image content, or after the content has been captured and accumulated, the server performs recognition processing based on the raw or encoded data, such as capture error processing, scene search processing, meaning analysis, and / or object detection processing. Then, based on the result of the recognition processing, the server—either when requested or automatically—edits the content, examples of which include: corrections such as focus or motion blur correction; removal of low-priority scenes such as scenes that are low in brightness compared to other images, or out of focus; object edge adjustment; and color tone adjustment. The server encodes the edited data based on the result of the editing. It is known that excessively long videos tend to receive fewer views.Therefore, in order to keep the content within a specific length that is in balance with the length of the original video, the server may, in addition to the low-priority scenes described above, automatically crop scenes with little movement, based on an image processing result. Alternatively, the server may generate and encode a video summary based on the result of an analysis of a scene's meaning.

[00574] There may be cases where individual content may include content that infringes on copyright, moral rights, image rights, etc. Such a case may lead to an unfavorable situation for the creator, such as when the content is shared beyond the intended scope. Petition 870250005547, dated 01 / 23 / 2025, page 140 / 364 130 / 136 as directed by the creator. Therefore, before encoding, the server can, for example, edit images to blur the faces of people on the periphery of the screen or blur the interior of a house, for example. Furthermore, the server can be configured to recognize the faces of people different from a registered person in images to be encoded, and when such faces appear in an image, it can apply a mosaic filter, for example, to the person's face. Alternatively, as pre- or post-processing for encoding, the user can specify, for copyright reasons, a region of an image including a person or a region of the background to be processed. The server can process the specified region, for example, by replacing the region with a different image, or by blurring the region. If the region includes a person, the person can be tracked in the moving image, and the region of the person's head can be replaced with another image as the person moves.

[00575] Since there is a demand for real-time viewing of content produced by individuals, which tends to be small in data size, the decoder first receives the base layer as the highest priority, and performs decoding and playback, although this may differ depending on the bandwidth. When the content is played back two or more times, such as when the decoder receives the enhancement layer during decoding and playback of the base layer, and performs the playback cycle, the decoder can produce a high-quality image video including the enhancement layer. If the broadcast is encoded using such scalable encoding, the video may be of low quality when in an unselected state or at the beginning of the video, but it can offer an experience where the image quality of the broadcast progressively increases in an intelligent way. This is not limited to just scalable encoding; the same experience can be offered Petition 870250005547, dated 01 / 23 / 2025, page 141 / 364 131 / 136 based on the configuration of a single transmission from a low-quality transmission played for the first time and a second transmission encoded using the first transmission as a reference. Other Examples of Implementation and Application

[00576] Encoding and decoding can be performed using an ex500 LSI (large-scale integration circuit) (see FIG. 63), which is typically included in each terminal. The ex500 LSI can be configured as a single chip or a plurality of chips. Software for encoding and decoding moving images can be integrated into some type of recording medium (such as a CD-ROM, a floppy disk, or a hard disk) that is readable by, for example, a computer (ex111), and encoding and decoding can be performed using the software. Furthermore, when the ex115 smartphone is equipped with a camera, the video data obtained by the camera can be transmitted. In this case, the video data is encoded by the ex500 LSI included in the ex115 smartphone.

[00577] Note that the LSI ex500 can be configured to download and activate an application. In such a case, the terminal first determines whether it is compatible with the scheme used to encode the content, or whether it is capable of running a specific service. When the terminal is not compatible with the content encoding scheme, or when the terminal is not capable of running a specific service, the terminal first downloads a codec or application software and then obtains and plays the content.

[00578] In addition to the example of content provisioning system ex100 that uses internet ex101, at least the moving picture encoder (picture encoder) or the moving picture decoder (picture decoder) described in the above modalities can be implemented in a digital transmission system. The Petition 870250005547, dated 01 / 23 / 2025, page 142 / 364 132 / 136 The same encoding and decoding processing can be applied to transmit and receive superimposed broadcast radio waves with multiplexed audio and video data using, for example, a satellite, although this is geared towards multicast, whereas unicast is easier with the ex100 content provisioning system. Hardware Configuration

[00579] FIG. 68 illustrates additional details of the ex115 smartphone shown in FIG. 63. FIG. 69 illustrates an example of an ex115 smartphone configuration. The ex115 smartphone includes an ex450 antenna for transmitting and receiving radio waves to and from the ex110 base station, an ex465 camera capable of capturing video and still images, and an ex458 display device that displays decoded data, such as video captured by the ex465 camera and video received by the ex450 antenna.The ex115 smartphone also includes an ex466 user interface such as a touch panel, an ex457 audio output unit such as a speaker for voice or other audio output, an ex456 audio input unit such as a microphone for audio input, ex467 memory capable of storing encoded data such as captured video or still images, recorded audio, received video or still images, and correspondence, as well as encoded data, and an ex464 slot which is an interface for an ex468 SIM card for network access authorization and various data. Note that external memory can be used instead of ex467 memory.

[00580] The main controller ex460, which comprehensively controls the display device ex458 and user interface ex466, power supply circuit ex461, user interface input controller ex462, video signal processor ex455, camera interface ex464, display device controller ex459, modulator / demodulator ex452, multiplexer / demultiplexer Petition 870250005547, dated 01 / 23 / 2025, page 143 / 364 133 / 136 ex453, audio signal processor ex454, slot ex464 and memory ex467 are connected via the ex470 bus.

[00581] When the user turns on the power button of the ex461 power supply circuit, the ex115 smartphone is switched on to an operable state, and each component is powered by a battery.

[00582] The ex115 smartphone performs processing for, for example, making calls and transmitting data, based on control performed by the main controller ex460, which includes a CPU, ROM, and RAM. When making calls, an audio signal recorded by the audio input unit ex456 is converted into a digital audio signal by the audio signal processor ex454, to which spread spectrum processing is applied by the modulator / demodulator ex452 and digital-to-analog conversion, and frequency conversion processing is applied by the transmitter / receiver ex451, and the resulting signal is transmitted by the antenna ex450. The received data is amplified, frequency-converted, and analog-to-digital converted, processed in inverse spread spectrum by the modulator / demodulator ex452, converted into an analog audio signal by the audio signal processor ex454, and then outputs from the audio output unit ex457.In data transmission mode, text, still image, or video data is transmitted by the ex460 main controller via the ex462 user interface input controller based on the ex466 user interface operation of the main body, for example. Similar transmission and reception processing is performed. In data transmission mode, when sending a video, still image, or video and audio, the ex455 video signal processor compresses an air video signal using the motion picture coding method described in the embodiments above. Petition 870250005547, dated 01 / 23 / 2025, page 144 / 364 The 134 / 136 data stored in memory ex467 or a video signal entered from the camera ex465 is transmitted to the multiplexer / demultiplexer ex453. The audio signal processor ex454 encodes an audio signal recorded by the audio input unit ex456 while the camera ex465 is capturing a video or still image, and transmits the encoded audio data to the multiplexer / demultiplexer ex453. The multiplexer / demultiplexer ex453 performs multiplexing of the encoded video data and encoded audio data using a predetermined scheme, modulates and converts the data using modulator / demodulator (modulator / demodulator circuit) ex452 and transmitter / receiver ex451, and transmits the result via antenna ex450.

[00583] When video attached to an email or chat, or a video linked from a web page, is received, for example, in order to decode the multiplexed data received via the ex450 antenna, the ex453 multiplexer / demultiplexer performs the demultiplexing of the multiplexed data to divide the multiplexed data into a video data bitstream and an audio data bitstream, provides the encoded video data to the ex455 video signal processor via the ex470 synchronous bus, and provides the encoded audio data to the ex454 audio signal processor via the ex470 synchronous bus.The ex455 video signal processor decodes the video signal using a motion picture decoding method corresponding to the motion picture encoding method described in the embodiments above, and video or a still image included in the linked motion picture file is displayed on the ex458 display device via the ex459 display controller. The ex454 audio signal processor decodes the audio signal and outputs audio from the ex457 audio output unit. Once real-time transmission is complete... Petition 870250005547, dated 01 / 23 / 2025, page 145 / 364 135 / 136 of the increasingly popular, there may be instances where audio playback could be socially inappropriate, depending on the user's environment. Therefore, as a starting point, a configuration where only video data is played, i.e., the audio signal is not played, may be preferable; audio can be synchronized and played only when an input, such as when the user clicks on the video data, is received.

[00584] Although the ex115 smartphone was used in the example above, three other implementations are conceivable: a transceiver terminal including both an encoder and a decoder; a transmitter terminal including only an encoder; and a receiver terminal including only a decoder. In the description of the digital transmission system, an example is given in which multiplexed data obtained as a result of video data being multiplexed with audio data is received or transmitted. The multiplexed data, however, can be video data multiplexed with data other than audio data, such as text data related to the video. Still, the video data itself, instead of multiplexed data, can be received or transmitted.

[00585] Although the main ex460 controller including a CPU is described as controlling encoding or decoding processes, many terminals often include GPUs. Therefore, a configuration is acceptable where a large area is processed at once making use of the GPU's performance capabilities through shared memory between the CPU and GPU, or memory including an address that is managed in such a way as to allow common use by the CPU and GPU. This makes it possible to shorten encoding time, maintain the real-time nature of the transmission, and reduce latency. In particular, processing relating to motion estimation, deblock filtering, adaptive sample shifting. Petition 870250005547, dated 01 / 23 / 2025, page 146 / 364 136 / 136 (SAO) and transformation / quantization can be effectively performed by the GPU instead of the CPU in image units, for example, all at once. INDUSTRIAL APPLICABILITY

[00586] The present invention is applicable to, for example, television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, teleconferencing systems, electronic mirrors, etc. REFERENCES IN THE DRAWINGS 100 encoder 102 divisor 104 subtractor 106 transformer 108 quantizer 110 entropy encoder 112, 204 inverse quantizer 114, 206 reverse transformer 116, 208 adder 118, 210 block memory 120, 212 loop filter 122, 214 frame memory 124, 216 intra predictor 126, 218 predictor inter 128, 220 prediction controller 200 decoder 202 entropy decoder 1201 limit determinant 1202, 1204, 1206 switch 1203 filter determinator 1205 filtering executor

Claims

1. Encoder that encodes a video, characterized in that it comprises: a circuit; and memory coupled to the circuit, wherein the circuit, in operation, obtains a current block from a coding tree unit (CTU); stores a first parameter in a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of the current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a non-rectangular mode in which a prediction image is generated for each non-rectangular partition in the current block; and encodes the current block according to the prediction mode, wherein encoding the current block using the multiple prediction mode and encoding the current block using the non-rectangular mode are mutually exclusive.

2. A decoder that decodes a video, characterized in that it comprises: a circuit; and memory coupled to the circuit, wherein the circuit, in operation, obtains a current block from a coding tree unit (CTU); analyzes a first parameter of a bitstream, the first parameter indicating, as a prediction mode, one of (i) a multiple prediction mode in which a prediction image is generated by superimposing an inter-prediction image of the current block and an intra-prediction image of the current block and (ii) one of a plurality of prediction modes including a non-rectangular mode in which a prediction image is generated for each non-rectangular partition in the current block; and decodes the current block according to the prediction mode, where decoding the current block using the multiple prediction mode and decoding the current block using the non-rectangular mode are mutually exclusive.

Images