Encoder, decoder and bit stream transmission device

Abstract

To provide an encoder capable of appropriately constructing information for prediction.SOLUTION: An encoder which includes a circuit and a memory, and the circuit generates a motion vector candidate list, selects a motion vector of a processing object block from the motion vector candidate list on the basis of an index parameter, and uses the selected motion vector to generate a prediction image of the processing object block. The motion vector candidate list includes a plurality of motion vector candidates. The encoder derives a first maximum number of the plurality of motion vector candidates in response to a rectangular block of a processing object block, derives a second maximum number different from the first maximum number of the plurality of motion vector candidates in response to a non-rectangular block of a processing object block, generates a motion vector candidate list of the derived first or second maximum number, and derives a candidate from a motion vector to an adjacent block.SELECTED DRAWING: Figure 17

Description

[Technical Field]

[0001] The present disclosure relates to an encoding device and the like that encodes a moving image into a bitstream using a predicted image. [Background technology]

[0002] BACKGROUND ART Conventionally, H.265, also known as HEVC (High Efficiency Video Coding), exists as a standard for encoding moving images (Non-Patent Document 1). [Prior art documents] [Non-patent literature]

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

[0004] However, if information for prediction in encoding or decoding of moving images is not constructed appropriately, there is a possibility that the amount of code will increase and the image quality will deteriorate.

[0005] Therefore, the present disclosure provides an encoding device and the like that can appropriately construct information for prediction. [Means for solving the problem]

[0006] An encoding device according to one aspect of the present disclosure is an encoding device that encodes a moving image into a bitstream using a predicted image, and includes a circuit and a memory. The circuit uses the memory to generate a motion vector candidate list for a block to be processed of each picture included in the moving image, select a motion vector for the block to be processed from the motion vector candidate list based on an index parameter, and generate a predicted image for the block to be processed using the selected motion vector. The motion vector candidate list includes a plurality of motion vector candidates for the motion vector of the block to be processed. In response to the block to be processed being a rectangular block, the circuit derives a first maximum number of the plurality of motion vector candidates, and in response to the block to be processed being a non-rectangular block, the circuit derives a second maximum number of the plurality of motion vector candidates that is different from the first maximum number. The circuit generates a motion vector candidate list for the block to be processed with the derived first or second maximum number. The candidates in the motion vector candidate list for the block to be processed are derived from motion vectors for adjacent blocks adjacent to the block to be processed.

[0007] These comprehensive or specific aspects may be realized as a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory recording medium such as a computer-readable CD-ROM, or may be realized as any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium. [Effects of the Invention]

[0008] An encoding device and the like according to one aspect of the present disclosure can appropriately construct information for prediction. [Brief explanation of the drawings]

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

[0010] (Findings that formed the basis of this disclosure) For example, the encoding device encodes a video block by block. When encoding a video block by block, the encoding device may use inter prediction or intra prediction. When using inter prediction to encode a current block, the encoding device identifies a reference block and generates a predicted image of the current block by referring to the reference block. The encoding device then reduces the amount of code by encoding a differential image between the predicted image of the current block and the original image of the current block.

[0011] Furthermore, when decoding a moving image, the decoding device decodes a differential image. Then, the decoding device generates a predicted image of the block to be processed by referring to the reference block, and reconstructs the original image by adding the predicted image and the differential image. In this way, the decoding device can decode the moving image.

[0012] Furthermore, for example, in inter prediction, the encoding device and the decoding device generate a motion vector candidate list for a current block using a common method, select a motion vector for the current block from the motion vector candidate list, and generate a predicted image of the current block using the motion vector of the current block.

[0013] The encoding device also encodes an index indicating the motion vector of the current block in the motion vector candidate list for the current block, and the decoding device decodes the index indicating the motion vector of the current block in the motion vector candidate list for the current block.

[0014] This allows the encoding device and the decoding device to select the same motion vector from the same motion vector candidate list generated by a common method, and to generate the same predicted image using the same motion vector, thereby enabling the encoding device and the decoding device to appropriately encode and decode video using the same predicted image.

[0015] However, if the information for prediction is not properly constructed, the amount of coding may increase.

[0016] For example, the amount of code for an index indicating the motion vector of a target block in a motion vector candidate list depends on the maximum list size of the motion vector candidate list. Also, the amount of code for an index indicating the motion vector of a target block in a motion vector candidate list depends on the position of the motion vector of the target block in the motion vector candidate list. In other words, the amount of code for an index indicating the motion vector of a target block in a motion vector candidate list depends on the candidate order in the motion vector candidate list.

[0017] Therefore, depending on the maximum list size of the motion vector candidate list and the candidate order of the motion vector candidate list, the amount of code for the index indicating the motion vector of the current block in the motion vector candidate list may increase.

[0018] Therefore, for example, an encoding device according to one aspect of the present disclosure is an encoding device that encodes a video into a bitstream using a predicted image, and includes a circuit and a memory, and the circuit uses the memory to perform the following steps: generating a list including multiple candidates for a first motion vector of a first partition in the video, where the multiple candidates included in the list include a candidate derived from a second motion vector of a second partition in the video that is different from the first partition, and at least one of a maximum list size of the list and an order of the multiple candidates included in the list depends on at least one of the partition size and partition shape of the first partition; selecting the first motion vector from the multiple candidates included in the list; encoding an index indicating the first motion vector from among the multiple candidates included in the list into the bitstream based on the maximum list size; and generating the predicted image of the first partition using the first motion vector.

[0019] This allows the encoding device to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, the encoding device can generate an appropriate candidate list based on the partition size or partition shape. That is, the encoding device can appropriately construct information for prediction. Therefore, the encoding device can contribute to reducing the amount of coding.

[0020] Also, for example, if the partition size is a first partition size, the maximum list size is the first list size, and if the partition size is a second partition size smaller than the first partition size, the maximum list size is a second list size larger than the first list size.

[0021] This allows the encoding device to select an appropriate motion vector for a small partition from among a large number of motion vector candidates. On the other hand, for a large partition, there is a possibility that an appropriate motion vector does not exist even among the large number of motion vector candidates. Therefore, by using a motion vector candidate list with a small maximum list size for a large partition, the encoding device can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0022] Also, for example, if the partition size is a first partition size, the maximum list size is the first list size, and if the partition size is a second partition size smaller than the first partition size, the maximum list size is a second list size smaller than the first list size.

[0023] This allows the encoding device to select an appropriate motion vector from a large number of motion vector candidates for a large partition, while using a motion vector candidate list with a small maximum list size for a small partition simplifies processing and contributes to reducing the amount of coding for indexes that point to motion vectors.

[0024] Also, for example, the maximum list size depends on the partition shape, and the partition shape is one of a square, a rectangle, and a triangle.

[0025] This allows the encoding device to generate an appropriate candidate list based on the partition shape: square, rectangular, or triangular.

[0026] Also, for example, if the partition shape is a triangle, the maximum list size is a first list size, and if the partition shape is not a triangle, the maximum list size is a second list size larger than the first list size.

[0027] This allows the encoding device to select an appropriate motion vector for a rectangular partition from a large number of motion vector candidates. On the other hand, there may be few referenceable processed partitions around a triangular partition, and therefore few motion vector candidates that can be derived. Therefore, by using a motion vector candidate list with a small maximum list size for a triangular partition, the encoding device can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0028] Also, for example, if the partition shape is square, the maximum list size is a first list size, and if the partition shape is not square, the maximum list size is a second list size that is larger than the first list size.

[0029] This allows the encoding device to select an appropriate motion vector from a large number of motion vector candidates for a partition with a complex shape. On the other hand, the encoding device can simplify processing by using a motion vector candidate list with a small maximum list size for a partition with a simple shape, which can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0030] Also, for example, when the maximum list size is a first list size, the circuit encodes the index with a first number of bits, and when the maximum list size is a second list size larger than the first list size, the circuit encodes the index with a second number of bits larger than the first number of bits.

[0031] This allows the encoder to encode the index with an appropriate number of bits based on the maximum list size.

[0032] Also, for example, the second partition is a partition adjacent to the first partition.

[0033] This allows the encoding device to derive candidates for the motion vector of the partition to be processed from the motion vectors of partitions adjacent to the partition to be processed, and therefore the encoding device can appropriately derive candidates for the motion vector of the partition to be processed from motion vectors that are assumed to be similar to the motion vector of the partition to be processed.

[0034] Also, for example, a decoding device according to one aspect of the present disclosure is a decoding device that decodes a video from a bitstream using a predicted image, and includes a circuit and a memory, wherein the circuit uses the memory to perform the following steps: generating a list including multiple candidates for a first motion vector of a first partition in the video, wherein the multiple candidates included in the list include a candidate derived from a second motion vector of a second partition in the video that is different from the first partition, and at least one of a maximum list size of the list and an order of the multiple candidates included in the list depends on at least one of a partition size and a partition shape of the first partition; decoding an index indicating the first motion vector from the bitstream based on the maximum list size; selecting the first motion vector from the multiple candidates included in the list using the index; and generating the predicted image of the first partition using the first motion vector.

[0035] This allows the decoding device to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, the decoding device can generate an appropriate candidate list based on the partition size or partition shape. That is, the decoding device can appropriately construct information for prediction. Therefore, the decoding device can contribute to reducing the amount of coding.

[0036] Also, for example, if the partition size is a first partition size, the maximum list size is the first list size, and if the partition size is a second partition size smaller than the first partition size, the maximum list size is a second list size larger than the first list size.

[0037] This allows the decoding device to select an appropriate motion vector from among a large number of motion vector candidates for a small partition. On the other hand, for a large partition, there is a possibility that an appropriate motion vector does not exist even among the large number of motion vector candidates. Therefore, by using a motion vector candidate list with a small maximum list size for a large partition, the decoding device can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0038] Also, for example, if the partition size is a first partition size, the maximum list size is the first list size, and if the partition size is a second partition size smaller than the first partition size, the maximum list size is a second list size smaller than the first list size.

[0039] This allows the decoding device to select an appropriate motion vector from among a large number of motion vector candidates for a large partition, while using a motion vector candidate list with a small maximum list size for a small partition simplifies processing and contributes to reducing the amount of coding for indexes that point to motion vectors.

[0040] Also, for example, the maximum list size depends on the partition shape, and the partition shape is one of a square, a rectangle, and a triangle.

[0041] This allows the decoder to generate an appropriate candidate list based on the partition shape: square, rectangular, or triangular.

[0042] Also, for example, if the partition shape is a triangle, the maximum list size is a first list size, and if the partition shape is not a triangle, the maximum list size is a second list size larger than the first list size.

[0043] This allows the decoding device to select an appropriate motion vector for a rectangular partition from a large number of motion vector candidates. On the other hand, there may be few referenceable processed partitions around a triangular partition, and therefore few motion vector candidates that can be derived. Therefore, by using a motion vector candidate list with a small maximum list size for a triangular partition, the decoding device can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0044] Also, for example, if the partition shape is square, the maximum list size is a first list size, and if the partition shape is not square, the maximum list size is a second list size that is larger than the first list size.

[0045] This allows the decoding device to select an appropriate motion vector from a large number of motion vector candidates for a partition with a complex shape. On the other hand, by using a motion vector candidate list with a small maximum list size for a partition with a simple shape, the decoding device can simplify processing and contribute to reducing the amount of coding for indexes that point to motion vectors.

[0046] Also, for example, when the maximum list size is a first list size, the circuit decodes the index using a first number of bits, and when the maximum list size is a second list size larger than the first list size, the circuit decodes the index using a second number of bits larger than the first number of bits.

[0047] This allows the decoding device to decode the index with an appropriate number of bits based on the maximum list size.

[0048] Also, for example, the second partition is a partition adjacent to the first partition.

[0049] This allows the decoding device to derive candidates for the motion vector of the partition to be processed from the motion vectors of partitions adjacent to the partition to be processed, and therefore the decoding device can appropriately derive candidates for the motion vector of the partition to be processed from motion vectors that are assumed to be similar to the motion vector of the partition to be processed.

[0050] Also, for example, an encoding method according to one aspect of the present disclosure is an encoding method for encoding a moving image into a bitstream using a predicted image, and includes the steps of generating a list including a plurality of candidates for a first motion vector of a first partition in the moving image, wherein the plurality of candidates included in the list include a candidate derived from a second motion vector of a second partition in the moving image that is different from the first partition, and at least one of a maximum list size of the list and an order of the plurality of candidates included in the list depends on at least one of a partition size and a partition shape of the first partition; selecting the first motion vector from the plurality of candidates included in the list; encoding an index indicating the first motion vector from among the plurality of candidates included in the list into the bitstream based on the maximum list size; and generating the predicted image of the first partition using the first motion vector.

[0051] This makes it possible to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, it is possible to generate an appropriate candidate list based on the partition size or partition shape. In other words, it is possible to appropriately construct information for prediction. This can contribute to reducing the amount of coding.

[0052] Also, for example, a decoding method according to one aspect of the present disclosure is a decoding method for decoding a video from a bitstream using a predicted image, the decoding method including the steps of: generating a list including a plurality of candidates for a first motion vector of a first partition in the video, wherein the plurality of candidates included in the list include a candidate derived from a second motion vector of a second partition in the video that is different from the first partition; at least one of a maximum list size of the list and an order of the plurality of candidates included in the list depends on at least one of a partition size and a partition shape of the first partition; decoding an index indicating the first motion vector from the bitstream based on the maximum list size; selecting the first motion vector from the plurality of candidates included in the list using the index; and generating the predicted image of the first partition using the first motion vector.

[0053] This allows the decoding device to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, the decoding device can generate an appropriate candidate list based on the partition size or partition shape. That is, the decoding device can appropriately construct information for prediction. Therefore, the decoding device can contribute to reducing the amount of coding.

[0054] Also, for example, an encoding device according to one aspect of the present disclosure is an encoding device that encodes a moving image into a bitstream using a predicted image, and includes a division unit, an intra prediction unit, an inter prediction unit, a transformation unit, a quantization unit, and an entropy encoding unit.

[0055] The division unit divides a current picture constituting the moving image into a plurality of blocks, the intra prediction unit generates the predicted image of a current block in the current picture using a reference image in the current picture, and the inter prediction unit generates the predicted image using a reference image in a reference picture different from the current picture.

[0056] The transform unit transforms a difference image between the predicted image generated by the intra prediction unit or the inter prediction unit and an image of the current block to generate a plurality of transform coefficients, the quantization unit quantizes the plurality of transform coefficients to generate a plurality of quantized coefficients, and the entropy coding unit codes the plurality of quantized coefficients into the bitstream.

[0057] The inter prediction unit also performs the steps of generating a list including a plurality of candidates for a first motion vector of a first partition in the video, wherein the plurality of candidates included in the list include candidates derived from a second motion vector of a second partition in the video that is different from the first partition, and at least one of the maximum list size of the list and the order of the plurality of candidates included in the list depends on at least one of the partition size and partition shape of the first partition, and selecting the first motion vector from the plurality of candidates included in the list.

[0058] The entropy coding unit further performs the step of coding, into the bitstream, an index indicating the first motion vector among the plurality of candidates included in the list based on the maximum list size, and the inter prediction unit further performs the step of generating the predicted image of the first partition using the first motion vector.

[0059] Also, for example, a decoding device according to one aspect of the present disclosure is a decoding device that decodes moving images from a bitstream using a predicted image, and includes an entropy decoding unit, an inverse quantization unit, an inverse transform unit, an intra prediction unit, an inter prediction unit, and an addition unit (reconstruction unit).

[0060] The entropy decoding unit decodes a plurality of quantized coefficients from the bitstream, the inverse quantization unit inversely quantizes the plurality of quantized coefficients to obtain a plurality of transform coefficients, and the inverse transform unit inversely transforms the plurality of transform coefficients to obtain a difference image.

[0061] The intra prediction unit generates the predicted image of a block to be processed in a current picture that constitutes the video using a reference image in the current picture. The inter prediction unit generates the predicted image using a reference image in a reference picture different from the current picture. The adder adds the predicted image generated by the intra prediction unit or the inter prediction unit to the difference image to reconstruct an image of the block to be processed.

[0062] The inter prediction unit also performs a step of generating a list including a plurality of candidates for a first motion vector of a first partition in the video, wherein the plurality of candidates included in the list include candidates derived from a second motion vector of a second partition in the video that is different from the first partition, and at least one of the maximum list size of the list and the order of the plurality of candidates included in the list depends on at least one of the partition size and partition shape of the first partition.

[0063] The entropy decoding unit decodes, from the bitstream, an index indicating the first motion vector among the plurality of candidates included in the list based on the maximum list size, and the inter prediction unit selects the first motion vector from the plurality of candidates included in the list using the index, and generates the predicted image of the first partition using the first motion vector.

[0064] Furthermore, these comprehensive or specific aspects may be realized as a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory recording medium such as a computer-readable CD-ROM, or may be realized as any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.

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

[0066] The embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, component placement and connection configurations, steps, and step order shown in the following embodiments are merely examples and are not intended to limit the scope of the claims. Furthermore, among the components in the following embodiments, components that are not described in the independent claims that represent the highest concepts are described as optional components.

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

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

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

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

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

[0072] As shown in FIG. 1, the encoding device 100 is a device that encodes an image on a block-by-block basis, and includes a division unit 102, a subtraction unit 104, a transformation unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse transformation unit 114, an addition unit 116, a block memory 118, a loop filter unit 120, a frame memory 122, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0120] Note that an inter-prediction signal may be generated using not only the motion information of the current block obtained by motion estimation, but also the motion information of adjacent blocks. Specifically, an inter-prediction signal may be generated for each sub-block in the current block by weighting and adding a prediction signal based on the motion information obtained by motion estimation and a prediction signal based on the motion information of adjacent blocks. Such inter-prediction (motion compensation) may be called OBMC (overlapped block motion compensation).

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

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

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

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

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

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

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

[0128] Although the process of correcting a predicted image from one reference picture has been described here, the process is similar when correcting a predicted image from multiple reference pictures. After obtaining corrected predicted images from each reference picture, the obtained predicted images are further superimposed to form the final predicted image.

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

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

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

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

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

[0134] Then, a motion vector for the current block is derived based on the motion vector of the selected candidate. Specifically, for example, the motion vector of the selected candidate (best candidate MV) is derived as the motion vector for the current block as is. Also, for example, the motion vector for the current block may be derived by performing pattern matching in a peripheral area of ​​a position in a reference picture corresponding to the motion vector of the selected candidate. That is, a search is performed in a similar manner in a peripheral area of ​​the best candidate MV, and if an MV with a better evaluation value is found, the best candidate MV may be updated to the MV and used as the final MV for the current block. Note that a configuration may be adopted in which this process is not performed.

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

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

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

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

[0139] FIG. 6 is a diagram illustrating an example of pattern matching (bilateral matching) between two blocks along a motion trajectory. As shown in FIG. 6, in the first pattern matching, two motion vectors (MV0, MV1) are derived by searching for the most closely matched pair of two blocks along the motion trajectory of a current block (Cur block) in two different reference pictures (Ref0, Ref1). Specifically, for the current block, a difference is derived between a reconstructed image at a specified position in a first coded reference picture (Ref0) specified by a candidate MV and a reconstructed image at a specified position in a second coded reference picture (Ref1) specified by a symmetric MV obtained by scaling the candidate MV by the display time interval, and an evaluation value is calculated using the obtained difference value. The candidate MV with the best evaluation value among multiple candidate MVs may be selected as the final MV.

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

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

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

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

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

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

[0146] At this time, the velocity vector (v x ,v y ), (MVx0,MVy0) and (MVx1,MVy1) are respectively (v x τ0,v y τ0) and (-v x τ1,-v y τ1), and the following optical flow equation (1) holds:

[0147]

number

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

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

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

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

[0152]

number

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

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

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

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

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

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

[0159] Furthermore, the variable length coding unit encodes the stream by describing merge_idx, which is a signal indicating which predicted MV has been selected.

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

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

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

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

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

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

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

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

[0168] Here, a mode for generating a predicted image using LIC processing will be described.

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

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

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

[0172] A predicted image for the block to be coded is generated by performing luminance correction processing on a reference image in a reference picture specified by the MV using the luminance correction parameters.

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

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

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

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

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

[0178] As shown in FIG. 10, the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transform unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, a frame memory 214, an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.

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

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

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

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

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

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

[0185] Also, for example, if the information decoded from the coded bitstream indicates that NSST is to be applied, then inverse transform unit 206 applies an inverse re-transform to the transform coefficients.

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

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

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

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

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

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

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

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

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

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

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

[0197] Furthermore, when the BIO mode is applied, the inter prediction unit 218 derives a motion vector based on a model assuming constant-velocity linear motion. Furthermore, when information interpreted from the coded bitstream indicates that the affine motion compensation prediction mode is to be applied, the inter prediction unit 218 derives a motion vector for each sub-block based on the motion vectors of multiple adjacent blocks.

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

[0199] [Interpretation Details] In the inter prediction of this embodiment, a motion vector candidate list is generated for a partition to be processed, and a motion vector for the partition to be processed is selected from the motion vector candidate list. Then, a predicted image for the partition to be processed is generated using the motion vector for the partition to be processed. Then, the predicted image is used to encode and decode the partition to be processed.

[0200] Here, a partition is a partition of an image, and may also be expressed as a block, a region, or a range. A partition may be a coding unit or a sub-coding unit obtained by dividing a coding unit. A partition may also be a prediction unit or a sub-prediction unit obtained by dividing a prediction unit. A partition may also be a transform unit or a sub-transform unit obtained by dividing a transform unit.

[0201] The partitions may be rectangular or non-rectangular, the rectangular partitions may be square or non-square, and the non-rectangular partitions may be triangular or other partitions.

[0202] The motion vector candidate list may also be expressed as a motion vector prediction list, or simply as a list. The motion vector candidate list for a partition to be processed includes multiple candidates for the motion vector of the partition to be processed. The candidates may also be expressed as predicted motion vectors or motion vector candidates. The candidates included in the motion vector candidate list for the partition to be processed are derived, for example, from motion vectors of adjacent partitions adjacent to the partition to be processed. The motion vector candidate list may be the merge list or a list for the FRUC mode described above, or may be a list for another mode.

[0203] Specifically, the motion vector of the neighboring partition may be derived as a candidate, or the candidate may be derived by scaling the motion vector of the neighboring partition, where the motion vector of the neighboring partition is the motion vector used in encoding or decoding the neighboring partition.

[0204] Furthermore, a merge index parameter indicating the motion vector of the target partition from among the multiple candidates in the motion vector candidate list for the target partition is coded and decoded. As a result, the coding device 100 and the decoding device 200 select the same motion vector and use it for coding and decoding. The merge index parameter may also be expressed as a merge vector index parameter or simply as an index. The merge index parameter indicates one of the multiple candidates in the motion vector candidate list, and it goes without saying that the motion vector candidate list is not limited to a merge mode motion vector candidate list.

[0205] Below, several specific aspects of inter prediction performed by the encoding device 100 and the decoding device 200 will be described.

[0206] [First mode of inter prediction] In this aspect, the maximum number of motion vector candidates in a motion vector candidate list, i.e., the maximum list size of the motion vector candidate list, adaptively depends on the partition size. The maximum list size may also be expressed as an upper limit size or simply as a list size.

[0207] Then, a merge index parameter for selecting one motion vector from the motion vector candidate list is coded into a bitstream by the coding device 100, and is decoded from the bitstream by the decoding device 200. In this case, the merge index parameter is coded by arithmetic coding and decoded by arithmetic decoding.

[0208] The coding size of the merge index parameter depends on the maximum number of motion vector candidates. In other words, the code amount of the merge index parameter depends on the maximum list size of the motion vector candidate list. When the maximum list size is a first list size smaller than a second list size, the merge index parameter is coded and decoded with fewer bits than when the maximum list size is the second list size.

[0209] For example, when the maximum list size is small, at least one of the upper and lower limits of the number of bits of the merge index parameter is lower than when the maximum list size is large.

[0210] FIG. 11 is a flowchart showing a first aspect of inter prediction performed by the encoding device 100 shown in FIG.

[0211] First, the inter prediction unit 126 of the encoding device 100 derives a maximum number based on the partition size of the current partition (S101). This maximum number is the maximum number of motion vector candidates for the motion vector used to predict the current partition. The inter prediction unit 126 derives a different maximum number based on the partition size. For example, the inter prediction unit 126 may derive a smaller maximum number for a large partition than for a small partition. That is, the inter prediction unit 126 may derive a larger maximum number for a small partition than for a large partition.

[0212] Next, the inter prediction unit 126 generates a motion vector candidate list by generating a plurality of motion vector candidates for the current partition up to the maximum number (S102). Then, the inter prediction unit 126 selects a motion vector for the current partition from the motion vector candidate list (S103).

[0213] Next, the entropy coding unit 110 of the coding device 100 codes a merge index parameter indicating the motion vector of the current partition from among the motion vector candidates in the motion vector candidate list, and then codes the merge index parameter into a bitstream based on the derived maximum number (S104).

[0214] For example, the entropy coding unit 110 binarizes the merge index parameter into a plurality of bits and encodes the plurality of bits using arithmetic coding. In the binarization and arithmetic coding methods, the merge index parameter can be expressed with fewer bits when the derived maximum number is small compared to when the derived maximum number is large.

[0215] Finally, the encoding apparatus 100 encodes the current partition using the selected motion vector (S105).

[0216] Specifically, the inter prediction unit 126 generates a predicted image for the current partition using the selected motion vector. The subtraction unit 104 derives a difference image between the original image and the predicted image for the current partition. The transformation unit 106 transforms the difference image into a plurality of transform coefficients. The quantization unit 108 quantizes the plurality of transform coefficients. The entropy coding unit 110 then encodes the quantized transform coefficients into a bitstream.

[0217] FIG. 12 is a flowchart showing a first mode of inter prediction performed by the decoding device 200 shown in FIG.

[0218] First, the inter prediction unit 218 of the decoding device 200 derives a maximum number based on the partition size of the current partition (S111). This maximum number is the maximum number of motion vector candidates for the motion vector used to predict the current partition. The inter prediction unit 218 derives different maximum numbers based on different partition sizes. For example, the inter prediction unit 218 may derive a smaller maximum number for a larger partition than for a smaller partition.

[0219] Next, the inter prediction unit 218 generates a motion vector candidate list by generating a plurality of motion vector candidates for the current partition up to the maximum number (S112). Furthermore, the entropy decoding unit 202 of the decoding device 200 decodes a merge index parameter from the bitstream based on the derived maximum number (S113). For example, the entropy decoding unit 202 decodes the merge index parameter using arithmetic decoding.

[0220] The merge index parameter indicates a motion vector for the current partition from among multiple motion vector candidates in the motion vector candidate list. The inter prediction unit 218 selects a motion vector for the current partition from the motion vector candidate list based on the merge index parameter (S114). The merge index parameter can be expressed with fewer bits when the maximum number is small in the binarization method or arithmetic coding method compared to when the maximum number is large.

[0221] Finally, the decoding device 200 decodes the current partition using the selected motion vector (S115).

[0222] Specifically, the inter prediction unit 218 generates a predicted image of the current partition using the selected motion vector. The entropy decoding unit 202 decodes the quantized transform coefficients from the bitstream, the inverse quantization unit 204 inverse quantizes the quantized transform coefficients, and the inverse transform unit 206 transforms the transform coefficients into a difference image. The addition unit 208 adds the difference image and the predicted image to reconstruct an image.

[0223] The motion vector candidate list includes a plurality of motion vector candidates for the motion vector of the target partition. The maximum number of motion vector candidates differs between two partitions having different partition sizes. That is, the two maximum list sizes of the two motion vector candidate lists generated for the two partitions having different partition sizes differ from each other.

[0224] 13 shows an example of the maximum number of motion vector candidates related to partition size. In this example, when the partition size of a first partition is larger than the partition size of a second partition, the maximum number of motion vector candidates for the first partition is smaller than the maximum number of motion vector candidates for the second partition.

[0225] This makes it more likely that the encoding device 100 and the decoding device 200 will be able to select an appropriate motion vector for a small partition from among a large number of motion vector candidates.

[0226] On the other hand, for a large partition, there is a possibility that an appropriate motion vector does not exist even among a large number of motion vector candidates. Therefore, the encoding device 100 and the decoding device 200 can contribute to reducing the amount of coding of indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a large partition.

[0227] 14 shows another example of the maximum number of motion vector candidates related to partition size. In this example, when the partition size of the first partition is larger than the partition size of the second partition, the maximum number of motion vector candidates for the first partition is larger than the maximum number of motion vector candidates for the second partition. That is, when the partition size of the first partition is smaller than the partition size of the second partition, the maximum number of motion vector candidates for the first partition is smaller than the maximum number of motion vector candidates for the second partition.

[0228] When small blocks are used, the total number of blocks increases. This may increase the total number of motion vectors, which may increase the amount of coding. In the example of Figure 14, the encoding device 100 and the decoding device 200 can suppress the increase in the amount of coding by using a motion vector candidate list with a small maximum list size for small partitions.

[0229] In this aspect, the maximum number of motion vector candidates for a motion vector is adaptively determined based on the partition size. This makes it possible to improve coding efficiency and optimize the amount of calculation. Furthermore, by using an appropriate prediction process, it is possible to improve image quality.

[0230] Note that the encoding device 100 and the decoding device 200 perform inter prediction in the same manner. At least a part of this aspect may be combined with at least a part of another aspect. Furthermore, the processes, elements, syntax, features, or any combination thereof in this aspect may be applied to other aspects.

[0231] Furthermore, not all of the processes described above may be included in the method, and not all of the elements may be included in the apparatus. That is, not all of the processes described above may be included in the method, and not all of the elements described above may be included in the apparatus.

[0232] [Second mode of inter prediction] In this aspect, the maximum number of motion vector candidates in a motion vector candidate list, i.e., the maximum list size of the motion vector candidate list, adaptively depends on the partition shape. The maximum list size may also be expressed as an upper limit size or simply as a list size.

[0233] Then, a merge index parameter for selecting one motion vector from the motion vector candidate list is coded into a bitstream by the coding device 100, and is decoded from the bitstream by the decoding device 200. In this case, the merge index parameter is coded by arithmetic coding and decoded by arithmetic decoding.

[0234] The coding size of the merge index parameter depends on the maximum number of motion vector candidates. In other words, the code amount of the merge index parameter depends on the maximum list size of the motion vector candidate list. When the maximum list size is a first list size smaller than a second list size, the merge index parameter is coded and decoded with fewer bits than when the maximum list size is the second list size.

[0235] For example, when the maximum list size is small, at least one of the upper and lower limits of the number of bits of the merge index parameter is lower than when the maximum list size is large.

[0236] FIG. 15 is a flowchart showing a second mode of inter prediction performed by the encoding device 100 shown in FIG.

[0237] First, the inter prediction unit 126 of the encoding device 100 derives a maximum number based on the partition shape of the current partition (S201). This maximum number is the maximum number of motion vector candidates for the motion vector used to predict the current partition. The inter prediction unit 126 derives different maximum numbers based on different partition shapes. For example, the inter prediction unit 126 may derive a smaller maximum number for a non-rectangular (triangular) shaped partition than for a rectangular shaped partition.

[0238] Next, the inter prediction unit 126 generates a motion vector candidate list by generating a plurality of motion vector candidates for the current partition up to the maximum number (S202). Then, the inter prediction unit 126 selects a motion vector for the current partition from the motion vector candidate list (S203).

[0239] Next, the entropy coding unit 110 of the coding device 100 codes a merge index parameter indicating the motion vector of the current partition from among the multiple motion vector candidates in the motion vector candidate list, and then codes the merge index parameter into a bitstream based on the derived maximum number (S204).

[0240] For example, the entropy coding unit 110 binarizes the merge index parameter into a plurality of bits and encodes the plurality of bits using arithmetic coding. In the binarization and arithmetic coding methods, the merge index parameter can be expressed with fewer bits when the derived maximum number is small compared to when the derived maximum number is large.

[0241] Finally, the encoding apparatus 100 encodes the current partition using the selected motion vector (S205).

[0242] Specifically, the inter prediction unit 126 generates a predicted image for the current partition using the selected motion vector. The subtraction unit 104 derives a difference image between the original image and the predicted image for the current partition. The transformation unit 106 transforms the difference image into a plurality of transform coefficients. The quantization unit 108 quantizes the plurality of transform coefficients. The entropy coding unit 110 then encodes the quantized transform coefficients into a bitstream.

[0243] FIG. 16 is a flowchart showing a second mode of inter prediction performed by the decoding device 200 shown in FIG.

[0244] First, the inter prediction unit 218 of the decoding device 200 derives a maximum number based on the partition shape of the current partition (S211). This maximum number is the maximum number of motion vector candidates for the motion vector used to predict the current partition. The inter prediction unit 218 derives different maximum numbers based on different partition shapes. For example, the inter prediction unit 218 may derive a smaller maximum number for a non-rectangular (triangular) shaped partition than for a rectangular shaped partition.

[0245] Next, the inter prediction unit 218 generates a motion vector candidate list by generating a plurality of motion vector candidates for the current partition up to the maximum number (S212). Furthermore, the entropy decoding unit 202 of the decoding device 200 decodes a merge index parameter from the bitstream based on the derived maximum number (S213). For example, the entropy decoding unit 202 decodes the merge index parameter using arithmetic decoding.

[0246] The merge index parameter indicates a motion vector for the current partition from among multiple motion vector candidates in the motion vector candidate list. The inter prediction unit 218 selects a motion vector for the current partition from the motion vector candidate list based on the merge index parameter (S214). The merge index parameter can be expressed with fewer bits when the maximum number is small in the binarization method or arithmetic coding method compared to when the maximum number is large.

[0247] Finally, the decoding device 200 decodes the current partition using the selected motion vector (S215).

[0248] Specifically, the inter prediction unit 218 generates a predicted image of the current partition using the selected motion vector. The entropy decoding unit 202 decodes the quantized transform coefficients from the bitstream, the inverse quantization unit 204 inverse quantizes the quantized transform coefficients, and the inverse transform unit 206 transforms the transform coefficients into a difference image. The addition unit 208 adds the difference image and the predicted image to reconstruct an image.

[0249] The motion vector candidate list includes multiple motion vector candidates for the motion vector of the target partition. The maximum number of motion vector candidates differs between two partitions having different partition shapes. That is, the two maximum list sizes of the two motion vector candidate lists generated for the two partitions having different partition shapes differ from each other.

[0250] 17 shows an example of the maximum number of motion vector candidates associated with partition shapes, where the maximum number of motion vector candidates for triangular partitions is smaller than the maximum number of motion vector candidates for rectangular partitions.

[0251] This makes it more likely that the encoding device 100 and the decoding device 200 will be able to select an appropriate motion vector for a rectangular partition from among a large number of motion vector candidates.

[0252] On the other hand, there may be few processed partitions around the triangular partition that can be referenced, and therefore there may be few motion vector candidates that can be derived. Therefore, the encoding device 100 and the decoding device 200 can contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for the triangular partition.

[0253] However, in cases where a partition adjacent to the hypotenuse of a triangular partition is available, there may be many referenceable, processed partitions around the triangular partition, and therefore many derivable motion vector candidates. Therefore, the maximum number of motion vector candidates for a triangular partition is not limited to the example in FIG. 17 and may be greater than the maximum number of motion vector candidates for a rectangular partition.

[0254] 18 shows another example of the maximum number of motion vector candidates related to partition shape, where the maximum number of motion vector candidates for rectangular (non-square) partitions is greater than the maximum number of motion vector candidates for square partitions.

[0255] This allows the encoding device 100 and the decoding device 200 to select an appropriate motion vector from a large number of motion vector candidates for a partition with a complex shape. On the other hand, the encoding device 100 and the decoding device 200 can simplify processing by using a motion vector candidate list with a small maximum list size for a partition with a simple shape. This also allows the encoding device 100 and the decoding device 200 to contribute to reducing the amount of code for indexes that point to motion vectors.

[0256] Furthermore, for example, rectangular (non-square) partitions are assumed to have different characteristics between their long and short sides. Therefore, it is assumed that it is effective to derive a relatively large number of motion vector candidates from multiple partitions adjacent to these partitions and select a motion vector from the relatively large number of motion vector candidates. On the other hand, it is assumed that square partitions do not have the same characteristics as rectangular (non-square) partitions, and it is assumed that it is effective to simplify the processing.

[0257] However, for complex partitions, there is a possibility that no suitable motion vector exists even among a large number of motion vector candidates. Therefore, for complex partitions, it may be effective to use a motion vector candidate list with a small maximum list size to reduce the amount of coding for indexes pointing to motion vectors. Therefore, the maximum number of motion vector candidates for rectangular (non-square) partitions is not limited to the example of FIG. 18, and may be smaller than the maximum number of motion vector candidates for square partitions.

[0258] In this aspect, the maximum number of motion vector candidates for a motion vector is adaptively determined based on the partition shape. This makes it possible to improve coding efficiency and optimize the amount of calculation. Furthermore, by using an appropriate prediction process, it is possible to improve image quality.

[0259] Note that the encoding device 100 and the decoding device 200 perform inter prediction in the same manner. At least a part of this aspect may be combined with at least a part of another aspect. Furthermore, the processes, elements, syntax, features, or any combination thereof in this aspect may be applied to other aspects.

[0260] Furthermore, not all of the processes described above may be included in the method, and not all of the elements may be included in the apparatus. That is, not all of the processes described above may be included in the method, and not all of the elements described above may be included in the apparatus.

[0261] [Third aspect of inter prediction] In this aspect, the order of the multiple motion vector candidates in the motion vector candidate list, i.e., the candidate order of the motion vector candidate list, depends on the partition size. The multiple motion vector candidates may be derived in an initial order and rearranged based on the partition size.

[0262] A merge index parameter for selecting one motion vector from the motion vector candidate list is coded into a bitstream by the coding device 100 and decoded from the bitstream by the decoding device 200. In this case, the merge index parameter is coded by arithmetic coding and decoded by arithmetic decoding.

[0263] The encoding size of the merge index parameter depends on the position of the motion vector candidate to which it points in the candidate order of the motion vector candidate list: a merge index parameter that points to an earlier motion vector candidate in the candidate order of the motion vector candidate list is encoded and decoded using fewer bits than a merge index parameter that points to a later motion vector candidate.

[0264] FIG. 19 is a flowchart showing a third mode of inter prediction performed by the encoding device 100 shown in FIG.

[0265] First, the inter prediction unit 126 of the encoding device 100 generates, for a current partition, a motion vector candidate list including multiple motion vector candidates whose order depends on the partition size (S301). For example, the inter prediction unit 126 may generate a motion vector candidate list for a large partition including multiple motion vector candidates in a different order from that for a small partition.

[0266] Next, the inter prediction unit 126 selects a motion vector for the partition to be processed from the motion vector candidate list (S302).

[0267] Next, the entropy coding unit 110 of the coding device 100 encodes, into a bitstream, a merge index parameter indicating the motion vector of the target partition from among the motion vector candidates in the motion vector candidate list (S303). For example, the entropy coding unit 110 binarizes the merge index parameter into multiple bits and encodes the multiple bits using arithmetic coding.

[0268] Finally, the encoding apparatus 100 encodes the current partition using the selected motion vector (S304).

[0269] Specifically, the inter prediction unit 126 generates a predicted image for the current partition using the selected motion vector. The subtraction unit 104 derives a difference image between the original image and the predicted image for the current partition. The transformation unit 106 transforms the difference image into a plurality of transform coefficients. The quantization unit 108 quantizes the plurality of transform coefficients. The entropy coding unit 110 then encodes the quantized transform coefficients into a bitstream.

[0270] FIG. 20 is a flowchart showing a third mode of inter prediction performed by the decoding device 200 shown in FIG.

[0271] First, the inter prediction unit 218 of the decoding device 200 generates, for a current partition, a motion vector candidate list including multiple motion vector candidates whose order depends on the partition size (S311). For example, the inter prediction unit 218 may generate, for a large partition, a motion vector candidate list including multiple motion vector candidates in an order different from that of a small partition.

[0272] Next, the entropy decoding unit 202 of the decoding device 200 decodes, from the bitstream, a merge index parameter indicating the motion vector of the target partition among the multiple motion vector candidates in the motion vector candidate list (S312). For example, the entropy decoding unit 202 decodes the merge index parameter using arithmetic decoding.

[0273] Then, the inter prediction unit 218 selects a motion vector for the partition to be processed from the motion vector candidate list based on the merge index parameter (S313).

[0274] Finally, the decoding device 200 decodes the current partition using the selected motion vector (S314).

[0275] Specifically, the inter prediction unit 218 generates a predicted image of the current partition using the selected motion vector. The entropy decoding unit 202 decodes the quantized transform coefficients from the bitstream, the inverse quantization unit 204 inverse quantizes the quantized transform coefficients, and the inverse transform unit 206 transforms the transform coefficients into a difference image. The addition unit 208 adds the difference image and the predicted image to reconstruct an image.

[0276] As described above, a motion vector candidate list generated for a partition includes multiple motion vector candidates for the motion vector of the partition, and the candidate orders are different between two motion vector candidate lists generated for two partitions with different partition sizes.

[0277] Figure 21 shows an example of candidate ordering related to partition size, where the candidate ordering differs between large and small partitions.

[0278] Figure 22 shows another example of candidate ordering related to partition size, where the candidate ordering differs between MxM / 2 blocks and MxM square blocks.

[0279] In this aspect, the order of multiple motion vector candidates for a motion vector is adaptively determined based on the partition size, thereby improving coding efficiency.

[0280] Note that the encoding device 100 and the decoding device 200 perform inter prediction in the same manner. At least a part of this aspect may be combined with at least a part of another aspect. Furthermore, the processes, elements, syntax, features, or any combination thereof in this aspect may be applied to other aspects.

[0281] Furthermore, not all of the processes described above may be included in the method, and not all of the elements may be included in the apparatus. That is, not all of the processes described above may be included in the method, and not all of the elements described above may be included in the apparatus.

[0282] [Fourth aspect of inter prediction] In this aspect, the order of the multiple motion vector candidates in the motion vector candidate list, i.e., the candidate order of the motion vector candidate list, depends on the partition shape. The multiple motion vector candidates may be derived in an initial order and then rearranged based on the partition shape.

[0283] A merge index parameter for selecting one motion vector from the motion vector candidate list is coded into a bitstream by the coding device 100 and decoded from the bitstream by the decoding device 200. In this case, the merge index parameter is coded by arithmetic coding and decoded by arithmetic decoding.

[0284] The encoding size of the merge index parameter depends on the position of the motion vector candidate to which it points in the candidate order of the motion vector candidate list: a merge index parameter that points to an earlier motion vector candidate in the candidate order of the motion vector candidate list is encoded and decoded using fewer bits than a merge index parameter that points to a later motion vector candidate.

[0285] FIG. 23 is a flowchart showing a fourth mode of inter prediction performed by the encoding device 100 shown in FIG.

[0286] First, the inter prediction unit 126 of the encoding device 100 generates, for a current partition, a motion vector candidate list including multiple motion vector candidates whose order depends on the partition shape (S401). For example, for a non-rectangular (triangular) shape partition, the inter prediction unit 126 may generate a motion vector candidate list including multiple motion vector candidates in an order different from that for a rectangular shape partition.

[0287] Next, the inter prediction unit 126 selects a motion vector for the partition to be processed from the motion vector candidate list (S402).

[0288] Next, the entropy coding unit 110 of the coding device 100 encodes, into a bitstream, a merge index parameter indicating the motion vector of the target partition from among the motion vector candidates in the motion vector candidate list (S403). For example, the entropy coding unit 110 binarizes the merge index parameter into multiple bits and encodes the multiple bits using arithmetic coding.

[0289] Finally, the encoding apparatus 100 encodes the current partition using the selected motion vector (S404).

[0290] Specifically, the inter prediction unit 126 generates a predicted image for the current partition using the selected motion vector. The subtraction unit 104 derives a difference image between the original image and the predicted image for the current partition. The transformation unit 106 transforms the difference image into a plurality of transform coefficients. The quantization unit 108 quantizes the plurality of transform coefficients. The entropy coding unit 110 then encodes the quantized transform coefficients into a bitstream.

[0291] FIG. 24 is a flowchart showing a fourth mode of inter prediction performed by the decoding device 200 shown in FIG.

[0292] First, the inter prediction unit 218 of the decoding device 200 generates, for a current partition, a motion vector candidate list including multiple motion vector candidates whose order depends on the partition shape (S411). For example, for a non-rectangular (triangular) shape partition, the inter prediction unit 218 may generate a motion vector candidate list including multiple motion vector candidates in an order different from that for a rectangular shape partition.

[0293] Next, the entropy decoding unit 202 of the decoding device 200 decodes, from the bitstream, a merge index parameter indicating the motion vector of the target partition among the multiple motion vector candidates in the motion vector candidate list (S412). For example, the entropy decoding unit 202 decodes the merge index parameter using arithmetic decoding.

[0294] Then, the inter prediction unit 218 selects a motion vector for the partition to be processed from the motion vector candidate list based on the merge index parameter (S413).

[0295] Finally, the decoding device 200 decodes the current partition using the selected motion vector (S414).

[0296] Specifically, the inter prediction unit 218 generates a predicted image of the current partition using the selected motion vector. The entropy decoding unit 202 decodes the quantized transform coefficients from the bitstream, the inverse quantization unit 204 inverse quantizes the quantized transform coefficients, and the inverse transform unit 206 transforms the transform coefficients into a difference image. The addition unit 208 adds the difference image and the predicted image to reconstruct an image.

[0297] As described above, a motion vector candidate list generated for a partition includes multiple motion vector candidates for the motion vector of the partition, and the candidate orders are different between the two motion vector candidate lists generated for the two partitions with different partition shapes.

[0298] Figure 25 shows an example of candidate ordering associated with partition shapes, where the candidate ordering differs between rectangular shape partitions and triangle partitions.

[0299] FIG. 26 shows another example of candidate order related to partition shape. In this example, the candidate order differs between M×N blocks and N×M blocks. Even if the partition shapes of two partitions are the same except for the orientation, the candidate order may be different if the orientations of the partition shapes are different. In other words, the candidate order may depend on the orientation of the partition shape. In other words, the candidate order may depend on the partition shape that has orientation as an attribute.

[0300] 26 shows an example, and the candidate order may not depend on the orientation of the partition shape. In other words, the candidate order may depend on the partition shape that does not have orientation as an attribute. For example, if two partitions have the same partition shape, the candidate order may be the same even if the orientations of the partition shapes are different.

[0301] In this aspect, the order of multiple motion vector candidates for a motion vector is adaptively determined based on the partition shape, thereby improving coding efficiency.

[0302] Note that the encoding device 100 and the decoding device 200 perform inter prediction in the same manner. At least a part of this aspect may be combined with at least a part of another aspect. Furthermore, the processes, elements, syntax, features, or any combination thereof in this aspect may be applied to other aspects.

[0303] Furthermore, not all of the processes described above may be included in the method, and not all of the elements may be included in the apparatus. That is, not all of the processes described above may be included in the method, and not all of the elements described above may be included in the apparatus.

[0304] [Implementation example] 27 is a block diagram showing an example implementation of the encoding device 100. The encoding device 100 includes a circuit 160 and a memory 162. For example, several components of the encoding device 100 shown in FIG. 1 are implemented by the circuit 160 and memory 162 shown in FIG.

[0305] The circuit 160 is an electronic circuit that can access the memory 162 and performs information processing. For example, the circuit 160 is a dedicated or general-purpose electronic circuit that encodes moving images using the memory 162. The circuit 160 may be a processor such as a CPU. Alternatively, the circuit 160 may be a collection of multiple electronic circuits.

[0306] Also, for example, circuit 160 may function as multiple components of encoding device 100 shown in Fig. 1, excluding the components for storing information. That is, circuit 160 may perform the operations described above as the operations of these components.

[0307] The memory 162 is a dedicated or general-purpose memory that stores information for encoding video by the circuit 160. The memory 162 may be an electronic circuit, connected to the circuit 160, or included in the circuit 160.

[0308] Furthermore, memory 162 may be a collection of multiple electronic circuits or may be composed of multiple sub-memories. Furthermore, memory 162 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage or a recording medium, etc. Furthermore, memory 162 may be a non-volatile memory or a volatile memory.

[0309] For example, the memory 162 may serve as a component for storing information among the multiple components of the encoding device 100 shown in Fig. 1. Specifically, the memory 162 may serve as the block memory 118 and the frame memory 122 shown in Fig. 1.

[0310] The memory 162 may store a video to be encoded, or a bit string corresponding to the encoded video, and may also store a program for the circuit 160 to encode the video.

[0311] Note that not all of the components shown in Fig. 1 need to be implemented in the encoding device 100, and not all of the processes described above need to be performed. Some of the components shown in Fig. 1 may be included in another device, and some of the processes described above may be executed by another device. Then, by implementing some of the components shown in Fig. 1 and performing some of the processes described above in the encoding device 100, information for prediction can be appropriately constructed.

[0312] Fig. 28 is a flowchart showing an example of the operation of the encoding device 100 shown in Fig. 27. For example, when the encoding device 100 encodes a moving image into a bitstream using a predicted image, the circuit 160 in the encoding device 100 performs the operation shown in Fig. 28 using the memory 162.

[0313] First, the circuit 160 generates a list including a plurality of candidates for a first motion vector of a first partition in a video (S501). The plurality of candidates included in this list include candidates derived from a second motion vector of a second partition different from the first partition in the video. Furthermore, at least one of the maximum list size of this list and the order of the plurality of candidates included in this list depends on at least one of the partition size and partition shape of the first partition.

[0314] Next, the circuit 160 selects a first motion vector from the candidates included in the list (S502). The circuit 160 also encodes an index indicating the first motion vector from the candidates included in the list based on the maximum list size into a bitstream (S503). The circuit 160 then generates a predicted image of the first partition using the first motion vector (S504).

[0315] This allows the encoding device 100 to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, the encoding device 100 can generate an appropriate candidate list based on the partition size or partition shape. That is, the encoding device 100 can appropriately construct information for prediction. Therefore, the encoding device 100 can contribute to reducing the amount of coding.

[0316] For example, if the partition size is a first partition size, the maximum list size may be the first list size, and if the partition size is a second partition size that is smaller than the first partition size, the maximum list size may be a second list size that is larger than the first list size.

[0317] This allows the encoding device 100 to select an appropriate motion vector for a small partition from among a large number of motion vector candidates. On the other hand, for a large partition, there is a possibility that an appropriate motion vector does not exist even among the large number of motion vector candidates. Therefore, the encoding device 100 can contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a large partition.

[0318] For example, if the partition size is a first partition size, the maximum list size may be the first list size, and if the partition size is a second partition size that is smaller than the first partition size, the maximum list size may be a second list size that is smaller than the first list size.

[0319] This allows the encoding device 100 to select an appropriate motion vector for a large partition from among a large number of motion vector candidates. On the other hand, the encoding device 100 can simplify processing and contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a small partition.

[0320] Also, for example, the maximum list size may depend on the partition shape, which is one of a square, a rectangle, and a triangle, so that the encoding device 100 can generate an appropriate candidate list based on the partition shape, which is a square, a rectangle, or a triangle.

[0321] Also, for example, if the partition shape is a triangle, the maximum list size may be the first list size, and if the partition shape is not a triangle, the maximum list size may be a second list size that is larger than the first list size.

[0322] This allows the encoding device 100 to select an appropriate motion vector for a rectangular partition from a large number of motion vector candidates. On the other hand, there may be few referenceable, processed partitions around a triangular partition, and therefore few motion vector candidates that can be derived. Therefore, by using a motion vector candidate list with a small maximum list size for a triangular partition, the encoding device 100 can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0323] Also, for example, if the partition shape is square, the maximum list size may be the first list size, and if the partition shape is not square, the maximum list size may be a second list size that is larger than the first list size.

[0324] This allows the encoding device 100 to select an appropriate motion vector from among a large number of motion vector candidates for a partition with a complex shape. On the other hand, the encoding device 100 can simplify processing and contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a partition with a simple shape.

[0325] Furthermore, for example, when the maximum list size is a first list size, the circuit 160 may encode the index with a first number of bits. Then, when the maximum list size is a second list size that is larger than the first list size, the circuit 160 may encode the index with a second number of bits that is larger than the first number of bits. In this way, the encoding device 100 can encode the index with an appropriate number of bits based on the maximum list size.

[0326] Also, for example, the second partition may be a partition adjacent to the first partition.

[0327] This allows the encoding device 100 to derive candidates for the motion vector of the partition to be processed from the motion vectors of partitions adjacent to the partition to be processed. Therefore, the encoding device 100 can appropriately derive candidates for the motion vector of the partition to be processed from motion vectors that are assumed to be similar to the motion vector of the partition to be processed.

[0328] 29 is a block diagram showing an implementation example of the decoding device 200. The decoding device 200 includes a circuit 260 and a memory 262. For example, several components of the decoding device 200 shown in FIG. 10 are implemented by the circuit 260 and memory 262 shown in FIG.

[0329] The circuit 260 is an electronic circuit that can access the memory 262 and performs information processing. For example, the circuit 260 is a dedicated or general-purpose electronic circuit that decodes video using the memory 262. The circuit 260 may be a processor such as a CPU. Alternatively, the circuit 260 may be a collection of multiple electronic circuits.

[0330] Also, for example, the circuit 260 may function as multiple components of the decoding device 200 shown in Fig. 10 , excluding the components for storing information. That is, the circuit 260 may perform the operations described above as the operations of these components.

[0331] The memory 262 is a dedicated or general-purpose memory that stores information for decoding video by the circuit 260. The memory 262 may be an electronic circuit, connected to the circuit 260, or included in the circuit 260.

[0332] Furthermore, the memory 262 may be a collection of multiple electronic circuits, or may be composed of multiple sub-memories. Furthermore, the memory 262 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage or a recording medium, etc. Furthermore, the memory 262 may be a non-volatile memory or a volatile memory.

[0333] For example, the memory 262 may serve as a component for storing information among the multiple components of the decoding device 200 shown in Fig. 10. Specifically, the memory 262 may serve as the block memory 210 and the frame memory 214 shown in Fig. 10.

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

[0335] Note that not all of the components shown in Fig. 10 need to be implemented in the decoding device 200, and not all of the processes described above need to be performed. Some of the components shown in Fig. 10 may be included in another device, and some of the processes described above may be executed by another device. Then, by implementing some of the components shown in Fig. 10 and performing some of the processes described above in the decoding device 200, information for prediction can be appropriately constructed.

[0336] Fig. 30 is a flowchart showing an example of the operation of the decoding device 200 shown in Fig. 29. For example, when the decoding device 200 decodes a moving image from a bitstream using a predicted image, the circuit 260 in the decoding device 200 performs the operation shown in Fig. 30 using the memory 262.

[0337] First, the circuit 260 generates a list including a plurality of candidates for a first motion vector of a first partition in a video (S511). The plurality of candidates included in this list include candidates derived from a second motion vector of a second partition different from the first partition in the video. Furthermore, at least one of the maximum list size of this list and the order of the plurality of candidates included in this list depends on at least one of the partition size and partition shape of the first partition.

[0338] The circuit 260 also decodes from the bitstream an index indicating a first motion vector among the candidates included in the list based on the maximum list size (S512). Next, the circuit 260 uses the index to select a first motion vector from the candidates included in the list (S513). Then, the circuit 260 generates a predicted image of the first partition using the first motion vector (S514).

[0339] This allows the decoding device 200 to generate a motion vector candidate list with a maximum list size or candidate order that depends on the partition size or partition shape. Therefore, the decoding device 200 can generate an appropriate candidate list based on the partition size or partition shape. That is, the decoding device 200 can appropriately construct information for prediction. Therefore, the decoding device 200 can contribute to reducing the amount of coding.

[0340] For example, if the partition size is a first partition size, the maximum list size may be the first list size, and if the partition size is a second partition size that is smaller than the first partition size, the maximum list size may be a second list size that is larger than the first list size.

[0341] This allows the decoding device 200 to select an appropriate motion vector for a small partition from among a large number of motion vector candidates. On the other hand, for a large partition, there is a possibility that an appropriate motion vector does not exist even among the large number of motion vector candidates. Therefore, the decoding device 200 can contribute to reducing the amount of coding of indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a large partition.

[0342] For example, if the partition size is a first partition size, the maximum list size may be the first list size, and if the partition size is a second partition size that is smaller than the first partition size, the maximum list size may be a second list size that is smaller than the first list size.

[0343] This allows the decoding device 200 to select an appropriate motion vector for a large partition from among a large number of motion vector candidates. On the other hand, the decoding device 200 can simplify processing and contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a small-shaped partition.

[0344] Also, for example, the maximum list size may depend on the partition shape, which is one of a square, a rectangle, and a triangle, so that the decoding device 200 can generate an appropriate candidate list based on the partition shape, which is a square, a rectangle, or a triangle.

[0345] Also, for example, if the partition shape is a triangle, the maximum list size may be the first list size, and if the partition shape is not a triangle, the maximum list size may be a second list size that is larger than the first list size.

[0346] This allows the decoding device 200 to select an appropriate motion vector for a rectangular partition from a large number of motion vector candidates. On the other hand, there may be few referenceable, processed partitions around a triangular partition, and therefore few derivable motion vector candidates. Therefore, by using a motion vector candidate list with a small maximum list size for a triangular partition, the decoding device 200 can contribute to reducing the amount of coding for indexes that point to motion vectors.

[0347] Also, for example, if the partition shape is square, the maximum list size may be the first list size, and if the partition shape is not square, the maximum list size may be a second list size that is larger than the first list size.

[0348] This allows the decoding device 200 to select an appropriate motion vector from among a large number of motion vector candidates for a partition with a complex shape. On the other hand, the decoding device 200 can simplify processing and contribute to reducing the amount of coding for indexes that point to motion vectors by using a motion vector candidate list with a small maximum list size for a partition with a simple shape.

[0349] Furthermore, for example, when the maximum list size is a first list size, the circuit 260 may decode the index using a first number of bits. Then, when the maximum list size is a second list size larger than the first list size, the circuit 260 may decode the index using a second number of bits larger than the first number of bits. This allows the decoding device 200 to decode the index using an appropriate number of bits based on the maximum list size.

[0350] Also, for example, the second partition may be a partition adjacent to the first partition.

[0351] This allows decoding device 200 to derive candidates for the motion vector of the partition to be processed from the motion vectors of partitions adjacent to the partition to be processed. Therefore, decoding device 200 can appropriately derive candidates for the motion vector of the partition to be processed from motion vectors that are assumed to be similar to the motion vector of the partition to be processed.

[0352] [supplement] The encoding device 100 and the decoding device 200 in this embodiment may be used as an image encoding device and an image decoding device, or as a video encoding device and a video decoding device, respectively.

[0353] Alternatively, each of the encoding device 100 and the decoding device 200 may be used as a prediction device or an inter-prediction device. That is, the encoding device 100 and the decoding device 200 may correspond only to the inter-prediction unit 126 and the inter-prediction unit 218, respectively. Other components, such as the entropy encoding unit 110 or the entropy decoding unit 202, may be included in other devices.

[0354] Furthermore, at least a part of this embodiment may be used as an encoding method, a decoding method, a prediction method, or any other method.

[0355] In the above description, for the motion vectors used to encode the target partition, the maximum list size or candidate order of the motion vector candidate list depends on the partition size and partition shape of the target partition.

[0356] However, for a predicted motion vector for encoding a motion vector of a target partition, the maximum list size or candidate order of the predicted motion vector candidate list may depend on the partition size or partition shape of the target partition. That is, the motion vector may be replaced with a predicted motion vector. For example, in this case, encoding and decoding of a differential motion vector, which is a difference between the motion vector and the predicted motion vector, is performed.

[0357] In addition, in this embodiment, each component may be configured with dedicated hardware, or may be realized by executing a software program suitable for each component. Each component may be realized by a program execution unit such as a CPU or processor reading and executing a software program recorded on a recording medium such as a hard disk or semiconductor memory.

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

[0359] The processing circuit includes at least one of dedicated hardware and a program execution unit, and executes processing using a storage device. If the processing circuit includes a program execution unit, the storage device stores the software program executed by the program execution unit.

[0360] Here, the software for realizing the encoding device 100 or the decoding device 200 according to the present embodiment is the following program.

[0361] For example, this program may cause a computer to execute an encoding method for encoding a video into a bitstream using a predicted image, the encoding method including the steps of: generating a list including multiple candidates for a first motion vector of a first partition in the video, where the multiple candidates included in the list include candidates derived from a second motion vector of a second partition in the video that is different from the first partition, and at least one of a maximum list size of the list and an order of the multiple candidates included in the list depends on at least one of a partition size and a partition shape of the first partition; selecting the first motion vector from the multiple candidates included in the list; encoding an index indicating the first motion vector from among the multiple candidates included in the list into the bitstream based on the maximum list size; and generating the predicted image of the first partition using the first motion vector.

[0362] Furthermore, for example, this program may cause a computer to execute a decoding method for decoding a video from a bitstream using a predicted image, the decoding method including the steps of: generating a list including multiple candidates for a first motion vector of a first partition in the video, wherein the multiple candidates included in the list include a candidate derived from a second motion vector of a second partition in the video that is different from the first partition; and at least one of a maximum list size of the list and an order of the multiple candidates included in the list depending on at least one of a partition size and a partition shape of the first partition; decoding an index indicating the first motion vector from the bitstream based on the maximum list size; selecting the first motion vector from the multiple candidates included in the list using the index; and generating the predicted image of the first partition using the first motion vector.

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

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

[0365] Furthermore, the ordinal numbers such as first and second used in the description may be changed as appropriate. Furthermore, new ordinal numbers may be assigned to components or removed.

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

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

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

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

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

[0371] Furthermore, here, we will explain application examples of the video coding method (image coding method) or video decoding method (image decoding method) shown in each of the above embodiments and a system using the same. The system is characterized by having an image coding device using the image coding method, an image decoding device using the image decoding method, and an image coding / decoding device that includes both. Other components of the system can be appropriately changed depending on the situation.

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

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

[0374] Note that wireless access points, hotspots, etc. may be used instead of the base stations ex106 to ex110. Furthermore, the streaming server ex103 may be directly connected to the communication network ex104 without going through the Internet ex101 or the Internet service provider ex102, or may be directly connected to an airplane ex117 without going through a satellite ex116.

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

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

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

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

[0379] [Distributed processing] The streaming server ex103 may also be multiple servers or multiple computers that process, record, and distribute data in a distributed manner. For example, the streaming server ex103 may be implemented as a CDN (Content Delivery Network), where content distribution is achieved through a network connecting numerous edge servers distributed around the world. In a CDN, a physically nearby edge server is dynamically assigned depending on the client. Content is then cached and distributed to that edge server, thereby reducing delays. Furthermore, if an error occurs or communication conditions change due to increased traffic, processing can be distributed among multiple edge servers, the distribution entity can be switched to another edge server, or distribution can be continued by bypassing the affected network portion, thereby achieving high-speed and stable distribution.

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

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

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

[0383] Furthermore, since multiple pieces of video data are of nearly the same scene, the server may manage and / or instruct the video data shot by each terminal to be mutually referenced. Alternatively, the server may receive encoded data from each terminal and change the reference relationships between multiple pieces of data, or correct or replace the pictures themselves and re-encode them. This allows for the generation of streams with improved quality and efficiency for each piece of data.

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

[0385] In this way, the encoding process can be performed by a terminal or one or more servers. Therefore, although the following uses terms such as "server" or "terminal" to refer to the entity performing the process, some or all of the processing performed by the server may be performed by the terminal, and some or all of the processing performed by the terminal may be performed by the server. The same applies to the decoding process.

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

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

[0388] In this way, users can enjoy scenes by selecting any video corresponding to each camera device, or can enjoy content in which video from any viewpoint is extracted from 3D data reconstructed using multiple images or videos. Furthermore, like the video, sound may also be collected from multiple different angles, and the server may multiplex and transmit sound from a specific angle or space in accordance with the video.

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

[0390] In the case of AR images, the server superimposes virtual object information in virtual space onto camera information in real space based on the 3D position or the user's viewpoint movement. The decoding device may acquire or store virtual object information and 3D data, generate a 2D image according to the user's viewpoint movement, and smoothly connect the images to create superimposed data. Alternatively, the decoding device may send the user's viewpoint movement to the server in addition to a request for virtual object information, and the server may create superimposed data based on the viewpoint movement received from the 3D data stored on the server, encode the superimposed data, and distribute it to the decoding device. Note that the superimposed data may also have an α value indicating transparency in addition to RGB, and the server may set the α value of parts other than the object created from the 3D data to 0, etc., to encode the parts in a transparent state. Alternatively, the server may generate data by setting a predetermined RGB value as the background, like a chromakey, and using the background color for parts other than the object.

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

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

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

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

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

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

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

[0398] When a link image is selected by a user, the display device decodes the base layer with the highest priority. If the HTML constituting the web page contains information indicating that the content is scalable, the display device may decode up to the enhancement layer. To ensure real-time performance, before a selection is made or when the communication bandwidth is very limited, the display device decodes and displays only forward-referenced pictures (I-pictures, P-pictures, and forward-reference-only B-pictures), thereby reducing the delay between the decoding time of the first picture and the display time (the delay from the start of content decoding to the start of display). Alternatively, the display device may intentionally ignore the picture reference relationships and roughly decode all B-pictures and P-pictures using forward reference, and then perform normal decoding as the number of received pictures increases over time.

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

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

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

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

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

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

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

[0406] [Other use cases] Furthermore, these encoding or decoding processes are generally performed by the LSIex500 possessed by each terminal. The LSIex500 may be a single chip or may be configured with multiple chips. It is also possible to incorporate video encoding or decoding software into some kind of recording medium (such as a CD-ROM, flexible disk, or hard disk) that can be read by the computer ex111, and perform the encoding or decoding process using that software. Furthermore, if the smartphone ex115 is equipped with a camera, video data captured by the camera may be transmitted. This video data is data that has been encoded by the LSIex500 possessed by the smartphone ex115.

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

[0408] Furthermore, at least one of the video encoding device (image encoding device) or video decoding device (image decoding device) of each of the above embodiments can be incorporated into a digital broadcasting system, not limited to the content supply system ex100 via the Internet ex101. Since multiplexed data in which video and audio are multiplexed is transmitted and received over broadcast radio waves using a satellite or the like, the content supply system ex100 is more suited to multicast than the content supply system ex100, which is more suited to unicast, but similar applications are possible with regard to encoding and decoding processes.

[0409] [Hardware configuration] FIG. 36 is a diagram illustrating a smartphone ex115. FIG. 37 is a diagram illustrating an example configuration of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of capturing video and still images, and a display unit ex458 for displaying video captured by the camera unit ex465 and decoded data of the video and other data received by the antenna ex450. The smartphone ex115 further includes an operation unit ex466 such as a touch panel, an audio output unit ex457 such as a speaker for outputting voice or sound, an audio input unit ex456 such as a microphone for inputting voice, a memory unit ex467 capable of storing encoded data or decoded data such as captured video or still images, recorded audio, received video or still images, and email, and a slot unit ex464 that serves as an interface with a SIM ex468 for identifying users and authenticating access to various data, including networks. In addition, an external memory may be used instead of the memory unit ex467.

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

[0411] When the power key is turned on by a user, the power supply circuit unit ex461 supplies power from the battery pack to each unit, thereby starting up the smartphone ex115 into an operational state.

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

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

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

[0415] While the main control unit ex460, which includes a CPU, controls the encoding and decoding processes, devices often also include a GPU. Therefore, a configuration is possible in which a memory shared by the CPU and GPU, or a memory with addresses managed for common use, is used to take advantage of the GPU's performance and process a large area at once. This shortens encoding time, ensures real-time performance, and achieves low latency. It is particularly efficient to perform motion estimation, deblocking filtering, SAO (Sample Adaptive Offset), and transformation and quantization processes at a picture level or other unit in the GPU rather than the CPU. [Industrial Applicability]

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

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

Claims

1. 1. A coding device that codes a moving image into a bitstream using a predicted image, comprising: The circuit and a memory; The circuit uses the memory to: generating a motion vector candidate list for a current block of each picture included in the video, selecting a motion vector for the current block from the motion vector candidate list based on an index parameter, and generating a predicted image for the current block using the selected motion vector; the motion vector candidate list includes a plurality of motion vector candidates for the motion vector of the current block; deriving a first maximum number of the plurality of motion vector candidates in response to the current block being a rectangular block; deriving a second maximum number of the plurality of motion vector candidates different from the first maximum number in response to the current block being a non-rectangular block; generating the derived first or second maximum number of motion vector candidate lists for the current block; the candidates in the motion vector candidate list for the current block are derived from motion vectors for adjacent blocks adjacent to the current block; Encoding device.

2. A decoding device that decodes a moving image from a bitstream using a predicted image, comprising: The circuit and a memory; The circuit uses the memory to: generating a motion vector candidate list for a current block of each picture included in the video, selecting a motion vector for the current block from the motion vector candidate list based on an index parameter decoded from the bitstream, and generating a predicted image for the current block using the selected motion vector; the motion vector candidate list includes a plurality of motion vector candidates for the motion vector of the current block; deriving a first maximum number of the plurality of motion vector candidates in response to the current block being a rectangular block; deriving a second maximum number of the plurality of motion vector candidates different from the first maximum number in response to the current block being a non-rectangular block; generating the derived first or second maximum number of motion vector candidate lists for the current block; the candidates in the motion vector candidate list for the current block are derived from motion vectors for adjacent blocks adjacent to the current block; Decryption device.

3. The circuit and a memory; The circuit uses the memory to: generating a motion vector candidate list for a block to be processed of each picture included in a moving image, selecting a motion vector for the block to be processed from the motion vector candidate list based on an index parameter, and generating a predicted image for the block to be processed using the selected motion vector; the motion vector candidate list includes a plurality of motion vector candidates for the motion vector of the current block; deriving a first maximum number of the plurality of motion vector candidates in response to the current block being a rectangular block; deriving a second maximum number of the plurality of motion vector candidates different from the first maximum number in response to the current block being a non-rectangular block; generating the derived first or second maximum number of motion vector candidate lists for the current block; Transmitting a bitstream obtained by encoding the video using the predicted image; the candidates in the motion vector candidate list for the current block are derived from motion vectors for adjacent blocks adjacent to the current block; A bitstream transmitter.

Images