WO2018174354A1 - Procédé et appareil de décodage d'image selon une prédiction intra dans un système de codage d'image - Google Patents
Procédé et appareil de décodage d'image selon une prédiction intra dans un système de codage d'image Download PDFInfo
- Publication number
- WO2018174354A1 WO2018174354A1 PCT/KR2017/009746 KR2017009746W WO2018174354A1 WO 2018174354 A1 WO2018174354 A1 WO 2018174354A1 KR 2017009746 W KR2017009746 W KR 2017009746W WO 2018174354 A1 WO2018174354 A1 WO 2018174354A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- sample
- peripheral
- samples
- current block
- value
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
Definitions
- the present invention relates to an image coding technique, and more particularly, to an image decoding method and apparatus according to intra prediction in an image coding system.
- the demand for high resolution and high quality images such as high definition (HD) images and ultra high definition (UHD) images is increasing in various fields.
- the higher the resolution and the higher quality of the image data the more information or bit rate is transmitted than the existing image data. Therefore, the image data can be transmitted by using a medium such as a conventional wired / wireless broadband line or by using a conventional storage medium. In the case of storage, the transmission cost and the storage cost are increased.
- a high efficiency image compression technique is required to effectively transmit, store, and reproduce high resolution, high quality image information.
- An object of the present invention is to provide a method and apparatus for improving image coding efficiency.
- Another object of the present invention is to provide an intra prediction method and apparatus for performing based on at least one neighboring sample of a current block.
- Another object of the present invention is to provide an intra prediction method and apparatus for deriving neighboring samples including lower neighboring samples and right neighboring samples of a current block using a cosine function.
- Another technical problem of the present invention is to provide an intra prediction method and apparatus for deriving neighboring samples including lower neighboring samples and right neighboring samples of a current block based on neighboring samples of a corresponding block derived based on a motion vector of the current block. Is in.
- an intra prediction method performed by a decoding apparatus includes deriving an intra prediction mode for a current block, deriving peripheral samples including right lower peripheral samples, lower peripheral samples and right peripheral samples of the current block, and in accordance with the intra prediction mode. Generating a prediction sample for the current block using at least one of the neighboring samples, wherein the prediction sample is located in a prediction direction of the intra prediction mode with respect to the prediction sample of the neighboring samples. And a first peripheral sample and a second peripheral sample positioned in a direction opposite to the prediction direction.
- a decoding apparatus for performing image decoding based on intra prediction.
- the decoding apparatus may further include an entropy decoding unit configured to obtain prediction information about a current block, an intra prediction mode for the current block based on the prediction information, and a lower right side sample, a lower side neighbor samples, and A prediction unit for deriving neighboring samples including right neighboring samples and generating a prediction sample for the current block using at least one of the neighboring samples according to the intra prediction mode, wherein the prediction sample is the neighboring sample; Based on the prediction sample, it is derived based on a first peripheral sample located in the prediction direction of the intra prediction mode and a second peripheral sample located in the opposite direction of the prediction direction.
- an intra prediction method performed by an encoding apparatus includes determining an intra prediction mode for a current block, deriving peripheral samples including right lower peripheral samples, lower peripheral samples and right peripheral samples of the current block, the peripheral according to the intra prediction mode. Generating a prediction sample for the current block using at least one of the samples, and generating, encoding and outputting prediction information for the current block, wherein the prediction sample is the one of the neighboring samples.
- the reference sample is derived based on a first peripheral sample positioned in a prediction direction of the intra prediction mode and a second peripheral sample positioned in an opposite direction to the prediction direction.
- a video encoding apparatus determines an intra prediction mode for the current block, derives peripheral samples including the lower right peripheral sample, the lower peripheral samples and the right peripheral samples of the current block, and calculates the peripheral samples according to the intra prediction mode.
- the reference sample is derived based on a first peripheral sample positioned in a prediction direction of the intra prediction mode and a second peripheral sample positioned in an opposite direction to the prediction direction.
- the prediction accuracy of the current block can be improved by performing intra prediction based on at least one neighboring sample among a plurality of neighboring samples, thereby improving overall coding efficiency.
- the lower peripheral samples and the right peripheral samples of the current block can be derived more accurately based on a cosine function, and the intra prediction is performed based on the lower peripheral samples and the right peripheral samples to perform the prediction on the current block.
- the prediction accuracy can be improved, thereby improving the overall coding efficiency.
- the lower peripheral samples and the right peripheral samples of the current block may be derived based on the lower peripheral samples and the right peripheral samples of the corresponding block of the current block, and the lower peripheral samples of the current block and the Intra prediction may be performed based on right neighboring samples to improve prediction accuracy of the current block, thereby improving overall coding efficiency.
- FIG. 1 is a diagram schematically illustrating a configuration of a video encoding apparatus to which the present invention may be applied.
- FIG. 2 is a diagram schematically illustrating a configuration of a video decoding apparatus to which the present invention may be applied.
- 3 exemplarily shows directional intra prediction modes of 33 prediction directions.
- FIG. 4 illustrates an example in which a prediction block is generated based on linear interpolation intra prediction.
- FIG. 5 illustrates an example of generating a lower peripheral sample and a right peripheral sample of the current block based on a cosine function.
- FIG. 6 illustrates an example of generating a lower neighboring sample and a right neighboring sample of the current block based on a cosine function when the minimum weight and the maximum weight are determined.
- FIG. 7 illustrates an example of deriving weights for lower neighboring samples and right neighboring samples of the current block based on the least square method.
- FIG. 8 illustrates an example of deriving a lower peripheral sample and a right peripheral sample of the current block 800 based on the corresponding block 810 of the current block 800.
- FIG. 9 schematically illustrates a video encoding method by an encoding device according to the present invention.
- FIG. 10 schematically illustrates a video decoding method by a decoding apparatus according to the present invention.
- each configuration in the drawings described in the present invention are shown independently for the convenience of description of the different characteristic functions, it does not mean that each configuration is implemented by separate hardware or separate software.
- two or more of each configuration may be combined to form one configuration, or one configuration may be divided into a plurality of configurations.
- Embodiments in which each configuration is integrated and / or separated are also included in the scope of the present invention without departing from the spirit of the present invention.
- a picture generally refers to a unit representing one image of a specific time zone
- a slice is a unit constituting a part of a picture in coding.
- One picture may be composed of a plurality of slices, and if necessary, the picture and the slice may be mixed with each other.
- a pixel or a pel may refer to a minimum unit constituting one picture (or image). Also, 'sample' may be used as a term corresponding to a pixel.
- a sample may generally represent a pixel or a value of a pixel, and may only represent pixel / pixel values of the luma component, or only pixel / pixel values of the chroma component.
- a unit represents the basic unit of image processing.
- the unit may include at least one of a specific region of the picture and information related to the region.
- the unit may be used interchangeably with terms such as block or area in some cases.
- an M ⁇ N block may represent a set of samples or transform coefficients composed of M columns and N rows.
- FIG. 1 is a diagram schematically illustrating a configuration of a video encoding apparatus to which the present invention may be applied.
- the video encoding apparatus 100 may include a picture divider 105, a predictor 110, a subtractor 115, a transformer 120, a quantizer 125, a reordering unit 130,
- the entropy encoding unit 135, the residual processing unit 140, the adding unit 150, the filter unit 155, and the memory 160 may be included.
- the residual processor 140 may include an inverse quantizer 141 and an inverse transform unit 142.
- the picture divider 105 may divide the input picture into at least one processing unit.
- the processing unit may be called a coding unit (CU).
- the coding unit may be recursively split from the largest coding unit (LCU) according to a quad-tree binary-tree (QTBT) structure.
- LCU largest coding unit
- QTBT quad-tree binary-tree
- one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad tree structure and / or a binary tree structure.
- the quad tree structure may be applied first and the binary tree structure may be applied later.
- the binary tree structure may be applied first.
- the coding procedure according to the present invention may be performed based on the final coding unit that is no longer split.
- the maximum coding unit may be used as the final coding unit immediately based on coding efficiency according to the image characteristic, or if necessary, the coding unit is recursively divided into coding units of lower depths and optimized.
- a coding unit of size may be used as the final coding unit.
- the coding procedure may include a procedure of prediction, transform, and reconstruction, which will be described later.
- the processing unit may include a coding unit (CU) prediction unit (PU) or a transform unit (TU).
- the coding unit may be split from the largest coding unit (LCU) into coding units of deeper depths along the quad tree structure.
- LCU largest coding unit
- the maximum coding unit may be used as the final coding unit immediately based on coding efficiency according to the image characteristic, or if necessary, the coding unit is recursively divided into coding units of lower depths and optimized.
- a coding unit of size may be used as the final coding unit. If a smallest coding unit (SCU) is set, the coding unit may not be split into smaller coding units than the minimum coding unit.
- the final coding unit refers to a coding unit that is the basis of partitioning or partitioning into a prediction unit or a transform unit.
- the prediction unit is a unit partitioning from the coding unit and may be a unit of sample prediction. In this case, the prediction unit may be divided into sub blocks.
- the transform unit may be divided along the quad tree structure from the coding unit, and may be a unit for deriving a transform coefficient and / or a unit for deriving a residual signal from the transform coefficient.
- a coding unit may be called a coding block (CB)
- a prediction unit is a prediction block (PB)
- a transform unit may be called a transform block (TB).
- a prediction block or prediction unit may mean a specific area in the form of a block within a picture, and may include an array of prediction samples.
- a transform block or a transform unit may mean a specific area in a block form within a picture, and may include an array of transform coefficients or residual samples.
- the prediction unit 110 may perform a prediction on a block to be processed (hereinafter, referred to as a current block) and generate a predicted block including prediction samples of the current block.
- the unit of prediction performed by the prediction unit 110 may be a coding block, a transform block, or a prediction block.
- the prediction unit 110 may determine whether intra prediction or inter prediction is applied to the current block. As an example, the prediction unit 110 may determine whether intra prediction or inter prediction is applied on a CU basis.
- the prediction unit 110 may derive a prediction sample for the current block based on reference samples outside the current block in the picture to which the current block belongs (hereinafter, referred to as the current picture). In this case, the prediction unit 110 may (i) derive the prediction sample based on the average or interpolation of neighboring reference samples of the current block, and (ii) the neighbor reference of the current block.
- the prediction sample may be derived based on a reference sample present in a specific (prediction) direction with respect to the prediction sample among the samples. In case of (i), it may be called non-directional mode or non-angle mode, and in case of (ii), it may be called directional mode or angular mode.
- the prediction mode may have, for example, 33 directional prediction modes and at least two non-directional modes.
- the non-directional mode may include a DC prediction mode and a planner mode (Planar mode).
- the prediction unit 110 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
- the prediction unit 110 may derive the prediction sample for the current block based on the sample specified by the motion vector on the reference picture.
- the prediction unit 110 may apply one of a skip mode, a merge mode, and a motion vector prediction (MVP) mode to derive a prediction sample for the current block.
- the prediction unit 110 may use the motion information of the neighboring block as the motion information of the current block.
- the skip mode unlike the merge mode, the difference (residual) between the prediction sample and the original sample is not transmitted.
- the MVP mode the motion vector of the current block may be derived using the motion vector of the neighboring block as a motion vector predictor.
- the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture.
- a reference picture including the temporal neighboring block may be called a collocated picture (colPic).
- the motion information may include a motion vector and a reference picture index.
- Information such as prediction mode information and motion information may be encoded (entropy) and output in the form of a bitstream.
- the highest picture on the reference picture list may be used as the reference picture.
- Reference pictures included in a reference picture list may be sorted based on a difference in a picture order count (POC) between a current picture and a corresponding reference picture.
- POC picture order count
- the subtraction unit 115 generates a residual sample which is a difference between the original sample and the prediction sample.
- residual samples may not be generated as described above.
- the transform unit 120 generates a transform coefficient by transforming the residual sample in units of transform blocks.
- the transform unit 120 may perform the transformation according to the size of the transform block and the prediction mode applied to the coding block or the prediction block that spatially overlaps the transform block. For example, if intra prediction is applied to the coding block or the prediction block that overlaps the transform block, and the transform block is a 4 ⁇ 4 residual array, the residual sample uses a discrete sine transform (DST). In other cases, the residual sample may be transformed by using a discrete cosine transform (DCT).
- DST discrete sine transform
- DCT discrete cosine transform
- the quantization unit 125 may quantize the transform coefficients to generate quantized transform coefficients.
- the reordering unit 130 rearranges the quantized transform coefficients.
- the reordering unit 130 may reorder the quantized transform coefficients in the form of a block into a one-dimensional vector form through a coefficient scanning method. Although the reordering unit 130 has been described in a separate configuration, the reordering unit 130 may be part of the quantization unit 125.
- the entropy encoding unit 135 may perform entropy encoding on the quantized transform coefficients.
- Entropy encoding may include, for example, encoding methods such as exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), and the like.
- the entropy encoding unit 135 may encode information necessary for video reconstruction other than the quantized transform coefficients (for example, a value of a syntax element) together or separately. Entropy encoded information may be transmitted or stored in units of network abstraction layer (NAL) units in the form of bitstreams.
- NAL network abstraction layer
- the inverse quantization unit 141 inverse quantizes the quantized values (quantized transform coefficients) in the quantization unit 125, and the inverse transform unit 142 inverse transforms the inverse quantized values in the inverse quantization unit 141 to generate a residual sample.
- the adder 150 reconstructs the picture by combining the residual sample and the predictive sample.
- the residual sample and the predictive sample may be added in units of blocks to generate a reconstructed block.
- the adder 150 may be part of the predictor 110.
- the adder 150 may be called a restoration unit or a restoration block generation unit.
- the filter unit 155 may apply a deblocking filter and / or a sample adaptive offset to the reconstructed picture. Through deblocking filtering and / or sample adaptive offset, the artifacts of the block boundaries in the reconstructed picture or the distortion in the quantization process can be corrected.
- the sample adaptive offset may be applied on a sample basis and may be applied after the process of deblocking filtering is completed.
- the filter unit 155 may apply an adaptive loop filter (ALF) to the reconstructed picture. ALF may be applied to the reconstructed picture after the deblocking filter and / or sample adaptive offset is applied.
- ALF adaptive loop filter
- the memory 160 may store reconstructed pictures (decoded pictures) or information necessary for encoding / decoding.
- the reconstructed picture may be a reconstructed picture after the filtering process is completed by the filter unit 155.
- the stored reconstructed picture may be used as a reference picture for (inter) prediction of another picture.
- the memory 160 may store (reference) pictures used for inter prediction.
- pictures used for inter prediction may be designated by a reference picture set or a reference picture list.
- FIG. 2 is a diagram schematically illustrating a configuration of a video decoding apparatus to which the present invention may be applied.
- the video decoding apparatus 200 may include an entropy decoding unit 210, a residual processor 220, a predictor 230, an adder 240, a filter 250, and a memory 260. It may include.
- the residual processor 220 may include a reordering unit 221, an inverse quantization unit 222, and an inverse transform unit 223.
- the video decoding apparatus 200 may reconstruct the video in response to a process in which the video information is processed in the video encoding apparatus.
- the video decoding apparatus 200 may perform video decoding using a processing unit applied in the video encoding apparatus.
- the processing unit block of video decoding may be, for example, a coding unit, and in another example, a coding unit, a prediction unit, or a transform unit.
- the coding unit may be split along the quad tree structure and / or binary tree structure from the largest coding unit.
- the prediction unit and the transform unit may be further used in some cases, in which case the prediction block is a block derived or partitioned from the coding unit and may be a unit of sample prediction. At this point, the prediction unit may be divided into subblocks.
- the transform unit may be divided along the quad tree structure from the coding unit, and may be a unit for deriving a transform coefficient or a unit for deriving a residual signal from the transform coefficient.
- the entropy decoding unit 210 may parse the bitstream and output information necessary for video reconstruction or picture reconstruction. For example, the entropy decoding unit 210 decodes information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, quantized values of syntax elements necessary for video reconstruction, and residual coefficients. Can be output.
- a coding method such as exponential Golomb coding, CAVLC, or CABAC, quantized values of syntax elements necessary for video reconstruction, and residual coefficients. Can be output.
- the CABAC entropy decoding method receives a bin corresponding to each syntax element in a bitstream, and decodes syntax element information and decoding information of neighboring and decoding target blocks or information of symbols / bins decoded in a previous step.
- the context model may be determined using the context model, the probability of occurrence of a bin may be predicted according to the determined context model, and arithmetic decoding of the bin may be performed to generate a symbol corresponding to the value of each syntax element. have.
- the CABAC entropy decoding method may update the context model by using the information of the decoded symbol / bin for the context model of the next symbol / bean after determining the context model.
- the information related to the prediction among the information decoded by the entropy decoding unit 210 is provided to the prediction unit 230, and the residual value on which the entropy decoding has been performed by the entropy decoding unit 210, that is, the quantized transform coefficient, is used as a reordering unit ( 221 may be input.
- the reordering unit 221 may rearrange the quantized transform coefficients in a two-dimensional block form.
- the reordering unit 221 may perform reordering in response to coefficient scanning performed by the encoding apparatus.
- the rearrangement unit 221 has been described in a separate configuration, but the rearrangement unit 221 may be part of the inverse quantization unit 222.
- the inverse quantization unit 222 may dequantize the quantized transform coefficients based on the (inverse) quantization parameter and output the transform coefficients.
- information for deriving a quantization parameter may be signaled from the encoding apparatus.
- the inverse transform unit 223 may inversely transform transform coefficients to derive residual samples.
- the prediction unit 230 may perform prediction on the current block and generate a predicted block including prediction samples for the current block.
- the unit of prediction performed by the prediction unit 230 may be a coding block, a transform block, or a prediction block.
- the prediction unit 230 may determine whether to apply intra prediction or inter prediction based on the information about the prediction.
- a unit for determining which of intra prediction and inter prediction is to be applied and a unit for generating a prediction sample may be different.
- the unit for generating a prediction sample in inter prediction and intra prediction may also be different.
- whether to apply inter prediction or intra prediction may be determined in units of CUs.
- a prediction mode may be determined and a prediction sample may be generated in PU units
- intra prediction a prediction mode may be determined in PU units and a prediction sample may be generated in TU units.
- the prediction unit 230 may derive the prediction sample for the current block based on the neighbor reference samples in the current picture.
- the prediction unit 230 may derive the prediction sample for the current block by applying the directional mode or the non-directional mode based on the neighbor reference samples of the current block.
- the prediction mode to be applied to the current block may be determined using the intra prediction mode of the neighboring block.
- the prediction unit 230 may derive the prediction sample for the current block based on the sample specified on the reference picture by the motion vector on the reference picture.
- the prediction unit 230 may apply any one of a skip mode, a merge mode, and an MVP mode to derive a prediction sample for the current block.
- motion information required for inter prediction of the current block provided by the video encoding apparatus for example, information about a motion vector, a reference picture index, and the like may be obtained or derived based on the prediction information.
- the motion information of the neighboring block may be used as the motion information of the current block.
- the neighboring block may include a spatial neighboring block and a temporal neighboring block.
- the prediction unit 230 may construct a merge candidate list using motion information of available neighboring blocks, and may use information indicated by the merge index on the merge candidate list as a motion vector of the current block.
- the merge index may be signaled from the encoding device.
- the motion information may include a motion vector and a reference picture. When the motion information of the temporal neighboring block is used in the skip mode and the merge mode, the highest picture on the reference picture list may be used as the reference picture.
- the difference (residual) between the prediction sample and the original sample is not transmitted.
- the motion vector of the current block may be derived using the motion vector of the neighboring block as a motion vector predictor.
- the neighboring block may include a spatial neighboring block and a temporal neighboring block.
- a merge candidate list may be generated by using a motion vector of a reconstructed spatial neighboring block and / or a motion vector corresponding to a Col block, which is a temporal neighboring block.
- the motion vector of the candidate block selected from the merge candidate list is used as the motion vector of the current block.
- the information about the prediction may include a merge index indicating a candidate block having an optimal motion vector selected from candidate blocks included in the merge candidate list.
- the prediction unit 230 may derive the motion vector of the current block by using the merge index.
- a motion vector predictor candidate list may be generated using a motion vector of a reconstructed spatial neighboring block and / or a motion vector corresponding to a Col block, which is a temporal neighboring block.
- the prediction information may include a prediction motion vector index indicating an optimal motion vector selected from the motion vector candidates included in the list.
- the prediction unit 230 may select the predicted motion vector of the current block from the motion vector candidates included in the motion vector candidate list using the motion vector index.
- the prediction unit of the encoding apparatus may obtain a motion vector difference (MVD) between the motion vector of the current block and the motion vector predictor, and may encode the output vector in a bitstream form. That is, MVD may be obtained by subtracting the motion vector predictor from the motion vector of the current block.
- the prediction unit 230 may obtain a motion vector difference included in the information about the prediction, and derive the motion vector of the current block by adding the motion vector difference and the motion vector predictor.
- the prediction unit may also obtain or derive a reference picture index or the like indicating a reference picture from the information about the prediction.
- the adder 240 may reconstruct the current block or the current picture by adding the residual sample and the predictive sample.
- the adder 240 may reconstruct the current picture by adding the residual sample and the predictive sample in block units. Since the residual is not transmitted when the skip mode is applied, the prediction sample may be a reconstruction sample.
- the adder 240 has been described in a separate configuration, the adder 240 may be part of the predictor 230. On the other hand, the adder 240 may be called a restoration unit or a restoration block generation unit.
- the filter unit 250 may apply the deblocking filtering sample adaptive offset, and / or ALF to the reconstructed picture.
- the sample adaptive offset may be applied in units of samples and may be applied after deblocking filtering.
- ALF may be applied after deblocking filtering and / or sample adaptive offset.
- the memory 260 may store reconstructed pictures (decoded pictures) or information necessary for decoding.
- the reconstructed picture may be a reconstructed picture after the filtering process is completed by the filter unit 250.
- the memory 260 may store pictures used for inter prediction.
- pictures used for inter prediction may be designated by a reference picture set or a reference picture list.
- the reconstructed picture can be used as a reference picture for another picture.
- the memory 260 may output the reconstructed picture in an output order.
- intra prediction may be performed on the current block, and the intra prediction modes may include, for example, two non-directional intra prediction modes and 33 directional intra prediction modes.
- the intra prediction modes 0 to 1 are the anisotropic intra prediction modes.
- the intra prediction mode 0 represents an intra planar mode, and the intra prediction mode 1 represents an intra DC mode.
- the remaining 2 to 34 intra prediction modes are the directional intra prediction modes, each having a prediction direction.
- the directional intra prediction mode may be referred to as an intra angular mode.
- the prediction block for the current block may be generated based on one of the 35 intra prediction modes.
- 3 exemplarily shows directional intra prediction modes of 33 prediction directions.
- an intra prediction mode having horizontal directionality and an intra prediction mode having vertical directionality may be classified based on an intra prediction mode 18 having an upper left diagonal prediction direction.
- H and V in FIG. 3 mean horizontal directionality and vertical directionality, respectively, and numbers of -32 to 32 represent a displacement of 1/32 on a sample grid position.
- Intra prediction modes 2 to 17 have a horizontal direction
- intra prediction modes 18 to 34 have a vertical direction.
- Intra prediction mode 10 is a horizontal intra prediction mode or a horizontal mode
- intra intra prediction mode 26 is a vertical intra prediction mode or a vertical mode.
- the prediction direction of the mode) can be expressed in degrees.
- the relative angle corresponding to each intra prediction mode may be expressed based on the horizontal reference angle 0 ° corresponding to the intra prediction mode 10, and the vertical reference angle corresponding to the intra prediction mode 26 reference 0 °.
- the relative angle corresponding to each intra prediction mode can be expressed.
- a specific prediction sample of the current block may be generated based on neighboring samples of the current block (eg, upper neighboring samples and left neighboring samples of the current block), and intra prediction of the current block.
- the generated specific prediction sample may be copied along the prediction direction of the mode. That is, the specific prediction sample may be generated based on a neighboring sample located in the prediction direction based on the specific prediction sample, and prediction samples other than the specific prediction sample of the current block located in the prediction direction may be generated. It may be generated with the same value as a specific prediction sample.
- intra prediction a prediction sample may be simply copied and generated, and thus an error may increase as the distance between the prediction sample and the neighboring sample increases.
- linear interpolation prediction is proposed to improve prediction accuracy in intra prediction.
- the linear interpolation prediction may be called linear interpolation intra prediction.
- right neighboring samples and lower neighboring samples of the current block are generated, and an intra prediction mode of the current block based on a prediction sample of the current block among the left neighboring samples and the upper neighboring samples of the current block.
- a prediction sample may be generated through interpolation between a first peripheral sample positioned in the prediction direction of and a second peripheral sample corresponding to the first peripheral sample among the right peripheral samples and the lower peripheral samples.
- the second neighboring sample and the first neighboring sample positioned in opposite directions of the prediction direction of the intra prediction mode of the current block based on the prediction sample of the current block among the right neighboring samples and the lower neighboring samples.
- the prediction sample may be generated through interpolation with.
- the position of the first peripheral sample or the second peripheral sample is a fractional sample position
- the first peripheral sample or the second peripheral sample is interposed between integer samples adjacent to the left and right of the first peripheral sample or the second peripheral sample.
- a sample value of one peripheral sample or the second peripheral sample can be derived.
- FIG. 4 illustrates an example in which a prediction block is generated based on linear interpolation intra prediction.
- a lower peripheral sample that is not encoded / decoded may be generated at an encoding / decoding time point of the current block, and already at the encoding / decoding time point of the current block.
- a prediction block may be generated based on a weighted sum according to a distance between an upper peripheral sample encoded and decoded and reconstructed, and a lower peripheral sample. For example, the prediction sample c illustrated in FIG.
- the weights for the peripheral sample P and the peripheral sample P ' are derived in inverse proportion to the distance ratio of the first distance between the peripheral sample P and the prediction sample c and the second distance between the peripheral sample P' and the prediction sample c. Can be.
- the position of P is a fractional sample position
- the value of P may be derived through interpolation of integer samples A and B adjacent to the left and right.
- the position of P ' is also a fractional sample position
- the value of P' may be derived through interpolation of integer samples A 'and B' adjacent to the left and right sides of P '.
- the prediction accuracy of the prediction block may vary depending on how accurately the neighboring samples which are not encoded / decoded are generated at the encoding / decoding time point of the current block.
- the present invention proposes a method for more accurately predicting (or generating) neighboring samples that are not encoded / decoded at the encoding / decoding time point of the current block.
- a neighboring sample may be generated by using a cosine function value as a weight for generating a neighboring sample of the current block.
- the left neighboring samples and the upper neighboring samples of the current block may be samples included in a reconstructed block that has already been encoded / decoded at the encoding / decoding time point of the current block.
- the lower right side of the current block based on the bottom-left peripheral sample BL of the left peripheral samples and the top-right peripheral sample TR of the upper peripheral samples.
- Bottom-Right) Peripheral samples (BR) can be generated.
- the lower right peripheral sample BR may be generated by various methods.
- the lower peripheral samples are p [0] [N] to p [N-1] [N]
- the right peripheral samples are p [N] [N-1] to p [N] [0]
- the lower right peripheral sample BR is p [N] [N]
- the lower left peripheral sample BL may be p [-1] [N]
- the upper right peripheral sample TR may be p [N] [-1].
- the lower peripheral sample may be generated based on the lower right peripheral sample BR and the lower left peripheral sample BL.
- the lower left peripheral sample BL is a value of 0 degrees of the cosine function
- the lower right peripheral sample BR is the cosine function.
- values between 0 and 90 degrees of the cosine function may be mapped to the lower peripheral samples, and the first lower peripheral sample B1 of the lower peripheral samples may be mapped to a value of 18 degrees of the cosine function.
- a second lower reference sample B2 may be mapped to a value of 36 degrees of the cosine function
- a third lower reference sample B3 may be mapped to a value of 54 degrees of the cosine function
- a fourth lower reference sample (B2) may be mapped to B4) may be mapped to a value of 72 degrees of the cosine function.
- the value of the mapped cosine function may be used as a weight for generating a corresponding lower peripheral sample.
- the first lower peripheral sample B1 may be generated through linear interpolation of the lower left peripheral sample BL and the lower right peripheral sample BR, in this case, the lower left peripheral sample BL.
- the weight of may be assigned a value of 0.95 of 18 degrees of the cosine function, and the weight of the lower right peripheral sample BR may be assigned a value of 0.05 minus the value of 18 degrees of the cosine function of 1.
- Weights for the lower right peripheral sample BR and the lower left peripheral sample BL for generating the lower peripheral samples may be derived based on the cosine function, and the lower right side is derived based on the cosine function.
- Weights for the peripheral sample BR and the lower left peripheral sample BL may be as shown in the following table.
- a lower peripheral sample may be generated based on weights of the lower left peripheral sample BL, the lower right peripheral sample BR, the lower left peripheral sample BL, and the weight of the lower right peripheral sample BR. .
- the value of the weight of the lower left peripheral sample BL for deriving the nth lower peripheral sample among the lower peripheral samples may be derived as cosine ((90n) / (N + 1))
- the value of the weight of the right lower peripheral sample BR for deriving the nth lower peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the sample value of the lower peripheral sample BL is a value obtained by multiplying the sample value of the lower left peripheral sample BL by the weight of the lower left peripheral sample BL and the sample value of the lower right peripheral sample BR to the lower right side sample. It may be derived as the sum of the values multiplied by the weights of the surrounding samples BR.
- the right peripheral samples of the current block may be generated.
- the upper right side peripheral sample TR is a value of 0 degrees of the cosine function
- the lower right side peripheral sample BR is the cosine function.
- values between 0 and 90 degrees of the cosine function may be mapped to the right peripheral samples
- the first right peripheral sample R1 of the right peripheral samples may be mapped to a value of 18 degrees of the cosine function.
- a second right reference sample R2 may be mapped to a value of 36 degrees of the cosine function
- a third right reference sample R3 may be mapped to a value of 54 degrees of the cosine function
- a fourth right reference sample (R2) may be mapped to R4) may be mapped to a value of 72 degrees of the cosine function.
- the value of the mapped cosine function may be used as a weight for generating a corresponding right side sample.
- the first right peripheral sample R1 may be generated through linear interpolation of the upper right peripheral sample TR and the lower right peripheral sample BR, in this case, the upper right peripheral sample TR
- the weight of may be assigned a value of 0.95 of 18 degrees of the cosine function
- the weight of the lower right peripheral sample BR may be assigned a value of 0.05 minus the value of 18 degrees of the cosine function of 1.
- Weights for the lower right peripheral sample BR and the upper right peripheral sample TR for generating the right peripheral samples may be derived based on the cosine function, and the lower right side derived based on the cosine function.
- Weights for the peripheral sample BR and the upper right peripheral sample TR may be as shown in the following table.
- a right peripheral sample may be generated based on a weight of the right upper peripheral sample TR, the right lower peripheral sample BR, the right upper peripheral sample TR, and a weight of the right lower peripheral sample BR.
- the value of the weight of the right upper peripheral sample TR for deriving the nth right peripheral sample among the right peripheral samples may be derived as cosine ((90n) / (N + 1))
- the value of the weight of the lower right peripheral sample BR for deriving the nth right peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the sample value of the right peripheral sample is a value obtained by multiplying the sample value of the right upper peripheral sample TR by the weight of the right upper peripheral sample TR and the sample value of the right lower peripheral sample BR to the right lower side. It may be derived as the sum of the values multiplied by the weights of the surrounding samples BR.
- values of 0 degrees and 90 degrees of the cosine function are mapped to the lower left peripheral sample BL and the lower right peripheral sample BR, respectively, or the upper right peripheral sample TR and the lower right side are mapped.
- a value of 0 degrees and a value of 90 degrees of the cosine function are respectively mapped to the side peripheral samples BR, and the weights of the corresponding peripheral samples may be derived by equally dividing between 0 degrees and 90 degrees according to the size of the current block. Can be. Therefore, a weight for the corresponding neighboring sample may be automatically derived based on the size of the current block.
- the following description describes a method of determining an arbitrary maximum weight and a minimum weight and deriving a weight for a neighboring sample based on the maximum weight and the minimum weight.
- a weight to be used for generating the corresponding neighboring sample may be arbitrarily derived through the maximum weight and the minimum weight.
- FIG. 6 illustrates an example of generating a lower neighboring sample and a right neighboring sample of the current block based on a cosine function when the minimum weight and the maximum weight are determined.
- the left neighboring samples and the upper neighboring samples of the current block may be samples included in a reconstructed block that has already been encoded / decoded at the encoding / decoding time point of the current block.
- the lower right side of the current block based on the bottom-left peripheral sample BL of the left peripheral samples and the top-right peripheral sample TR of the upper peripheral samples.
- Bottom-Right) Peripheral samples (BR) can be generated.
- the lower peripheral sample may be generated based on the lower right peripheral sample BR and the lower left peripheral sample BL.
- the maximum weight may be determined as 0.9 and the minimum weight as 0.1.
- the first lower peripheral sample B1 of the lower neighbor samples of the current block has the maximum weight
- the fourth lower peripheral sample B4 has the minimum weight.
- the first lower peripheral sample B1 may be mapped to a 26 degree value of the cosine function corresponding to the maximum weight
- the fourth lower peripheral sample B4 is 84 of the cosine function corresponding to the minimum weight. It can be mapped to a value in degrees.
- the angle between the 0 degree and the 90 degree may be equally divided into two, and the values of the divided angles may be mapped to the second lower peripheral sample B2 and the third lower peripheral sample B3, respectively.
- values of 26 degrees to 84 degrees of the cosine function may be mapped to the lower peripheral samples, wherein the first lower peripheral sample B1 of the lower peripheral samples is mapped to the value of 26 degrees of the cosine function.
- the second lower reference sample B2 may be mapped to a value of 46 degrees of the cosine function
- the third lower reference sample B3 may be mapped to a value of 65 degrees of the cosine function
- the fourth The lower reference sample B4 may be mapped to a value of 84 degrees of the cosine function.
- the value of the mapped cosine function may be used as a weight for generating a corresponding lower peripheral sample.
- the first lower peripheral sample B1 may be generated through linear interpolation of the lower left peripheral sample BL and the lower right peripheral sample BR, in this case, the lower left peripheral sample BL.
- the weight of) may be assigned a value 0.9 of 26 degrees of a cosine function
- the weight of the right lower peripheral sample BR may be assigned a value of 0.1, which is the value obtained by subtracting the value of 26 degrees of the cosine function.
- Weights for the lower right peripheral sample BR and the lower left peripheral sample BL for generating the lower peripheral samples may be derived based on the cosine function, and the lower right side is derived based on the cosine function. Weights for the peripheral sample BR and the lower left peripheral sample BL may be as shown in the following table.
- the right peripheral samples of the current block may be generated.
- the first right peripheral sample R1 of the right peripheral samples of the current block is the maximum weight
- the fourth right peripheral sample R4 is The minimum weight may be mapped. That is, the first right peripheral sample R1 may be mapped to a 26 degree value of the cosine function corresponding to the maximum weight, and the fourth right peripheral sample R4 is 84 of the cosine function corresponding to the minimum weight. It can be mapped to a value in degrees.
- the angle between the 0 degree and the 90 degree may be equally divided into two, and the values of the divided angles may be mapped to the second right peripheral sample R2 and the third right peripheral sample R3, respectively.
- values from 26 degrees to 84 degrees of the cosine function may be mapped to the right peripheral samples, wherein the first right peripheral sample R1 of the right peripheral samples is mapped to a value of 26 degrees of the cosine function.
- the second right reference sample R2 may be mapped to a value of 46 degrees of the cosine function
- the third right reference sample R3 may be mapped to a value of 65 degrees of the cosine function
- the fourth The right reference sample R4 may be mapped to a value of 84 degrees of the cosine function.
- the value of the mapped cosine function may be used as a weight for generating a corresponding right side sample.
- the first right peripheral sample R1 may be generated through linear interpolation of the upper right peripheral sample TR and the lower right peripheral sample BR, in this case, the upper right peripheral sample TR
- the weight of) may be assigned a value 0.9 of 26 degrees of a cosine function
- the weight of the right lower peripheral sample BR may be assigned a value of 0.1, which is the value obtained by subtracting the value of 26 degrees of the cosine function.
- Weights for the lower right peripheral sample BR and the upper right peripheral sample TR for generating the right peripheral samples may be derived based on the cosine function, and the lower right side derived based on the cosine function.
- Weights for the peripheral sample BR and the upper right peripheral sample TR may be as shown in the following table.
- a weight for generating neighboring samples of the current block may be derived through a least square method.
- a weight may be calculated such that a residual between an original lower peripheral sample and a generated lower peripheral sample of the current block is minimized through the least square method.
- the residual may represent a difference between a sample value of the original lower peripheral sample and a sample value of the generated lower peripheral sample.
- the generated lower peripheral sample may represent a sample generated based on a lower left peripheral sample BL and a lower right peripheral sample BR of the current block.
- the weight may be calculated for each sample position. That is, weights for each of the lower peripheral samples may be calculated.
- the weight for the lower peripheral sample may be derived based on the following equation.
- E () may represent an operator representing an expectation.
- the lower peripheral samples are p [0] [N] to p [N-1] [N]
- the right peripheral samples are p [N] [N-1] to p [N] [0]
- the lower right peripheral sample BR is p [N] [N]
- the lower left peripheral sample BL may be p [-1] [N]
- the upper right peripheral sample TR may be p [N] [-1].
- the weight of the residual between the original right peripheral sample and the generated right peripheral sample of the current block may be calculated using the least square method.
- the residual may represent a difference between a sample value of the original right peripheral sample and a sample value of the generated right peripheral sample.
- the generated right peripheral sample may represent a sample generated based on the right upper peripheral sample TR and the right lower peripheral sample BR of the current block.
- the weight derived based on the least squares method may be calculated in advance through offline training. That is, the weight calculated in advance through the offline learning may be preset or the information about the pre-calculated weight may be signaled through a bitstream, and the decoding apparatus may be derived from the preset weight or the information on the weight.
- the weight may be used to generate a lower peripheral sample or a right peripheral sample of the current block.
- the weight may be calculated for each sample position. That is, the weight for each of the right peripheral samples may be calculated.
- the weight for the right peripheral sample may be derived based on Equation 1 described above.
- the weight for generating the right neighboring sample or the lower neighboring sample of the current block may be calculated through other methods according to various conditions.
- the weight may be calculated based on the size of the current block, or the weight may be calculated based on the intra prediction mode of the current block.
- Weights derived based on various conditions and methods can be derived in advance through offline learning. That is, the weight may be calculated through offline learning before the encoding / decoding process of the current block, and when the encoding / decoding process of the current block is performed, the right peripheral sample or the lower peripheral sample of the current block. The calculated weight may be applied to the generation of. Through this, residual for restoring the current block can be reduced and overall coding efficiency can be improved.
- the corresponding block for the current block may be derived, and the lower peripheral samples and the right peripheral samples of the current block may be derived based on the lower peripheral samples and the right peripheral samples of the corresponding block.
- a current picture including the current block 800 may be represented by a t picture, and a corresponding picture including the corresponding block 810 of the current block 800 may be represented by a t-N picture.
- the encoding apparatus may determine an optimal prediction mode for the current block by comparing intra prediction and inter prediction in terms of bit rate distortion optimization.
- an optimal motion vector for the current block 800 may be derived.
- the corresponding block 810 of the current block may be derived based on the derived motion vector. That is, the block indicated by the motion vector may be derived to the corresponding block 810 of the current block.
- the lower peripheral samples and the right peripheral samples of the current block 800 based on the lower peripheral samples and the right peripheral samples of the corresponding block 810. Can be derived. That is, the sample values of the lower peripheral samples and the right peripheral samples of the corresponding block 810 may be used as the sample values of the lower peripheral samples and the right peripheral samples of the current block 800.
- the decoding apparatus may derive the corresponding block by deriving the motion vector based on methods described below.
- the decoding apparatus may receive information about a motion vector of the current block through a bitstream, derive a motion vector of the current block based on the information about the motion vector, A corresponding block of the current block may be derived based on the. That is, the decoding apparatus may derive the block indicated by the motion vector as a corresponding block of the current block. When the corresponding block is derived, the decoding apparatus may derive the lower peripheral samples and the right peripheral samples of the current block based on the lower peripheral samples and the right peripheral samples of the corresponding block.
- the decoding apparatus may perform a motion vector search process for the current block and derive an optimal motion vector for the current block.
- the decoding apparatus may derive the corresponding block of the current block based on the motion vector. That is, the decoding apparatus may derive the block indicated by the motion vector as a corresponding block of the current block.
- the decoding apparatus may derive the lower peripheral samples and the right peripheral samples of the current block based on the lower peripheral samples and the right peripheral samples of the corresponding block.
- the current is based on the neighboring samples of the corresponding block.
- Weights for peripheral samples of the block may be derived. That is, the neighboring samples of the corresponding block may be used to derive weights for the neighboring samples of the current block.
- the lower peripheral samples for the current block may be generated based on the lower left peripheral sample and the lower right peripheral sample of the current block, and the lower peripheral samples of the corresponding block and the generated lower side of the current block.
- Weights for the lower peripheral samples of the current block may be derived based on the peripheral samples.
- the weights for the lower peripheral samples of the current block may be derived based on the least square method described above.
- lower peripheral samples RB1 to RB4 of the corresponding block corresponding to the lower peripheral samples B1 to B4 illustrated in FIG. 8 may be derived.
- Lower peripheral samples of the corresponding block may be reconstructed samples.
- residuals R1 to R4 which are the difference between the sample values of RB1 to RB4 and the sample values of B1 to B4 derived based on the lower left reference sample BL and the lower right reference sample BR of the current block are minimized.
- the weight to be determined may be determined.
- right peripheral samples for the current block may be generated based on the right upper peripheral sample and the lower right peripheral sample of the current block, and the right peripheral samples of the corresponding block and the generated right peripheral of the current block Weights for the right neighboring samples of the current block may be derived based on samples.
- the weights for the lower peripheral samples of the current block may be derived based on the least square method described above.
- the right peripheral samples RR1 to RR4 of the corresponding block corresponding to the right peripheral samples R1 to R4 illustrated in FIG. 8 may be derived.
- the right peripheral samples of the corresponding block may be reconstructed samples.
- residuals R1 to R4 which are a difference between the sample values of RR1 to RR4 and the sample values of R1 to R4 derived based on the right upper reference sample TR and the lower right reference sample BR of the current block are minimized.
- the weight to be determined may be determined.
- FIG. 9 schematically illustrates a video encoding method by an encoding device according to the present invention.
- the method disclosed in FIG. 9 may be performed by the encoding apparatus disclosed in FIG. 1.
- S900 to S920 of FIG. 9 may be performed by the prediction unit of the encoding apparatus
- S930 may be performed by the entropy encoding unit of the encoding apparatus.
- the encoding apparatus determines an intra prediction mode for the current block (S900).
- the encoding apparatus may perform various intra prediction modes to derive an intra prediction mode having an optimal RD cost as an intra prediction mode for the current block.
- the intra prediction mode may be one of two non-directional prediction modes and 33 directional prediction modes. As described above, the two non-directional prediction modes may include an intra DC mode and an intra planner mode.
- the encoding apparatus derives peripheral samples including the lower right peripheral sample, the lower peripheral samples, and the right peripheral samples of the current block (S910).
- the encoding device may derive neighboring samples of the current block.
- the peripheral samples may include left peripheral samples, upper left peripheral samples, and upper peripheral samples.
- the left neighboring samples, the upper left neighboring sample, and the upper neighboring sample may be derived from neighboring blocks already reconstructed at the decoding time of the current block.
- the peripheral samples may include the lower right peripheral sample, the lower peripheral samples, and the right peripheral samples.
- the lower right peripheral sample may be derived based on the lower left peripheral sample and the upper right peripheral sample of the current block.
- the lower peripheral samples are p [0] [N] to p [ N-1] [N]
- the lower right peripheral sample is p [N] [N]
- the right peripheral samples are p [N] [N-1] to p [N] [0]
- the right upper peripheral sample may be p [N] [-1].
- the lower peripheral samples may be derived through a weighted sum of the lower left peripheral sample and the right lower peripheral sample of the current block.
- a first weight of the lower left peripheral sample and a second weight of the right lower peripheral sample for deriving an nth lower peripheral sample among the lower peripheral samples may be derived based on a cosine function.
- the nth lower peripheral sample may represent a lower peripheral sample located in the nth order from left to right among the lower peripheral samples.
- the value of the first weight for deriving the n th lower neighbor sample among the lower neighbor samples is cosine ((90n) / (N + 1)
- the value of the second weight for deriving the nth lower peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the angle range of the cosine function may be 0 degrees to 90 degrees.
- the maximum weight and the minimum weight for the first weight may be set, and the first for deriving the first lower peripheral sample from the left among the lower peripheral samples.
- the value of the weight may be derived as the value of the maximum weight
- the value of the first weight for deriving the Nth lower peripheral sample from the left of the lower peripheral samples may be derived as the value of the minimum weight.
- the angle of the cosine function corresponding to the maximum weight may be represented by the maximum weight angle a
- the angle of the cosine function corresponding to the minimum weight may be represented by the minimum weight angle b.
- the second weight value for deriving the first lower peripheral sample may be derived as the minimum weight value, and the second weight value for deriving the Nth lower peripheral sample is the maximum weight.
- the right peripheral samples may be derived through a weighted sum of the upper right peripheral sample and the lower right peripheral sample of the current block.
- a first weight value for the upper right side sample and a second weight value for the lower right side sample for deriving an nth right peripheral sample among the right side samples may be derived based on a cosine function.
- the nth lower peripheral sample may represent the right peripheral sample located in the nth order from the top to the bottom of the right peripheral samples.
- the value of the first weight for derivation of the nth right neighboring sample among the right neighboring samples is cosine ((90n) / (N + 1)
- the value of the second weight for deriving the nth right peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the angle range of the cosine function may be 0 degrees to 90 degrees.
- a maximum weight and a minimum weight for the first weight may be set, and a first for deriving the first right peripheral sample from the upper side among the right peripheral samples.
- the value of the weight may be derived as the value of the maximum weight
- the value of the first weight for deriving the Nth right peripheral sample from the upper side among the right peripheral samples may be derived as the value of the minimum weight.
- the angle of the cosine function corresponding to the maximum weight may be represented by the maximum weight angle a
- the angle of the cosine function corresponding to the minimum weight may be represented by the minimum weight angle b.
- the value of the first weight for deriving an nth right peripheral sample among the right peripheral samples except the first right peripheral sample and the Nth right peripheral sample is
- the second weight value for deriving the nth right peripheral sample is Can be derived.
- the lower peripheral samples may be derived through a weighted sum of the lower left peripheral sample and the lower right peripheral sample of the current block, and the value of the first weight for the lower left peripheral sample and the lower right side
- the value of the second weight for the surrounding sample may be preset.
- the predetermined value of the first weight value and the value of the second weight value are based on a sample value of an original sample of a specific lower peripheral sample among the lower peripheral samples, the lower left peripheral sample, and the lower right peripheral sample. It may be values that minimize the difference between the sample values of the specific lower peripheral samples generated by.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on Equation 1 described above.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on various methods, or may be derived by other methods according to various conditions.
- the preset first weight value and the second weight value may include a sample value of a corresponding sample of a specific lower peripheral sample among the lower peripheral samples, the lower left peripheral sample, and the lower right peripheral sample. It may be values that minimize the difference between the sample value of the particular lower peripheral sample generated based on.
- the corresponding sample may represent a sample corresponding to the specific lower peripheral sample among lower peripheral samples of the corresponding block of the current block.
- the corresponding block may be derived based on a motion vector for the current block.
- the encoding apparatus may derive information on the motion vector indicating the corresponding block through motion estimation, and derive the motion vector based on the information on the motion vector. Meanwhile, the information about the motion vector may be signaled through a bitstream.
- the right peripheral samples may be derived through a weighted sum of the right upper peripheral sample and the right lower peripheral sample of the current block, and the value of the first weight for the right upper peripheral sample and the lower right side
- the value of the second weight for the surrounding sample may be preset.
- the predetermined value of the first weight value and the value of the second weight value are based on a sample value of an original sample of a specific right peripheral sample among the right peripheral samples, the right upper peripheral sample, and the right lower peripheral sample. It may be a value that minimizes the difference between the sample value of the specific right peripheral sample generated by.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on Equation 1 described above.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on various methods, or may be derived by other methods according to various conditions.
- the preset first weight value and the second weight value may correspond to a sample value of a corresponding sample of a specific right peripheral sample among the right peripheral samples, the right upper peripheral sample, and the right lower peripheral sample. It may be values that minimize the difference between the sample value of the particular right peripheral sample generated based on.
- the corresponding sample may represent a sample corresponding to the specific right peripheral sample among the right peripheral samples of the corresponding block of the current block.
- the corresponding block may be derived based on a motion vector for the current block.
- the encoding apparatus may derive information on the motion vector indicating the corresponding block through motion estimation, and derive the motion vector based on the information on the motion vector. Meanwhile, the information about the motion vector may be signaled through a bitstream.
- the lower peripheral samples of the current block may be derived based on lower peripheral samples of the corresponding block of the current block.
- an optimal motion vector for the current block may be derived through motion estimation.
- the corresponding block of the current block may be derived based on the motion vector. That is, the block indicated by the motion vector may be derived as a corresponding block of the current block.
- lower neighboring samples of the current block may be derived based on the lower neighboring samples of the corresponding block. That is, the sample values of the lower peripheral samples of the corresponding block may be used as the sample values of the lower peripheral samples of the current block.
- the right neighboring samples of the current block may be derived based on right neighboring samples of the corresponding block of the current block.
- an optimal motion vector for the current block may be derived through motion estimation.
- the corresponding block of the current block may be derived based on the motion vector. That is, the block indicated by the motion vector may be derived as a corresponding block of the current block.
- the right neighboring samples of the current block may be derived based on the right neighboring samples of the corresponding block. That is, the sample values of the right peripheral samples of the corresponding block may be used as the sample values of the right peripheral samples of the current block.
- the encoding apparatus generates a prediction sample for the current block by using at least one of the neighboring samples according to the intra prediction mode (S920).
- the encoding apparatus may derive at least one neighboring sample of the neighboring samples based on the intra prediction mode, and generate the prediction sample based on the neighboring sample.
- the prediction sample may include a first peripheral sample located in a prediction direction of the intra prediction mode and a second surrounding sample located in an opposite direction of the prediction direction based on the prediction sample of the current block among the surrounding samples. It can be derived based on.
- a prediction sample may be generated through linear interpolation between the first peripheral sample and the second peripheral sample.
- the position of the first peripheral sample or the second peripheral sample is a fractional sample position
- the first peripheral sample or the second peripheral sample is interposed between integer samples adjacent to the left and right of the first peripheral sample or the second peripheral sample.
- a sample value of one peripheral sample or the second peripheral sample can be derived.
- the encoding apparatus generates, encodes and outputs prediction information about the current block (S930).
- the encoding device may encode the prediction information about the current block and output the encoded information in the form of a bitstream.
- the prediction information may include information about the intra prediction mode of the current block.
- the encoding apparatus may generate, encode, and output the information about the intra prediction mode indicating the intra prediction mode in the form of a bitstream.
- the information about the intra prediction mode may include information indicating an intra prediction mode for the current block directly, or an intra prediction mode candidate list derived based on the intra prediction mode of the left or upper block of the current block. It may also include information indicating any one of the candidates.
- the prediction information about the current block may include information about the motion vector of the current block.
- Motion estimation may be performed for the current block, and information on a motion vector indicating a corresponding block for the current block may be derived through the motion estimation.
- the information about the motion vector may include a motion vector predictor for the motion vector and a reference picture index indicating a corresponding picture.
- the corresponding picture may represent a picture including the corresponding block and may be referred to as a reference picture.
- the information about the motion vector may be encoded and output in the form of a bitstream.
- FIG. 10 schematically illustrates a video decoding method by a decoding apparatus according to the present invention.
- the method disclosed in FIG. 10 may be performed by the decoding apparatus disclosed in FIG. 2.
- S1000 to S1020 of FIG. 10 may be performed by the prediction unit of the decoding device of the decoding device.
- the decoding apparatus derives an intra prediction mode for the current block (S1000).
- the decoding apparatus may obtain prediction information about the current block through the bitstream.
- the prediction information may include information directly indicating an intra prediction mode for the current block, or any one of an intra prediction mode candidate list derived based on an intra prediction mode of a left or upper block of the current block. It may also contain information indicating candidates.
- the decoding apparatus may derive an intra prediction mode for the current block based on the obtained prediction information.
- the intra prediction mode may be one of two non-directional prediction modes and 33 directional prediction modes. As described above, the two non-directional prediction modes may include an intra DC mode and an intra planner mode.
- the prediction information may include information about a motion vector of the current block.
- the motion vector of the current block may be derived based on the information about the motion vector, and the corresponding block of the current block may be derived based on the motion vector.
- the information about the motion vector may include a motion vector predictor for the motion vector and a reference picture index indicating a corresponding picture.
- the corresponding picture may represent a picture including the corresponding block and may be referred to as a reference picture.
- the decoding apparatus derives peripheral samples including the lower right peripheral sample, the lower peripheral samples, and the right peripheral samples of the current block (S1010).
- the decoding apparatus may derive neighboring samples of the current block.
- the peripheral samples may include left peripheral samples, upper left peripheral samples, and upper peripheral samples.
- the left neighboring samples, the upper left neighboring sample, and the upper neighboring sample may be derived from neighboring blocks already reconstructed at the decoding time of the current block.
- the peripheral samples may include the lower right peripheral sample, the lower peripheral samples, and the right peripheral samples.
- the lower right peripheral sample may be derived based on the lower left peripheral sample and the upper right peripheral sample of the current block.
- the lower peripheral samples are p [0] [N] to p [ N-1] [N]
- the lower right peripheral sample is p [N] [N]
- the right peripheral samples are p [N] [N-1] to p [N] [0]
- the right upper peripheral sample may be p [N] [-1].
- the lower peripheral samples may be derived through a weighted sum of the lower left peripheral sample and the right lower peripheral sample of the current block.
- a first weight of the lower left peripheral sample and a second weight of the right lower peripheral sample for deriving an nth lower peripheral sample among the lower peripheral samples may be derived based on a cosine function.
- the nth lower peripheral sample may represent a lower peripheral sample located in the nth order from left to right among the lower peripheral samples.
- the value of the first weight for deriving the n th lower neighbor sample among the lower neighbor samples is cosine ((90n) / (N + 1)
- the value of the second weight for deriving the nth lower peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the angle range of the cosine function may be 0 degrees to 90 degrees.
- the maximum weight and the minimum weight for the first weight may be set, and the first for deriving the first lower peripheral sample from the left among the lower peripheral samples.
- the value of the weight may be derived as the value of the maximum weight
- the value of the first weight for deriving the Nth lower peripheral sample from the left of the lower peripheral samples may be derived as the value of the minimum weight.
- the angle of the cosine function corresponding to the maximum weight may be represented by the maximum weight angle a
- the angle of the cosine function corresponding to the minimum weight may be represented by the minimum weight angle b.
- the second weight value for deriving the first lower peripheral sample may be derived as the minimum weight value, and the second weight value for deriving the Nth lower peripheral sample is the maximum weight.
- the right peripheral samples may be derived through a weighted sum of the upper right peripheral sample and the lower right peripheral sample of the current block.
- a first weight value for the upper right side sample and a second weight value for the lower right side sample for deriving an nth right peripheral sample among the right side samples may be derived based on a cosine function.
- the nth lower peripheral sample may represent the right peripheral sample located in the nth order from the top to the bottom of the right peripheral samples.
- the value of the first weight for derivation of the nth right neighboring sample among the right neighboring samples is cosine ((90n) / (N + 1)
- the value of the second weight for deriving the nth right peripheral sample may be derived as 1 ⁇ cosine ((90n) / (N + 1)).
- the angle range of the cosine function may be 0 degrees to 90 degrees.
- a maximum weight and a minimum weight for the first weight may be set, and a first for deriving the first right peripheral sample from the upper side among the right peripheral samples.
- the value of the weight may be derived as the value of the maximum weight
- the value of the first weight for deriving the Nth right peripheral sample from the upper side among the right peripheral samples may be derived as the value of the minimum weight.
- the angle of the cosine function corresponding to the maximum weight may be represented by the maximum weight angle a
- the angle of the cosine function corresponding to the minimum weight may be represented by the minimum weight angle b.
- the value of the first weight for deriving an nth right peripheral sample among the right peripheral samples except the first right peripheral sample and the Nth right peripheral sample is
- the second weight value for deriving the nth right peripheral sample is Can be derived.
- the lower peripheral samples may be derived through a weighted sum of the lower left peripheral sample and the lower right peripheral sample of the current block, and the value of the first weight for the lower left peripheral sample and the lower right side
- the value of the second weight for the surrounding sample may be preset.
- the predetermined value of the first weight value and the value of the second weight value are based on a sample value of an original sample of a specific lower peripheral sample among the lower peripheral samples, the lower left peripheral sample, and the lower right peripheral sample. It may be values that minimize the difference between the sample values of the specific lower peripheral samples generated by.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on Equation 1 described above.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on various methods, or may be derived by other methods according to various conditions.
- the preset first weight value and the second weight value may include a sample value of a corresponding sample of a specific lower peripheral sample among the lower peripheral samples, the lower left peripheral sample, and the lower right peripheral sample. It may be values that minimize the difference between the sample value of the particular lower peripheral sample generated based on.
- the corresponding sample may represent a sample corresponding to the specific lower peripheral sample among lower peripheral samples of the corresponding block of the current block.
- the corresponding block may be derived based on a motion vector for the current block.
- the decoding apparatus may derive information on the motion vector indicating the corresponding block through motion estimation, and derive the motion vector based on the information on the motion vector.
- the information about the motion vector may be received through the bitstream.
- a motion vector of the current block may be derived based on the received information about the motion vector, and the corresponding block of the current block may be derived based on the motion vector.
- the right peripheral samples may be derived through a weighted sum of the right upper peripheral sample and the right lower peripheral sample of the current block, and the value of the first weight for the right upper peripheral sample and the lower right side
- the value of the second weight for the surrounding sample may be preset.
- the predetermined value of the first weight value and the value of the second weight value are based on a sample value of an original sample of a specific right peripheral sample among the right peripheral samples, the right upper peripheral sample, and the right lower peripheral sample. It may be a value that minimizes the difference between the sample value of the specific right peripheral sample generated by.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on Equation 1 described above.
- the value of the predetermined first weight value and the value of the second weight value may be derived based on various methods, or may be derived by other methods according to various conditions.
- the preset first weight value and the second weight value may correspond to a sample value of a corresponding sample of a specific right peripheral sample among the right peripheral samples, the right upper peripheral sample, and the right lower peripheral sample. It may be values that minimize the difference between the sample value of the particular right peripheral sample generated based on.
- the corresponding sample may represent a sample corresponding to the specific right peripheral sample among the right peripheral samples of the corresponding block of the current block.
- the corresponding block may be derived based on a motion vector for the current block.
- the decoding apparatus may derive information on the motion vector indicating the corresponding block through motion estimation, and derive the motion vector based on the information on the motion vector.
- the information about the motion vector may be received through the bitstream.
- a motion vector of the current block may be derived based on the received information about the motion vector, and the corresponding block of the current block may be derived based on the motion vector.
- the lower peripheral samples of the current block may be derived based on lower peripheral samples of the corresponding block of the current block.
- an optimal motion vector for the current block may be derived through motion estimation.
- the information about the motion vector may be received through the bitstream, and the motion vector of the current block may be derived based on the information about the received motion vector.
- the corresponding block of the current block may be derived based on the motion vector. That is, the block indicated by the motion vector may be derived as a corresponding block of the current block.
- lower neighboring samples of the current block may be derived based on the lower neighboring samples of the corresponding block. That is, the sample values of the lower peripheral samples of the corresponding block may be used as the sample values of the lower peripheral samples of the current block.
- the right neighboring samples of the current block may be derived based on right neighboring samples of the corresponding block of the current block.
- an optimal motion vector for the current block may be derived through motion estimation.
- the information about the motion vector may be received through the bitstream, and the motion vector of the current block may be derived based on the information about the received motion vector.
- the corresponding block of the current block may be derived based on the motion vector. That is, the block indicated by the motion vector may be derived as a corresponding block of the current block.
- the right neighboring samples of the current block may be derived based on the right neighboring samples of the corresponding block. That is, the sample values of the right peripheral samples of the corresponding block may be used as the sample values of the right peripheral samples of the current block.
- the decoding apparatus generates a prediction sample for the current block by using at least one of the neighboring samples according to the intra prediction mode (S1020).
- the decoding apparatus may derive at least one neighboring sample among the neighboring samples based on the intra prediction mode, and generate the prediction sample based on the neighboring sample.
- the prediction sample may include a first peripheral sample located in a prediction direction of the intra prediction mode and a second surrounding sample located in an opposite direction of the prediction direction based on the prediction sample of the current block among the surrounding samples. It can be derived based on.
- a prediction sample may be generated through linear interpolation between the first peripheral sample and the second peripheral sample.
- the position of the first peripheral sample or the second peripheral sample is a fractional sample position
- the first peripheral sample or the second peripheral sample is interposed between integer samples adjacent to the left and right of the first peripheral sample or the second peripheral sample.
- a sample value of one peripheral sample or the second peripheral sample can be derived.
- the decoding apparatus may directly use the prediction sample as a reconstruction sample according to a prediction mode, or generate a reconstruction sample by adding a residual sample to the prediction sample.
- the decoding apparatus may receive information about the residual for the target block, and the information about the residual may be included in the information about the face.
- the information about the residual may include transform coefficients regarding the residual sample.
- the decoding apparatus may derive the residual sample (or residual sample array) for the target block based on the residual information.
- the decoding apparatus may generate a reconstructed sample based on the prediction sample and the residual sample, and may derive a reconstructed block or a reconstructed picture based on the reconstructed sample.
- the decoding apparatus may apply an in-loop filtering procedure, such as a deblocking filtering and / or SAO procedure, to the reconstructed picture in order to improve subjective / objective picture quality as necessary.
- the prediction accuracy of the current block can be improved by performing intra prediction based on at least one neighboring sample among a plurality of neighboring samples, thereby improving the overall coding efficiency.
- the lower neighboring samples and the right neighboring samples of the current block can be more accurately derived based on a cosine function, and the intra prediction is performed based on the lower neighboring samples and the right neighboring samples. It is possible to improve the prediction accuracy for, thereby improving the overall coding efficiency.
- the lower peripheral samples and the right peripheral samples of the current block can be derived based on the lower peripheral samples and the right peripheral samples of the corresponding block of the current block, and the lower peripheral samples of the current block. And by performing intra prediction based on the right neighboring samples, it is possible to improve the prediction accuracy of the current block, thereby improving the overall coding efficiency.
- the above-described method according to the present invention may be implemented in software, and the encoding device and / or the decoding device according to the present invention may perform image processing of, for example, a TV, a computer, a smartphone, a set-top box, a display device, and the like. It can be included in the device.
- the above-described method may be implemented as a module (process, function, etc.) for performing the above-described function.
- the module may be stored in memory and executed by a processor.
- the memory may be internal or external to the processor and may be coupled to the processor by various well known means.
- the processor may include application-specific integrated circuits (ASICs), other chipsets, logic circuits, and / or data processing devices.
- the memory may include read-only memory (ROM), random access memory (RAM), flash memory, memory card, storage medium and / or other storage device.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
Un procédé de prédiction intra exécuté par un dispositif de décodage, selon la présente invention, comprend les étapes consistant à : dériver un mode de prédiction intra pour un bloc actuel; dériver des échantillons voisins, y compris des échantillons voisins inférieurs droits, des échantillons voisins inférieurs et des échantillons voisins droits, du bloc actuel; et générer un échantillon de prédiction pour le bloc actuel à l'aide d'au moins l'un des échantillons voisins selon le mode de prédiction intra, l'échantillon de prédiction étant déduit sur la base, parmi les échantillons voisins, d'un premier échantillon voisin positionné, par rapport à l'échantillon de prédiction, dans une direction de prédiction du mode de prédiction intra, et d'un second échantillon voisin positionné dans la direction opposée à la direction de prédiction.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201762474578P | 2017-03-21 | 2017-03-21 | |
US62/474,578 | 2017-03-21 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018174354A1 true WO2018174354A1 (fr) | 2018-09-27 |
Family
ID=63586090
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/KR2017/009746 WO2018174354A1 (fr) | 2017-03-21 | 2017-09-06 | Procédé et appareil de décodage d'image selon une prédiction intra dans un système de codage d'image |
Country Status (1)
Country | Link |
---|---|
WO (1) | WO2018174354A1 (fr) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20120014947A (ko) * | 2010-07-22 | 2012-02-21 | 에스케이 텔레콤주식회사 | 전 방위 기반의 인트라 예측 부호화/복호화 장치 및 방법 |
KR101369224B1 (ko) * | 2007-03-28 | 2014-03-05 | 삼성전자주식회사 | 움직임 보상 필터링을 이용한 영상 부호화, 복호화 방법 및장치 |
KR101379255B1 (ko) * | 2007-04-06 | 2014-03-28 | 삼성전자주식회사 | 미분 방정식을 이용한 인트라 예측 부호화, 복호화 방법 및장치 |
KR20150059146A (ko) * | 2011-06-28 | 2015-05-29 | 삼성전자주식회사 | 영상의 인트라 예측 부호화, 복호화 방법 및 장치 |
KR101579356B1 (ko) * | 2010-12-22 | 2015-12-21 | 엘지전자 주식회사 | 화면 내 예측 방법 및 이러한 방법을 사용하는 장치 |
-
2017
- 2017-09-06 WO PCT/KR2017/009746 patent/WO2018174354A1/fr active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR101369224B1 (ko) * | 2007-03-28 | 2014-03-05 | 삼성전자주식회사 | 움직임 보상 필터링을 이용한 영상 부호화, 복호화 방법 및장치 |
KR101379255B1 (ko) * | 2007-04-06 | 2014-03-28 | 삼성전자주식회사 | 미분 방정식을 이용한 인트라 예측 부호화, 복호화 방법 및장치 |
KR20120014947A (ko) * | 2010-07-22 | 2012-02-21 | 에스케이 텔레콤주식회사 | 전 방위 기반의 인트라 예측 부호화/복호화 장치 및 방법 |
KR101579356B1 (ko) * | 2010-12-22 | 2015-12-21 | 엘지전자 주식회사 | 화면 내 예측 방법 및 이러한 방법을 사용하는 장치 |
KR20150059146A (ko) * | 2011-06-28 | 2015-05-29 | 삼성전자주식회사 | 영상의 인트라 예측 부호화, 복호화 방법 및 장치 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2018174402A1 (fr) | Procédé de transformation dans un système de codage d'image et appareil associé | |
WO2018062921A1 (fr) | Procédé et appareil de partitionnement et de prédiction intra de blocs dans un système de codage d'image | |
WO2017043786A1 (fr) | Procédé et dispositif de prédiction intra dans un système de codage vidéo | |
WO2018062702A1 (fr) | Procédé et appareil de prédiction intra dans un système de codage d'images | |
WO2017069419A1 (fr) | Procédé et appareil de prédiction intra dans un système de codage vidéo | |
WO2018056603A1 (fr) | Procédé et appareil d'inter-prédiction basée sur une compensation d'éclairage dans un système de codage d'images | |
WO2017052118A1 (fr) | Procédé et dispositif de prédiction intra dans un système de codage d'image | |
WO2017034331A1 (fr) | Procédé et dispositif de prédiction intra d'échantillon de chrominance dans un système de codage vidéo | |
WO2017052000A1 (fr) | Procédé et appareil de prédiction inter basée sur le raffinement des vecteurs de mouvement dans un système de codage d'images | |
WO2018070632A1 (fr) | Procédé et dispositif de décodage vidéo dans un système de codage vidéo | |
WO2017069590A1 (fr) | Procédé et dispositif de décodage d'image à base de modélisation dans un système de codage d'image | |
WO2016204360A1 (fr) | Procédé et dispositif de prédiction de bloc basée sur la compensation d'éclairage dans un système de codage d'image | |
WO2016200043A1 (fr) | Procédé et appareil d'inter-prédiction en fonction d'une image de référence virtuelle dans un système de codage vidéo | |
WO2019112071A1 (fr) | Procédé et appareil de décodage d'image basés sur une transformation efficace de composante de chrominance dans un système de codage d'image | |
WO2018021585A1 (fr) | Procédé et appareil d'intra-prédiction dans un système de codage d'image | |
WO2017057877A1 (fr) | Procédé et appareil de filtrage d'image dans un système de codage d'image | |
WO2017188565A1 (fr) | Procédé et dispositif de décodage d'image dans un système de codage d'image | |
WO2018056709A1 (fr) | Procédé et dispositif d'inter-prédiction dans un système de codage d'image | |
WO2019198997A1 (fr) | Procédé de codage d'image à base d'intraprédiction et appareil pour cela | |
WO2018062699A1 (fr) | Procédé et appareil de décodage d'images dans un système de codage d'images | |
WO2018066791A1 (fr) | Procédé et appareil de décodage d'image dans un système de codage d'images | |
WO2018070661A1 (fr) | Procédé et appareil de décodage d'image reposant sur une prédiction intra dans un système de codage d'image | |
WO2018056602A1 (fr) | Appareil et procédé de prédiction-inter dans un système de codage d'image | |
WO2018174357A1 (fr) | Procédé et dispositif de décodage d'image dans un système de codage d'image | |
WO2019194507A1 (fr) | Procédé de codage d'image basé sur une prédiction de mouvement affine, et dispositif associé |
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: 17902262 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: 17902262 Country of ref document: EP Kind code of ref document: A1 |