WO2019163795A1 - Dispositif de codage, et procédé de codage - Google Patents

Dispositif de codage, et procédé de codage Download PDF

Info

Publication number
WO2019163795A1
WO2019163795A1 PCT/JP2019/006175 JP2019006175W WO2019163795A1 WO 2019163795 A1 WO2019163795 A1 WO 2019163795A1 JP 2019006175 W JP2019006175 W JP 2019006175W WO 2019163795 A1 WO2019163795 A1 WO 2019163795A1
Authority
WO
WIPO (PCT)
Prior art keywords
partition
processing
block
encoding
unit
Prior art date
Application number
PCT/JP2019/006175
Other languages
English (en)
Japanese (ja)
Inventor
安倍　清史
西　孝啓
遠間　正真
龍一 加納
チョン スン リム
ル リン リャオ
ハイ ウェイ スン
スゴシュ パバン シャシドア
ハン ブン テオ
ジン ヤ リ
Original Assignee
パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ filed Critical パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ
Publication of WO2019163795A1 publication Critical patent/WO2019163795A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H04N19/517—Processing of motion vectors by encoding
    • H04N19/52—Processing of motion vectors by encoding by predictive encoding

Definitions

  • the present disclosure relates to an encoding device that encodes a partition obtained by dividing an image block.
  • H.C. High Efficiency Video Coding
  • H.265 exists (Non-Patent Document 1).
  • the present disclosure provides an encoding device that can efficiently process a partition obtained by dividing an image block.
  • An encoding apparatus includes a circuit and a memory, and the circuit divides an image block using the memory, and a partition obtained by dividing the image block. Determining a total number of a plurality of processing parameter candidates including a motion vector of the partition according to one size parameter of the image block; and from the plurality of candidates determined by the determined total number Selecting a processing parameter; and encoding the partition using the selected processing parameter.
  • the encoding device and the like can efficiently process a partition obtained by dividing an image block.
  • FIG. 1 is a block diagram showing a functional configuration of the encoding apparatus according to Embodiment 1.
  • FIG. 2 is a diagram illustrating an example of block division in the first embodiment.
  • FIG. 3 is a table showing conversion basis functions corresponding to each conversion type.
  • FIG. 4A is a diagram illustrating an example of the shape of a filter used in ALF.
  • FIG. 4B is a diagram illustrating another example of the shape of a filter used in ALF.
  • FIG. 4C is a diagram illustrating another example of the shape of a filter used in ALF.
  • FIG. 5A is a diagram illustrating 67 intra prediction modes in intra prediction.
  • FIG. 5B is a flowchart for explaining the outline of the predicted image correction process by the OBMC process.
  • FIG. 5A is a diagram illustrating 67 intra prediction modes in intra prediction.
  • FIG. 5B is a flowchart for explaining the outline of the predicted image correction process by the OBMC process.
  • FIG. 5A is a
  • FIG. 5C is a conceptual diagram for explaining the outline of the predicted image correction process by the OBMC process.
  • FIG. 5D is a diagram illustrating an example of FRUC.
  • FIG. 6 is a diagram for explaining pattern matching (bilateral matching) between two blocks along the motion trajectory.
  • FIG. 7 is a diagram for explaining pattern matching (template matching) between a template in the current picture and a block in the reference picture.
  • FIG. 8 is a diagram for explaining a model assuming constant velocity linear motion.
  • FIG. 9A is a diagram for explaining derivation of a motion vector in units of sub-blocks based on motion vectors of a plurality of adjacent blocks.
  • FIG. 9B is a diagram for explaining the outline of the motion vector deriving process in the merge mode.
  • FIG. 9A is a diagram for explaining derivation of a motion vector in units of sub-blocks based on motion vectors of a plurality of adjacent blocks.
  • FIG. 9B is a diagram for explaining the outline of
  • FIG. 9C is a conceptual diagram for explaining an outline of DMVR processing.
  • FIG. 9D is a diagram for describing an overview of a predicted image generation method using luminance correction processing by LIC processing.
  • FIG. 10 is a block diagram showing a functional configuration of the decoding apparatus according to the first embodiment.
  • FIG. 11 is a flowchart showing an encoding process in the first mode of the first embodiment.
  • FIG. 12A is a schematic diagram showing four divisions in the first embodiment.
  • FIG. 12B is a schematic diagram illustrating a first example of two divisions in the first exemplary embodiment.
  • FIG. 12C is a schematic diagram illustrating a second example of the two divisions in the first exemplary embodiment.
  • FIG. 12D is a schematic diagram illustrating a first example of three divisions in the first embodiment.
  • FIG. 12A is a schematic diagram showing four divisions in the first embodiment.
  • FIG. 12B is a schematic diagram illustrating a first example of two divisions in the first exemplary embodiment.
  • FIG. 12E is a schematic diagram illustrating a second example of the three divisions in the first exemplary embodiment.
  • FIG. 12F is a schematic diagram illustrating a first example of the oblique division in the first embodiment.
  • FIG. 12G is a schematic diagram illustrating a second example of the oblique division in the first embodiment.
  • FIG. 12H is a schematic diagram illustrating a third example of the oblique division in the first embodiment.
  • FIG. 12I is a schematic diagram illustrating a first example of a plurality of combinations of divisions according to the first embodiment.
  • FIG. 12J is a schematic diagram illustrating a second example of the combination of the plurality of divisions in the first embodiment.
  • FIG. 13A is a schematic diagram showing a triangular partition in the first embodiment.
  • FIG. 13B is a schematic diagram showing an L-type partition in the first embodiment.
  • FIG. 13C is a schematic diagram showing a pentagonal partition in the first embodiment.
  • FIG. 13D is a schematic diagram showing a hexagonal partition in the first embodiment.
  • FIG. 13E is a schematic diagram illustrating a polygon partition in the first embodiment.
  • FIG. 14A is a schematic diagram illustrating a first example of the first division method according to Embodiment 1.
  • FIG. 14B is a schematic diagram illustrating a first example of the second division method according to Embodiment 1.
  • FIG. 15A is a schematic diagram illustrating a second example of the first division method according to Embodiment 1.
  • FIG. 15B is a schematic diagram illustrating a second example of the second division method in the first embodiment.
  • FIG. 16 is a flowchart showing an encoding process in the second mode of the first embodiment.
  • FIG. 17 is a table diagram showing an example of a plurality of candidates in the second mode of the first embodiment.
  • FIG. 18 is a flowchart showing an encoding process in the third mode of the first embodiment.
  • FIG. 19 is a block diagram illustrating an implementation example of the encoding apparatus according to Embodiment 1.
  • FIG. 20 is a flowchart showing a first operation example of the coding apparatus according to Embodiment 1.
  • FIG. 21 is a flowchart showing a second operation example of the coding apparatus according to Embodiment 1.
  • FIG. 22 is an overall configuration diagram of a content supply system that implements a content distribution service.
  • FIG. 22 is an overall configuration diagram of a content supply system that implements a content distribution service.
  • FIG. 23 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 24 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 25 shows an example of a web page display screen.
  • FIG. 26 is a diagram illustrating a display screen example of a web page.
  • FIG. 27 is a diagram illustrating an example of a smartphone.
  • FIG. 28 is a block diagram illustrating a configuration example of a smartphone.
  • the encoding device when encoding a moving image, divides an image block included in the moving image, and processes a partition obtained by dividing the image block using a processing parameter such as a processing mode or a motion vector. To do. At that time, the encoding apparatus evaluates each of the plurality of processing parameter candidates for the partition, and selects a processing parameter from the plurality of candidates according to the evaluation. Then, the encoding apparatus processes the partition using the selected processing parameter.
  • a processing parameter such as a processing mode or a motion vector
  • the encoding apparatus can encode the partition using an appropriate processing parameter.
  • an encoding device includes a circuit and a memory, and the circuit divides an image block using the memory, and uses the first division method to According to the first processing mode for the first partition obtained by dividing the image block, the image block is divided by using a second division method different from the first division method, so that the same partition as the first partition is obtained. Determining a total number of a plurality of processing parameter candidates for the obtained second partition, selecting the processing parameter from among the plurality of candidates defined by the determined total number, and the selected processing parameter And encoding the second partition using.
  • the encoding apparatus reduces the total number of candidates for the processing parameters for the second partition obtained as the same partition by the second division method according to the first processing mode for the first partition obtained by the first division method. be able to. Therefore, the encoding device can reduce the processing amount.
  • each of the first partition and the second partition is a triangular partition.
  • the encoding apparatus can reduce the total number of candidates for the processing parameters for the second partition obtained as the same triangular partition according to the first processing mode for the first partition obtained as the triangular partition. Therefore, the encoding device can suppress an increase in the processing amount related to the triangle partition.
  • the first processing mode is one of a plurality of processing modes including an intra mode, an inter mode, a skip mode, and a merge mode.
  • the encoding apparatus can reduce the total number of candidates according to the first processing mode such as the intra mode, the inter mode, the skip mode, or the merge mode.
  • the circuit determines whether or not the first processing mode is a predetermined processing mode, and determines whether or not the first processing mode is a predetermined processing mode. Determine the total number.
  • the encoding device can reduce the total number of candidates according to whether or not the first processing mode is the predetermined processing mode.
  • the predetermined processing mode is a skip mode and the circuit determines that the first processing mode is a skip mode in the step of determining the total number
  • the first number is set as the total number.
  • a second number different from the first number is determined as the total number.
  • the encoding apparatus can reduce the total number of candidates according to whether or not the first processing mode is the skip mode.
  • the first number is smaller than the second number.
  • the encoding apparatus can reduce the total number of candidates when the first processing mode is the skip mode.
  • the circuit performs evaluation of each of the plurality of candidates determined by the determined total number, and the processing parameter is selected from the plurality of candidates according to the evaluation. Select.
  • the encoding apparatus can select an appropriate processing parameter from the plurality of candidates according to the evaluation of each of the plurality of candidates.
  • the processing parameter includes a motion vector
  • each of the plurality of candidates is a candidate for the processing parameter including the motion vector
  • the encoding apparatus can reduce the total number of a plurality of motion vector candidates, and can reduce the processing amount for selecting a motion vector from the plurality of candidates.
  • the processing parameter includes a second processing mode for the second partition, and each of the plurality of candidates is a candidate for the processing parameter including the second processing mode.
  • the encoding apparatus can reduce the total number of the plurality of candidates for the second processing mode for the second partition, and the processing amount for selecting the second processing mode for the second partition from the plurality of candidates. Can be reduced.
  • the encoding method includes a step of dividing an image block and a first processing mode for a first partition obtained by dividing the image block using the first division method. Determining the total number of a plurality of processing parameter candidates for the second partition obtained as the same partition as the first partition by dividing the image block using a second dividing method different from the first dividing method. And selecting the processing parameter from among the plurality of candidates determined by the determined total number, and encoding the second partition using the selected processing parameter.
  • the processing amount can be reduced.
  • an encoding device includes a circuit and a memory, and the circuit divides the image block using the memory, and divides the image block. Determining a total number of candidates for processing parameters including motion vectors of the partition according to a size parameter of one of the obtained partition and the image block; and the plurality of candidates defined by the determined total number Selecting the processing parameter from among the steps, and encoding the partition using the selected processing parameter.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size parameter. Therefore, the encoding device can reduce the processing amount.
  • the partition is a triangular partition.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the triangle partition according to the size parameter. Therefore, the encoding device can suppress an increase in the processing amount related to the triangle partition.
  • the size parameter is the size of the image block.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size of the image block.
  • the size parameter is the size of the partition.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size of the partition.
  • the size parameter is the number of samples in the partition.
  • the encoding apparatus can reduce the total number of candidates for the processing parameter including the motion vector of the partition according to the number of samples in the partition.
  • the size parameter is the width of the partition.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the width of the partition.
  • the size parameter is the height of the partition.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the height of the partition.
  • the size parameter is a ratio related to the width and height of the partition.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the ratio regarding the width and height of the partition.
  • the circuit obtains the ratio of the width to the partition height as the size parameter, and determines the total number according to the ratio of the width to the partition height.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the ratio of the width to the partition height.
  • the circuit determines the first number as the total number. If the ratio of width to height of the partition is not greater than the first threshold or less than the second threshold, a second number different from the first number is determined as the total number, and The first threshold is smaller than the second threshold and is the reciprocal of the second threshold.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to whether the height and width of the partition are greatly different.
  • the first number is larger than the second number.
  • the encoding apparatus can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition when the height and width of the partition are greatly different.
  • the circuit performs evaluation of each of the plurality of candidates determined by the determined total number, and the processing parameter is selected from the plurality of candidates according to the evaluation. Select.
  • the encoding apparatus can select an appropriate processing parameter from the plurality of candidates according to the evaluation of each of the plurality of candidates.
  • the encoding method includes the step of dividing an image block, the partition obtained by dividing the image block, and the size parameter of one of the image blocks, Determining a total number of a plurality of processing parameter candidates including a motion vector of the partition; selecting the processing parameter from the plurality of candidates defined by the determined total number; and the selected processing parameter Encoding the partition using.
  • a decoding device includes a circuit and a memory, and the circuit divides an image block using the memory, and the image using a first dividing method.
  • the image block is divided using a second division method different from the first division method, thereby obtaining the same partition as the first partition. Determining a total number of processing parameter candidates for the second partition to be selected, selecting the processing parameter from among the plurality of candidates defined by the determined total number, and selecting the selected processing parameter. And decoding the second partition.
  • a decoding device includes a circuit and a memory, and the circuit is obtained by dividing the image block using the memory and dividing the image block. Determining a total number of candidates for processing parameters including a motion vector of the partition according to a size parameter of one of the partition and the image block; and determining the plurality of candidates defined by the determined total number A step of selecting the processing parameter from among the steps and a step of decoding the partition using the selected processing parameter are performed.
  • an encoding device includes a dividing unit, an intra prediction unit, an inter prediction unit, a conversion unit, a quantization unit, an entropy encoding unit, and a loop filter unit.
  • the dividing unit divides a picture into a plurality of image blocks.
  • the intra prediction unit performs intra prediction on image blocks included in the plurality of image blocks.
  • the inter prediction unit performs inter prediction on the image block.
  • the conversion unit converts a prediction error between a prediction image obtained by the intra prediction or the inter prediction and an original image to generate a conversion coefficient.
  • the quantization unit quantizes the transform coefficient to generate a quantization coefficient.
  • the entropy encoding unit generates an encoded bitstream by encoding the quantization coefficient.
  • the loop filter unit applies a filter to a reconstructed image generated using the predicted image.
  • At least one of the dividing unit and the inter prediction unit includes a step of dividing an image block, and a first processing mode for a first partition obtained by dividing the image block using a first dividing method Accordingly, the total number of processing parameter candidates for the second partition obtained as the same partition as the first partition is determined by dividing the image block using a second division method different from the first division method. Selecting a processing parameter from the plurality of candidates determined by the determined total number, and performing an operation for encoding the second partition using the selected processing parameter And do.
  • At least one of the dividing unit and the inter prediction unit is configured to divide an image block, a partition obtained by dividing the image block, and one size parameter of the image block, Determining a total number of a plurality of candidate processing parameters including motion vectors of the partition; selecting the processing parameter from the plurality of candidates defined by the determined total number; and the selected process Performing an operation for encoding the partition using a parameter.
  • these comprehensive or specific aspects may be realized by 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.
  • the present invention may be realized by any combination of an apparatus, a method, an integrated circuit, a computer program, and a recording medium.
  • an outline of the first embodiment will be described as an example of an encoding device and a decoding device to which the processing and / or configuration described in each aspect of the present disclosure to be described later can be applied.
  • the first embodiment is merely an example of an encoding device and a decoding device to which the processing and / or configuration described in each aspect of the present disclosure can be applied, and the processing and / or processing described in each aspect of the present disclosure.
  • the configuration can also be implemented in an encoding device and a decoding device different from those in the first embodiment.
  • the encoding apparatus or decoding apparatus according to the first embodiment corresponds to the constituent elements described in each aspect of the present disclosure among a plurality of constituent elements constituting the encoding apparatus or decoding apparatus. Replacing the constituent elements with constituent elements described in each aspect of the present disclosure (2) A plurality of constituent elements constituting the encoding apparatus or decoding apparatus with respect to the encoding apparatus or decoding apparatus of the first embodiment The constituent elements corresponding to the constituent elements described in each aspect of the present disclosure are added to the present disclosure after arbitrary changes such as addition, replacement, and deletion of functions or processes to be performed on some constituent elements among the constituent elements.
  • a component that performs a part of processing performed by a component is a component that is described in each aspect of the present disclosure, a component that includes a part of a function included in a component described in each aspect of the present disclosure, or a book (6)
  • a method performed by the encoding device or the decoding device according to Embodiment 1 is performed in combination with a component that performs a part of processing performed by the component described in each aspect of the disclosure.
  • the process corresponding to the process described in each aspect of the present disclosure is replaced with the process described in each aspect of the present disclosure.
  • the encoding apparatus according to the first embodiment or A part of the plurality of processes included in the method performed by the decoding device is performed in combination with the processes described in each aspect of the present disclosure
  • the processes and / or configurations described in each aspect of the present disclosure are not limited to the above examples.
  • the present invention may be implemented in an apparatus used for a different purpose from the moving picture / picture encoding apparatus or moving picture / picture decoding apparatus disclosed in the first embodiment, and the processing and / or described in each aspect.
  • the configuration may be implemented alone.
  • you may implement combining the process and / or structure which were demonstrated in the different aspect.
  • FIG. 1 is a block diagram showing a functional configuration of encoding apparatus 100 according to Embodiment 1.
  • the encoding device 100 is a moving image / image encoding device that encodes moving images / images in units of blocks.
  • an encoding apparatus 100 is an apparatus that encodes an image in units of blocks, and includes a dividing unit 102, a subtracting unit 104, a transforming unit 106, a quantizing unit 108, and entropy encoding.
  • Unit 110 inverse quantization unit 112, inverse transform unit 114, addition unit 116, block memory 118, loop filter unit 120, frame memory 122, intra prediction unit 124, inter prediction unit 126, A prediction control unit 128.
  • the encoding device 100 is realized by, for example, a general-purpose processor and a memory.
  • the processor when the software program stored in the memory is executed by the processor, the processor performs the division unit 102, the subtraction unit 104, the conversion unit 106, the quantization unit 108, the entropy encoding unit 110, and the inverse quantization unit 112.
  • the encoding apparatus 100 includes a dividing unit 102, a subtracting unit 104, a transforming unit 106, a quantizing unit 108, an entropy coding unit 110, an inverse quantizing unit 112, an inverse transforming unit 114, an adding unit 116, and a loop filter unit 120.
  • the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 may be implemented as one or more dedicated electronic circuits.
  • the dividing unit 102 divides each picture included in the input moving image into a plurality of blocks, and outputs each block to the subtracting unit 104.
  • the dividing unit 102 first divides a picture into blocks of a fixed size (for example, 128 ⁇ 128).
  • This fixed size block may be referred to as a coding tree unit (CTU).
  • the dividing unit 102 divides each of the fixed size blocks into blocks of a variable size (for example, 64 ⁇ 64 or less) based on recursive quadtree and / or binary tree block division.
  • This variable size block may be referred to as a coding unit (CU), a prediction unit (PU) or a transform unit (TU).
  • CU, PU, and TU do not need to be distinguished, and some or all blocks in a picture may be processing units of CU, PU, and TU.
  • FIG. 2 is a diagram showing an example of block division in the first embodiment.
  • a solid line represents a block boundary by quadtree block division
  • a broken line represents a block boundary by binary tree block division.
  • the block 10 is a 128 ⁇ 128 pixel square block (128 ⁇ 128 block).
  • the 128 ⁇ 128 block 10 is first divided into four square 64 ⁇ 64 blocks (quadtree block division).
  • the upper left 64 ⁇ 64 block is further divided vertically into two rectangular 32 ⁇ 64 blocks, and the left 32 ⁇ 64 block is further divided vertically into two rectangular 16 ⁇ 64 blocks (binary tree block division). As a result, the upper left 64 ⁇ 64 block is divided into two 16 ⁇ 64 blocks 11 and 12 and a 32 ⁇ 64 block 13.
  • the upper right 64 ⁇ 64 block is horizontally divided into two rectangular 64 ⁇ 32 blocks 14 and 15 (binary tree block division).
  • the lower left 64x64 block is divided into four square 32x32 blocks (quadrant block division). Of the four 32 ⁇ 32 blocks, the upper left block and the lower right block are further divided.
  • the upper left 32 ⁇ 32 block is vertically divided into two rectangular 16 ⁇ 32 blocks, and the right 16 ⁇ 32 block is further divided horizontally into two 16 ⁇ 16 blocks (binary tree block division).
  • the lower right 32 ⁇ 32 block is horizontally divided into two 32 ⁇ 16 blocks (binary tree block division).
  • the lower left 64 ⁇ 64 block is divided into a 16 ⁇ 32 block 16, two 16 ⁇ 16 blocks 17 and 18, two 32 ⁇ 32 blocks 19 and 20, and two 32 ⁇ 16 blocks 21 and 22.
  • the lower right 64x64 block 23 is not divided.
  • the block 10 is divided into 13 variable-size blocks 11 to 23 based on the recursive quadtree and binary tree block division.
  • Such division may be called QTBT (quad-tree plus binary tree) division.
  • one block is divided into four or two blocks (quadrature tree or binary tree block division), but the division is not limited to this.
  • one block may be divided into three blocks (triple tree block division).
  • Such a division including a tri-tree block division may be called an MBT (multi type tree) division.
  • the subtraction unit 104 subtracts the prediction signal (prediction sample) from the original signal (original sample) in units of blocks divided by the division unit 102. That is, the subtraction unit 104 calculates a prediction error (also referred to as a residual) of a coding target block (hereinafter referred to as a current block). Then, the subtraction unit 104 outputs the calculated prediction error to the conversion unit 106.
  • a prediction error also referred to as a residual of a coding target block (hereinafter referred to as a current block).
  • the original signal is an input signal of the encoding device 100, and is a signal (for example, a luminance (luma) signal and two color difference (chroma) signals) representing an image of each picture constituting the moving image.
  • a signal representing an image may be referred to as a sample.
  • the transform unit 106 transforms the prediction error in the spatial domain into a transform factor in the frequency domain, and outputs the transform coefficient 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 a prediction error in the spatial domain.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • the conversion unit 106 adaptively selects a conversion type from a plurality of conversion types, and converts a prediction error into a conversion coefficient using a conversion basis function corresponding to the selected conversion type. May be. Such a conversion may be referred to as EMT (explicit multiple core transform) or AMT (adaptive multiple transform).
  • the plurality of conversion types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I and DST-VII.
  • FIG. 3 is a table showing conversion basis functions corresponding to each conversion type. In FIG. 3, N indicates the number of input pixels. Selection of a conversion type from among these multiple conversion types may depend on, for example, the type of prediction (intra prediction and inter prediction), or may depend on an intra prediction mode.
  • Information indicating whether or not to apply such EMT or AMT (for example, called an AMT flag) and information indicating the selected conversion type are signaled at the CU level.
  • AMT flag information indicating whether or not to apply such EMT or AMT
  • the signalization of these pieces of information need not be limited to the CU level, but may be other levels (for example, a sequence level, a picture level, a slice level, a tile level, or a CTU level).
  • the conversion unit 106 may reconvert the conversion coefficient (conversion result). Such reconversion is sometimes referred to as AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the conversion unit 106 performs re-conversion for each sub-block (for example, 4 ⁇ 4 sub-block) included in the block of the conversion coefficient corresponding to the intra prediction error. Information indicating whether or not NSST is applied and information related to the transformation matrix used for NSST are signaled at the CU level. Note that the signalization of these pieces of information need not be limited to the CU level, but may be other levels (for example, a sequence level, a picture level, a slice level, a tile level, or a CTU level).
  • the separable conversion is a method of performing the conversion a plurality of times by separating the number of dimensions of the input for each direction, and the non-separable conversion is two or more when the input is multidimensional.
  • the dimensions are collectively regarded as one dimension, and conversion is performed collectively.
  • non-separable conversion if an input is a 4 ⁇ 4 block, it is regarded as one array having 16 elements, and 16 ⁇ 16 conversion is performed on the array. The thing which performs the conversion process with a matrix is mentioned.
  • a 4 ⁇ 4 input block is regarded as a single array having 16 elements, and then the Givens rotation is performed multiple times on the array (Hypercube Givens Transform) is also a non-separable. It is an example of conversion.
  • the quantization unit 108 quantizes the transform coefficient 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 the quantization parameter (QP) corresponding to the scanned transform coefficients. Then, the quantization unit 108 outputs the quantized transform coefficient (hereinafter referred to as a quantization coefficient) of the current block to the entropy encoding unit 110 and the inverse quantization unit 112.
  • QP quantization parameter
  • the predetermined order is an order for quantization / inverse quantization of transform coefficients.
  • the predetermined scanning order is defined in ascending order of frequency (order from low frequency to high frequency) or descending order (order from high frequency to low frequency).
  • the quantization parameter is a parameter that defines a quantization step (quantization width). For example, if the value of the quantization parameter increases, the quantization step also increases. That is, if the value of the quantization parameter increases, the quantization error increases.
  • the entropy encoding unit 110 generates an encoded signal (encoded bit stream) by performing variable length encoding on the quantization coefficient that is input from the quantization unit 108. Specifically, the entropy encoding unit 110 binarizes the quantization coefficient, for example, and arithmetically encodes the binary signal.
  • the inverse quantization unit 112 inversely quantizes the quantization coefficient that is an input from the quantization unit 108. Specifically, the inverse quantization unit 112 inversely quantizes the quantization coefficient of the current block in a predetermined scanning order. Then, the inverse quantization unit 112 outputs the inverse-quantized transform coefficient of the current block to the inverse transform unit 114.
  • the inverse transform unit 114 restores the prediction error by inverse transforming the transform coefficient that is an 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 corresponding to the transform by the transform unit 106 on the transform coefficient. Then, the inverse transformation unit 114 outputs the restored prediction error to the addition unit 116.
  • the restored prediction error does not match the prediction error calculated by the subtraction unit 104 because information is lost due to quantization. That is, the restored prediction error includes a quantization error.
  • the adder 116 reconstructs the current block by adding the prediction error input from the inverse transform unit 114 and the prediction sample input from the prediction control unit 128. Then, the adding unit 116 outputs the reconfigured block to the block memory 118 and the loop filter unit 120.
  • the reconstructed block is sometimes referred to as a local decoding block.
  • the block memory 118 is a storage unit for storing blocks in an encoding target picture (hereinafter referred to as current picture) that are referred to in intra prediction. Specifically, the block memory 118 stores the reconstructed block output from the adding unit 116.
  • the loop filter unit 120 applies a loop filter to the block reconstructed by the adding unit 116 and outputs the filtered reconstructed block to the frame memory 122.
  • the loop filter is a filter (in-loop filter) used in the encoding loop, and includes, for example, a deblocking filter (DF), a sample adaptive offset (SAO), an adaptive loop filter (ALF), and the like.
  • a least square error filter is applied to remove coding distortion. For example, for each 2 ⁇ 2 sub-block in the current block, a plurality of multiples based on the direction of the local gradient and the activity are provided. One filter selected from the filters is applied.
  • sub-blocks for example, 2 ⁇ 2 sub-blocks
  • a plurality of classes for example, 15 or 25 classes.
  • the direction value D of the gradient is derived, for example, by comparing gradients in a plurality of directions (for example, horizontal, vertical, and two diagonal directions).
  • the gradient activation value A is derived, for example, by adding gradients in a plurality of directions and quantizing the addition result.
  • a filter for a sub-block is determined from among a plurality of filters.
  • FIG. 4A to 4C are diagrams showing a plurality of examples of filter shapes used in ALF.
  • 4A shows a 5 ⁇ 5 diamond shape filter
  • FIG. 4B shows a 7 ⁇ 7 diamond shape filter
  • FIG. 4C shows a 9 ⁇ 9 diamond shape filter.
  • Information indicating the shape of the filter is signalized at the picture level. It should be noted that the signalization of the information indicating the filter shape need not be limited to the picture level, but may be another level (for example, a sequence level, a slice level, a tile level, a CTU level, or a CU level).
  • ON / OFF of ALF is determined at the picture level or the CU level, for example. For example, for luminance, it is determined whether to apply ALF at the CU level, and for color difference, it is determined whether to apply ALF at the picture level.
  • Information indicating ALF on / off is signaled at the picture level or the CU level. Signaling of information indicating ALF on / off need not be limited to the picture level or the CU level, and may be performed at other levels (for example, a sequence level, a slice level, a tile level, or a CTU level). Good.
  • a coefficient set of a plurality of selectable filters (for example, up to 15 or 25 filters) is signalized at the picture level.
  • the signalization of the coefficient set need not be limited to the picture level, but may be another level (for example, sequence level, slice level, tile level, CTU level, CU level, or sub-block level).
  • the frame memory 122 is a storage unit for storing a reference picture used for inter prediction, and is sometimes called a frame buffer. Specifically, the frame memory 122 stores the reconstructed block filtered by the loop filter unit 120.
  • the intra prediction unit 124 generates a prediction signal (intra prediction signal) by referring to the block in the current picture stored in the block memory 118 and performing intra prediction (also referred to as intra-screen prediction) of the current block. Specifically, the intra prediction unit 124 generates an intra prediction signal by performing intra prediction with reference to a sample (for example, luminance value and color difference value) of a block adjacent to the current block, and performs prediction control on the intra prediction signal. To the unit 128.
  • the intra prediction unit 124 performs intra prediction using one of a plurality of predefined intra prediction modes.
  • the plurality of intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes.
  • One or more non-directional prediction modes are for example H.264. It includes Planar prediction mode and DC prediction mode defined by H.265 / HEVC (High-Efficiency Video Coding) standard (Non-patent Document 1).
  • the multiple directionality prediction modes are for example H.264. It includes 33-direction prediction modes defined in the H.265 / HEVC standard. In addition to the 33 directions, the plurality of directionality prediction modes may further include 32 direction prediction modes (a total of 65 directionality prediction modes).
  • FIG. 5A is a diagram illustrating 67 intra prediction modes (two non-directional prediction modes and 65 directional prediction modes) in intra prediction. The solid line arrows The 33 directions defined in the H.265 / HEVC standard are represented, and the dashed arrow represents the added 32 directions.
  • the luminance block may be referred to in the intra prediction of the color difference block. That is, the color difference component of the current block may be predicted based on the luminance component of the current block.
  • Such intra prediction is sometimes called CCLM (cross-component linear model) prediction.
  • the intra prediction mode (for example, called CCLM mode) of the color difference block which refers to such a luminance block may be added as one of the intra prediction modes of the color difference block.
  • the intra prediction unit 124 may correct the pixel value after intra prediction based on the gradient of the reference pixel in the horizontal / vertical direction. Intra prediction with such correction may be called PDPC (position dependent intra prediction combination). Information indicating whether or not PDPC is applied (for example, referred to as a PDPC flag) is signaled, for example, at the CU level.
  • the signalization of this information need not be limited to the CU level, but may be another level (for example, a sequence level, a picture level, a slice level, a tile level, or a CTU level).
  • the inter prediction unit 126 refers to a reference picture stored in the frame memory 122 and is different from the current picture, and performs inter prediction (also referred to as inter-screen prediction) of the current block, thereby generating a prediction signal (inter prediction signal). Prediction signal). Inter prediction is performed in units of a current block or a sub-block (for example, 4 ⁇ 4 block) in the current block. For example, the inter prediction unit 126 performs motion estimation in the reference picture for the current block or sub-block. Then, the inter prediction unit 126 generates an inter prediction signal of the current block or sub-block by performing motion compensation using motion information (for example, a motion vector) obtained by motion search. Then, the inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.
  • inter prediction also referred to as inter-screen prediction
  • a motion vector predictor may be used for signalizing the motion vector. That is, the difference between the motion vector and the predicted motion vector may be signaled.
  • an inter prediction signal may be generated using not only the motion information of the current block obtained by motion search but also the motion information of adjacent blocks. Specifically, the inter prediction signal is generated in units of sub-blocks in the current block by weighted addition of the prediction signal based on the motion information obtained by motion search and the prediction signal based on the motion information of adjacent blocks. May be.
  • Such inter prediction motion compensation
  • OBMC overlapped block motion compensation
  • OBMC block size information indicating the size of a sub-block for OBMC
  • OBMC flag information indicating whether or not to apply the OBMC mode
  • the level of signalization of these information does not need to be limited to the sequence level and the CU level, and may be other levels (for example, a picture level, a slice level, a tile level, a CTU level, or a sub-block level). Good.
  • FIG. 5B and FIG. 5C are a flowchart and a conceptual diagram for explaining the outline of the predicted image correction process by the OBMC process.
  • a prediction image (Pred) by normal motion compensation is acquired using a motion vector (MV) assigned to an encoding target block.
  • MV motion vector
  • a prediction image (Pred_L) is obtained by applying the motion vector (MV_L) of the encoded left adjacent block to the encoding target block, and prediction is performed by superimposing the prediction image and Pred_L with weights. Perform the first correction of the image.
  • the motion vector (MV_U) of the encoded upper adjacent block is applied to the block to be encoded to obtain a prediction image (Pred_U), and the prediction image and Pred_U that have been subjected to the first correction are weighted. Then, the second correction of the predicted image is performed by superimposing and making it the final predicted image.
  • the two-step correction method using the left adjacent block and the upper adjacent block has been described here, the correction may be performed more times than the two steps using the right adjacent block and the lower adjacent block. Is possible.
  • the area to be overlapped may not be the pixel area of the entire block, but only a part of the area near the block boundary.
  • the processing target block may be a prediction block unit or a sub-block unit obtained by further dividing the prediction block.
  • obmc_flag is a signal indicating whether or not to apply the OBMC process.
  • the encoding apparatus it is determined whether or not the encoding target block belongs to a complex motion region, and if it belongs to a complex motion region, a value 1 is set as obmc_flag. Encoding is performed by applying the OBMC process, and if it does not belong to a complex region of motion, the value 0 is set as obmc_flag and the encoding is performed without applying the OBMC process.
  • the decoding device decodes obj_flag described in the stream, and performs decoding by switching whether to apply the OBMC processing according to the value.
  • the motion information may be derived on the decoding device side without being converted into a signal.
  • H.M. A merge mode defined in the H.265 / HEVC standard may be used.
  • the motion information may be derived by performing motion search on the decoding device side. In this case, motion search is performed without using the pixel value of the current block.
  • the mode in which the motion search is performed on the decoding device side is sometimes called a PMMVD (patterned motion vector derivation) mode or an FRUC (frame rate up-conversion) mode.
  • PMMVD patterned motion vector derivation
  • FRUC frame rate up-conversion
  • FIG. 5D An example of FRUC processing is shown in FIG. 5D.
  • a list of a plurality of candidates each having a predicted motion vector (may be common with the merge list) is generated Is done.
  • the best candidate MV is selected from a plurality of candidate MVs registered in the candidate list. For example, the evaluation value of each candidate included in the candidate list is calculated, and one candidate is selected based on the evaluation value.
  • a motion vector for the current block is derived based on the selected candidate motion vector.
  • the selected candidate motion vector (best candidate MV) is directly derived as a motion vector for the current block.
  • the motion vector for the current block may be derived by performing pattern matching in the peripheral region at the position in the reference picture corresponding to the selected candidate motion vector. That is, the same method is used to search the area around the best candidate MV, and if there is an MV with a good evaluation value, the best candidate MV is updated to the MV, and the current block is updated. The final MV may be used. It is also possible to adopt a configuration in which the processing is not performed.
  • the same processing may be performed when processing is performed in units of sub-blocks.
  • the evaluation value is calculated by obtaining a difference value of the reconstructed image by pattern matching between a region in the reference picture corresponding to the motion vector and a predetermined region. Note that the evaluation value may be calculated using information other than the difference value.
  • the first pattern matching and the second pattern matching may be referred to as bilateral matching and template matching, respectively.
  • pattern matching is performed between two blocks in two different reference pictures that follow the motion trajectory of the current block. Therefore, in the first pattern matching, a region in another reference picture along the motion trajectory of the current block is used as the predetermined region for calculating the candidate evaluation value described above.
  • FIG. 6 is a diagram for explaining an example of pattern matching (bilateral matching) between two blocks along a motion trajectory.
  • first pattern matching two blocks along the motion trajectory of the current block (Cur block) and two blocks in two different reference pictures (Ref0, Ref1) are used.
  • two motion vectors MV0, MV1 are derived.
  • MV0, MV1 a reconstructed image at a designated position in the first encoded reference picture (Ref0) designated by the candidate MV, and a symmetric MV obtained by scaling the candidate MV at a display time interval.
  • the difference from the reconstructed image at the designated position in the second encoded reference picture (Ref1) designated in (2) is derived, and the evaluation value is calculated using the obtained difference value.
  • the candidate MV having the best evaluation value among the plurality of candidate MVs may be selected as the final MV.
  • the motion vectors (MV0, MV1) pointing to the two reference blocks are temporal distances between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). It is proportional to (TD0, TD1).
  • the first pattern matching uses a mirror-symmetric bi-directional motion vector Is derived.
  • pattern matching is performed between a template in the current picture (a block adjacent to the current block in the current picture (for example, an upper and / or left adjacent block)) and a block in the reference picture. Therefore, in the second pattern matching, a block adjacent to the current block in the current picture is used as the predetermined region for calculating the candidate evaluation value described above.
  • FIG. 7 is a diagram for explaining an example of pattern matching (template matching) between a template in the current picture and a block in the reference picture.
  • the current block is searched by searching the reference picture (Ref0) for the block that most closely matches the block adjacent to the current block (Cur block) in the current picture (Cur Pic).
  • Ref0 the reference picture
  • the reconstructed image of the encoded region of the left adjacent area and / or the upper adjacent area, and the equivalent in the encoded reference picture (Ref0) designated by the candidate MV When a difference from the reconstructed image at the position is derived, an evaluation value is calculated using the obtained difference value, and a candidate MV having the best evaluation value among a plurality of candidate MVs is selected as the best candidate MV. Good.
  • FRUC flag Information indicating whether or not to apply such FRUC mode
  • FRUC flag information indicating whether or not to apply such FRUC mode
  • the FRUC mode is applied (for example, when the FRUC flag is true)
  • information indicating the pattern matching method (first pattern matching or second pattern matching) (for example, called the FRUC mode flag) is signaled at the CU level. It becomes. Note that the signalization of these pieces of information need not be limited to the CU level, but may be other levels (for example, sequence level, picture level, slice level, tile level, CTU level, or sub-block level). .
  • BIO bi-directional optical flow
  • FIG. 8 is a diagram for explaining a model assuming constant velocity linear motion.
  • (v x , v y ) indicates a velocity vector
  • ⁇ 0 and ⁇ 1 are the time between the current picture (Cur Pic) and two reference pictures (Ref 0 , Ref 1 ), respectively.
  • the distance. (MVx 0 , MVy 0 ) indicates a motion vector corresponding to the reference picture Ref 0
  • (MVx 1 , MVy 1 ) indicates a motion vector corresponding to the reference picture Ref 1 .
  • This optical flow equation consists of (i) the product of the time derivative of the luminance value, (ii) the horizontal component of the horizontal velocity and the spatial gradient of the reference image, and (iii) the vertical velocity and the spatial gradient of the reference image. Indicates that the sum of the products of the vertical components of is equal to zero. Based on a combination of this optical flow equation and Hermite interpolation, a block-based motion vector obtained from a merge list or the like is corrected in pixel units.
  • the motion vector may be derived on the decoding device side by a method different from the derivation of the motion vector based on the model assuming constant velocity linear motion.
  • a motion vector may be derived for each subblock based on the motion vectors of a plurality of adjacent blocks.
  • This mode may be referred to as an affine motion compensation prediction mode.
  • FIG. 9A is a diagram for explaining derivation of a motion vector in units of sub-blocks based on motion vectors of a plurality of adjacent blocks.
  • the current block includes 16 4 ⁇ 4 sub-blocks.
  • the motion vector v 0 of the upper left corner control point of the current block is derived based on the motion vector of the adjacent block
  • the motion vector v 1 of the upper right corner control point of the current block is derived based on the motion vector of the adjacent sub block. Is done.
  • the motion vector (v x , v y ) of each sub-block in the current block is derived by the following equation (2).
  • x and y indicate the horizontal position and vertical position of the sub-block, respectively, and w indicates a predetermined weight coefficient.
  • Such an affine motion compensation prediction mode may include several modes in which the motion vector derivation methods of the upper left and upper right corner control points are different.
  • Information indicating such an affine motion compensation prediction mode (for example, called an affine flag) is signaled at the CU level. Note that the information indicating the affine motion compensation prediction mode need not be limited to the CU level, but other levels (for example, sequence level, picture level, slice level, tile level, CTU level, or sub-block level). ).
  • 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.
  • FIG. 9B is a diagram for explaining the outline of the motion vector deriving process in the merge mode.
  • a prediction MV list in which prediction MV candidates are registered is generated.
  • prediction MV candidates spatial adjacent prediction MVs that are MVs of a plurality of encoded blocks located spatially around the encoding target block, and the position of the encoding target block in the encoded reference picture are projected.
  • Temporal adjacent prediction MV that is MV of neighboring blocks combined prediction MV that is MV generated by combining MV values of spatial adjacent prediction MV and temporal adjacent prediction MV, zero prediction MV that is MV having a value of zero, and the like There is.
  • variable length encoding unit describes and encodes merge_idx which is a signal indicating which prediction MV is selected in the stream.
  • the prediction MV registered in the prediction MV list described with reference to FIG. 9B is an example, and the number of prediction MVs may be different from the number in the figure, or may not include some types of prediction MVs in the figure. It may be the composition which added prediction MV other than the kind of prediction MV in a figure.
  • the final MV may be determined by performing DMVR processing, which will be described later, using the MV of the encoding target block derived by the merge mode.
  • FIG. 9C is a conceptual diagram for explaining an outline of DMVR processing.
  • the optimal MVP set in the processing target block is set as a candidate MV, and reference pixels from a first reference picture that is a processed picture in the L0 direction and a second reference picture that is a processed picture in the L1 direction are set according to the candidate MV. Are obtained, and a template is generated by taking the average of each reference pixel.
  • the peripheral areas of the candidate MVs of the first reference picture and the second reference picture are searched, respectively, and the MV with the lowest cost is determined as the final MV.
  • the cost value is calculated using a difference value between each pixel value of the template and each pixel value of the search area, an MV value, and the like.
  • FIG. 9D is a diagram for explaining an outline of a predicted image generation method using luminance correction processing by LIC processing.
  • an MV for obtaining a reference image corresponding to a block to be encoded is derived from a reference picture that is an encoded picture.
  • the predicted image for the encoding target block is generated by performing the brightness correction process using the brightness correction parameter for the reference image in the reference picture specified by MV.
  • the shape of the peripheral reference region in FIG. 9D is an example, and other shapes may be used.
  • the process of generating a predicted image from one reference picture has been described, but the same applies to the case of generating a predicted image from a plurality of reference pictures, and the same applies to reference images acquired from each reference picture.
  • the predicted image is generated after performing the luminance correction processing by the method.
  • lic_flag is a signal indicating whether to apply LIC processing.
  • the encoding device it is determined whether or not the encoding target block belongs to an area where the luminance change occurs, and if it belongs to the area where the luminance change occurs, lic_flag is set. Encode by applying LIC processing with a value of 1 set, and if not belonging to an area where a luminance change has occurred, set 0 as lic_flag and perform encoding without applying the LIC processing .
  • the decoding apparatus decodes lic_flag described in the stream, thereby switching whether to apply the LIC processing according to the value, and performing decoding.
  • a method for determining whether or not to apply LIC processing for example, there is a method for determining whether or not LIC processing has been applied to peripheral blocks.
  • the encoding target block is in the merge mode
  • whether or not the surrounding encoded blocks selected in the derivation of the MV in the merge mode processing are encoded by applying the LIC processing. Judgment is performed, and encoding is performed by switching whether to apply the LIC processing according to the result.
  • the decoding process is exactly the same.
  • FIG. 10 is a block diagram showing a functional configuration of decoding apparatus 200 according to Embodiment 1.
  • the decoding device 200 is a moving image / image decoding device that decodes moving images / images in units of blocks.
  • the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transformation unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, and a frame memory 214. And an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.
  • the decoding device 200 is realized by, for example, a general-purpose processor and a memory.
  • the processor executes the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, and the intra prediction unit. 216, the inter prediction unit 218, and the prediction control unit 220.
  • the decoding apparatus 200 is dedicated to the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220. It may be realized as one or more electronic circuits.
  • the entropy decoding unit 202 performs entropy decoding on the encoded bit stream. Specifically, the entropy decoding unit 202 performs arithmetic decoding from a coded bitstream to a binary signal, for example. Then, the entropy decoding unit 202 debinarizes the binary signal. As a result, the entropy decoding unit 202 outputs the quantized coefficient to the inverse quantization unit 204 in units of blocks.
  • the inverse quantization unit 204 inversely quantizes the quantization coefficient of a decoding target block (hereinafter referred to as a current block) that is an input from the entropy decoding unit 202. Specifically, the inverse quantization unit 204 inversely quantizes each quantization coefficient of the current block based on the quantization parameter corresponding to the quantization coefficient. Then, the inverse quantization unit 204 outputs the quantization coefficient (that is, the transform coefficient) obtained by inverse quantization of the current block to the inverse transform unit 206.
  • a decoding target block hereinafter referred to as a current block
  • the inverse quantization unit 204 inversely quantizes each quantization coefficient of the current block based on the quantization parameter corresponding to the quantization coefficient. Then, the inverse quantization unit 204 outputs the quantization coefficient (that is, the transform coefficient) obtained by inverse quantization of the current block to the inverse transform unit 206.
  • the inverse transform unit 206 restores the prediction error by inverse transforming the transform coefficient that is an input from the inverse quantization unit 204.
  • the inverse conversion unit 206 determines the current block based on the information indicating the read conversion type. Inversely transform the conversion coefficient of.
  • the inverse transform unit 206 applies inverse retransformation to the transform coefficient.
  • the adder 208 reconstructs the current block by adding the prediction error input from the inverse converter 206 and the prediction sample input from the prediction controller 220. Then, the adding unit 208 outputs the reconfigured block to the block memory 210 and the loop filter unit 212.
  • the block memory 210 is a storage unit for storing a block that is referred to in intra prediction and that is within a decoding target picture (hereinafter referred to as a current picture). Specifically, the block memory 210 stores the reconstructed block output from the adding unit 208.
  • the loop filter unit 212 applies a loop filter to the block reconstructed by the adding unit 208, and outputs the filtered reconstructed block to the frame memory 214, the display device, and the like.
  • one filter is selected from the plurality of filters based on the local gradient direction and activity, The selected filter is applied to the reconstruction block.
  • the frame memory 214 is a storage unit for storing a reference picture used for inter prediction, and is sometimes called a frame buffer. Specifically, the frame memory 214 stores the reconstructed block filtered by the loop filter unit 212.
  • the intra prediction unit 216 performs intra prediction with reference to the block in the current picture stored in the block memory 210 based on the intra prediction mode read from the encoded bitstream, so that a prediction signal (intra prediction Signal). Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to a sample (for example, luminance value and color difference value) of a block adjacent to the current block, and performs prediction control on the intra prediction signal. Output to the unit 220.
  • a prediction signal for example, luminance value and color difference value
  • the intra prediction unit 216 may predict the color difference component of the current block based on the luminance component of the current block.
  • the intra prediction unit 216 corrects the pixel value after intra prediction based on the gradient of the reference pixel in the horizontal / vertical direction.
  • the inter prediction unit 218 refers to the reference picture stored in the frame memory 214 and predicts the current block. Prediction is performed in units of a current block or a sub-block (for example, 4 ⁇ 4 block) in the current block. For example, the inter prediction unit 218 generates an inter prediction signal of the current block or sub-block by performing motion compensation using motion information (for example, a motion vector) read from the encoded bitstream, and generates the inter prediction signal. The result is output to the prediction control unit 220.
  • motion information for example, a motion vector
  • the inter prediction unit 218 When the information read from the encoded bitstream indicates that the OBMC mode is to be applied, the inter prediction unit 218 includes not only the motion information of the current block obtained by motion search but also the motion information of adjacent blocks. To generate an inter prediction signal.
  • the inter prediction unit 218 follows the pattern matching method (bilateral matching or template matching) read from the encoded stream. Motion information is derived by performing motion search. Then, the inter prediction unit 218 performs motion compensation using the derived motion information.
  • the inter prediction unit 218 derives a motion vector based on a model assuming constant velocity linear motion. Also, when the information read from the encoded bitstream indicates that the affine motion compensated prediction mode is applied, the inter prediction unit 218 determines the motion vector in units of subblocks based on the motion vectors of a plurality of adjacent blocks. Is derived.
  • the prediction control unit 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected signal to the adding unit 208 as a prediction signal.
  • FIG. 11 shows an encoding method and an encoding process performed by the encoding device 100 according to the first aspect.
  • the encoding apparatus 100 divides the image block into a plurality of partitions including the first partition according to the first division method (S101).
  • the first division method is not limited to any one of these division methods, and may be a method in which these divisions are arbitrarily combined.
  • the first partition may be a partition as shown in FIG. 13A, FIG. 13B, FIG. 13C, FIG. 13D, or FIG.
  • the first partition may be a rectangular partition, a triangular partition, an L-shaped partition, a pentagonal partition, a hexagonal partition, or a polygonal partition.
  • the processing mode is an example of a processing parameter.
  • the processing mode set includes one or more candidates for processing modes.
  • the first processing mode set includes an inter mode, an intra mode, a merge mode, and a skip mode.
  • the first processing mode set may include a partition mode in which the first partition is divided into a plurality of subpartitions for processing.
  • the first processing mode set may include a triangular partition mode in which a rectangular first partition is divided into two triangular partitions for processing.
  • the first processing mode set may include only the skip mode among these processing modes.
  • the first processing mode set may include only the intra mode and the skip mode among these processing modes.
  • the encoding apparatus 100 divides the image block into a plurality of partitions including the second partition according to a second division method different from the first division method (S103).
  • the second partition is the same partition as the first partition.
  • the position, shape, and size of the second partition in the image block are the same as the position, shape, and size of the first partition in the image block.
  • the second division method may be four divisions, two divisions, three divisions or diagonal as shown in FIG. 12A, FIG. 12B, FIG. 12C, FIG. 12D, FIG. 12E, FIG. A division method may be used.
  • the second division method is not limited to any one of these division methods, and may be a method in which these divisions are arbitrarily combined.
  • the second partition may be a partition as shown in FIGS. 13A, 13B, 13C, 13D, or 13E.
  • the second partition may be a rectangular partition, a triangular partition, an L-shaped partition, a pentagonal partition, a hexagonal partition, or a polygonal partition.
  • the number of the plurality of partitions obtained by the division may be different, and at least one shape of the plurality of partitions obtained by the division may be different. Further, the number of divisions of the first division method may be different from the number of divisions of the second division method.
  • FIG. 14A shows a first example of the first division method
  • FIG. 14B shows a first example of the second division method
  • FIG. 14A shows the first partition
  • FIG. 14B shows the second partition.
  • the image block is divided into four partitions.
  • the first partition is located at the upper right of the image block.
  • the image block is divided into three partitions. Specifically, the image block is divided into two parts up and down by a horizontal line, and then the upper region is divided into two parts by a vertical line.
  • the position, shape and size of the second partition are the same as the position, shape and size of the first partition.
  • FIG. 15A shows a second example of the first dividing method
  • FIG. 15B shows a second example of the second dividing method.
  • FIG. 15A shows the first partition
  • FIG. 15B shows the second partition.
  • the image block is divided into three partitions. Specifically, the image block is divided into right and left parts by a vertical line, and then the right region is divided into two parts by a horizontal line. The first partition is located at the upper right of the image block.
  • the image block is divided into three partitions. Specifically, the image block is divided into two parts up and down by a horizontal line, and then the upper region is divided into two parts by a vertical line.
  • the position, shape and size of the second partition are the same as the position, shape and size of the first partition.
  • the encoding apparatus 100 divides the image block by the second division method, and then determines whether or not the processing mode for the first partition is the intra mode (S104).
  • the encoding apparatus 100 determines the processing mode using the second processing mode set including the skip mode (S105 and S106). When it is determined that the processing mode for the first partition is the intra mode (Yes in S104), the encoding apparatus 100 determines the processing mode using the third processing mode set that does not include the skip mode (S107 and S108). ).
  • the encoding apparatus 100 assigns each processing mode in the second processing mode set including the skip mode to the second partition according to a predetermined evaluation criterion.
  • the evaluation is made (S105).
  • the encoding apparatus 100 highly evaluates a processing mode with high encoding efficiency and little image quality degradation.
  • the encoding apparatus 100 selects a processing mode for the second partition from the second processing mode set according to the evaluation result (S106).
  • the encoding apparatus 100 assigns each processing mode in the third processing mode set not including the skip mode to the second partition according to the predetermined evaluation criterion. (S107). For example, the encoding apparatus 100 highly evaluates a processing mode with high encoding efficiency and little image quality degradation. Then, the encoding apparatus 100 selects a processing mode for the second partition from the third processing mode set according to the evaluation result (S108).
  • the encoding apparatus 100 encodes the second partition using the processing mode for the second partition (S109). For example, the encoding apparatus 100 encodes the second partition by encoding the image block by applying the processing mode to the second partition.
  • the encoding apparatus 100 encodes an image block including the first partition based on the first division method and a first operation for encoding the image block including the second partition based on the second division method. Each of the two actions may be evaluated and the action selected. When the second operation is selected, the encoding apparatus 100 may encode the second partition by encoding an image block including the second partition.
  • the encoding apparatus 100 determines a plurality of candidates for the processing mode of the second partition according to the processing mode of the first partition.
  • the plurality of candidates for the processing mode of the second partition are a part of a plurality of processing modes including an inter mode, an intra mode, a merge mode, and a skip mode.
  • the plurality of candidates may include a partition mode in which the second partition is divided into a plurality of subpartitions and processed, or a triangle partition mode in which the second partition is divided into two triangle partitions for processing. Also good.
  • the processing mode of the first partition when the processing mode of the first partition is the intra mode, fewer candidates that do not include the skip mode are used. If the processing mode of the first partition is not the intra mode, more candidates including the skip mode are used.
  • the encoding apparatus 100 determines the total number of candidates for the processing mode of the second partition according to the processing mode of the first partition. Thereby, the encoding apparatus 100 can reduce candidates for the processing mode of the second partition according to the processing mode of the first partition.
  • the encoding apparatus 100 determines the total number of candidates for the processing mode of the second partition according to whether or not the processing mode of the first partition is the predetermined processing mode.
  • the predetermined processing mode is the intra mode, but the predetermined processing mode is not limited to the intra mode.
  • the predetermined processing mode may be any of a plurality of processing modes including an intra mode, an inter mode, a skip mode, and a merge mode.
  • the encoding apparatus 100 may determine a smaller number of candidates.
  • the encoding apparatus 100 may determine a larger number of candidates.
  • the encoding apparatus 100 applies a high-speed algorithm in the encoding method and the encoding process. That is, when the determination condition is satisfied, the encoding device 100 does not evaluate some candidates for the processing mode. Thereby, the processing amount is reduced.
  • FIG. 16 shows an encoding method and an encoding process performed by the encoding device 100 according to the second aspect.
  • the encoding apparatus 100 divides an image block into two triangular partitions, a first partition and a second partition (S201). For example, the encoding apparatus 100 divides the image block into a lower left triangle partition and an upper right triangle partition by a diagonal line connecting the upper left corner and the lower right corner as shown in FIG. 12F. Alternatively, the encoding apparatus 100 divides the image block into an upper left triangular partition and a lower right triangular partition by a diagonal line connecting the upper right corner and the lower left corner as shown in FIG. 12G.
  • the encoding apparatus 100 determines the total number of candidates for the processing parameter including the motion vector of each triangular partition according to the size parameter such as the image block size (S202).
  • the total number of candidates is greater than zero and may be selected from among the numbers according to the size parameter.
  • Each candidate may indicate the division direction of the image block, the motion vector of the first partition, and the motion vector of the second partition.
  • the size parameter may be an image block size or a triangle partition size.
  • the size parameter may be the number of samples in the image block or the number of samples in the triangle partition.
  • the size parameter may be the width of the image block, that is, the horizontal size of the image block, or the height of the image block, that is, the vertical size of the image block.
  • the size parameter may be the width of the triangular partition, that is, the horizontal size of the triangular partition, or the height of the triangular partition, that is, the vertical size of the triangular partition.
  • the size parameter may be a ratio related to the width and height of the image block, or may be a ratio related to the width and height of the triangular partition. Specifically, the size parameter may be a ratio of the width to the height of the image block, or may be a ratio of the width to the height of the triangle partition.
  • the encoding apparatus 100 acquires the ratio of the width to the height of the image block as a size parameter. Then, the encoding apparatus 100 determines the total number of candidates based on the ratio of the width to the height of the image block.
  • the total number of candidates may be determined to be the first value. Then, when the ratio of the width to the height of the image block is not larger than the first threshold value or smaller than the second threshold value, the total number of candidates may be determined as the second value.
  • the first threshold is smaller than the second threshold and is the reciprocal of the second threshold. The first value and the second value are greater than zero, and the first value is greater than the second value.
  • FIG. 17 shows an example of a plurality of candidates whose total number is equal to the first value or the second value. If the total number of candidates is equal to the second value, the candidates are reduced.
  • each candidate corresponds to the division direction of the image block, the motion vector candidate of the first partition, and the motion vector candidate of the second partition.
  • the motion vector of the first partition is selected from the first motion vector candidate list, and the motion vector of the second partition is selected from the second motion vector candidate list.
  • the first motion vector candidate list and the second motion vector candidate list are derived from a plurality of spatial partitions or a plurality of time partitions of the image block.
  • the plurality of spatial partitions are a plurality of partitions spatially adjacent to the current partition
  • the plurality of time partitions are a plurality of partitions temporally adjacent to the current partition.
  • each candidate may be assigned to the candidate list in the order of the selected probability.
  • a candidate with a high probability of being selected may be encoded into fewer bits than a candidate with a low probability of being selected.
  • the TL-BR shown as the dividing direction is a diagonal line connecting the upper left (TL: top-left) corner and the lower right (BR: bottom-right) corner as shown in FIG. 12F.
  • TR-BL shown as the dividing direction is such that the upper left triangular partition and the lower right are separated by a diagonal line connecting the upper right (TR: top-right) corner and the lower left (BL: bottom-left) corner as shown in FIG. 12G.
  • TR-BL shown as the dividing direction is such that the upper left triangular partition and the lower right are separated by a diagonal line connecting the upper right (TR: top-right) corner and the lower left (BL: bottom-left) corner as shown in FIG. 12G.
  • a plurality of candidates may be determined according to the division direction. That is, candidates that do not match the dividing direction may be excluded.
  • the total number of candidates may be determined based on the width and height of the image block. For example, when the width and height of the image block are larger than the threshold, the total number of the plurality of candidates may be the first value. Then, when the width or height of the image block is not larger than the threshold value, the total number of the plurality of candidates may be the second value. Alternatively, when the width or height of the image block is larger than the threshold, the total number of the plurality of candidates may be the first value. Then, when neither the width nor the height of the image block is larger than the threshold, the total number of the plurality of candidates may be the second value.
  • the threshold is an integer, both the first value and the second value are greater than zero, and the first value is not equal to the second value.
  • the encoding apparatus 100 evaluates each of the plurality of candidates determined by the determined total number with respect to the image block according to a predetermined evaluation criterion (S203). .
  • the encoding apparatus 100 highly evaluates a processing mode with high encoding efficiency and little image quality degradation.
  • the encoding apparatus 100 selects a processing parameter for the image block from a plurality of candidates according to the evaluation result (S204).
  • the encoding apparatus 100 encodes the image block using the selected processing parameter (S205). Thereby, the encoding apparatus 100 encodes each partition constituting the image block. For example, the encoding apparatus 100 encodes each partition by encoding an image block by applying a processing parameter to each partition.
  • the encoding apparatus 100 determines the total number of a plurality of processing parameter candidates including a motion vector based on the size parameter. Thereby, the encoding apparatus 100 can reduce the total number of a plurality of candidates based on the size parameter, and can reduce the processing amount.
  • the image block is divided into two triangular partitions, but may be divided into two rectangular partitions. Further, the image block may be divided into three or more partitions. Each partition may be a rectangular partition or a non-rectangular partition. Non-rectangular partitions are not limited to triangular partitions. The non-rectangular partition may be a pentagonal partition or a hexagonal partition.
  • the encoding apparatus 100 determines the total number of a plurality of processing parameter candidates according to the size parameter of the image block or the like after the image block is divided. However, before the image block is divided, the encoding apparatus 100 may determine the total number of a plurality of processing parameter candidates including the division direction of the image block and the motion vector of each partition according to the size parameter of the image block or the like. . Thereby, the encoding apparatus 100 can reduce candidates for the division direction according to the size parameter such as an image block.
  • FIG. 18 shows an encoding method and an encoding process performed by the encoding device 100 according to the third aspect.
  • the process of dividing the image block by the first division method, selecting the processing mode of the first partition, and dividing the image block by the second division method is the process in the first aspect ( S101, S102 and S103).
  • the encoding apparatus 100 divides the second partition into two triangular partitions, the third partition and the fourth partition (S304).
  • the encoding apparatus 100 determines the total number of a plurality of candidate processing parameters including the motion vector of each triangular partition according to the processing mode for the first partition (S305).
  • the total number of the plurality of candidates may be greater than zero and selected from the plurality of numbers according to the processing mode for the first partition.
  • Each candidate may indicate a motion vector of the third partition and a motion vector of the fourth partition.
  • the total number of candidates is determined according to whether or not the processing mode for the first partition is the skip mode.
  • the total number of the plurality of candidates may be determined to be the first value.
  • the total number of candidates may be determined to be the second value.
  • both the first value and the second value are integers, and the first value is larger than the second value.
  • the skip mode in the above example may be replaced with an intra mode, an inter mode, or a merge mode.
  • the total number of candidates may be determined according to whether the processing mode for the first partition is a triangular partition mode in which the first partition is divided into two triangular partitions for processing.
  • the total number of the plurality of candidates may be determined as the first value.
  • the total number of the plurality of candidates may be determined as the second value.
  • the first value is greater than the second value, and the second value is greater than zero.
  • the encoding apparatus 100 evaluates each of the plurality of candidates determined by the determined total number with respect to the second partition according to a predetermined evaluation criterion (S306). ). For example, the encoding apparatus 100 highly evaluates a processing mode with high encoding efficiency and little image quality degradation.
  • the encoding apparatus 100 selects a processing parameter for the second partition from a plurality of candidates according to the evaluation result (S307). Thereafter, the encoding apparatus 100 encodes the second partition using the selected processing parameter (S308). For example, the encoding apparatus 100 encodes the second partition by encoding the image block by applying the processing parameter to the second partition.
  • the encoding apparatus 100 determines the total number of a plurality of candidates for processing parameters related to the second partition that is the same as the first partition, based on the processing mode for the first partition. As a result, the encoding apparatus 100 can reduce processing parameter candidates according to the processing mode of the same partition obtained by dividing with a different dividing method, and can reduce the processing amount.
  • encoding apparatus 100 determines a plurality of motion vector candidates related to the second partition according to the processing mode of the first partition, more specifically, according to whether or not the processing mode of the first partition is the predetermined processing mode. To do. Accordingly, the encoding apparatus 100 can reduce motion vector candidates related to the second partition in accordance with the processing mode of the first partition, and can reduce the processing amount.
  • the partition in the above description may be replaced with a prediction unit. Also, the partition may be replaced with a sub prediction unit. Further, the image block in the above description may be replaced with an encoding unit. The image block may be replaced with a coding tree unit. Further, the triangular partition in the above description may be replaced with a non-rectangular partition.
  • the image block is divided into multiple partitions.
  • Each of the plurality of partitions may be a non-rectangular partition or a rectangular partition.
  • the non-rectangular partition is a partition different from the rectangular partition.
  • the non-rectangular partition is obtained when the image block is divided into a plurality of partitions and is not divided into only a plurality of rectangular partitions.
  • the processing of FIG. 16 and the processing of FIG. 18 may be combined.
  • the total number of candidates for the processing parameter for the second partition may be determined based on the processing mode for the first partition, the size of the second partition, and the like.
  • processing mode may be simply expressed as a mode.
  • processing mode selected from a plurality of candidates may be expressed as the best processing mode or the best mode.
  • the operations shown in the first aspect, the second aspect, and the third aspect are basically performed by the inter prediction unit 126 of the encoding device 100.
  • the operation related to the division may be performed by the division unit 102 of the encoding device 100.
  • operations related to encoding may be performed by the entropy encoding unit 110 of the encoding device 100.
  • FIG. 19 is a block diagram illustrating an implementation example of the encoding device 100.
  • the encoding device 100 includes a circuit 160 and a memory 162.
  • a plurality of components of the encoding device 100 illustrated in FIG. 1 are implemented by the circuit 160 and the memory 162 illustrated in FIG.
  • the circuit 160 is an electronic circuit that can access the memory 162 and performs information processing.
  • the circuit 160 is a dedicated or general-purpose electronic circuit that encodes a moving image using the memory 162.
  • the circuit 160 may be a processor such as a CPU.
  • the circuit 160 may be an aggregate of a plurality of electronic circuits.
  • the circuit 160 may serve as a plurality of constituent elements excluding the constituent elements for storing information among the plurality of constituent elements of the encoding device 100 shown in FIG. That is, the circuit 160 may perform the operation described above as the operation of these components.
  • the memory 162 is a dedicated or general-purpose memory in which information for the circuit 160 to encode a moving image is stored.
  • the memory 162 may be an electronic circuit, may be connected to the circuit 160, or may be included in the circuit 160.
  • the memory 162 may be an assembly of a plurality of electronic circuits or may be configured by a plurality of sub memories. Further, the memory 162 may be a magnetic disk or an optical disk, or may be expressed as a storage or a recording medium. The memory 162 may be a non-volatile memory or a volatile memory.
  • the memory 162 may serve as a component for storing information among a plurality of components of the encoding device 100 illustrated in FIG. Specifically, the memory 162 may serve as the block memory 118 and the frame memory 122 shown in FIG.
  • the memory 162 may store a moving image to be encoded, or may store a bit string corresponding to the encoded moving image.
  • the memory 162 may store a program for the circuit 160 to encode a moving image.
  • not all of the plurality of components shown in FIG. 1 may be mounted, or all of the plurality of processes described above may not be performed. Some of the plurality of components shown in FIG. 1 may be included in another device, and some of the plurality of processes described above may be executed by another device.
  • a part of the plurality of components shown in FIG. 1 is mounted, and a part of the plurality of processes described above is performed, so that the image block is divided. Partitions can be processed efficiently.
  • FIG. 20 is a flowchart showing a first operation example of the encoding apparatus 100 shown in FIG.
  • the circuit 160 in the encoding device 100 performs the operation illustrated in FIG. 20 using the memory 162.
  • the circuit 160 divides the image block (S401). Then, the circuit 160 determines the total number of candidate processing parameters for the second partition in accordance with the first processing mode for the first partition (S402).
  • the first partition is a partition obtained by dividing an image block using the first division method.
  • the second partition is a partition obtained as the same partition as the first partition by dividing the image block using a second division method different from the first division method.
  • the circuit 160 selects a processing parameter from a plurality of candidates determined by the determined total number (S403). Then, the circuit 160 encodes the second partition using the selected processing parameter (S404).
  • the encoding apparatus 100 reduces the total number of candidates for the processing parameters for the second partition obtained as the same partition by the second division method according to the first processing mode for the first partition obtained by the first division method. can do. Therefore, the encoding apparatus 100 can reduce the processing amount.
  • each of the first partition and the second partition is a triangular partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameters for the second partition obtained as the same triangular partition according to the first processing mode for the first partition obtained as the triangular partition. Therefore, the encoding apparatus 100 can suppress an increase in the processing amount related to the triangle partition.
  • the first processing mode is one of a plurality of processing modes including an intra mode, an inter mode, a skip mode, and a merge mode.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates according to the first processing mode such as the intra mode, the inter mode, the skip mode, or the merge mode.
  • the circuit 160 determines whether or not the first processing mode is the predetermined processing mode, and determines the total number according to whether or not the first processing mode is the predetermined processing mode. Thereby, the encoding apparatus 100 can reduce the total number of candidates according to whether or not the first processing mode is the predetermined processing mode.
  • the predetermined processing mode is a skip mode.
  • the circuit 160 determines the first number as the total number. Then, when it is determined that the first processing mode is not the skip mode, the circuit 160 determines a second number different from the first number as the total number. Thereby, the encoding apparatus 100 can reduce the total number of a plurality of candidates according to whether or not the first processing mode is the skip mode.
  • the first number is smaller than the second number. Therefore, the encoding apparatus 100 can reduce the total number of a plurality of candidates when the first processing mode is the skip mode.
  • the circuit 160 evaluates each of a plurality of candidates determined by the determined total number, and selects a processing parameter from the plurality of candidates according to the evaluation. Thereby, the encoding apparatus 100 can select an appropriate processing parameter from the plurality of candidates according to the evaluation of each of the plurality of candidates.
  • the processing parameter includes a motion vector
  • each of the plurality of candidates is a processing parameter candidate including a motion vector.
  • the encoding apparatus 100 can reduce the total number of a plurality of motion vector candidates, and can reduce the amount of processing for selecting a motion vector from the plurality of candidates.
  • the processing parameter includes a second processing mode for the second partition.
  • Each of the plurality of candidates is a processing parameter candidate including the second processing mode. Accordingly, the encoding apparatus 100 can reduce the total number of the plurality of candidates for the second processing mode for the second partition, and the process for selecting the second processing mode for the second partition from the plurality of candidates. The amount can be reduced.
  • FIG. 21 is a flowchart showing a second operation example of the encoding apparatus 100 shown in FIG.
  • the circuit 160 in the encoding device 100 performs the operation illustrated in FIG. 21 using the memory 162.
  • the circuit 160 divides the image block (S501). Then, the circuit 160 determines the total number of candidates for the processing parameter including the motion vector of the partition according to one size parameter of the partition obtained by dividing the image block and the image block (S502).
  • the circuit 160 selects a processing parameter from a plurality of candidates determined by the determined total number (S503). Then, the circuit 160 encodes the partition using the selected processing parameter (S504).
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size parameter. Therefore, the encoding apparatus 100 can reduce the processing amount.
  • the partition is a triangular partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of processing parameter candidates including the motion vector of the triangular partition according to the size parameter. Therefore, the encoding apparatus 100 can suppress an increase in the processing amount related to the triangle partition.
  • the size parameter is the size of the image block.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size of the image block.
  • the size parameter is the size of the partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the size of the partition.
  • the size parameter is the number of samples in the partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the number of samples in the partition.
  • the size parameter is the partition width.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the width of the partition.
  • the size parameter is the height of the partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the height of the partition.
  • the size parameter is a ratio related to the width and height of the partition.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to the ratio regarding the width and height of the partition.
  • the circuit 160 acquires the ratio of the width to the partition height as a size parameter, and determines the total number according to the ratio of the width to the partition height. Thereby, the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition in accordance with the ratio of the width to the partition height.
  • the circuit 160 determines the first number as the total number. Then, when the ratio of the width to the partition height is not larger than the first threshold or smaller than the second threshold, the circuit 160 determines a second number different from the first number as the total number.
  • the first threshold is smaller than the second threshold and is the reciprocal of the second threshold.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition according to whether the height and width of the partition are greatly different.
  • the first number is larger than the second number.
  • the encoding apparatus 100 can reduce the total number of a plurality of candidates for the processing parameter including the motion vector of the partition when the height and width of the partition are greatly different.
  • the circuit 160 evaluates each of a plurality of candidates determined by the determined total number, and selects a processing parameter from the plurality of candidates according to the evaluation. Thereby, the encoding apparatus 100 can select an appropriate processing parameter from the plurality of candidates according to the evaluation of each of the plurality of candidates.
  • the description of the encoding device 100 is mainly performed, but the decoding device 200 may operate in a decoding operation similarly to the encoding operation of the encoding device 100.
  • the encoding in the above description may be read as decoding.
  • the encoding apparatus 100 may encode information for selecting a processing parameter from a plurality of candidates determined according to the total number.
  • the decoding apparatus 200 may decode information for selecting a processing parameter from a plurality of candidates determined according to the total number.
  • the information for selecting a processing parameter from a plurality of candidates determined according to the total number may be identification information such as an index.
  • the encoding device 100 and the decoding device 200 may evaluate each of a plurality of candidates determined according to the total number according to a common evaluation criterion, and select a processing parameter according to the evaluation result. Thereby, the encoding apparatus 100 and the decoding apparatus 200 can select the same processing parameter. In addition, the code amount is further reduced.
  • the encoding device 100 and the decoding device 200 in the present embodiment may be used as an image encoding device and an image decoding device, respectively, or may be used as a moving image encoding device and a moving image decoding device, respectively.
  • each of the encoding device 100 and the decoding device 200 can be used as a prediction device or an inter prediction device. That is, the encoding apparatus 100 and the decoding apparatus 200 may support only 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.
  • At least a part of the present embodiment may be used as an encoding method, may be used as a decoding method, may be used as a prediction method, or may be used as another method. Also good.
  • each component may be configured by 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 a processor reading and executing a software program recorded on a recording medium such as a hard disk or a semiconductor memory.
  • each of the encoding device 100 and the decoding device 200 includes a processing circuit (Processing Circuit) and a storage device (Storage) electrically connected to the processing circuit and accessible from the processing circuit. You may have.
  • the processing circuit corresponds to the circuit 160 or 260
  • the storage device corresponds to the memory 162 or 262.
  • the processing circuit includes at least one of dedicated hardware and a program execution unit, and executes processing using a storage device. Further, when the processing circuit includes a program execution unit, the storage device stores a software program executed by the program execution unit.
  • the software that realizes the encoding apparatus 100 or the decoding apparatus 200 of the present embodiment is the following program.
  • the program includes a step of dividing an image block into a computer, and the first dividing method according to a first processing mode for a first partition obtained by dividing the image block using the first dividing method. Determining the total number of candidates for processing parameters for the second partition obtained as the same partition as the first partition by dividing the image block using a different second dividing method; and the determined total number And a step of selecting the processing parameter from among the plurality of candidates defined by the step of encoding the second partition using the selected processing parameter.
  • the program may include a motion vector of the partition according to a size parameter of one of the step of dividing the image block, the partition obtained by dividing the image block, and the image block. Determining a total number of a plurality of candidates for parameters, selecting the processing parameter from among the plurality of candidates defined by the determined total number, and encoding the partition using the selected processing parameters
  • the encoding method including the step of converting is executed.
  • Each component may be a circuit as described above. These circuits may constitute one circuit as a whole, or may be separate circuits. Each component may be realized by a general-purpose processor or a dedicated processor.
  • the encoding / decoding device may include the encoding device 100 and the decoding device 200.
  • ordinal numbers such as the first and second used in the description may be appropriately replaced.
  • an ordinal number may be newly given to a component or the like, or may be removed.
  • the aspect of the encoding apparatus 100 and the decoding apparatus 200 was demonstrated based on embodiment, the aspect of the encoding apparatus 100 and decoding apparatus 200 is not limited to this embodiment. As long as it does not deviate from the gist of the present disclosure, the encoding device 100 and the decoding device 200 may be configured in which various modifications conceived by those skilled in the art have been made in the present embodiment, or in a form constructed by combining components in different embodiments. It may be included within the scope of the embodiment.
  • This aspect may be implemented in combination with at least a part of other aspects in the present disclosure.
  • a part of the processing, a part of the configuration of the apparatus, a part of the syntax, and the like described in the flowchart of this aspect may be combined with another aspect.
  • each of the functional blocks can usually be realized by an MPU, a memory, and the like. Further, the processing by each functional block is usually realized by a program execution unit such as a processor reading and executing software (program) recorded on a recording medium such as a ROM. The software may be distributed by downloading or the like, or may be distributed by being recorded on a recording medium such as a semiconductor memory. Naturally, each functional block can be realized by hardware (dedicated circuit).
  • each embodiment may be realized by centralized processing using a single device (system), or may be realized by distributed processing using a plurality of devices. Good.
  • the number of processors that execute the program may be one or more. That is, centralized processing may be performed, or distributed processing may be performed.
  • the system includes an image encoding device using an image encoding method, an image decoding device using an image decoding method, and an image encoding / decoding device including both.
  • Other configurations in the system can be appropriately changed according to circumstances.
  • FIG. 22 is a diagram showing an overall configuration of a content supply system ex100 that implements a content distribution service.
  • the communication service providing area is divided into desired sizes, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations, are installed in each cell.
  • devices such as a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, and a smartphone ex115 via the Internet ex101, the Internet service provider ex102 or the communication network ex104, and the base stations ex106 to ex110.
  • the content supply system ex100 may be connected by combining any of the above elements.
  • Each device may be directly or indirectly connected to each other via a telephone network or a short-range wireless communication without using the base stations ex106 to ex110 which are fixed wireless stations.
  • the streaming server ex103 is connected to each device such as a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, and a smartphone ex115 via the Internet ex101.
  • the streaming server ex103 is connected to a terminal in a hot spot in the airplane ex117 via the satellite ex116.
  • 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 the airplane ex117 without going through the satellite ex116.
  • the camera ex113 is a device that can shoot still images and moving images such as a digital camera.
  • the smartphone ex115 is a smartphone, a cellular phone, or a PHS (Personal Handyphone System) that is compatible with a mobile communication system generally called 2G, 3G, 3.9G, 4G, and 5G in the future.
  • a mobile communication system generally called 2G, 3G, 3.9G, 4G, and 5G in the future.
  • the home appliance ex118 is a device included in a refrigerator or a household fuel cell cogeneration system.
  • a terminal having a photographing function is connected to the streaming server ex103 through the base station ex106 or the like, thereby enabling live distribution or the like.
  • the terminal (computer ex111, game machine ex112, camera ex113, home appliance ex114, smartphone ex115, terminal in airplane ex117, etc.) is used for the still image or video content captured by the user using the terminal.
  • the encoding process described in each embodiment is performed, and the video data obtained by the encoding and the sound data obtained by encoding the sound corresponding to the video are multiplexed, and the obtained data is transmitted to the streaming server ex103. That is, each terminal functions as an image encoding device according to an aspect of the present disclosure.
  • the streaming server ex103 streams the content data transmitted to the requested client.
  • the client is a computer or the like in the computer ex111, the game machine ex112, the camera ex113, the home appliance ex114, the smart phone ex115, or the airplane ex117 that can decode the encoded data.
  • Each device that has received the distributed data decrypts and reproduces the received data. That is, each device functions as an image decoding device according to an aspect of the present disclosure.
  • the streaming server ex103 may be a plurality of servers or a plurality of computers, and may process, record, and distribute data in a distributed manner.
  • the streaming server ex103 may be realized by a CDN (Contents Delivery Network), and content distribution may be realized by a network connecting a large number of edge servers and edge servers distributed all over the world.
  • CDN Contents Delivery Network
  • edge servers that are physically close to each other are dynamically allocated according to clients. Then, the content can be cached and distributed to the edge server, thereby reducing the delay.
  • the processing is distributed among multiple edge servers, the distribution subject is switched to another edge server, or the part of the network where the failure has occurred Since detouring can be continued, high-speed and stable distribution can be realized.
  • the captured data may be encoded at each terminal, may be performed on the server side, or may be shared with each other.
  • a processing loop is performed twice.
  • the first loop the complexity of the image or the code amount in units of frames or scenes is detected.
  • the second loop processing for maintaining the image quality and improving the coding efficiency is performed.
  • the terminal performs the first encoding process
  • the server receiving the content performs the second encoding process, thereby improving the quality and efficiency of the content while reducing the processing load on each terminal. it can.
  • the encoded data of the first time performed by the terminal can be received and reproduced by another terminal, enabling more flexible real-time distribution.
  • the camera ex113 or the like extracts a feature amount from an image, compresses data relating to the feature amount as metadata, and transmits the metadata to the server.
  • the server performs compression according to the meaning of the image, for example, by determining the importance of the object from the feature amount and switching the quantization accuracy.
  • the feature data is particularly effective for improving the accuracy and efficiency of motion vector prediction at the time of re-compression on the server.
  • simple coding such as VLC (variable length coding) may be performed at the terminal, and coding with a large processing load such as CABAC (context adaptive binary arithmetic coding) may be performed at the server.
  • a plurality of video data in which almost the same scene is captured by a plurality of terminals.
  • a GOP Group of Picture
  • a picture unit or a tile obtained by dividing a picture using a plurality of terminals that have performed shooting and other terminals and servers that have not performed shooting as necessary.
  • Distributed processing is performed by assigning encoding processing in units or the like. Thereby, delay can be reduced and real-time property can be realized.
  • the server may manage and / or instruct the video data captured by each terminal to refer to each other.
  • the encoded data from each terminal may be received by the server and the reference relationship may be changed among a plurality of data, or the picture itself may be corrected or replaced to be encoded again. This makes it possible to generate a stream with improved quality and efficiency of each piece of data.
  • the server may distribute the video data after performing transcoding to change the encoding method of the video data.
  • the server may convert the MPEG encoding system to the VP encoding. 264. It may be converted into H.265.
  • the encoding process can be performed by a terminal or one or more servers. Therefore, in the following, description such as “server” or “terminal” is used as the subject performing processing, but part or all of processing performed by the server may be performed by the terminal, or processing performed by the terminal may be performed. Some or all may be performed at the server. The same applies to the decoding process.
  • the server not only encodes a two-dimensional moving image, but also encodes a still image automatically based on a scene analysis of the moving image or at a time specified by the user and transmits it to the receiving terminal. Also good.
  • the server can acquire the relative positional relationship between the photographing terminals, the server obtains the three-dimensional shape of the scene based on not only the two-dimensional moving image but also the video obtained by photographing the same scene from different angles. Can be generated.
  • the server may separately encode the three-dimensional data generated by the point cloud or the like, and the video to be transmitted to the receiving terminal based on the result of recognizing or tracking the person or the object using the three-dimensional data.
  • the images may be selected or reconstructed from videos captured by a plurality of terminals.
  • the user can arbitrarily select each video corresponding to each photographing terminal and enjoy a scene, or can display a video of an arbitrary viewpoint from three-dimensional data reconstructed using a plurality of images or videos. You can also enjoy the clipped content.
  • sound is collected from a plurality of different angles, and the server may multiplex and transmit sound from a specific angle or space according to the video.
  • the server may create viewpoint images for the right eye and the left eye, respectively, and perform encoding that allows reference between each viewpoint video by Multi-View Coding (MVC) or the like. You may encode as another stream, without referring. At the time of decoding another stream, it is preferable to reproduce in synchronization with each other so that a virtual three-dimensional space is reproduced according to the viewpoint of the user.
  • MVC Multi-View Coding
  • the server superimposes virtual object information in the virtual space on the camera information in the real space based on the three-dimensional position or the movement of the user's viewpoint.
  • the decoding device may acquire or hold virtual object information and three-dimensional data, generate a two-dimensional image according to the movement of the user's viewpoint, and create superimposition data by connecting them smoothly.
  • the decoding device transmits the movement of the user's viewpoint to the server in addition to the request for the virtual object information, and the server creates superimposition data according to the movement of the viewpoint received from the three-dimensional data held in the server,
  • the superimposed data may be encoded and distributed to the decoding device.
  • the superimposed data has an ⁇ value indicating transparency in addition to RGB
  • the server sets the ⁇ value of a portion other than the object created from the three-dimensional data to 0 or the like, and the portion is transparent. May be encoded.
  • the server may generate data in which a RGB value of a predetermined value is set as the background, such as a chroma key, and the portion other than the object is set to the background color.
  • the decryption processing of the distributed data may be performed at each terminal as a client, may be performed on the server side, or may be performed in a shared manner.
  • a terminal may once send a reception request to the server, receive content corresponding to the request at another terminal, perform a decoding process, and transmit a decoded signal to a device having a display.
  • a part of a region such as a tile in which a picture is divided may be decoded and displayed on a viewer's personal terminal while receiving large-size image data on a TV or the like. Accordingly, it is possible to confirm at hand the area in which the person is responsible or the area to be confirmed in more detail while sharing the whole image.
  • access to encoded data on the network such as when the encoded data is cached in a server that can be accessed from the receiving terminal in a short time, or copied to the edge server in the content delivery service. It is also possible to switch the bit rate of received data based on ease.
  • the content switching will be described using a scalable stream that is compression-encoded by applying the moving image encoding method shown in each of the above embodiments shown in FIG.
  • the server may have a plurality of streams of the same content and different quality as individual streams, but the temporal / spatial scalable implementation realized by dividing into layers as shown in the figure.
  • the configuration may be such that the content is switched by utilizing the characteristics of the stream.
  • the decoding side decides which layer to decode according to internal factors such as performance and external factors such as the state of communication bandwidth, so that the decoding side can combine low-resolution content and high-resolution content. You can switch freely and decrypt. For example, when the user wants to continue watching the video that was viewed on the smartphone ex115 while moving on a device such as an Internet TV after returning home, the device only has to decode the same stream to a different layer, so the load on the server side Can be reduced.
  • the enhancement layer includes meta information based on image statistical information, etc., in addition to the configuration in which the picture is encoded for each layer and the enhancement layer exists above the base layer.
  • the decoding side may generate content with high image quality by super-resolution of the base layer picture based on the meta information.
  • Super-resolution may be either improvement of the SN ratio at the same resolution or enlargement of the resolution.
  • the meta information includes information for specifying a linear or non-linear filter coefficient used for super-resolution processing, or information for specifying a parameter value in filter processing, machine learning, or least square calculation used for super-resolution processing. .
  • the picture may be divided into tiles or the like according to the meaning of the object in the image, and the decoding side may select only a part of the region by selecting the tile to be decoded.
  • the decoding side can determine the position of the desired object based on the meta information. Can be identified and the tile containing the object can be determined.
  • the meta information is stored using a data storage structure different from the pixel data such as the SEI message in HEVC. This meta information indicates, for example, the position, size, or color of the main object.
  • meta information may be stored in units composed of a plurality of pictures, such as streams, sequences, or random access units.
  • the decoding side can acquire the time when the specific person appears in the video, etc., and can match the picture in which the object exists and the position of the object in the picture by combining with the information in units of pictures.
  • FIG. 25 is a diagram showing an example of a web page display screen on the computer ex111 or the like.
  • FIG. 26 is a diagram illustrating a display screen example of a web page on the smartphone ex115 or the like.
  • the web page may include a plurality of link images that are links to the image content, and the appearance differs depending on the browsing device. When a plurality of link images are visible on the screen, the display device until the user explicitly selects the link image, or until the link image approaches the center of the screen or the entire link image enters the screen.
  • the (decoding device) displays a still image or an I picture included in each content as a link image, displays a video like a gif animation with a plurality of still images or I pictures, or receives only a base layer to receive a video. Are decoded and displayed.
  • the display device When the link image is selected by the user, the display device decodes the base layer with the highest priority. If there is information indicating that the HTML constituting the web page is scalable content, the display device may decode up to the enhancement layer. Also, in order to ensure real-time properties, the display device only decodes forward reference pictures (I picture, P picture, forward reference only B picture) before being selected or when the communication band is very strict. In addition, the delay between the decoding time of the first picture and the display time (delay from the start of content decoding to the start of display) can be reduced by displaying. Further, the display device may intentionally ignore the reference relationship of pictures and roughly decode all B pictures and P pictures with forward reference, and perform normal decoding as the number of received pictures increases over time.
  • forward reference pictures I picture, P picture, forward reference only B picture
  • the receiving terminal when transmitting and receiving still image or video data such as two-dimensional or three-dimensional map information for automatic driving or driving support of a car, the receiving terminal adds meta data to image data belonging to one or more layers. Weather or construction information may also be received and decoded in association with each other. The meta information may belong to a layer or may be simply multiplexed with image data.
  • the receiving terminal since the car, drone, airplane, or the like including the receiving terminal moves, the receiving terminal transmits the position information of the receiving terminal at the time of the reception request, thereby seamless reception and decoding while switching the base stations ex106 to ex110. Can be realized.
  • the receiving terminal can dynamically switch how much meta-information is received or how much map information is updated according to the user's selection, the user's situation, or the communication band state. become.
  • the encoded information transmitted by the user can be received, decoded and reproduced in real time by the client.
  • the content supply system ex100 can perform not only high-quality and long-time content by a video distributor but also unicast or multicast distribution of low-quality and short-time content by an individual. Moreover, such personal contents are expected to increase in the future.
  • the server may perform the encoding process after performing the editing process. This can be realized, for example, with the following configuration.
  • the server After shooting, the server performs recognition processing such as shooting error, scene search, semantic analysis, and object detection from the original image or encoded data. Then, the server manually or automatically corrects out-of-focus or camera shake based on the recognition result, or selects a less important scene such as a scene whose brightness is lower than that of other pictures or is out of focus. Edit such as deleting, emphasizing the edge of an object, and changing the hue.
  • the server encodes the edited data based on the editing result. It is also known that if the shooting time is too long, the audience rating will decrease, and the server will move not only in the less important scenes as described above, but also in motion according to the shooting time. A scene with few images may be automatically clipped based on the image processing result. Alternatively, the server may generate and encode a digest based on the result of the semantic analysis of the scene.
  • the server may change and encode the face of the person in the periphery of the screen or the inside of the house into an unfocused image.
  • the server recognizes whether or not a face of a person different from the person registered in advance is shown in the encoding target image, and if so, performs processing such as applying a mosaic to the face part. May be.
  • the user designates a person or background area that the user wants to process an image from the viewpoint of copyright, etc., and the server replaces the designated area with another video or blurs the focus. It is also possible to perform such processing. If it is a person, the face image can be replaced while tracking the person in the moving image.
  • the decoding device first receives the base layer with the highest priority and performs decoding and reproduction, depending on the bandwidth.
  • the decoding device may receive the enhancement layer during this time, and may play back high-quality video including the enhancement layer when played back twice or more, such as when playback is looped.
  • a stream that is scalable in this way can provide an experience in which the stream becomes smarter and the image is improved gradually, although it is a rough moving picture when it is not selected or at the beginning of viewing.
  • the same experience can be provided even if the coarse stream played back the first time and the second stream coded with reference to the first video are configured as one stream. .
  • these encoding or decoding processes are generally processed in the LSI ex500 included in each terminal.
  • the LSI ex500 may be configured as a single chip or a plurality of chips.
  • moving image encoding or decoding software is incorporated into some recording medium (CD-ROM, flexible disk, hard disk, etc.) that can be read by the computer ex111 and the like, and encoding or decoding processing is performed using the software. Also good.
  • moving image data acquired by the camera may be transmitted. The moving image data at this time is data encoded by the LSI ex500 included in the smartphone ex115.
  • the LSI ex500 may be configured to download and activate application software.
  • the terminal first determines whether the terminal is compatible with the content encoding method or has a specific service execution capability. If the terminal does not support the content encoding method or does not have the capability to execute a specific service, the terminal downloads a codec or application software, and then acquires and reproduces the content.
  • the content supply system ex100 via the Internet ex101, but also a digital broadcasting system, at least the moving image encoding device (image encoding device) or the moving image decoding device (image decoding device) of the above embodiments. Any of these can be incorporated.
  • the unicasting of the content supply system ex100 is suitable for multicasting because it uses a satellite or the like to transmit and receive multiplexed data in which video and sound are multiplexed on broadcasting radio waves.
  • the same application is possible for the encoding process and the decoding process.
  • FIG. 27 is a diagram illustrating the smartphone ex115.
  • FIG. 28 is a diagram illustrating a configuration example of the smartphone ex115.
  • the smartphone ex115 receives the antenna ex450 for transmitting / receiving radio waves to / from the base station ex110, the camera unit ex465 capable of taking video and still images, the video captured by the camera unit ex465, and the antenna ex450.
  • a display unit ex458 for displaying data obtained by decoding the video or the like.
  • the smartphone ex115 further includes an operation unit ex466 that is a touch panel or the like, a voice output unit ex457 that is a speaker or the like for outputting voice or sound, a voice input unit ex456 that is a microphone or the like for inputting voice, and photographing.
  • Memory unit ex467 that can store encoded video or still image, recorded audio, received video or still image, encoded data such as mail, or decoded data, and a user, and network
  • An external memory may be used instead of the memory unit ex467.
  • a main control unit ex460 that comprehensively controls the display unit ex458, the operation unit ex466, and the like, 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, multiplexing / demultiplexing unit ex453, audio signal processing unit ex454, slot unit ex464, and memory unit ex467 are connected via bus ex470.
  • the power supply circuit unit ex461 starts up the smartphone ex115 in an operable state by supplying power from the battery pack to each unit.
  • the smartphone ex115 performs processing such as calling and data communication based on the control of the main control unit ex460 having a CPU, a ROM, a RAM, and the like.
  • the voice signal picked up by the voice input unit ex456 is converted into a digital voice signal by the voice signal processing unit ex454, spread spectrum processing is performed by the modulation / demodulation unit ex452, and digital / analog conversion is performed by the transmission / reception unit ex451.
  • the data is transmitted via the antenna ex450.
  • the received data is amplified and subjected to frequency conversion processing and analog-digital conversion processing, spectrum despreading processing is performed by the modulation / demodulation unit ex452, and converted to analog audio signal by the audio signal processing unit ex454, and then this is output to the audio output unit ex457.
  • text, still image, or video data is sent to the main control unit ex460 via the operation input control unit ex462 by the operation of the operation unit ex466 of the main body unit, and transmission / reception processing is performed similarly.
  • the video signal processing unit ex455 uses the video signal stored in the memory unit ex467 or the video signal input from the camera unit ex465 as described above.
  • the video data is compressed and encoded by the moving picture encoding method shown in the form, and the encoded video data is sent to the multiplexing / demultiplexing unit ex453.
  • the audio signal processing unit ex454 encodes the audio signal picked up by the audio input unit ex456 while the camera unit ex465 captures a video or a still image, and sends the encoded audio data to the multiplexing / separating unit ex453. To do.
  • the multiplexing / demultiplexing unit ex453 multiplexes the encoded video data and the encoded audio data by a predetermined method, and the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the modulation / demodulation unit ex451 perform modulation processing and conversion.
  • the data is processed and transmitted via the antenna ex450.
  • the multiplexing / demultiplexing unit ex453 performs multiplexing By separating the data, the multiplexed data is divided into a bit stream of video data and a bit stream of audio data, and the encoded video data is supplied to the video signal processing unit ex455 via the synchronization bus ex470. The converted audio data is supplied to the audio signal processing unit ex454.
  • the video signal processing unit ex455 decodes the video signal by the video decoding method corresponding to the video encoding method shown in each of the above embodiments, and is linked from the display unit ex458 via the display control unit ex459.
  • a video or still image included in the moving image file is displayed.
  • the audio signal processing unit ex454 decodes the audio signal, and the audio is output from the audio output unit ex457. Since real-time streaming is widespread, depending on the user's situation, there may be occasions where audio playback is not socially appropriate. Therefore, it is desirable that the initial value is a configuration in which only the video data is reproduced without reproducing the audio signal. Audio may be synchronized and played back only when the user performs an operation such as clicking on video data.
  • the smartphone ex115 has been described here as an example, in addition to a transmission / reception terminal having both an encoder and a decoder as a terminal, a transmission terminal having only an encoder and a reception having only a decoder There are three possible mounting formats: terminals.
  • terminals In the digital broadcasting system, it has been described as receiving or transmitting multiplexed data in which audio data or the like is multiplexed with video data.
  • multiplexed data includes character data related to video in addition to audio data. Multiplexing may be performed, and video data itself may be received or transmitted instead of multiplexed data.
  • the terminal often includes a GPU. Therefore, a configuration may be adopted in which a wide area is processed in a lump by utilizing the performance of the GPU by using a memory shared by the CPU and the GPU or a memory whose addresses are managed so as to be used in common. As a result, the encoding time can be shortened, real-time performance can be ensured, and low delay can be realized. In particular, it is efficient to perform motion search, deblocking filter, SAO (Sample Adaptive Offset), and transformation / quantization processing in batches in units of pictures or the like instead of the CPU.
  • SAO Sample Adaptive Offset
  • the present disclosure can be used for, for example, a television receiver, a digital video recorder, a car navigation, a mobile phone, a digital camera, a digital video camera, a video conference system, or an electronic mirror.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

L'invention concerne un dispositif de codage (100) comprenant un circuit (160) et une mémoire (162). Le circuit exécute : une étape d'utilisation de la mémoire (162) pour diviser un bloc d'image ; une étape de détermination, selon un paramètre de taille d'une partition obtenue en divisant un bloc d'image ou un paramètre de taille du bloc d'image, un nombre total de candidats multiples pour un paramètre de traitement comprenant un vecteur de mouvement de partition ; une étape de sélection d'un paramètre de traitement parmi des candidats multiples déterminés sur la base du nombre total déterminé ; et une étape d'utilisation du paramètre de traitement sélectionné pour coder la seconde partition.
PCT/JP2019/006175 2018-02-21 2019-02-19 Dispositif de codage, et procédé de codage WO2019163795A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862633379P 2018-02-21 2018-02-21
US62/633379 2018-02-21

Publications (1)

Publication Number Publication Date
WO2019163795A1 true WO2019163795A1 (fr) 2019-08-29

Family

ID=67687679

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2019/006175 WO2019163795A1 (fr) 2018-02-21 2019-02-19 Dispositif de codage, et procédé de codage

Country Status (1)

Country Link
WO (1) WO2019163795A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2022530922A (ja) * 2020-01-08 2022-07-04 テンセント・アメリカ・エルエルシー Ｌ型パーティションツリー

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013047811A1 (fr) * 2011-09-29 2013-04-04 シャープ株式会社 Dispositif de décodage d'image, procédé de décodage d'image et dispositif de codage d'image

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013047811A1 (fr) * 2011-09-29 2013-04-04 シャープ株式会社 Dispositif de décodage d'image, procédé de décodage d'image et dispositif de codage d'image

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
AHN, YONG-JO ET AL.: "Diagonal motion partitions on top of QTBT block structure", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-TSG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 8TH MEETING, 18 October 2017 (2017-10-18), Macao, CN, XP030151089 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2022530922A (ja) * 2020-01-08 2022-07-04 テンセント・アメリカ・エルエルシー Ｌ型パーティションツリー
JP7423126B2 (ja) 2020-01-08 2024-01-29 テンセント・アメリカ・エルエルシー Ｌ型パーティションツリー
US12010306B2 (en) 2020-01-08 2024-06-11 Tencent America LLC L-type partitioning tree

Similar Documents

Publication Publication Date Title
JP7087030B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2018199051A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2018181448A1 (fr) Dispositif de codage d'image, dispositif de décodage d'image, procédé de codage d'image, procédé de décodage d'image
WO2018212110A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019151279A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
JP7339890B2 (ja) 符号化装置及び復号装置
WO2018190207A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP2021048619A (ja) 符号化装置及び符号化方法
WO2019189346A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019208372A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
WO2018212111A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP7001822B2 (ja) 復号装置及び復号方法
WO2018199050A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019151284A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2018097115A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP2022093625A (ja) 符号化装置、復号装置、符号化方法、及び復号方法
JP6770192B2 (ja) 符号化装置、符号化方法、復号装置及び復号方法
JPWO2019098152A1 (ja) 復号装置、画像復号装置及び復号方法
JP2020198655A (ja) 復号装置及び復号方法
WO2019189344A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP2021180494A (ja) 復号装置、復号方法、及び、非一時的記憶媒体
WO2019163794A1 (fr) Dispositif de codage, et procédé de codage
WO2019151280A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019151297A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
JP2023016992A (ja) 符号化装置及び復号装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19757476

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19757476

Country of ref document: EP

Kind code of ref document: A1