WO2019065329A1 - Dispositif et procédé de codage, et dispositif et procédé de décodage - Google Patents

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

Info

Publication number
WO2019065329A1
WO2019065329A1 PCT/JP2018/034310 JP2018034310W WO2019065329A1 WO 2019065329 A1 WO2019065329 A1 WO 2019065329A1 JP 2018034310 W JP2018034310 W JP 2018034310W WO 2019065329 A1 WO2019065329 A1 WO 2019065329A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
sub
processing
unit
blocks
Prior art date
Application number
PCT/JP2018/034310
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 WO2019065329A1 publication Critical patent/WO2019065329A1/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/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/583—Motion compensation with overlapping blocks

Definitions

  • the present disclosure relates to an encoding device, a decoding device, an encoding method, and a decoding method.
  • HEVC High-Efficiency Video Coding
  • JCT-VC Joint Collaborative Team on Video Coding
  • the present disclosure aims to provide an encoding device, a decoding device, an encoding method, or a decoding method that can realize further improvement.
  • An encoding apparatus includes a circuit and a memory, and the circuit uses an inter prediction process to perform motion compensation in units of sub blocks in the inter prediction process using the memory.
  • the circuit uses an inter prediction process to perform motion compensation in units of sub blocks in the inter prediction process using the memory.
  • the present disclosure can provide a coding device, a decoding device, a coding method or a decoding method that can realize further improvement.
  • FIG. 5C is a conceptual diagram for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 5D is a diagram illustrating an example of FRUC.
  • FIG. 6 is a diagram for describing pattern matching (bilateral matching) between two blocks along a motion trajectory.
  • FIG. 7 is a diagram for describing pattern matching (template matching) between a template in a current picture and a block in a reference picture.
  • FIG. 8 is a diagram for explaining a model assuming uniform linear motion.
  • FIG. 9A is a diagram for describing 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 describing an overview of motion vector derivation processing in the merge mode.
  • FIG. 9A is a diagram for describing 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 describing an
  • FIG. 9C is a conceptual diagram for describing an overview of DMVR processing.
  • FIG. 9D is a diagram for describing an outline 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 illustrating a first example of inter prediction processing in the encoding device and the decoding device according to the first embodiment.
  • FIG. 12A is a diagram for describing an application method of the block unit OBMC process.
  • FIG. 12B is a diagram for describing an application method of the sub-block unit OBMC process.
  • FIG. 13A is a diagram for describing a detailed processing flow on the premise of parallel processing for the block unit OBMC processing.
  • FIG. 13B is a diagram for describing a detailed processing flow on the premise of parallel processing for the sub-block unit OBMC processing.
  • FIG. 14 is a flowchart illustrating a second example of inter prediction processing in the encoding device and the decoding device according to Embodiment 1.
  • FIG. 15A is a diagram for describing an application method of the block unit OBMC process.
  • FIG. 15B is a diagram for describing an application method of the sub-block unit OBMC process.
  • FIG. 16A is a diagram for describing a detailed processing flow on the premise of parallel processing for the block unit OBMC processing.
  • FIG. 16B is a diagram for describing a detailed processing flow on the premise of parallel processing for the sub-block unit OBMC processing.
  • FIG. 17 is a flowchart illustrating a third example of inter prediction processing in the encoding device and the decoding device according to Embodiment 1.
  • FIG. 18A is a diagram for describing an application method of the block unit OBMC process.
  • FIG. 18B is a diagram for describing an application method of the sub-block unit OBMC process.
  • FIG. 19A is a diagram for describing a detailed processing flow on the premise of parallel processing for the block unit OBMC processing.
  • FIG. 19B is a diagram for describing a detailed processing flow on the premise of parallel processing with respect to sub-block unit OBMC processing.
  • FIG. 20 is a flowchart for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 20 is a flowchart for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 21 is a conceptual diagram for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 22 is an overall configuration diagram of a content supply system for realizing 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 is a diagram showing an example of a display screen of a web page.
  • FIG. 26 is a diagram showing an example of a display screen of a web page.
  • FIG. 27 is a diagram illustrating an example of a smartphone.
  • FIG. 28 is a block diagram showing a configuration example of a smartphone.
  • Embodiment 1 First, an outline of the first embodiment will be described as an example of an encoding apparatus and a decoding apparatus to which the process and / or the configuration described in each aspect of the present disclosure described later can be applied.
  • Embodiment 1 is merely an example of an encoding apparatus and a decoding apparatus to which the processing and / or configuration described in each aspect of the present disclosure can be applied, and the processing and / or configuration described in each aspect of the present disclosure Can also be implemented in an encoding apparatus and a decoding apparatus different from those in the first embodiment.
  • the manner of implementation of the processing and / or configuration described in each aspect of the present disclosure is not limited to the above example.
  • the process may be implemented in an apparatus used for a purpose different from that of the moving picture / image coding apparatus or the moving picture / image decoding apparatus disclosed in the first embodiment, or the processing and / or configuration described in each aspect. May be implemented alone. Also, the processes and / or configurations described in the different embodiments may be implemented in combination.
  • FIG. 1 is a block diagram showing a functional configuration of coding apparatus 100 according to the first embodiment.
  • the encoding device 100 is a moving image / image coding device that encodes a moving image / image in units of blocks.
  • the encoding apparatus 100 is an apparatus for encoding an image in units of blocks, and includes a dividing unit 102, a subtracting unit 104, a converting unit 106, a quantizing unit 108, and entropy coding.
  • Unit 110 inverse quantization unit 112, inverse transformation unit 114, addition unit 116, block memory 118, loop filter unit 120, frame memory 122, intra prediction unit 124, inter prediction unit 126, And a prediction control unit 128.
  • the encoding device 100 is realized by, for example, a general-purpose processor and a memory.
  • the processor controls the division unit 102, the subtraction unit 104, the conversion unit 106, the quantization unit 108, the entropy coding unit 110, and the dequantization unit 112.
  • the inverse transform unit 114, the addition unit 116, the loop filter unit 120, the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 function.
  • coding apparatus 100 includes division section 102, subtraction section 104, conversion section 106, quantization section 108, entropy coding section 110, inverse quantization section 112, inverse conversion section 114, addition section 116, and loop filter section 120. , And may be realized as one or more dedicated electronic circuits corresponding to the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.
  • FIG. 2 is a diagram showing an example of block division in the first embodiment.
  • solid lines represent block boundaries by quadtree block division
  • broken lines represent block boundaries by binary tree block division.
  • the block 10 is a square block (128 ⁇ 128 block) of 128 ⁇ 128 pixels.
  • the 128x128 block 10 is first divided into four square 64x64 blocks (quadtree block division).
  • the upper right 64x64 block is divided horizontally into two rectangular 64x32 blocks 14 and 15 (binary block division).
  • the lower left 64x64 block is divided into four square 32x32 blocks (quadtree block division). Of the four 32x32 blocks, the upper left block and the lower right block are further divided.
  • the upper left 32x32 block is vertically divided into two rectangular 16x32 blocks, and the right 16x32 block is further horizontally split into two 16x16 blocks (binary block division).
  • the lower right 32x32 block is divided horizontally into two 32x16 blocks (binary block division).
  • the lower left 64x64 block is divided into a 16x32 block 16, two 16x16 blocks 17, 18, two 32x32 blocks 19, 20, and two 32x16 blocks 21, 22.
  • the lower right 64x64 block 23 is not divided.
  • the block 10 is divided into thirteen variable sized blocks 11 to 23 based on recursive quadtree and binary tree block division. Such division is sometimes called quad-tree plus binary tree (QTBT) division.
  • QTBT quad-tree plus binary tree
  • the original signal is an input signal of the coding apparatus 100, and is a signal (for example, a luminance (luma) signal and two color difference (chroma) signals) representing an image of each picture constituting a moving image.
  • a signal representing an image may also be referred to as a sample.
  • Transform section 106 transforms the prediction error in the spatial domain into a transform coefficient in the frequency domain, and outputs the transform coefficient to quantization section 108.
  • the transform unit 106 performs, for example, discrete cosine transform (DCT) or discrete sine transform (DST) determined in advance on the prediction error in the spatial domain.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • Transform section 106 adaptively selects a transform type from among a plurality of transform types, and transforms the prediction error into transform coefficients using a transform basis function corresponding to the selected transform type. You may Such transformation may be referred to as explicit multiple core transform (EMT) or adaptive multiple transform (AMT).
  • EMT explicit multiple core transform
  • AMT adaptive multiple transform
  • the plurality of transformation types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I and DST-VII.
  • FIG. 3 is a table showing transform basis functions corresponding to each transform type. In FIG. 3, N indicates the number of input pixels. The choice of transform type from among these multiple transform types may depend, for example, on the type of prediction (intra-prediction and inter-prediction) or depending on the intra-prediction mode.
  • Information indicating whether to apply such EMT or AMT (for example, called an AMT flag) and information indicating the selected conversion type are signaled at CU level. Note that the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • the conversion unit 106 may re-convert the conversion coefficient (conversion result). Such reconversion may be referred to as adaptive secondary transform (AST) or non-separable secondary transform (NSST). For example, the conversion unit 106 performs reconversion for each sub block (for example, 4 ⁇ 4 sub blocks) included in the block of transform coefficients corresponding to the intra prediction error.
  • the information indicating whether to apply the NSST and the information on the transformation matrix used for the NSST are signaled at the CU level. Note that the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • Separable conversion is a method in which conversion is performed multiple times by separating in each direction as many as the number of dimensions of the input, and Non-Separable conversion is two or more when the input is multidimensional. This is a method of collectively converting the dimensions of 1 and 2 into one dimension.
  • Non-Separable conversion if the input is a 4 ⁇ 4 block, it is regarded as one array having 16 elements, and 16 ⁇ 16 conversion is performed on the array There is one that performs transformation processing with a matrix.
  • the quantization unit 108 quantizes the transform coefficient output from the transform unit 106. Specifically, the quantization unit 108 scans the transform coefficient of the current block in a predetermined scan order, and quantizes the transform coefficient based on the quantization parameter (QP) corresponding to the scanned transform coefficient. Then, the quantization unit 108 outputs the quantized transform coefficient of the current block (hereinafter, referred to as a quantization coefficient) to the entropy coding 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 scan order is defined in ascending order (low frequency to high frequency) or descending order (high frequency to low frequency) of the 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, as the value of the quantization parameter increases, the quantization error increases.
  • the entropy coding unit 110 generates a coded signal (coded bit stream) by subjecting the quantization coefficient input from the quantization unit 108 to variable-length coding. Specifically, for example, the entropy coding unit 110 binarizes the quantization coefficient and performs arithmetic coding on the binary signal.
  • the inverse quantization unit 112 inversely quantizes the quantization coefficient which is the input from the quantization unit 108. Specifically, the inverse quantization unit 112 inversely quantizes the quantization coefficient of the current block in a predetermined scan 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 inversely transforming the transform coefficient which is the input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 restores the prediction error of the current block by performing inverse transform corresponding to the transform by the transform unit 106 on the transform coefficient. Then, the inverse conversion 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 subtracting unit 104 because the information is lost due to quantization. That is, the restored prediction error includes the quantization error.
  • the addition unit 116 reconstructs the current block by adding the prediction error, which is the input from the inverse conversion unit 114, and the prediction sample, which is the input from the prediction control unit 128. Then, the addition unit 116 outputs the reconstructed block to the block memory 118 and the loop filter unit 120. Reconstruction blocks may also be referred to as local decoding blocks.
  • 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 coding loop, and includes, for example, a deblocking filter (DF), a sample adaptive offset (SAO), an adaptive loop filter (ALF) and the like.
  • a least squares error filter is applied to remove coding distortion, for example, multiple 2x2 subblocks in the current block, based on local gradient direction and activity.
  • One filter selected from the filters is applied.
  • subblocks for example, 2x2 subblocks
  • 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 the subblock is determined among the plurality of filters.
  • FIGS. 4A to 4C are diagrams showing a plurality of examples of filter shapes used in ALF.
  • FIG. 4A shows a 5 ⁇ 5 diamond shaped filter
  • FIG. 4B shows a 7 ⁇ 7 diamond shaped filter
  • FIG. 4C shows a 9 ⁇ 9 diamond shaped filter.
  • Information indicating the shape of the filter is signaled at the picture level. Note that the signaling of the information indicating the shape of the filter does not have to be limited to the picture level, and may be another level (for example, sequence level, slice level, tile level, CTU level or CU level).
  • the frame memory 122 is a storage unit for storing a reference picture used for inter prediction, and may be referred to as a frame buffer. Specifically, the frame memory 122 stores the reconstructed block filtered by the loop filter unit 120.
  • 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.
  • the plurality of directionality prediction modes are, for example, H. It includes 33 directional prediction modes defined by 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 showing 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra prediction. Solid arrows indicate H. A broken line arrow represents the added 32 directions, which represents the 33 directions defined in the H.265 / HEVC standard.
  • a luminance block may be referred to in intra prediction of a chrominance block. That is, the chrominance component of the current block may be predicted based on the luminance component of the current block.
  • Such intra prediction may be referred to as cross-component linear model (CCLM) prediction.
  • the intra prediction mode (for example, referred to as a CCLM mode) of a chrominance block referencing such a luminance block may be added as one of the intra prediction modes of the chrominance 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 directions. Intra prediction with such correction is sometimes called position dependent intra prediction combination (PDPC). Information indicating the presence or absence of application of PDPC (for example, called a PDPC flag) is signaled, for example, at CU level. Note that the signaling of this information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • the inter prediction unit 126 performs inter prediction (also referred to as inter-frame prediction) of a current block with reference to a reference picture that is a reference picture stored in the frame memory 122 and that is different from the current picture. Generate a prediction signal). Inter prediction is performed in units of a current block or sub blocks (for example, 4 ⁇ 4 blocks) in the current block. For example, the inter prediction unit 126 performs motion estimation on the current block or sub block in the reference picture. 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 the 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-frame prediction
  • the inter prediction signal may be generated using not only the motion information of the current block obtained by the motion search but also the motion information of the adjacent block. Specifically, the inter prediction signal is generated in units of sub blocks in the current block by weighting and adding a prediction signal based on motion information obtained by motion search and a prediction signal based on motion information of an adjacent block. It may be done.
  • Such inter prediction (motion compensation) may be called OBMC (overlapped block motion compensation).
  • OBMC block size information indicating the size of the sub-block for the OBMC
  • OBMC flag information indicating whether or not to apply the OBMC mode
  • the level of signaling of these pieces of information need not be limited to the sequence level and the CU level, and may be other levels (eg, picture level, slice level, tile level, CTU level or subblock level) Good.
  • FIG. 5B and FIG. 5C are a flowchart and a conceptual diagram for explaining an outline of predicted image correction processing by OBMC processing.
  • a predicted image (Pred) by normal motion compensation is acquired using the motion vector (MV) assigned to the encoding target block.
  • the motion vector (MV_L) of the encoded left adjacent block is applied to the current block to obtain a predicted image (Pred_L), and the predicted image and Pred_L are weighted and superimposed. Perform the first correction of the image.
  • the right adjacent block and the lower adjacent block may be used to perform correction more than two steps. It is possible.
  • the area to be superimposed may not be the pixel area of the entire block, but only a partial 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.
  • FIG. 5D An example of the FRUC process is shown in FIG. 5D.
  • a plurality of candidate lists (which may be common to the merge list) each having a predicted motion vector are generated Be done.
  • the best candidate MV is selected from among the plurality of candidate MVs registered in the candidate list. For example, an evaluation value of each candidate included in the candidate list is calculated, and one candidate is selected based on the evaluation value.
  • 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 derived as it is as the motion vector for the current block.
  • a motion vector for the current block may be derived by performing pattern matching in a peripheral region of a position in the reference picture corresponding to the selected candidate motion vector. That is, the search is performed on the area around the best candidate MV by the same method, and if there is an MV for which the evaluation value is good, the best candidate MV is updated to the MV and the current block is updated. It may be used as the final MV. In addition, it is also possible to set it as the structure which does not implement the said process.
  • the evaluation value is calculated by calculating the difference value of the reconstructed image by pattern matching between the area in the reference picture corresponding to the motion vector and the predetermined area. Note that the evaluation value may be calculated using information other than the difference value.
  • pattern matching is performed between two blocks in two different reference pictures, which are along 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 calculation of the evaluation value of the candidate 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 among pairs of two blocks in two reference pictures (Ref0, Ref1) which are two blocks along the motion trajectory of the current block (Cur block), Two motion vectors (MV0, MV1) are derived by searching for the most matching pair. Specifically, for the current block, a reconstructed image at a designated position in the first encoded reference picture (Ref 0) designated by the candidate MV, and a symmetric MV obtained by scaling the candidate MV at a display time interval.
  • the difference with the reconstructed image at the specified position in the second coded reference picture (Ref 1) specified in step is derived, and the evaluation value is calculated using the obtained difference value.
  • the candidate MV with the best evaluation value among the plurality of candidate MVs may be selected as the final MV.
  • motion vectors (MV0, MV1) pointing to two reference blocks are the temporal distance between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1) It is proportional to (TD0, TD1).
  • the mirror symmetric bi-directional motion vector Is derived when the current picture is temporally located between two reference pictures, and the temporal distances from the current picture to the two reference pictures are equal, in the first pattern matching, the 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 (eg, upper and / or left adjacent blocks)) 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 area for calculating the evaluation value of the candidate described above.
  • FIG. 7 is a diagram for explaining an example of pattern matching (template matching) between a template in a current picture and a block in a reference picture.
  • the current block (Cur Pic) is searched for in the reference picture (Ref 0) for a block that most closely matches a block adjacent to the current block (Cur block).
  • Motion vectors are derived.
  • the evaluation value is calculated using the obtained difference value, and the candidate MV having the best evaluation value among the plurality of candidate MVs is selected as the best candidate MV Good.
  • a FRUC flag Information indicating whether to apply such a FRUC mode (for example, called a FRUC flag) is signaled at the CU level.
  • a signal for example, called a FRUC mode flag
  • a method of pattern matching for example, first pattern matching or second pattern matching
  • the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level, CTU level or subblock level) .
  • This mode is sometimes referred to as a bi-directional optical flow (BIO) mode.
  • BIO bi-directional optical flow
  • FIG. 8 is a diagram for explaining a model assuming uniform linear motion.
  • (v x , v y ) indicate velocity vectors
  • ⁇ 0 and ⁇ 1 indicate the time between the current picture (Cur Pic) and two reference pictures (Ref 0 and Ref 1 ), respectively.
  • (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 .
  • the optical flow equation is: (i) the time derivative of the luminance value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of the reference image, and (iii) the vertical velocity and the spatial gradient of the reference image The product of the vertical components of and the sum of is equal to zero.
  • a motion vector in units of blocks obtained from a merge list or the like is corrected in units of pixels.
  • the motion vector may be derived on the decoding device side by a method different from the derivation of the motion vector based on a model assuming uniform linear motion.
  • motion vectors may be derived on a subblock basis based on motion vectors of a plurality of adjacent blocks.
  • This mode is sometimes referred to as affine motion compensation prediction mode.
  • FIG. 9A is a diagram for describing derivation of a motion vector in units of sub blocks based on motion vectors of a plurality of adjacent blocks.
  • the current block includes sixteen 4 ⁇ 4 subblocks.
  • 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 subblock Be done.
  • the motion vector (v x , v y ) of each sub block in the current block is derived according to the following equation (2).
  • x and y indicate the horizontal position and the vertical position of the sub block, respectively, and w indicates a predetermined weighting factor.
  • the prediction control unit 128 selects one of the intra prediction signal and the inter prediction signal, and outputs the selected signal as a prediction signal to the subtraction unit 104 and the addition unit 116.
  • FIG. 9B is a diagram for describing an overview of motion vector derivation processing in the merge mode.
  • a predicted MV list in which candidates for predicted MV are registered is generated.
  • the prediction MV candidate the position of the coding target block in the coded reference picture, which is the MV of the plurality of coded blocks located in the spatial periphery of the coding target block, is projected
  • Temporally adjacent prediction MV which is an MV possessed by a nearby block
  • joint prediction MV which is an MV generated by combining spatially adjacent prediction MV and MVs of temporally adjacent prediction MV, and zero prediction MV whose value is MV, etc.
  • one prediction MV is selected from among the plurality of prediction MVs registered in the prediction MV list, and it is determined as the MV of the current block.
  • merge_idx which is a signal indicating which prediction MV has been selected, is described in the stream and encoded.
  • the prediction MVs registered in the prediction MV list described in FIG. 9B are an example, and the number is different from the number in the drawing, or the configuration does not include some types of the prediction MV in the drawing, It may have a configuration in which prediction MVs other than the type of prediction MV in the drawing are added.
  • the final MV may be determined by performing the DMVR process described later using the MV of the coding target block derived in the merge mode.
  • FIG. 9C is a conceptual diagram for describing an overview of DMVR processing.
  • a first reference picture which is a processed picture in the L0 direction and a second reference picture which is a processed picture in the L1 direction To generate a template by averaging each reference pixel.
  • the cost value is calculated using the difference value between each pixel value of the template and each pixel value of the search area, the MV value, and the like.
  • FIG. 9D is a diagram for describing 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 current block to be coded is derived from a reference picture which is a coded picture.
  • a predicted image for a block to be encoded is generated.
  • the shape of the peripheral reference area in FIG. 9D is an example, and other shapes may be used.
  • a predicted image is generated from a plurality of reference pictures, and is similar to the reference image acquired from each reference picture. After performing luminance correction processing by a method, a predicted image is generated.
  • lic_flag is a signal indicating whether to apply the LIC process.
  • the encoding apparatus it is determined whether or not the encoding target block belongs to the area in which the luminance change occurs, and when it belongs to the area in which the luminance change occurs, as lic_flag A value of 1 is set and encoding is performed by applying LIC processing, and when not belonging to an area where a luminance change occurs, a value of 0 is set as lic_flag and encoding is performed without applying the LIC processing.
  • the decoding apparatus decodes lic_flag described in the stream to switch whether to apply the LIC processing according to the value and performs decoding.
  • determining whether to apply the LIC process for example, there is also a method of determining according to whether or not the LIC process is applied to the peripheral block.
  • a method of determining according to whether or not the LIC process is applied to the peripheral block For example, when the encoding target block is in merge mode, whether or not the surrounding encoded blocks selected in the derivation of the MV in merge mode processing are encoded by applying LIC processing According to the result, whether to apply the LIC process is switched to perform encoding. In the case of this example, the processing in the decoding is completely 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 a moving image / image in units of blocks.
  • the decoding apparatus 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse conversion unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, and a frame memory 214. , 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. In this case, when the processor executes the software program stored in the memory, the processor determines whether the entropy decoding unit 202, the inverse quantization unit 204, the inverse conversion unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216 functions as an inter prediction unit 218 and a prediction control unit 220.
  • the decoding apparatus 200 is a dedicated unit corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse conversion 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. And one or more electronic circuits.
  • the entropy decoding unit 202 entropy decodes the coded bit stream. Specifically, the entropy decoding unit 202 performs arithmetic decoding, for example, from a coded bit stream to a binary signal. Then, the entropy decoding unit 202 debinarizes the binary signal. Thereby, the entropy decoding unit 202 outputs the quantization coefficient to the dequantization unit 204 in block units.
  • the inverse quantization unit 204 inversely quantizes the quantization coefficient of the block to be decoded (hereinafter referred to as a current block), which is an input from the entropy decoding unit 202. Specifically, the dequantization part 204 dequantizes the said quantization coefficient about each of the quantization coefficient of a current block based on the quantization parameter corresponding to the said quantization coefficient. Then, the dequantization unit 204 outputs the dequantized quantization coefficient (that is, transform coefficient) of the current block to the inverse transformation unit 206.
  • a current block which is an input from the entropy decoding unit 202.
  • the dequantization part 204 dequantizes the said quantization coefficient about each of the quantization coefficient of a current block based on the quantization parameter corresponding to the said quantization coefficient. Then, the dequantization unit 204 outputs the dequantized quantization coefficient (that is, transform coefficient) of the current block to the inverse transformation unit 206.
  • the inverse transform unit 206 restores the prediction error by inversely transforming the transform coefficient that is the input from the inverse quantization unit 204.
  • the inverse transform unit 206 determines the current block based on the deciphered transformation type information. Inverse transform coefficients of
  • the inverse transform unit 206 applies inverse retransformation to the transform coefficients.
  • the addition unit 208 adds the prediction error, which is the input from the inverse conversion unit 206, and the prediction sample, which is the input from the prediction control unit 220, to reconstruct the current block. Then, the adding unit 208 outputs the reconstructed block to the block memory 210 and the loop filter unit 212.
  • the block memory 210 is a storage unit for storing a block within a picture to be decoded (hereinafter referred to as a current picture) which is a block referred to in intra prediction. 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 and a display device or 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 may be referred to as a frame buffer. Specifically, the frame memory 214 stores the reconstructed block filtered by the loop filter unit 212.
  • the intra prediction unit 216 refers to a block in the current picture stored in the block memory 210 to perform intra prediction based on the intra prediction mode read from the coded bit stream, thereby generating a prediction signal (intra prediction Signal). Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to samples (for example, luminance value, color difference value) of a block adjacent to the current block, and performs prediction control on the intra prediction signal. Output to unit 220.
  • the intra prediction unit 216 may predict the chrominance 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 reference pixels in the horizontal / vertical directions.
  • the inter prediction unit 218 predicts the current block with reference to the reference picture stored in the frame memory 214.
  • the prediction is performed in units of the current block or subblocks (for example, 4 ⁇ 4 blocks) in the current block.
  • 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 coded bit stream, and generates an inter prediction signal. It is output to the prediction control unit 220.
  • the inter prediction unit 218 determines not only the motion information of the current block obtained by the motion search but also the motion information of the adjacent block. Use to generate an inter prediction signal.
  • the inter prediction unit 218 is configured to follow the method of pattern matching deciphered from the coded stream (bilateral matching or template matching). 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 uniform linear motion. Also, in the case where the information deciphered from the coded bit stream indicates that the affine motion compensation prediction mode is applied, the inter prediction unit 218 performs motion vectors in units of sub blocks based on motion vectors of a plurality of adjacent blocks. Derive
  • Inter prediction can be selected from a plurality of modes (normal mode, merge mode, affine mode, etc.), and a motion vector (MV) is derived using the selected mode.
  • the plurality of modes are classified into a mode for deriving an MV in prediction block units and a mode for deriving an MV in subblock units obtained by further dividing the prediction block.
  • FIG. 11 is a flowchart illustrating a first example of inter prediction processing in encoding apparatus 100 and decoding apparatus 200 according to Embodiment 1.
  • the MV in block units for the normal mode is derived (S103).
  • the inter prediction mode information indicates the block unit merge mode (merge mode (block) of S102)
  • the MV for the merge mode is derived in block units (S104).
  • inter prediction mode information indicates the merge mode in units of subblocks (merge mode (subblock) in S102)
  • MVs for merge mode are derived in units of subblocks (S107).
  • inter prediction mode information indicates an affine mode (affine mode in S102)
  • an MV in units of sub-blocks for affine mode is derived (S108).
  • the merge mode (subblock) and the affine mode are classified into subblock-based modes.
  • motion compensation processing (MC processing) is performed in sub block units using the derived MV to generate a prediction image (S109 to S111), and OBMC processing is applied in sub block units.
  • the prediction image is corrected (S112 to S114).
  • OBMC processing is applied to the upper, left, lower, and right boundaries of each processing target sub-block.
  • the loop in prediction block units is ended based on a predetermined loop end condition (S115).
  • process flow of FIG. 11 is an example, and part of the described processes may be removed or processes not described may be added.
  • the processing flow described here is basically common except that the signal necessary for processing is encoded into a stream or decoded from the stream.
  • FIG. 12A and 12B are diagrams for explaining an application method of the block unit OBMC process and the sub block unit OBMC process described with reference to FIG.
  • the hatched area in the drawing is an area to which the correction processing by the OBMC is applied to the predicted image of the processing target block.
  • Arrows in the figure indicate reference destinations of MV values of peripheral blocks or sub blocks for performing correction processing.
  • the reference pixel of the correction target area is acquired using the MV of the processed block (upper adjacent block) adjacent to the upper side of the upper boundary area of the processing target block, and the processing target Correction is performed by weighting and overlapping with the predicted image of the block. Similarly, correction processing is performed on the area of the left boundary of the processing target block using the MV of the left adjacent block.
  • the MV of the upper adjacent sub-block belonging to the upper adjacent block or the same processing target block with respect to the upper boundary of the processing target sub block is acquired using this, and the correction is performed by weighting with the predicted image of the processing target sub-block and overlapping.
  • correction processing is performed on the left boundary area of the processing target sub-block using the MV of the left adjacent block or the left adjacent sub-block belonging to the same processing target block.
  • correction processing is performed on the lower boundary and right boundary regions using the MVs of the lower adjacent subblock and the right adjacent subblock.
  • the number of pixels of the reference image necessary for correction and the number of times of superposition increase, and the transfer amount and processing amount of data for acquiring the reference image required for that purpose It will increase.
  • FIGS. 13A and 13B are diagrams for describing a detailed processing flow assuming parallel processing, for the block unit OBMC processing and the sub block unit OBMC processing described with reference to FIG.
  • the arrows in the figure indicate the dependency of each processing block, and the horizontal length of each processing block in the figure indicates an approximate processing time.
  • FIG. 13A is a diagram for describing parallel processing in block unit OBMC processing.
  • the MV of the adjacent block is acquired and the prediction MV (MVP) is acquired (S201).
  • the MV of the processing target block is derived using the acquired MVP and other information (S202).
  • MC processing in units of blocks is performed using the derived MV to generate a predicted image (S203).
  • the predicted image is corrected by performing block-based OBMC processing (S205).
  • S205 block-based OBMC processing
  • FIG. 13B is a diagram for describing parallel processing in sub-block unit OBMC processing.
  • the MV of the adjacent block is acquired to acquire a predicted MV (MVP) (S301).
  • MVP predicted MV
  • the MV of each sub-block in the processing target block is derived (S302).
  • MC processing in units of sub blocks is performed using the derived MV to generate a predicted image (S303).
  • the predicted image is corrected by performing sub-block unit OBMC processing (S305).
  • the MVs of the respective subblocks within the processing target block are also required for the reference pixels for correction necessary for the subblock unit OBMC processing.
  • step S304 transfer process of the reference pixel can be performed only in parallel with the MC process (S303) as in step S304 in the figure.
  • the transfer amount of data for acquiring the required reference image is increased, so the processing time of step S304 is significantly longer than that of step S204. It will be longer. Therefore, it becomes a bottleneck and the start of the sub-block unit OBMC processing is delayed. As a result, processing of the target block may not be completed within the required processing time.
  • FIG. 14 is a flowchart showing a second example of inter prediction processing in encoding apparatus 100 and decoding apparatus 200 according to Embodiment 1.
  • the process in the sub-block unit OBMC process, the process is not applied to the lower and right boundaries of each process target sub block, and the process is applied only to the upper and left boundaries.
  • the point is different from the first example described in FIG. Specifically, in the OBMC process in units of sub-blocks, correction of a predicted image is performed by applying the process only to the upper and left boundaries of the sub-blocks (S401).
  • the processing amount in the OBMC processing may be reduced as compared with the first example, and an increase in processing time may be suppressed.
  • FIG. 14 describes MC processing and OBMC processing as individual sub-block unit loops in sub-book unit processing, both processes are collectively performed in one sub-block unit loop. You may go.
  • the processing flow described here is basically common except that the signal necessary for processing is encoded into a stream or decoded from the stream.
  • FIGS. 15A and 15B are diagrams for explaining an application method of the block unit OBMC processing and the sub block unit OBMC processing described with reference to FIG.
  • the hatched area in the drawing is an area to which the correction processing by the OBMC is applied to the predicted image of the processing target block.
  • Arrows in the figure indicate reference destinations of MV values of peripheral blocks or sub blocks for performing correction processing.
  • the block unit OBMC of FIG. 15A is completely the same as the first example described in FIG. 12A.
  • the sub-block unit OBMC of FIG. 15B correction processing using MVs of blocks or sub-blocks adjacent to the lower and right sides of each processing sub-block is not performed, and upper and left boundaries of each processing sub block are Only the correction process using the MV of the upper adjacent block and the left adjacent block or the upper adjacent sub block and the left adjacent sub block is performed on the region.
  • the number of pixels of the reference image necessary for correction and the number of times of superposition are reduced to half as compared with the first example, and the reference image required for that purpose is reduced. It is also possible to significantly suppress the transfer amount and processing amount of data to be acquired.
  • correction processing may be performed on all subblocks in the processing target block, or correction processing may be performed on only some of the subblocks in the processing target block. In any case, correction processing using only the MVs of the upper adjacent block and the left adjacent block or upper adjacent sub block and the left adjacent sub block of each processing target sub block is performed on all the sub blocks that perform the correction processing. It may be applied, or may be applied to some subblocks among the subblocks to be subjected to the correction processing.
  • FIGS. 16A and 16B are diagrams for describing a detailed processing flow on the premise of parallel processing, for the block unit OBMC processing and the sub block unit OBMC processing described with reference to FIG.
  • the arrows in the figure indicate the dependency of each processing block, and the horizontal length of each processing block in the figure indicates an approximate processing time.
  • the block-based prediction mode of FIG. 16A is completely the same as the first example described in FIG. 13A.
  • the transfer process (S501) of the reference image required for the OBMC process and the OBMC process (S502) are the transfer process (S304) and the first example described in FIG. It differs from the OBMC process (S305).
  • S501 the transfer process of the reference image required for the OBMC process and the OBMC process
  • S304 the transfer process
  • S305 the first example described in FIG. It differs from the OBMC process
  • the transfer process of FIG. 16B only pixels for MVs of blocks and subblocks adjacent to the upper and left sides of each subblock are transferred.
  • the processing time related to the transfer processing of the reference image required in the sub-block unit OBMC is significantly suppressed, and as a result, the waiting time for the start of the sub-block unit OBMC processing is also greatly suppressed. There is a high probability that the processing of the target block can be completed in time.
  • FIG. 17 is a flowchart illustrating a third example of inter prediction processing in encoding apparatus 100 and decoding apparatus 200 according to Embodiment 1.
  • the process is not applied to the lower and right boundaries of each processing target sub block, and is performed on the upper and left boundaries. Does not apply processing.
  • the third example is different from the first example and the second example in that only the subblocks located at the left end and the upper end among the plurality of subblocks included in the processing target block are to be processed.
  • the subblock unit loop it is determined whether the subblock is the left end or the right end subblock (S601). Then, when the sub block is the left end or the right end sub block (Yes in S601), correction of the predicted image is performed by applying the process only to the upper and left boundaries of the sub block (S401). On the other hand, when the sub block is not the left end or the right end sub block (No in S601), the OBMC process is not applied to the sub block.
  • the processing amount in OBMC processing may be reduced as compared to the first and second examples, and an increase in processing time may be suppressed.
  • FIG. 17 describes MC processing and OBMC processing as individual sub-block unit loops in processing on a sub-book basis, both processings are collectively performed in one sub-block unit loop. May be
  • the processing flow described here is basically common except that the signal necessary for processing is encoded into a stream or decoded from the stream.
  • FIGS. 18A and 18B are diagrams for explaining an application method of the block unit OBMC process and the sub block unit OBMC process described with reference to FIG.
  • the hatched area in the drawing is an area to which the correction processing by the OBMC is applied to the predicted image of the processing target block.
  • Arrows in the figure indicate reference destinations of MV values of peripheral blocks or sub blocks for performing correction processing.
  • the block unit OBMC of FIG. 18A is completely the same as the first example described in FIG. 12A.
  • the correction process using the MV of the block or sub-block adjacent to the lower side and the right side of each processing target sub-block is not performed. Only the correction process using the MV of the upper adjacent block and the left adjacent block or the upper adjacent sub block and the left adjacent sub block is performed on the upper boundary and the left boundary of the processing target sub block.
  • FIG. 18B unlike the first example of FIG. 12B and the second example of FIG. 15B, among the plurality of subblocks included in the processing target block, only the subblocks located at the left end and the upper end are processed. .
  • the number of pixels of the reference image necessary for correction and the number of superpositions are significantly reduced compared to the first example, and a reference image required for that is acquired
  • the amount of data transfer and the amount of processing can also be greatly reduced.
  • peripheral processed blocks to be referenced to acquire the reference pixels necessary for correction, the area to which the correction processing is applied, and the number of superpositions have the same configuration as that of the block unit OBMC. And the possibility that the processing flow of the sub-block unit OBMC can be made common.
  • a value common to that of the block unit OBMC may be used for the number of pixel rows to be subjected to the correction process of the sub block unit OBMC and the strength of the correction process (weighting coefficient of the superposition process).
  • the block unit OBMC and the sub block unit OBMC can be shared not only for the processing flow but also for the superposition processing for correction.
  • FIGS. 19A and 19B are diagrams for describing a detailed processing flow assuming parallel processing, for the block unit OBMC processing and the sub block unit OBMC processing described with reference to FIG.
  • the arrows in the figure indicate the dependency of each processing block, and the horizontal length of each processing block in the figure indicates an approximate processing time.
  • the block-based prediction mode of FIG. 19A is completely the same as the first example described in FIG. 13A.
  • the transfer process (S701) of the reference image required for the OBMC process and the OBMC process (S702) are the transfer process (S304) of the first example described in FIG. This is different from the OBMC process (S305).
  • the sub-block unit OBMC processing (S702) in the third example only the sub-blocks located at the left end and the upper end of the processing target block are processed. Furthermore, since only the MVs of the processed blocks (upper adjacent block and left adjacent block) adjacent to the upper side and the left side are used, transfer of the reference image is started when the MV of the adjacent block is acquired as in block unit OBMC. Is possible. Further, as described in FIG. 18B, since the number of pixels of the reference image required for the correction process is significantly reduced, the processing time involved in the transfer process is also significantly shortened, as shown in step S701 in the figure. In addition, the transfer of reference pixels becomes possible in parallel with other processing in a parallel relationship substantially similar to the block unit OBMC, and the possibility of completing the processing of the target block within the required processing time becomes high.
  • FIGS. 20 and 21 are a flowchart and a conceptual diagram for explaining an outline of the predicted image correction process by the OBMC process described with reference to FIGS. 11 to 19B.
  • MV motion vector assigned to a processing target block
  • Pred predicted image
  • the motion vector (MV_L) of the processed left adjacent block is applied to the processing target block to obtain a prediction image (Pred_L) (S802), and a prediction image is obtained by superimposing Pred and Pred_L with a weight.
  • the first correction is performed (S803).
  • the motion vector (MV_U) of the processed upper adjacent block is acquired (S804), and MV_U is applied to the processing target block to acquire a predicted image (Pred_U) (S805).
  • the predicted image (Pred + Pred_L) subjected to the first correction and Pred_U are weighted and superimposed to perform the second correction of the predicted image, and it is set as the final predicted image (Pred + PredL + Pred_U) (S806) ).
  • the two-step correction method using the left adjacent block and the upper adjacent block is described here, the correction may be performed more than two steps using the right adjacent block or the lower adjacent block.
  • the order of processing may be switched.
  • the predicted image may be corrected from a plurality of reference pictures.
  • the final predicted image can be obtained by further superposing the obtained predicted images.
  • the processing target block may be a prediction block unit or a sub block unit obtained by further dividing the prediction block.
  • each of the functional blocks can usually be realized by an MPU, a memory, and the like. Further, the processing by each of the functional blocks is usually realized by a program execution unit such as a processor reading and executing software (program) recorded in a recording medium such as a ROM.
  • the software may be distributed by downloading or the like, or may be distributed by being recorded in a recording medium such as a semiconductor memory.
  • 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 processor that executes the program may be singular or plural. That is, centralized processing may be performed, or distributed processing may be performed.
  • the system is characterized by having an image coding apparatus using an image coding method, an image decoding apparatus using an image decoding method, and an image coding / decoding apparatus provided with both.
  • Other configurations in the system can be suitably modified as the case may be.
  • FIG. 22 is a diagram showing an overall configuration of a content supply system ex100 for realizing content distribution service.
  • the area for providing communication service is divided into desired sizes, and base stations ex106, ex107, ex108, ex109 and ex110, which are fixed wireless stations, are installed in each cell.
  • 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 service provider ex102 or the communication network ex104 and the base stations ex106 to ex110 on the Internet ex101 Is connected.
  • the content supply system ex100 may connect any of the above-described elements in combination.
  • the respective devices may be connected to each other directly or indirectly via a telephone network, near-field radio, etc., not via the base stations ex106 to ex110 which are fixed wireless stations.
  • the streaming server ex103 is connected to each device such as the computer ex111, the game machine ex112, the camera ex113, the home appliance ex114, and the smartphone ex115 via the Internet ex101 or the like.
  • the streaming server ex103 is connected to a terminal or the like in a hotspot in the aircraft ex117 via the satellite ex116.
  • a radio access point or a hotspot may be used instead of base stations ex106 to ex110.
  • the streaming server ex103 may be directly connected to the communication network ex104 without the internet ex101 or the internet service provider ex102, or may be directly connected with the airplane ex117 without the satellite ex116.
  • the camera ex113 is a device capable of shooting a still image such as a digital camera and shooting a moving image.
  • the smartphone ex115 is a smartphone, a mobile phone, a PHS (Personal Handyphone System), or the like compatible with a mobile communication system generally called 2G, 3G, 3.9G, 4G, and 5G in the future.
  • the home appliance ex118 is a refrigerator or a device included in a home fuel cell cogeneration system.
  • a terminal having a photographing function when a terminal having a photographing function is connected to the streaming server ex103 through the base station ex106 or the like, live distribution and the like become possible.
  • a terminal (a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, a terminal in an airplane ex117, etc.) transmits the still image or moving image content captured by the user using the terminal.
  • the encoding process described in each embodiment is performed, and video data obtained by the encoding and sound data obtained by encoding a 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 coding apparatus according to an aspect of the present disclosure.
  • the streaming server ex 103 streams the content data transmitted to the requested client.
  • the client is a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, or a terminal in an airplane ex117 that can decode the encoded data.
  • Each device that receives 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, or distribute data in a distributed manner.
  • the streaming server ex103 may be realized by a CDN (Contents Delivery Network), and content delivery may be realized by a network connecting a large number of edge servers distributed around the world and the edge servers.
  • CDN Content Delivery Network
  • content delivery may be realized by a network connecting a large number of edge servers distributed around the world and the edge servers.
  • physically close edge servers are dynamically assigned according to clients. The delay can be reduced by caching and distributing the content to the edge server.
  • processing is distributed among multiple edge servers, or the distribution subject is switched to another edge server, or a portion of the network where a failure has occurred. Since the delivery can be continued bypassing, high-speed and stable delivery can be realized.
  • each terminal may perform encoding processing of captured data, or may perform processing on the server side, or may share processing with each other.
  • a processing loop is performed twice.
  • the first loop the complexity or code amount of the image in frame or scene units is detected.
  • the second loop processing is performed to maintain the image quality and improve the coding efficiency.
  • the terminal performs a first encoding process
  • the server receiving the content performs a second encoding process, thereby improving the quality and efficiency of the content while reducing the processing load on each terminal. it can.
  • the first encoded data made by the terminal can also be received and reproduced by another terminal, enabling more flexible real time delivery Become.
  • the camera ex 113 or the like extracts a feature amount from an image, compresses data relating to the feature amount as metadata, and transmits the data to the server.
  • the server performs compression according to the meaning of the image, for example, determining the importance of the object from the feature amount and switching the quantization accuracy.
  • Feature amount data is particularly effective in improving the accuracy and efficiency of motion vector prediction at the time of second compression in the server.
  • the terminal may perform simple coding such as VLC (variable length coding) and the server may perform coding with a large processing load such as CABAC (context adaptive binary arithmetic coding method).
  • a plurality of video data in which substantially the same scenes are shot by a plurality of terminals.
  • a unit of GOP Group of Picture
  • a unit of picture or a tile into which a picture is divided, using a plurality of terminals for which photographing was performed and other terminals and servers which are not photographing as necessary.
  • the encoding process is allocated in units, etc., and distributed processing is performed. This reduces delay and can realize more real time performance.
  • the server may manage and / or instruct the video data captured by each terminal to be mutually referred to.
  • the server may receive the encoded data from each terminal and change the reference relationship among a plurality of data, or may correct or replace the picture itself and re-encode it. This makes it possible to generate streams with enhanced quality and efficiency of each piece of data.
  • the server may deliver the video data after performing transcoding for changing the coding method of the video data.
  • the server may convert the encoding system of the MPEG system into the VP system, or the H.264 system. H.264. It may be converted to 265.
  • the encoding process can be performed by the terminal or one or more servers. Therefore, in the following, although the description such as “server” or “terminal” is used as the subject of processing, part or all of the processing performed by the server may be performed by the terminal, or the processing performed by the terminal Some or all may be performed on the server. In addition, with regard to these, the same applies to the decoding process.
  • the server not only encodes a two-dimensional moving image, but also automatically encodes a still image based on scene analysis of the moving image or at a time designated by the user and transmits it to the receiving terminal. It is also good. Furthermore, if the server can acquire relative positional relationship between the imaging terminals, the three-dimensional shape of the scene is not only determined based on the two-dimensional moving image but also the video of the same scene captured from different angles. Can be generated. Note that the server may separately encode three-dimensional data generated by a point cloud or the like, or an image to be transmitted to the receiving terminal based on a result of recognizing or tracking a person or an object using the three-dimensional data. Alternatively, it may be generated by selecting or reconfiguring from videos taken by a plurality of terminals.
  • the user can enjoy the scene by arbitrarily selecting each video corresponding to each photographing terminal, or from the three-dimensional data reconstructed using a plurality of images or videos, the video of the arbitrary viewpoint You can also enjoy the extracted content.
  • the sound may be picked up from a plurality of different angles as well as the video, and the server may multiplex the sound from a specific angle or space with the video and transmit it according to the video.
  • the server may create viewpoint images for the right eye and for the left eye, respectively, and may perform coding to allow reference between each viewpoint video using Multi-View Coding (MVC) or the like. It may be encoded as another stream without reference. At the time of decoding of another stream, reproduction may be performed 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 camera information in the real space based on the three-dimensional position or the movement of the user's viewpoint.
  • the decoding apparatus 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 superimposed data by smoothly connecting.
  • the decoding device transmits the motion of the user's viewpoint to the server in addition to the request for virtual object information, and the server creates superimposed data in accordance with the motion 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 as well as RGB
  • the server sets the ⁇ value of a portion other than the object created from the three-dimensional data to 0 etc., and the portion is transparent , May be encoded.
  • the server may set RGB values of predetermined values as a background, such as chroma key, and generate data in which the portion other than the object has a background color.
  • the decryption processing of the distributed data may be performed by each terminal which is a client, may be performed by the server side, or may be performed sharing each other.
  • one terminal may send a reception request to the server once, the content corresponding to the request may be received by another terminal and decoded, and the decoded signal may be transmitted to a device having a display. Data of high image quality can be reproduced by distributing processing and selecting appropriate content regardless of the performance of the communicable terminal itself.
  • a viewer's personal terminal may decode and display a partial area such as a tile in which a picture is divided. Thereby, it is possible to confirm at hand the area in which the user is in charge or the area to be checked in more detail while sharing the whole image.
  • encoded data over the network such as encoded data being cached on a server that can be accessed in a short time from a receiving terminal, or copied to an edge server in a content delivery service, etc. It is also possible to switch the bit rate of the received data based on ease.
  • the switching of content will be described using a scalable stream compression-coded by applying the moving picture coding method shown in each of the above embodiments shown in FIG.
  • the server may have a plurality of streams with the same content but different qualities as individual streams, but is temporally / spatial scalable which is realized by coding into layers as shown in the figure.
  • the configuration may be such that the content is switched using the feature of the stream. That is, the decoding side determines low-resolution content and high-resolution content by determining which layer to decode depending on the internal factor of performance and external factors such as the state of the communication band. It can be switched freely and decoded. For example, when it is desired to view the continuation of the video being watched by the smartphone ex115 while moving on a device such as the Internet TV after returning home, the device only has to decode the same stream to different layers, so the burden on the server side Can be reduced.
  • the picture is encoded for each layer, and the enhancement layer includes meta information based on statistical information of the image, etc., in addition to the configuration for realizing the scalability in which the enhancement layer exists above the base layer.
  • the decoding side may generate high-quality content by super-resolving a picture of the base layer based on the meta information.
  • the super resolution may be either an improvement in the SN ratio at the same resolution or an expansion of the resolution.
  • Meta information includes information for identifying linear or non-linear filter coefficients used for super-resolution processing, or information for identifying parameter values in filter processing used for super-resolution processing, machine learning or least squares operation, etc. .
  • the picture may be divided into tiles or the like according to the meaning of an object or the like in the image, and the decoding side may be configured to decode only a part of the area by selecting the tile to be decoded.
  • the decoding side can position the desired object based on the meta information And determine the tile that contains the object. For example, as shown in FIG. 24, meta information is stored using a data storage structure different from pixel data, such as an SEI message in HEVC. This meta information indicates, for example, the position, size, or color of the main object.
  • meta information may be stored in units of a plurality of pictures, such as streams, sequences, or random access units.
  • the decoding side can acquire the time when a specific person appears in the video and the like, and can identify the picture in which the object exists and the position of the object in the picture by combining the information with the picture unit.
  • the display device When multiple link images are visible on the screen, the display device until the user explicitly selects the link image, or until the link image approaches near the center of the screen or the entire link image falls within the screen
  • the (decoding device) displays still images or I pictures of each content as link images, displays images such as gif animation with a plurality of still images or I pictures, etc., receives only the base layer Decode and display.
  • the display device decodes the base layer with the highest priority.
  • the display device may decode up to the enhancement layer if there is information indicating that the content is scalable in the HTML configuring the web page.
  • the display device decodes only forward referenced pictures (I picture, P picture, forward referenced only B picture) before the selection or when the communication band is very strict. And, by displaying, it is possible to reduce the delay between the decoding time of the leading picture and the display time (delay from the start of decoding of content to the start of display).
  • the display device may roughly ignore the reference relationship of pictures and roughly decode all B pictures and P pictures with forward reference, and may perform normal decoding as time passes and the number of received pictures increases.
  • the receiving terminal when transmitting or receiving still image or video data such as two-dimensional or three-dimensional map information for automatic traveling or driving assistance of a car, the receiving terminal is added as image information belonging to one or more layers as meta information Information on weather or construction may also be received, and these may be correlated and decoded.
  • the meta information may belong to the layer or may be simply multiplexed with the image data.
  • the receiving terminal since a car including a receiving terminal, a drone or an airplane moves, the receiving terminal transmits the position information of the receiving terminal at the time of reception request to seamlessly receive and decode 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 state of the communication band. become.
  • the client can receive, decode, and reproduce the encoded information transmitted by the user in real time.
  • the server may perform the encoding process after performing the editing process. This can be realized, for example, with the following configuration.
  • the server performs recognition processing such as shooting error, scene search, meaning analysis, and object detection from the original image or encoded data after shooting in real time or by accumulation. Then, the server manually or automatically corrects out-of-focus or camera shake, etc. based on the recognition result, or a scene with low importance such as a scene whose brightness is low or out of focus compared with other pictures. Make edits such as deleting, emphasizing the edge of an object, or changing the color. The server encodes the edited data based on the edited result. It is also known that the audience rating drops when the shooting time is too long, and the server works not only with scenes with low importance as described above, but also moves as content becomes within a specific time range according to the shooting time. Scenes with a small amount of motion may be clipped automatically based on the image processing result. Alternatively, the server may generate and encode a digest based on the result of semantic analysis of the scene.
  • recognition processing such as shooting error, scene search, meaning analysis, and object detection from the original image or encoded data after shooting in real
  • the server may change and encode the face of a person at the periphery of the screen, or the inside of a house, etc. into an image out of focus.
  • the server recognizes whether or not the face of a person different from the person registered in advance appears in the image to be encoded, and if so, performs processing such as mosaicing the face portion. May be Alternatively, the user designates a person or background area desired to process an image from the viewpoint of copyright etc.
  • preprocessing or post-processing of encoding replaces the designated area with another video or blurs the focus. It is also possible to perform such processing. If it is a person, it is possible to replace the image of the face part while tracking the person in the moving image.
  • the decoding apparatus first receives the base layer with the highest priority, and performs decoding and reproduction, although it depends on the bandwidth.
  • the decoding device may receive the enhancement layer during this period, and may play back high-quality video including the enhancement layer if it is played back more than once, such as when playback is looped.
  • scalable coding it is possible to provide an experience in which the stream gradually becomes smart and the image becomes better although it is a rough moving image when it is not selected or when it starts watching.
  • the same experience can be provided even if the coarse stream played back first and the second stream coded with reference to the first moving image are configured as one stream .
  • these encoding or decoding processes are generally processed in an LSI ex 500 that each terminal has.
  • the LSI ex 500 may be a single chip or a plurality of chips.
  • Software for moving image encoding or decoding is incorporated in any recording medium (CD-ROM, flexible disk, hard disk, etc.) readable by computer ex111 or the like, and encoding or decoding is performed using the software. It is 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 ex 500 included in the smartphone ex 115.
  • the LSI ex 500 may be configured to download and activate application software.
  • the terminal first determines whether the terminal corresponds to the content coding scheme or has the ability to execute a specific service. If the terminal does not support the content encoding method or does not have the ability to execute a specific service, the terminal downloads the codec or application software, and then acquires and reproduces the content.
  • the present invention is not limited to the content supply system ex100 via the Internet ex101, but also to a system for digital broadcasting at least a moving picture coding apparatus (image coding apparatus) or a moving picture decoding apparatus (image decoding apparatus) of the above embodiments. Can be incorporated. There is a difference in that it is multicast-oriented with respect to the configuration in which the content supply system ex100 can be easily unicasted, since multiplexed data in which video and sound are multiplexed is transmitted on broadcast radio waves using satellites etc. Similar applications are possible for the encoding process and the decoding process.
  • FIG. 27 is a diagram showing the smartphone ex115. Further, FIG. 28 is a diagram illustrating a configuration example of the smartphone ex115.
  • the smartphone ex115 receives an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of taking video and still images, a video taken by the camera unit ex465, and the antenna ex450 And a display unit ex ⁇ b> 458 for displaying data obtained by decoding an image 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, Specify a user, a memory unit ex467 capable of storing encoded video or still image, recorded voice, received video or still image, encoded data such as mail, or decoded data, and various networks and networks And a slot unit ex464 that is an interface unit with the SIM ex 468 for authenticating access to data. Note that an external memory may be used instead of the memory unit ex467.
  • a main control unit ex460 that integrally controls the display unit ex458 and the operation unit ex466, 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, / Demodulation unit ex452, multiplexing / demultiplexing unit ex453, audio signal processing unit ex454, slot unit ex464, and memory unit ex467 are connected via a bus ex470.
  • the power supply circuit unit ex461 activates the smartphone ex115 to an operable state by supplying power from the battery pack to each unit.
  • the smartphone ex115 performs processing such as call and data communication based on control of the main control unit ex460 having a CPU, a ROM, a RAM, and the like.
  • the audio signal collected by the audio input unit ex456 is converted to a digital audio signal by the audio 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.
  • transmission is performed via the antenna ex450.
  • the received data is amplified and subjected to frequency conversion processing and analog-to-digital conversion processing, subjected to spectrum despreading processing by modulation / demodulation unit ex452, and converted to an analog sound signal by sound signal processing unit ex454.
  • Output from In the data communication mode text, still images, or video data are sent to the main control unit ex460 via the operation input control unit ex462 by the operation of the operation unit ex466 or the like of the main unit, and transmission and reception processing is similarly performed.
  • the video signal processing unit ex 455 executes the video signal stored in the memory unit ex 467 or the video signal input from the camera unit ex 465 as described above.
  • the multiplexing / demultiplexing unit ex453 multiplexes in order to decode multiplexed data received via the antenna ex450.
  • 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, and The converted audio data is supplied to the audio signal processing unit ex 454.
  • the video signal processing unit ex455 decodes the video signal by the moving picture decoding method corresponding to the moving picture coding method described in each of the above embodiments, and the moving picture linked from the display unit ex458 via the display control unit ex459 An image or a still image included in the image file is displayed.
  • the audio signal processing unit ex 454 decodes the audio signal, and the audio output unit ex 457 outputs the audio. Furthermore, since real-time streaming is widespread, depending on the user's situation, it may happen that sound reproduction is not socially appropriate. Therefore, as an initial value, it is preferable to be configured to reproduce only the video data 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 is described as an example, in addition to a transmission / reception terminal having both an encoder and a decoder as a terminal, it is referred to as a transmitting terminal having only the encoder and a receiving terminal having only the decoder.
  • a transmitting terminal having only the encoder
  • a receiving terminal having only the decoder.
  • multiplexed data in which audio data is multiplexed with video data is received or transmitted, but in multiplexed data, character data related to video other than audio data is also described. It may be multiplexed, or video data itself may be received or transmitted, not multiplexed data.
  • the terminal often includes a GPU. Therefore, a configuration in which a large area is collectively processed using the performance of the GPU may be performed using a memory shared by the CPU and the GPU, or a memory whose address is managed so as to be commonly used. As a result, coding time can be shortened, real time property can be secured, and low delay can be realized. In particular, it is efficient to perform processing of motion search, deblock filter, sample adaptive offset (SAO), and transform / quantization collectively in units of pictures or the like on the GPU instead of the CPU.
  • SAO sample adaptive offset
  • the present disclosure is applicable to, for example, a television receiver, a digital video recorder, a car navigation, a mobile phone, a digital camera, or a digital video camera.

Landscapes

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

Abstract

La présente invention concerne un dispositif de codage (100) comprenant un circuit et une mémoire. Dans un traitement de prédiction inter, lorsque la mémoire est utilisée pour réaliser un traitement OBMC dans des unités de sous-bloc dans un mode de prédiction inter servant à réaliser une compensation de mouvement dans les unités de sous-bloc, le circuit réalise un traitement de correction d'image prédéfinie par acquisition de pixels de référence en vue d'une correction d'image prédéfinie d'un sous-bloc à coder à l'aide (i) d'un vecteur de mouvement (MV) d'un bloc ou d'un sous-bloc adjacent au côté supérieur du sous-bloc à coder et/ou (ii) d'un vecteur de mouvement d'un bloc ou d'un sous-bloc adjacent au côté gauche du sous-bloc à coder.
PCT/JP2018/034310 2017-09-27 2018-09-14 Dispositif et procédé de codage, et dispositif et procédé de décodage WO2019065329A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762563775P 2017-09-27 2017-09-27
US62/563,775 2017-09-27

Publications (1)

Publication Number Publication Date
WO2019065329A1 true WO2019065329A1 (fr) 2019-04-04

Family

ID=65900991

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2018/034310 WO2019065329A1 (fr) 2017-09-27 2018-09-14 Dispositif et procédé de codage, et dispositif et procédé de décodage

Country Status (1)

Country Link
WO (1) WO2019065329A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543331A (zh) * 2019-09-23 2021-03-23 杭州海康威视数字技术股份有限公司 编解码方法方法、装置及设备
WO2023198144A1 (fr) * 2022-04-15 2023-10-19 维沃移动通信有限公司 Procédé de prédiction inter-trames et terminal

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016123068A1 (fr) * 2015-01-26 2016-08-04 Qualcomm Incorporated Compensation de mouvement par superposition pour codage vidéo
US20160295215A1 (en) * 2013-12-06 2016-10-06 Mediatek Inc. Method and Apparatus for Motion Boundary Processing
US20160330475A1 (en) * 2015-05-05 2016-11-10 Broadcom Corporation Apparatus and method for overlapped motion compensation for video coding

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160295215A1 (en) * 2013-12-06 2016-10-06 Mediatek Inc. Method and Apparatus for Motion Boundary Processing
WO2016123068A1 (fr) * 2015-01-26 2016-08-04 Qualcomm Incorporated Compensation de mouvement par superposition pour codage vidéo
US20160330475A1 (en) * 2015-05-05 2016-11-10 Broadcom Corporation Apparatus and method for overlapped motion compensation for video coding

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CHEN, JIANLE ET AL.: "Algorithm Description of Joint Exploration Test Model 5", JOINT VIDEO EXPLORATION TEAM(JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG11 5TH MEETING:GENEVA, CH , 12- 20 JANUARY 2017 , 09 FEBRUARY 2017 , JVET- E1001_V1, 9 February 2017 (2017-02-09), pages 17 - 18, XP030150647 *
OZCAN ZAFER, TEVFIK ET AL.: "An Over lapped Block Motion Compensation Hardware for Frame Rate Conversion", 2011 14TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN, 31 August 2011 (2011-08-31) - 2 September 2011 (2011-09-02), pages 309 - 315, XP032058644, DOI: 10.1109/DSD.2011.45 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112543331A (zh) * 2019-09-23 2021-03-23 杭州海康威视数字技术股份有限公司 编解码方法方法、装置及设备
CN112543331B (zh) * 2019-09-23 2023-02-24 杭州海康威视数字技术股份有限公司 编解码方法、装置及设备
WO2023198144A1 (fr) * 2022-04-15 2023-10-19 维沃移动通信有限公司 Procédé de prédiction inter-trames et terminal

Similar Documents

Publication Publication Date Title
JP6765520B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2019022099A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP7299386B2 (ja) 符号化装置及び復号装置
JP2021048619A (ja) 符号化装置及び符号化方法
WO2019003993A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019138998A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019009129A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019013236A1 (fr) Dispositif de codage, procédé de codage, dispositif de décodage et procédé de décodage
JP6770192B2 (ja) 符号化装置、符号化方法、復号装置及び復号方法
WO2019098152A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
JP2024015159A (ja) 符号化装置、復号装置、符号化方法、及び復号方法
JPWO2019221103A1 (ja) 符号化装置、復号装置、符号化方法及び復号方法
JP2023126387A (ja) 符号化装置及び符号化方法
WO2019069782A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP2023174874A (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2019009314A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019124191A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019065329A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
WO2019082985A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019069902A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019059107A1 (fr) Dispositif d'encodage, dispositif de décodage, procédé d'encodage et procédé de décodage
WO2019031369A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019021803A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019098092A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019031417A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage

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: 18863306

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: 18863306

Country of ref document: EP

Kind code of ref document: A1