[go: up one dir, main page]

WO2018155983A1 - Procédé et dispositif de traitement de signal vidéo - Google Patents

Procédé et dispositif de traitement de signal vidéo Download PDF

Info

Publication number
WO2018155983A1
WO2018155983A1 PCT/KR2018/002340 KR2018002340W WO2018155983A1 WO 2018155983 A1 WO2018155983 A1 WO 2018155983A1 KR 2018002340 W KR2018002340 W KR 2018002340W WO 2018155983 A1 WO2018155983 A1 WO 2018155983A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
parallel processing
coding
current
processing block
Prior art date
Application number
PCT/KR2018/002340
Other languages
English (en)
Korean (ko)
Inventor
이배근
Original Assignee
주식회사 케이티
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 케이티 filed Critical 주식회사 케이티
Publication of WO2018155983A1 publication Critical patent/WO2018155983A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/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/172—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 picture, frame or field
    • 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/174—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 slice, e.g. a line of blocks or a group of blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • the present invention relates to a video signal processing method and apparatus.
  • High efficiency image compression techniques can be used to solve these problems caused by high resolution and high quality image data.
  • An inter-screen prediction technique for predicting pixel values included in the current picture from a picture before or after the current picture using an image compression technique an intra prediction technique for predicting pixel values included in a current picture using pixel information in the current picture
  • An object of the present invention is to provide a multi-tree partitioning method and apparatus capable of effectively dividing an encoding / decoding target block in encoding / decoding a video signal.
  • An object of the present invention is to provide a multi-tree partitioning method and apparatus for dividing an encoding / decoding target block into symmetrical or asymmetrical blocks in encoding / decoding video signals.
  • An object of the present invention is to provide a method and apparatus for parallel encoding and / or decoding a coding block divided by multi-tree partitioning.
  • An object of the present invention is to provide a recording medium including a video signal bitstream encoded by the encoding method.
  • the image decoding method uses the block partition information on the current coding block to determine whether the current coding block is a current parallel processing block adjacent to the neighboring parallel processing block in at least one of horizontal, vertical, or diagonal directions. And parallel decoding with the neighbor parallel processing block for the current parallel processing block.
  • the method may further include obtaining a reference sample of the current parallel processing block by using the reconstructed reference sample around the neighbor parallel processing block.
  • obtaining a reference sample of the current parallel processing block may include obtaining a difference between a reference point sample value of the current parallel processing block and a reference point sample of the neighbor parallel processing block as an offset, and restoring around the neighbor parallel processing block. Subtracting the offset from the received reference sample to obtain a reference sample of the current parallel processing block.
  • the reference point sample position of the current parallel processing block utilizes the restored top sample.
  • the reference sample position of the current parallel processing block utilizes the reconstructed left sample.
  • the reference sample of the current parallel processing block utilizes the restored reference sample of the neighbor parallel processing block as it is.
  • the current coding block is determined as the current parallel processing block.
  • the form of the parallel coding unit unit PCUR can be selected among square or non-square in the encoding process, and obtains a syntax element indicating the form of the selected PCUR, and confirms the form of the PCUR.
  • the parallel decoding step independently performs decoding without sharing at least motion information and a reference picture list among parallel processing blocks.
  • the parallel decoding step independently performs decoding without sharing at least intra reference samples between parallel processing blocks.
  • the current parallel processing block also includes a block divided by multi-tree partitioning.
  • a method of encoding an image may include determining whether a current coding block is a current parallel processing block adjacent to a neighboring parallel processing block in at least one of horizontal, vertical, or diagonal directions by using block partition information on the current coding block. And parallel encoding the current parallel processing block with the neighboring parallel processing block.
  • the reconstructed reference sample around the neighbor parallel processing block is used to obtain a reference sample of the current parallel processing block.
  • obtaining a reference sample of the current parallel processing block may include obtaining a difference between a reference point sample value of the current parallel processing block and a reference point sample of the neighbor parallel processing block as an offset, and restoring around the neighbor parallel processing block. Subtracting the offset from the received reference sample to obtain a reference sample of the current parallel processing block.
  • the reference point sample position of the current parallel processing block utilizes the restored top sample.
  • the reference sample position of the current parallel processing block utilizes the reconstructed left sample.
  • the current coding block is determined as the current parallel processing block.
  • the form of the parallel coding unit unit PCUR is selectable between square or non-square, and signals a syntax element indicating the form of the selected PCUR.
  • the image decoding apparatus uses block partition information on the current coding block to determine whether the current coding block is a current parallel processing block adjacent to the neighboring parallel processing block in at least one of horizontal, vertical, or diagonal directions, And a decoder for performing parallel decoding on the current parallel processing block together with the neighbor parallel processing block.
  • the video signal bitstream included in the recording medium may include at least a current coding block and a neighboring parallel processing block using block partition information about the current coding block. Determining whether the current parallel processing block is adjacent to one of the horizontal, vertical, and diagonal directions, and performing parallel encoding on the current parallel processing block together with the neighboring parallel processing block. It features.
  • the encoding / decoding efficiency of a video signal can be increased.
  • the encoding / decoding efficiency of an image signal can be increased by dividing an encoding / decoding target block into a symmetrical or asymmetrical block.
  • the encoding / decoding efficiency of the video signal can be increased by independently processing the encoding / decoding target blocks in parallel.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • FIG. 2 is a block diagram illustrating an image decoding apparatus according to an embodiment of the present invention.
  • FIG. 3 is a diagram illustrating a partition mode that can be applied to a coding block when the coding block is encoded by inter-screen prediction.
  • FIG. 4 is a diagram illustrating a partition type that allows quad tree and binary tree partitioning as an embodiment to which the invention is applied.
  • FIG. 5 illustrates an example of hierarchically splitting a coding block based on quad tree and binary tree splitting as an embodiment to which the present invention is applied.
  • FIG. 6 illustrates an example of hierarchically partitioning coding blocks based on quad tree and symmetric binary tree splitting as an embodiment to which the present invention is applied.
  • FIG. 7 is a diagram illustrating a partition form in which an asymmetric binary tree split is allowed as an embodiment to which the present invention is applied.
  • FIG. 8 illustrates a split form of a coding block based on quad tree and symmetric / asymmetric binary tree splitting as an embodiment to which the present invention is applied.
  • FIG. 9 is a flowchart illustrating a coding block partitioning method based on quad tree and binary tree partitioning according to an embodiment to which the present invention is applied.
  • FIG. 10 illustrates, as an embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quadtree and binary tree splits are applied.
  • NAL network abstraction layer
  • FIG. 11 is a diagram illustrating a partition type in which asymmetric quad tree division is allowed as another embodiment to which the present invention is applied.
  • FIG. 12 is a flowchart illustrating a coding block partitioning method based on asymmetric quad tree partitioning according to another embodiment to which the present invention is applied.
  • FIG. 13 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which asymmetric quadtree splitting is applied.
  • NAL network abstraction layer
  • FIG. 14 is a diagram illustrating a partition type allowing quad tree and triple tree division as another embodiment to which the present invention is applied.
  • 15 is a flowchart illustrating a coding block partitioning method based on quadtree and tripletree partitioning as another embodiment to which the present invention is applied.
  • FIG. 16 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quad tree and triple tree splits are applied.
  • NAL network abstraction layer
  • FIG. 17 is a diagram illustrating a basic partition type in which multi-tree partitioning is allowed as another embodiment to which the present invention is applied.
  • FIG. 18 is a diagram illustrating an extended partition type in which multi-tree partitioning is allowed as another embodiment to which the present invention is applied.
  • 19 is a flowchart illustrating a coding block partitioning method based on multi-tree partitioning according to another embodiment to which the present invention is applied.
  • FIG. 20 is a diagram for explaining a parallel processing method of a first type coding block partitioned by multi-tree partitioning as another embodiment to which the present invention is applied.
  • FIG. 21 is a diagram for describing a parallel processing method of a second type coding block partitioned by multi-tree partitioning as another embodiment to which the present invention is applied.
  • FIG. 22 is a diagram for describing a parallel processing coding block partitioned by multi-tree partitioning as another embodiment to which the present invention is applied.
  • FIG. 23 is a diagram for describing a parallel processing unit processing region (PCUR: Parallel Coding Unit Processing Region) divided by multi-tree partitioning according to another embodiment to which the present invention is applied.
  • PCUR Parallel Coding Unit Processing Region
  • FIG. 24 is a diagram for describing a parallel processing encoding method of a coding block divided by multitree division, according to another embodiment to which the present invention is applied.
  • FIG. 25 is a diagram for explaining a parallel processing decoding method of a coding block divided by multitree partitioning, according to another embodiment to which the present invention is applied.
  • 26 and 27 illustrate a method of obtaining a reference sample for parallel processing of a first type coding block according to another embodiment to which the present invention is applied.
  • 28 and 29 are diagrams for explaining a method of obtaining a reference sample for parallel processing of a second type coding block as another embodiment to which the present invention is applied.
  • FIG. 30 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which a parallel processing coding block divided to multi-tree partitions is applied.
  • NAL network abstraction layer
  • first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
  • the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component.
  • unit used in the present application may be replaced with a “block”, and thus, the term “coding tree unit” and “coding tree block”, “coding unit” and “coding block” are used herein. ”,“ Prediction unit ”and“ prediction block ”,“ transform unit ”and“ transform block ”can be interpreted in the same sense.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • the image encoding apparatus 100 may include a picture splitter 110, a predictor 120 and 125, a transformer 130, a quantizer 135, a realigner 160, and an entropy encoder. 165, an inverse quantizer 140, an inverse transformer 145, a filter 150, and a memory 155.
  • each of the components shown in FIG. 1 is independently illustrated to represent different characteristic functions in the image encoding apparatus, and does not mean that each of the components is made of separate hardware or one software component unit.
  • each component is included in each component for convenience of description, and at least two of the components may be combined into one component, or one component may be divided into a plurality of components to perform a function.
  • Integrated and separate embodiments of the components are also included within the scope of the present invention without departing from the spirit of the invention.
  • the components may not be essential components for performing essential functions in the present invention, but may be optional components for improving performance.
  • the present invention can be implemented including only the components essential for implementing the essentials of the present invention except for the components used for improving performance, and the structure including only the essential components except for the optional components used for improving performance. Also included in the scope of the present invention.
  • the picture dividing unit 110 may divide the input picture into at least one processing unit.
  • the processing unit may be a prediction unit (PU), a transform unit (TU), or a coding unit (CU).
  • the picture dividing unit 110 divides one picture into a combination of a plurality of coding units, prediction units, and transformation units, and combines one coding unit, prediction unit, and transformation unit on a predetermined basis (eg, a cost function). You can select to encode the picture.
  • one picture may be divided into a plurality of coding units.
  • a recursive tree structure such as a quad tree structure may be used, and coding is divided into other coding units by using one image or a largest coding unit as a root.
  • the unit may be split with as many child nodes as the number of split coding units. Coding units that are no longer split according to certain restrictions become leaf nodes. That is, when it is assumed that only square division is possible for one coding unit, one coding unit may be split into at most four other coding units.
  • a coding unit may be used as a unit for encoding or may be used as a unit for decoding.
  • the prediction unit may be split in the form of at least one square or rectangle having the same size in one coding unit, or the prediction unit of any one of the prediction units split in one coding unit is different from one another. It may be divided to have a different shape and / or size than the unit.
  • the intra prediction may be performed without splitting into a plurality of prediction units NxN.
  • the predictors 120 and 125 may include an inter predictor 120 that performs inter prediction and an intra predictor 125 that performs intra prediction. Whether to use inter prediction or intra prediction on the prediction unit may be determined, and specific information (eg, an intra prediction mode, a motion vector, a reference picture, etc.) according to each prediction method may be determined. In this case, the processing unit in which the prediction is performed may differ from the processing unit in which the prediction method and the details are determined. For example, the method of prediction and the prediction mode may be determined in the prediction unit, and the prediction may be performed in the transform unit. The residual value (residual block) between the generated prediction block and the original block may be input to the transformer 130.
  • specific information eg, an intra prediction mode, a motion vector, a reference picture, etc.
  • prediction mode information and motion vector information used for prediction may be encoded by the entropy encoder 165 together with the residual value and transmitted to the decoder.
  • the original block may be encoded as it is and transmitted to the decoder without generating the prediction block through the prediction units 120 and 125.
  • the inter prediction unit 120 may predict the prediction unit based on the information of at least one of the previous picture or the next picture of the current picture. In some cases, the inter prediction unit 120 may predict the prediction unit based on the information of the partial region in which the encoding is completed in the current picture. You can also predict units.
  • the inter predictor 120 may include a reference picture interpolator, a motion predictor, and a motion compensator.
  • the reference picture interpolator may receive reference picture information from the memory 155 and generate pixel information of an integer pixel or less in the reference picture.
  • a DCT based 8-tap interpolation filter having different filter coefficients may be used to generate pixel information of integer pixels or less in units of 1/4 pixels.
  • a DCT-based interpolation filter having different filter coefficients may be used to generate pixel information of an integer pixel or less in units of 1/8 pixels.
  • the motion predictor may perform motion prediction based on the reference picture interpolated by the reference picture interpolator.
  • various methods such as full search-based block matching algorithm (FBMA), three step search (TSS), and new three-step search algorithm (NTS) may be used.
  • FBMA full search-based block matching algorithm
  • TSS three step search
  • NTS new three-step search algorithm
  • the motion vector may have a motion vector value of 1/2 or 1/4 pixel units based on the interpolated pixels.
  • the motion prediction unit may predict the current prediction unit by using a different motion prediction method.
  • various methods such as a skip method, a merge method, an advanced motion vector prediction (AMVP) method, an intra block copy method, and the like may be used.
  • AMVP advanced motion vector prediction
  • the intra predictor 125 may generate a prediction unit based on reference pixel information around the current block, which is pixel information in the current picture. If the neighboring block of the current prediction unit is a block that has performed inter prediction, and the reference pixel is a pixel that has performed inter prediction, the reference pixel of the block that has performed intra prediction around the reference pixel included in the block where the inter prediction has been performed Can be used as a substitute for information. That is, when the reference pixel is not available, the unavailable reference pixel information may be replaced with at least one reference pixel among the available reference pixels.
  • a prediction mode may have a directional prediction mode using reference pixel information according to a prediction direction, and a non-directional mode using no directional information when performing prediction.
  • the mode for predicting the luminance information and the mode for predicting the color difference information may be different, and the intra prediction mode information or the predicted luminance signal information used for predicting the luminance information may be utilized to predict the color difference information.
  • intra prediction When performing intra prediction, if the size of the prediction unit and the size of the transform unit are the same, the intra prediction on the prediction unit is performed based on the pixels on the left of the prediction unit, the pixels on the upper left, and the pixels on the top. Can be performed. However, when performing intra prediction, if the size of the prediction unit is different from that of the transform unit, intra prediction may be performed using a reference pixel based on the transform unit. In addition, intra prediction using NxN division may be used only for a minimum coding unit.
  • the intra prediction method may generate a prediction block after applying an adaptive intra smoothing (AIS) filter to a reference pixel according to a prediction mode.
  • AIS adaptive intra smoothing
  • the type of AIS filter applied to the reference pixel may be different.
  • the intra prediction mode of the current prediction unit may be predicted from the intra prediction mode of the prediction unit existing around the current prediction unit.
  • the prediction mode of the current prediction unit is predicted by using the mode information predicted from the neighboring prediction unit, if the intra prediction mode of the current prediction unit and the neighboring prediction unit is the same, the current prediction unit and the neighboring prediction unit using the predetermined flag information If the prediction modes of the current prediction unit and the neighboring prediction unit are different, entropy encoding may be performed to encode the prediction mode information of the current block.
  • a residual block may include a prediction unit performing prediction based on the prediction units generated by the prediction units 120 and 125 and residual information including residual information that is a difference from an original block of the prediction unit.
  • the generated residual block may be input to the transformer 130.
  • the transform unit 130 converts the residual block including residual information of the original block and the prediction unit generated by the prediction units 120 and 125 into a discrete cosine transform (DCT), a discrete sine transform (DST), and a KLT. You can convert using the same conversion method. Whether to apply DCT, DST, or KLT to transform the residual block may be determined based on intra prediction mode information of the prediction unit used to generate the residual block.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • KLT KLT
  • the quantization unit 135 may quantize the values converted by the transformer 130 into the frequency domain.
  • the quantization coefficient may change depending on the block or the importance of the image.
  • the value calculated by the quantization unit 135 may be provided to the inverse quantization unit 140 and the reordering unit 160.
  • the reordering unit 160 may reorder coefficient values with respect to the quantized residual value.
  • the reordering unit 160 may change the two-dimensional block shape coefficients into a one-dimensional vector form through a coefficient scanning method. For example, the reordering unit 160 may scan from DC coefficients to coefficients in the high frequency region by using a Zig-Zag scan method and change them into one-dimensional vectors.
  • a vertical scan that scans two-dimensional block shape coefficients in a column direction instead of a zig-zag scan may be used, and a horizontal scan that scans two-dimensional block shape coefficients in a row direction. That is, according to the size of the transform unit and the intra prediction mode, it is possible to determine which scan method among the zig-zag scan, the vertical scan, and the horizontal scan is used.
  • the entropy encoder 165 may perform entropy encoding based on the values calculated by the reordering unit 160. Entropy encoding may use various encoding methods such as, for example, Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC).
  • Entropy encoding may use various encoding methods such as, for example, Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC).
  • the entropy encoder 165 receives residual value coefficient information, block type information, prediction mode information, partition unit information, prediction unit information, transmission unit information, and motion of the coding unit from the reordering unit 160 and the prediction units 120 and 125.
  • Various information such as vector information, reference frame information, interpolation information of a block, and filtering information can be encoded.
  • the entropy encoder 165 may entropy encode a coefficient value of a coding unit input from the reordering unit 160.
  • the inverse quantizer 140 and the inverse transformer 145 inverse quantize the quantized values in the quantizer 135 and inversely transform the transformed values in the transformer 130.
  • the residual value generated by the inverse quantizer 140 and the inverse transformer 145 is reconstructed by combining the prediction units predicted by the motion estimator, the motion compensator, and the intra predictor included in the predictors 120 and 125. You can create a Reconstructed Block.
  • the filter unit 150 may include at least one of a deblocking filter, an offset correction unit, and an adaptive loop filter (ALF).
  • a deblocking filter may include at least one of a deblocking filter, an offset correction unit, and an adaptive loop filter (ALF).
  • ALF adaptive loop filter
  • the deblocking filter may remove block distortion caused by boundaries between blocks in the reconstructed picture.
  • it may be determined whether to apply a deblocking filter to the current block based on the pixels included in several columns or rows included in the block.
  • a strong filter or a weak filter may be applied according to the required deblocking filtering strength.
  • horizontal filtering and vertical filtering may be performed in parallel when vertical filtering and horizontal filtering are performed.
  • the offset correction unit may correct the offset with respect to the original image on a pixel-by-pixel basis for the deblocking image.
  • the pixels included in the image are divided into a predetermined number of areas, and then, an area to be offset is determined, an offset is applied to the corresponding area, or offset considering the edge information of each pixel. You can use this method.
  • Adaptive Loop Filtering may be performed based on a value obtained by comparing the filtered reconstructed image with the original image. After dividing the pixels included in the image into a predetermined group, one filter to be applied to the group may be determined and filtering may be performed for each group. For information related to whether to apply ALF, a luminance signal may be transmitted for each coding unit (CU), and the shape and filter coefficient of an ALF filter to be applied may vary according to each block. In addition, regardless of the characteristics of the block to be applied, the same type (fixed form) of the ALF filter may be applied.
  • ALF Adaptive Loop Filtering
  • the memory 155 may store the reconstructed block or picture calculated by the filter unit 150, and the stored reconstructed block or picture may be provided to the predictors 120 and 125 when performing inter prediction.
  • FIG. 2 is a block diagram illustrating an image decoding apparatus according to an embodiment of the present invention.
  • the image decoder 200 includes an entropy decoder 210, a reordering unit 215, an inverse quantizer 220, an inverse transformer 225, a predictor 230, 235, and a filter unit ( 240, a memory 245 may be included.
  • the input bitstream may be decoded by a procedure opposite to that of the image encoder.
  • the entropy decoder 210 may perform entropy decoding in a procedure opposite to that of the entropy encoding performed by the entropy encoder of the image encoder. For example, various methods such as Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC) may be applied to the method performed by the image encoder.
  • various methods such as Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC) may be applied to the method performed by the image encoder.
  • the entropy decoder 210 may decode information related to intra prediction and inter prediction performed by the encoder.
  • the reordering unit 215 may reorder the entropy decoded bitstream by the entropy decoding unit 210 based on a method of rearranging the bitstream. Coefficients expressed in the form of a one-dimensional vector may be reconstructed by reconstructing the coefficients in a two-dimensional block form.
  • the reordering unit 215 may be realigned by receiving information related to coefficient scanning performed by the encoder and performing reverse scanning based on the scanning order performed by the corresponding encoder.
  • the inverse quantization unit 220 may perform inverse quantization based on the quantization parameter provided by the encoder and the coefficient values of the rearranged block.
  • the inverse transform unit 225 may perform an inverse transform, i.e., an inverse DCT, an inverse DST, and an inverse KLT, for a quantization result performed by the image encoder, that is, a DCT, DST, and KLT. Inverse transformation may be performed based on a transmission unit determined by the image encoder.
  • the inverse transform unit 225 of the image decoder may selectively perform a transform scheme (eg, DCT, DST, KLT) according to a plurality of pieces of information such as a prediction method, a size of a current block, and a prediction direction.
  • a transform scheme eg, DCT, DST, KLT
  • the prediction units 230 and 235 may generate the prediction block based on the prediction block generation related information provided by the entropy decoder 210 and previously decoded blocks or picture information provided by the memory 245.
  • Intra prediction is performed on a prediction unit based on a pixel, but when intra prediction is performed, when the size of the prediction unit and the size of the transformation unit are different, intra prediction may be performed using a reference pixel based on the transformation unit. Can be. In addition, intra prediction using NxN division may be used only for a minimum coding unit.
  • the predictors 230 and 235 may include a prediction unit determiner, an inter predictor, and an intra predictor.
  • the prediction unit determiner receives various information such as prediction unit information input from the entropy decoder 210, prediction mode information of the intra prediction method, and motion prediction related information of the inter prediction method, and distinguishes the prediction unit from the current coding unit, and predicts It may be determined whether the unit performs inter prediction or intra prediction.
  • the inter prediction unit 230 predicts the current prediction based on information included in at least one of a previous picture or a subsequent picture of the current picture including the current prediction unit by using information required for inter prediction of the current prediction unit provided by the image encoder. Inter prediction may be performed on a unit. Alternatively, inter prediction may be performed based on information of some regions pre-restored in the current picture including the current prediction unit.
  • a motion prediction method of a prediction unit included in a coding unit based on a coding unit includes a skip mode, a merge mode, an AMVP mode, and an intra block copy mode. It can be determined whether or not it is a method.
  • the intra predictor 235 may generate a prediction block based on pixel information in the current picture.
  • intra prediction may be performed based on intra prediction mode information of the prediction unit provided by the image encoder.
  • the intra predictor 235 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolator, and a DC filter.
  • the AIS filter is a part of filtering the reference pixel of the current block and determines whether to apply the filter according to the prediction mode of the current prediction unit.
  • AIS filtering may be performed on the reference pixel of the current block by using the prediction mode and the AIS filter information of the prediction unit provided by the image encoder. If the prediction mode of the current block is a mode that does not perform AIS filtering, the AIS filter may not be applied.
  • the reference pixel interpolator may generate a reference pixel having an integer value or less by interpolating the reference pixel. If the prediction mode of the current prediction unit is a prediction mode for generating a prediction block without interpolating the reference pixel, the reference pixel may not be interpolated.
  • the DC filter may generate the prediction block through filtering when the prediction mode of the current block is the DC mode.
  • the reconstructed block or picture may be provided to the filter unit 240.
  • the filter unit 240 may include a deblocking filter, an offset correction unit, and an ALF.
  • Information about whether a deblocking filter is applied to a corresponding block or picture, and when the deblocking filter is applied to the corresponding block or picture, may be provided with information about whether a strong filter or a weak filter is applied.
  • the deblocking filter related information provided by the image encoder may be provided and the deblocking filtering of the corresponding block may be performed in the image decoder.
  • the offset correction unit may perform offset correction on the reconstructed image based on the type of offset correction and offset value information applied to the image during encoding.
  • the ALF may be applied to a coding unit based on ALF application information, ALF coefficient information, and the like provided from the encoder. Such ALF information may be provided included in a specific parameter set.
  • the memory 245 may store the reconstructed picture or block to use as a reference picture or reference block, and may provide the reconstructed picture to the output unit.
  • a coding unit is used as a coding unit for convenience of description, but may also be a unit for performing decoding as well as encoding.
  • the current block represents a block to be encoded / decoded, and according to the encoding / decoding step, a coding tree block (or a coding tree unit), an encoding block (or a coding unit), a transform block (or a transform unit), or a prediction block. (Or prediction unit) or the like.
  • 'unit' may indicate a basic unit for performing a specific encoding / decoding process
  • 'block' may indicate a sample array having a predetermined size.
  • 'block' and 'unit' may be used interchangeably.
  • the coding block (coding block) and the coding unit (coding unit) may be understood to have the same meaning.
  • One picture may be divided into square or non-square basic blocks and encoded / decoded.
  • the basic block may be referred to as a coding tree unit.
  • a coding tree unit may be defined as the largest coding unit allowed in a sequence or slice. Information regarding whether the coding tree unit is square or non-square or the size of the coding tree unit may be signaled through a sequence parameter set, a picture parameter set or a slice header.
  • the coding tree unit may be divided into smaller sized partitions.
  • the partition generated by dividing the coding tree unit is called depth 1
  • the partition generated by dividing the partition having depth 1 may be defined as depth 2. That is, a partition generated by dividing a partition that is a depth k in a coding tree unit may be defined as having a depth k + 1.
  • FIG. 3 is a diagram illustrating a partition mode that may be applied to a coding block when a coding block is encoded by intra picture prediction or inter picture prediction.
  • An arbitrary size partition generated as a coding tree unit is split is defined as a coding unit. can do.
  • Figure 3 (a) shows the coding unit is 2Nx2N size.
  • the coding unit may be split recursively or split into basic units for performing prediction, quantization, transform, or in-loop filtering.
  • a partition of any size generated as a coding unit is divided may be defined as a coding unit, or a transform unit (TU) or a prediction unit that is a basic unit for performing prediction, quantization, transform, or in-loop filtering.
  • PU Prediction Unit
  • a prediction block having the same size as the coding block or a size smaller than the coding block may be determined through prediction division of the coding block.
  • Predictive partitioning of a coding block may be performed by a partition mode (Part_mode) indicating a partition type of a coding block.
  • Part_mode partition mode
  • the size or shape of the prediction block may be determined according to the partition mode of the coding block.
  • the division type of the coding block may be determined through information specifying any one of partition candidates.
  • the partition candidates available to the coding block may include an asymmetric partition shape (eg, nLx2N, nRx2N, 2NxnU, 2NxnD) according to the size, shape, or coding mode of the coding block.
  • a partition candidate available to a coding block may be determined according to an encoding mode of the current block. For example, when the coding block is encoded by inter-screen prediction, any one of eight partition modes may be applied to the coding block, as shown in the example illustrated in FIG. On the other hand, when a coding block is encoded by intra prediction, PART_2Nx2N or PART_NxN among the eight partition modes of FIG. 3 (b) may be applied to the coding block.
  • PART_NxN may be applied when the coding block has a minimum size.
  • the minimum size of the coding block may be predefined in the encoder and the decoder.
  • information about the minimum size of the coding block may be signaled through the bitstream.
  • the minimum size of the coding block is signaled through the slice header, and accordingly, the minimum size of the coding block may be defined for each slice.
  • the partition candidates available to the coding block may be determined differently according to at least one of the size or shape of the coding block.
  • the number or type of partition candidates that a coding block may use may be differently determined according to at least one of the size or shape of the coding block.
  • the type or number of asymmetric partition candidates among partition candidates available to the coding block may be limited according to the size or shape of the coding block.
  • the number or type of asymmetric partition candidates that a coding block may use may be differently determined according to at least one of the size or shape of the coding block.
  • the size of the prediction block may have a size of 64x64 to 4x4.
  • the prediction block may not have a 4x4 size in order to reduce the memory bandwidth.
  • the coding block may be divided according to the partition mode indicated by the partition index, and each partition generated as the coding block is divided may be defined as the coding block.
  • a coding tree unit is included in a category of a coding unit. That is, in an embodiment to be described later, the coding unit may refer to a coding tree unit or may mean a coding unit generated as the coding tree unit is divided.
  • 'partition' generated as the coding block is split may be understood as meaning 'coding block'.
  • the coding unit may be divided by at least one line.
  • the line dividing the coding unit may have a predetermined angle.
  • the predetermined angle may be a value within the range of 0 degrees to 360 degrees.
  • a 0 degree line may mean a horizontal line
  • a 90 degree line may mean a vertical line
  • a 45 degree or 135 degree line may mean a diagonal line.
  • the plurality of lines may all have the same angle. Alternatively, at least one of the plurality of lines may have a different angle from other lines. Alternatively, the coding tree unit or the plurality of lines dividing the coding unit may be set to have a predefined angle difference (eg, 90 degrees).
  • Information about a coding tree unit or a line dividing the coding unit may be defined and encoded in a partition mode. Alternatively, information about the number of lines, the direction, the angle, the position of the lines in the block, and the like may be encoded.
  • a coding tree unit or a coding unit is divided into a plurality of coding units using at least one of a vertical line and a horizontal line.
  • the number of vertical lines or horizontal lines partitioning the coding unit may be at least one.
  • a coding tree unit or a coding unit may be divided into two partitions using one vertical line or one horizontal line, or the coding unit may be divided into three partitions using two vertical lines or two horizontal lines. .
  • one vertical line and one horizontal line may be used to divide the coding unit into four partitions of 1/2 length and width.
  • the partitions may have a uniform size.
  • either partition may have a different size than the remaining partitions, or each partition may have a different size.
  • a coding unit is divided into four partitions as a quad tree-based partition, and that a coding unit is divided into two partitions is assumed to be a binary tree-based partition.
  • the coding unit is divided into three partitions as triple tree based partitioning.
  • the partitioning is performed by applying the at least two partitioning schemes.
  • FIG. 4 is a diagram illustrating a partition type that allows quad tree and binary tree partitioning as an embodiment to which the invention is applied.
  • the input video signal is decoded in predetermined block units, and the basic unit for decoding the input video signal in this way is called a coding block.
  • the coding block may be a unit for performing intra / inter prediction, transformation, and quantization.
  • a prediction mode eg, an intra prediction mode or an inter prediction mode
  • the coding block can be a square or non-square block with any size in the range 8x8 to 64x64, and can be a square or non-square block with a size of 128x128, 256x256 or more.
  • the coding block may be hierarchically divided based on at least one of a quad tree and a binary tree.
  • quad tree-based partitioning divides a 2Nx2N coding block into four NxN coding blocks (Fig. 4 (a)), and binary tree-based partitioning divides one coding block into two coding blocks. Each can mean. Even if binary tree-based partitioning is performed, there may be a square coding block at a lower depth.
  • Binary tree-based partitioning may be performed symmetrically or asymmetrically.
  • the coding block divided based on the binary tree may be a square block or a non-square block such as a rectangle.
  • a partition type that allows binary tree based partitioning may be symmetric 2NxN (horizontal non-square coding unit) or Nx2N (vertical non-square coding unit), as in the example shown in FIG. 4 (b).
  • a partition type allowing partitioning based on a binary tree may include at least one of asymmetric nLx2N, nRx2N, 2NxnU, or 2NxnD, as shown in the example of FIG. .
  • Binary tree-based partitioning may be limitedly limited to either symmetric or asymmetric partitions.
  • configuring the coding tree unit into square blocks may correspond to quad tree CU partitioning
  • configuring the coding tree unit into symmetric non-square blocks may correspond to binary tree CU partitioning
  • Configuring the coding tree unit into square blocks and symmetric non-square blocks may correspond to quad and binary tree CU partitioning.
  • quad-tree & binary-tree (QTBT) partitioning the partitioning method based on the quad tree and the binary tree.
  • coding blocks that are no longer split may be used as prediction blocks or transform blocks. That is, in a Quad-Tree & Binary-Tree (QTBT) splitting method based on a quad tree and a binary tree, a coding block may be a prediction block, and the prediction block may be a transform block.
  • QTBT Quad-Tree & Binary-Tree
  • a prediction image may be generated in units of coding blocks, and a residual signal that is a difference between the original image and the prediction image may be converted in units of coding blocks.
  • generating the prediction image in units of coding blocks may mean that motion information is determined based on the coding block or one intra prediction mode is determined based on the coding block. Accordingly, the coding block may be encoded using at least one of a skip mode, an intra prediction or an inter prediction.
  • a coding block it is also possible to split a coding block to use a prediction block or transform block having a smaller size than the coding block.
  • BT may be set such that only symmetric division is allowed.
  • the coding efficiency may be lowered.
  • Asymetric Binary Tree Partitioning refers to splitting a coding block into two smaller coding blocks.
  • the coding block may be divided into two asymmetrical coding blocks.
  • Binary tree-based partitioning may be performed on a coding block in which quadtree-based partitioning is no longer performed.
  • Quadtree-based partitioning may no longer be performed on a coding block partitioned based on binary tree.
  • the division of the lower depth may be determined depending on the division type of the upper depth. For example, when binary tree-based partitioning is allowed in two or more depths, only a binary tree-based partitioning of the same type as a binary tree partitioning of an upper depth may be allowed in a lower depth. For example, when the binary tree based splitting is performed in the 2NxN form at the upper depth, the binary tree based splitting in the 2NxN form may be performed at the lower depth. Alternatively, when binary tree-based partitioning is performed in an Nx2N form at an upper depth, Nx2N-type binary tree-based partitioning may be allowed in a lower depth.
  • slices, coding tree units, or coding units only certain types of binary tree based partitioning may be used.
  • the 2NxN or Nx2N type binary tree based partitioning may be limited to the coding tree unit.
  • the allowed partition type may be predefined in the encoder or the decoder, and information about the allowed partition type or the not allowed partition type may be encoded and signaled through a bitstream.
  • FIG. 5 illustrates an example of hierarchically splitting a coding block based on quad tree and binary tree splitting as an embodiment to which the present invention is applied.
  • the first coding block 300 having a split depth of k may be divided into a plurality of second coding blocks based on a quad tree.
  • the second coding blocks 310 to 340 are square blocks having half the width and the height of the first coding block, and the split depth of the second coding block may be increased to k + 1.
  • the second coding block 310 having the division depth k + 1 may be divided into a plurality of third coding blocks having the division depth k + 2. Partitioning of the second coding block 310 may be selectively performed using either a quart tree or a binary tree according to a partitioning scheme.
  • the splitting scheme may be determined based on at least one of information indicating splitting based on the quad tree or information indicating splitting based on the binary tree.
  • the second coding block 310 When the second coding block 310 is divided on the basis of the quart tree, the second coding block 310 is divided into four third coding blocks 310a having half the width and the height of the second coding block, The split depth can be increased to k + 2.
  • the second coding block 310 when the second coding block 310 is divided on a binary tree basis, the second coding block 310 may be split into two third coding blocks. In this case, each of the two third coding blocks is a non-square block having one half of the width and the height of the second coding block, and the split depth may be increased to k + 2.
  • the second coding block may be determined as a non-square block in the horizontal direction or the vertical direction according to the division direction, and the division direction may be determined based on information about whether the binary tree-based division is the vertical direction or the horizontal direction.
  • the second coding block 310 may be determined as an end coding block that is no longer split based on the quad tree or the binary tree, and in this case, the corresponding coding block may be used as a prediction block or a transform block.
  • the third coding block 310a may be determined as an end coding block like the division of the second coding block 310, or may be further divided based on a quad tree or a binary tree.
  • the third coding block 310b split based on the binary tree may be further divided into a vertical coding block 310b-2 or a horizontal coding block 310b-3 based on the binary tree, and corresponding coding
  • the partition depth of the block can be increased to k + 3.
  • the third coding block 310b may be determined as an end coding block 310b-1 that is no longer split based on the binary tree, in which case the coding block 310b-1 may be used as a prediction block or a transform block. Can be.
  • the above-described partitioning process allows information about the size / depth of a coding block that allows quad-tree based partitioning, information about the size / depth of the coding block that allows binary tree-based partitioning, or binary-tree based partitioning. It may be limitedly performed based on at least one of information about the size / depth of the coding block that is not.
  • the size of the coding block may be limited to a predetermined number, or the size of the coding block in the predetermined unit may have a fixed value.
  • the size of the coding block in the sequence or the size of the coding block in the picture may be limited to 256x256, 128x128 or 32x32.
  • Information representing the size of a coding block in a sequence or picture may be signaled through a sequence header or picture header.
  • the coding unit may take a square or a rectangle of any size.
  • FIG. 6 illustrates an example of hierarchically partitioning coding blocks based on quad tree and symmetric binary tree splitting as an embodiment to which the present invention is applied.
  • FIG. 6 is a diagram illustrating an example in which only a specific form, for example, a partition based on a symmetric binary tree is allowed.
  • FIG. 6A illustrates an example in which only Nx2N type binary tree based partitioning is allowed.
  • the depth 1 coding block 601 may be divided into two Nx2N blocks 601a and 601b at depth 2
  • the depth 2 coding block 602 may be divided into two Nx2N blocks 602a and 602b at depth 3. .
  • the depth 1 coding block 603 may be divided into two 2NxN blocks 603a and 603b at depth 2
  • the depth 2 coding block 604 may be divided into two 2NxN blocks 604a and 604b at depth 3. .
  • FIG. 6C illustrates an example of dividing a block divided into a symmetric binary tree into a symmetric binary tree.
  • the depth 1 coding block 605 is divided into two Nx2N blocks 605a and 605b at depth 2
  • the depth 2 coding block 605a generated after the division is divided into two Nx2N blocks 605a1, at depth 3. 605a2).
  • the partitioning scheme is equally applicable to 2N ⁇ N coding blocks generated by symmetric binary tree partitioning.
  • Quad_split_flag may indicate whether a coding block is divided into four coding blocks
  • binary_split_flag may indicate whether a coding block is divided into two coding blocks.
  • the number of times that binary tree splitting is allowed, the depth for which binary tree splitting is allowed or the number of depths for which binary tree splitting is allowed may be obtained.
  • the information may be encoded in a coding tree unit or a coding unit and transmitted to a decoder through a bitstream.
  • a syntax 'max_binary_depth_idx_minus1' indicating a maximum depth that allows binary tree splitting may be encoded / decoded through the bitstream through the bitstream.
  • max_binary_depth_idx_minus1 + 1 may indicate the maximum depth allowed for binary tree splitting.
  • the result of performing binary tree splitting on the coding units having depth 2 (eg, 605a and 605b) and the coding units having depth 3 (eg, 605a1 and 605a2) is illustrated.
  • information indicating the number of times binary tree splitting has been performed in the coding tree unit for example, two times
  • information indicating the maximum depth (eg, depth 3) allowed for binary tree splitting in the coding tree unit or in the coding tree unit.
  • At least one of information representing the number of depths (eg, two, depth 2, and depth 3) allowed for binary tree splitting may be encoded / decoded through a bitstream.
  • At least one of the number of times that the binary tree split is allowed, the depth in which the binary tree split is allowed, or the number of the depths in which the binary tree split is allowed may be obtained for each sequence and slice.
  • the information may be encoded in a sequence, picture or slice unit and transmitted through a bitstream.
  • at least one of the number of binary tree splits, the maximum depth allowed for binary tree splits, or the number of depths allowed for binary tree splits may be different in the first and second slices. For example, in the first slice, binary tree splitting is allowed only at one depth, while in the second slice, binary tree splitting may be allowed at two depths.
  • At least one of the number of times that a binary tree split is allowed, the depth that allows a binary tree split, or the number of depths that a binary tree split allows may be differently set according to a temporal identifier (Temporal_ID) of a slice or a picture.
  • Temporal_ID may be used to identify each of a plurality of layers of an image having at least one scalability among a view, a spatial, a temporal, or a quality. will be.
  • CUs partitioned by binary partitioning can be restricted from using Transform skip.
  • transformskip may be applied only in at least one of a horizontal direction and a vertical direction. Applying only the horizontal transform skip refers to performing scaling and quantization without performing transform in the horizontal direction, and performing transformation by specifying at least one transform such as DCT or DST in the vertical direction.
  • applying only the vertical transform skip indicates that the transform is performed by specifying at least one transform such as DCT or DST in the horizontal direction, and performs only scaling and quantization without performing transform in the vertical direction.
  • the syntax hor_transform_skip_flag indicating whether to apply the horizontal transform skip and the syntax ver_transform_skip_flag indicating whether to apply the vertical transform skip may be signaled.
  • the transform skip When applying the transform skip to at least one of the horizontal direction and the vertical direction, it is also possible to signal in which direction the transform skip is applied depending on the type of the CU. Specifically, for example, in the case of a 2NxN type CU The transform may be performed in the horizontal direction and the transform skip may be applied in the vertical direction. In the case of an Nx2N type CU, the transform skip may be applied in the horizontal direction and the transform may be performed in the vertical direction.
  • the transform may be at least one of DCT or DST.
  • the transform may be performed in the vertical direction and the transform skip may be applied in the horizontal direction.
  • the transform skip may be applied in the vertical direction and the horizontal direction is transformed. You can also do
  • the transform may be at least one of DCT or DST.
  • FIG. 7 is a diagram illustrating a partition form in which an asymmetric binary tree split is allowed according to an embodiment to which the present invention is applied.
  • a 2Nx2N coding block includes two coding blocks having a width ratio of n: (1-n) or a height ratio of n It may be split into two coding blocks: (1-n).
  • n may represent a real number greater than 0 and less than 1.
  • FIG. 7 for example, as asymmetric binary tree partitioning is applied to a coding block, two coding blocks 701, 702 having a width ratio of 1: 3, or two coding blocks 703, 704 having a 3: 1, Or two coding blocks 705, 706 with a height ratio of 1: 3 or two coding blocks 707, 708 with a 3: 1 are shown.
  • a left partition having a width of 1 / 4W and a right partition having a width of 3 / 4W may be generated.
  • a partitioned form in which the width of the left partition is smaller than the width of the right partition may be referred to as an nLx2N binary partition.
  • a left partition having a width of 3 / 4W and a right partition having a width of 1 / 4W may be generated.
  • the partition type whose width of the right partition is smaller than the width of the left partition may be referred to as nRx2N binary partition.
  • a top partition having a height of 1 / 4H and a bottom partition having a height of 3 / 4H may be generated.
  • a partition type in which the height of the upper partition is smaller than the height of the lower partition may be referred to as a 2NxnU binary partition.
  • an upper partition having a height of 3 / 4H and a lower partition having a height of 1 / 4H may be generated.
  • a partitioned form in which the height of the lower partition is smaller than the height of the upper partition may be referred to as a 2NxnD binary partition.
  • the width ratio or height ratio between two coding blocks is 1: 3 or 3: 1.
  • the width ratio or height ratio between two coding blocks generated by asymmetric binary tree partitioning is not limited thereto.
  • the coding block may be divided into two coding blocks having a different width ratio or a different height ratio than that shown in FIG. 7.
  • an asymmetric binary partition shape of a coding block may be determined based on information signaled through a bitstream.
  • a partitioning type of a coding block may include information indicating a partitioning direction of a coding block and a coding block. The partition may be determined based on information indicating whether the first partition generated as the partition is smaller than the second partition.
  • the information indicating the splitting direction of the coding block may be a 1-bit flag indicating whether the coding block is split in the vertical direction or in the horizontal direction.
  • hor_binary_flag may indicate whether a coding block is divided in a horizontal direction.
  • a value of hor_binary_flag equal to 1 indicates that the coding block is divided in the horizontal direction
  • a value of hor_binary_flag equal to 0 may indicate that the coding block is divided in the vertical direction.
  • ver_binary_flag indicating whether the coding block is divided in the vertical direction may be used.
  • the information indicating whether the first partition has a smaller size than the second partition may be a 1-bit flag.
  • is_left_above_small_part_flag may indicate whether the size of the left or top partition generated as the coding block is split is smaller than the right or bottom partition.
  • the value of is_left_above_small_part_flag equal to 1 may mean that the size of the left or top partition is smaller than the right or bottom partition
  • the value of is_left_above_small_part_flag equal to 0 may mean that the size of the left or top partition is larger than the right or bottom partition.
  • is_right_bottom_small_part_flag may be used indicating whether the size of the right or bottom partition is smaller than the left or top partition.
  • the size of the first partition and the second partition may be determined using information representing a width ratio, a height ratio, or a width ratio between the first partition and the second partition.
  • a value of hor_binary_flag equal to 0 and a value of is_left_above_small_part_flag equal to 1 indicate an nLx2N binary partition
  • a value of hor_binary_flag equal to 0 and a value of is_left_above_small_part_flag equal to 0 may indicate an nRx2N binary partition.
  • a value of hor_binary_flag equal to 1 and a value of is_left_above_small_part_flag equal to 1 indicate a 2NxnU binary partition
  • a value of hor_binary_flag equal to 1 indicates a 2NxnU binary partition
  • a value of hor_binary_flag equal to 1 indicates a 2NxnD binary partition
  • a value of hor_binary_flag 1
  • a value of is_left_above_small_part_flag equal to 0 may indicate a 2NxnD binary partition.
  • the asymmetric binary partition type of the coding block may be determined by index information indicating the partition type of the coding block.
  • the index information is information signaled through the bitstream, and may be encoded with a fixed length (that is, a fixed number of bits) or may be encoded with a variable length.
  • Table 1 shows partition indexes for asymmetric binary partitions.
  • Asymmetric binary tree partitioning may be used depending on the QTBT partitioning method. For example, if quad tree partitioning or binary tree partitioning is no longer applied to a coding block, whether to apply asymmetric binary tree partitioning to the coding block. Can be determined.
  • whether to apply asymmetric binary tree splitting to the coding block may be determined by information signaled through the bitstream. For example, the information may be a 1-bit flag 'asymmetric_binary_tree_flag', and based on the flag, it may be determined whether asymmetric binary tree splitting is applied to the coding block.
  • the coding block may be split into two blocks. If so, it may be determined whether the partition type is binary tree split or asymmetric binary tree split.
  • whether the partition type of the coding block is binary tree partitioning or asymmetric binary tree partitioning may be determined by information signaled through the bitstream.
  • the information may be a one-bit flag 'is_asymmetric_split_flag', and based on the flag, it may be determined whether the coding block is divided into symmetrical or asymmetrical forms.
  • Different indexes may be allocated and according to the index information, it may be determined whether a coding block is divided into a symmetrical form or an asymmetrical form.
  • Table 2 shows an example in which different indices are assigned to a symmetric binary partition and an asymmetric binary partition.
  • Binary partition index Binarization 2NxN (horizontal binary partition) 0 0 Nx2N (vertical binary partition)
  • the coding tree block or coding block may be subdivided into a plurality of coding blocks through quad tree splitting, binary tree splitting or asymmetric binary tree splitting.
  • FIG. 8 is a diagram illustrating an example in which a coding block is divided into a plurality of coding blocks using QTBT and asymmetric binary tree splitting. Referring to FIG. 9, it can be seen that asymmetric binary tree splits are performed in depth 2 partitioning of the first grip, depth 3 partitioning of the second figure, and depth 3 partitioning of the third figure. Coding blocks divided by asymmetric binary tree partitioning are performed. May be restricted so that it is no longer split.
  • quad-tree, binary tree, or asymmetric binary tree related information may not be encoded / decoded in a coding block generated through asymmetric binary tree partitioning. That is, for a coding block generated through asymmetric binary tree partitioning, a flag indicating whether a quad tree is split, a flag indicating whether a binary tree is split, a binary tree, or an asymmetric binary tree split direction is specified. Encoding / decoding of syntax, such as an indicating flag or index information indicating an asymmetric binary partition, may be omitted. As another example, whether to allow binary tree partitioning may be determined depending on whether to allow QTBT. As an example, asymmetric binary tree partitioning may be restricted from a picture or slice in which a split method based on QTBT is not used.
  • Information indicating whether asymmetric binary tree partitioning is allowed may be encoded and signaled in units of blocks, slices, or pictures.
  • the information indicating whether asymmetric binary tree partitioning is allowed may be a 1-bit flag.
  • the value of is_used_asymmetric_QTBT_enabled_flag equal to 0 may indicate that asymmetric binary tree partitioning is not used.
  • the value may be set to 0 without signaling is_used_asymmetric_QTBT_enabled_flag.
  • FIG. 8 illustrates a split form of a coding block based on quad tree and symmetric / asymmetric binary tree splitting as an embodiment to which the present invention is applied.
  • depth 1 coding block 801 is divided into two asymmetrical nLx2N blocks 801a and 801b at depth 2
  • depth 2 coding block 801b is also divided into two symmetrical Nx2N blocks 801b1 and 801b2 at depth 3. The divided example is shown.
  • the depth 2 coding block 802 illustrates an example divided into two asymmetric nRx2N blocks 802a and 802b at depth 3.
  • the depth 2 coding block 803 shows an example divided into two asymmetric two 2N ⁇ nU blocks 803a and 803b at depth 3.
  • the split type allowed for the coding block may be determined.
  • at least one of the partition type, partition type, or number of partitions allowed between the coding block generated by the quad tree split and the coding block generated by the binary tree split may be different.
  • the coding block may allow both quad tree splitting, binary tree splitting, and asymmetric binary tree splitting. That is, when the coding block is generated based on quad tree partitioning, all the partition types shown in FIG. 10 may be applied to the coding block.
  • a 2N ⁇ 2N partition indicates a case in which the coding block is no longer partitioned and NxN. Denotes a case in which a coding block is quadtree-divided, and Nx2N and 2NxN may indicate a case in which a coding block is binary-tree divided.
  • nLx2N, nRx2N, 2NxnU, and 2NxnD may represent a case where a coding block is asymmetric binary tree split.
  • the asymmetric binary tree splitting may be limited to the coding block. That is, when the coding block is generated based on binary tree partitioning, it may be restricted to apply an asymmetric partition type (nLx2N, nRx2N, 2NxnU, 2NxnD) among the partition types shown in FIG. 7 to the coding block.
  • an asymmetric partition type nLx2N, nRx2N, 2NxnU, 2NxnD
  • FIG. 9 is a flowchart illustrating a coding block partitioning method based on quad tree and binary tree partitioning according to an embodiment to which the present invention is applied.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • quad tree splitting is applied to the depth k current block (S910). If quad tree splitting is applied, the current block is split into four square blocks (S920). On the other hand, if quad tree splitting is not applied, it is determined whether binary tree splitting is applied to the current block (S930). If binary tree splitting is not applied, then the current block becomes a depth k + 1 coding block without splitting.
  • S930 if binary tree partitioning is applied to the current block, it is checked whether either symmetrical binary partitioning or asymmetrical binary partitioning is applied (S940).
  • the partition type applied to the current block is determined (S950).
  • the partition type applied to the step S950 may be any one of the form of FIG. 4 (b) in the case of symmetry, or one of the form of FIG. 4 (c) in case of the asymmetry.
  • the current block is divided into two depth k + 1 coding blocks according to the determined partition type (S960).
  • FIG. 10 illustrates, as an embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quadtree and binary tree splits are applied.
  • NAL network abstraction layer
  • the compressed image to which the present invention is applied may be packetized in units of a network abstract layer (hereinafter, referred to as NAL) and transmitted through a transmission medium.
  • NAL network abstract layer
  • the present invention is not limited to the NAL, but may be applied to various data transmission schemes to be developed in the future.
  • NAL unit to which the present invention is applied for example, as shown in Figure 10, video parameter set (VPS), sequence parameter set (SPS), picture parameter set (PPS) and at least one slice set (Slice) It may include.
  • syntax elements included in the sequence parameter set are illustrated in FIG. 10, the syntax elements may be included in the picture parameter set (PPS) or the slice set (Slice).
  • syntax elements to be commonly applied to sequence units or picture units for each syntax element may be included in a sequence parameter set (SPS) or a picture parameter set (PPS).
  • the syntax element applied only to the slice is preferably included in the slice set (Slice). Therefore, this can be selected in consideration of encoding performance and efficiency.
  • syntax elements to which quad tree and binary tree splits are applied are as follows. Although all syntax elements shown in FIG. 10 may be set as essential elements, dual syntax elements may be selectively set in consideration of encoding efficiency and performance.
  • 'quad_split_flag' indicates whether a coding block is divided into four coding blocks.
  • 'binary_split_flag' may indicate whether a coding block is split into two coding blocks.
  • 'isUseBinaryTreeFlag' indicates whether binary tree partitioning is applied to the current block, and is also a syntax element indicating a split direction of the coding block, and 'hor_binary_flag' indicates whether the coding block has been split in the horizontal direction.
  • 'hor_binary_flag 1
  • this may indicate that the coding block is split in the horizontal direction
  • ver_binary_flag indicating whether or not the coding block is divided in the vertical direction may be set in the same manner.
  • 'max_binary_depth_idx_minus1' may be defined as a syntax element indicating the maximum depth allowed for binary tree splitting.
  • “max_binary_depth_idx_minus1 + 1" may indicate the maximum depth allowed for binary tree splitting.
  • 'ver_transform_skip_flag' may be set as a syntax element indicating whether to apply the horizontal transform skip and 'hor_transform_skip_flag' and a syntax element indicating whether to apply the vertical transform skip.
  • the value when binary tree partitioning is not used in picture units or slice units, the value may be set to 0 without signaling is_used_asymmetric_QTBT_enabled_flag.
  • 'asymmetric_binary_tree_flag' may indicate whether asymmetric binary tree partitioning is applied to the current block.
  • 'is_left_above_small_part_flag' indicating whether the size of the right or bottom partition is smaller than the left or top partition may be used.
  • the coding unit (or coding tree unit) may be recursively divided by at least one vertical line or horizontal line.
  • quad tree splitting may be divided into a method of splitting a coding block using horizontal lines and vertical lines
  • binary tree splitting may be summarized as a method of splitting coding blocks using a horizontal line or vertical lines.
  • the partition form of the coding block to be quad tree divided and binary tree divided is not limited to the example illustrated in FIGS. 4 to 8, and an extended partition form other than that shown may be used. That is, the coding block may be recursively divided into different forms from those shown in FIGS. 4 to 8.
  • FIG. 11 is a diagram illustrating a partition type in which asymmetric quad tree division is allowed as another embodiment to which the present invention is applied.
  • the horizontal line or the vertical line may split the coding block into an asymmetric shape.
  • the asymmetry may mean a case in which the heights of the blocks divided by the horizontal lines are not the same or the widths of the blocks divided by the vertical lines are not the same.
  • a horizontal line divides a coding block into an asymmetric form
  • a vertical line divides a coding block into a symmetric form
  • a horizontal line divides a coding block into a symmetric form
  • a vertical line divides a coding block into an asymmetric form. It may be.
  • both horizontal and vertical lines may split the coding block into an asymmetric shape.
  • 11 (a) shows a symmetric quad tree split form of a coding block
  • (b) to (k) shows an asymmetric quad tree split form of a coding block
  • 11 (a) shows an example in which both horizontal and vertical lines are used for symmetrical division.
  • 11 (b) and 11 (c) show an example in which horizontal lines are used for symmetrical division, while vertical lines are used for asymmetrical division.
  • 11 (d) and (e) show an example in which vertical lines are used for symmetrical division, while horizontal lines are used for asymmetrical division.
  • the information may include a first indicator indicating whether the partitioned form of the coding block is symmetrical or asymmetrical.
  • the first indicator may be encoded in units of blocks or may be encoded for each vertical line or horizontal line.
  • the first indicator may include information indicating whether a vertical line is used for symmetric division and information indicating whether a horizontal line is used for symmetric division.
  • the first indicator may be encoded only for at least one of a vertical line or a horizontal line, and another split form in which the first indicator is not encoded may be derived dependently by the first indicator.
  • another split form in which the first indicator is not encoded may have a value opposite to that of the first indicator. That is, when the first indicator indicates that the vertical line is used for asymmetric division, the horizontal line may be set to be used for symmetric division opposite to the first indicator.
  • the second indicator may be further encoded with respect to the vertical line or the horizontal line.
  • the second indicator may indicate at least one of the position of the vertical line or the horizontal line used for the asymmetric division or the ratio between the blocks divided by the vertical line or the horizontal line.
  • Quad tree splitting may be performed using a plurality of vertical lines or a plurality of horizontal lines. For example, it is also possible to divide a coding block into four blocks by combining at least one of one or more vertical lines or one or more horizontal lines.
  • 11 (f) to 11 (k) show an example of dividing a coding block asymmetrically by combining a plurality of vertical lines / horizontal lines and one horizontal line / vertical line.
  • quadtree splitting divides a coding block into three blocks by two vertical lines or two horizontal lines, and any one of the divided three blocks into two blocks.
  • a block located in the middle of the blocks divided by two vertical lines or two horizontal lines may be divided by one horizontal line or vertical line.
  • a block located at one boundary of a coding block may be divided by one horizontal line or a vertical line.
  • information eg, partition index
  • partition index for specifying a partition among three partitions may be signaled through the bitstream.
  • At least one of a horizontal line or a vertical line may be used to divide the coding block into an asymmetric form, and the other may be used to divide the coding block into a symmetric form.
  • a plurality of vertical lines or horizontal lines may be used to split a coding block in a symmetrical form, or one horizontal line or vertical lines may be used to split a coding block in a symmetrical form.
  • horizontal lines or vertical lines may be used to split a coding block in a symmetrical form or may be used to split asymmetrically.
  • FIG. 11 (f) illustrates a partition form in which a middle coding block divided into two asymmetrical shapes by two vertical lines is divided into two symmetrical coding blocks by a horizontal line.
  • FIG. 11 (g) illustrates a partition form in which a middle coding block divided into two asymmetrical shapes by two horizontal lines is divided into two symmetrical coding blocks by a vertical line.
  • Figure 11 (h) and (i) shows a partition form in which the middle coding block divided into two asymmetrical forms by two vertical lines divided into two asymmetrical coding blocks by a horizontal line again.
  • 11 (j) and 11 (k) show a partition form in which a middle coding block divided into two asymmetrical shapes by two horizontal lines is further divided into two asymmetrical coding blocks by a vertical line.
  • the coding block When combining a plurality of vertical / horizontal lines and one horizontal / vertical line, the coding block is divided into four partitions (i.e., four coding blocks) of at least two different sizes.
  • the partitioning of a coding block into four partitions of at least two different sizes may be referred to as three types of asymmetric quad-tree partitioning.
  • the information about the three asymmetric quad tree partitionings may be encoded based on at least one of the aforementioned first indicator or second indicator.
  • the first indicator may indicate whether the splitting form of the coding block is symmetrical or asymmetrical.
  • the first indicator may be encoded in units of blocks or may be encoded for each vertical line or horizontal line.
  • the first indicator may include information indicating whether one or more vertical lines are used for symmetric division and information indicating whether one or more horizontal lines are used for symmetric division.
  • the first indicator may be encoded only for at least one of a vertical line or a horizontal line, and another split form in which the first indicator is not encoded may be derived dependently by the first indicator.
  • the second indicator may be further encoded with respect to the vertical line or the horizontal line.
  • the second indicator may indicate at least one of the position of the vertical line or the horizontal line used for the asymmetric division or the ratio between the blocks divided by the vertical line or the horizontal line.
  • FIG. 12 is a flowchart illustrating a coding block partitioning method based on asymmetric quad tree partitioning according to another embodiment to which the present invention is applied.
  • step S1210 it is determined whether the quad tree split is applied to the depth k current block (S1210). As a result of the determination of step S1210, if quad tree splitting is not applied, the current block becomes a depth k + 1 coding block without splitting. If it is determined in step S1210 that the quad tree split is applied, it is determined whether the asymmetric quad tree split is applied to the current block (S1220). If the asymmetric quad tree split is not applied and the symmetric quad tree split is applied, the current block is split into four square blocks (S1230).
  • an asymmetric quad tree split it is determined whether three asymmetric quad tree splits are applied to the current block (S1240). If three kinds of asymmetric quad tree splits are not applied, the current block is divided into four two kinds of asymmetric blocks (S1250). In this case, the partition information may be divided into any one partition form of FIGS. 11 (b) to (e).
  • the current block is divided into four kinds of three asymmetric blocks (S1260).
  • the partition information may be partitioned into one of the partitions of FIGS. 11 (f) to 11 (k).
  • FIG. 13 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which asymmetric quadtree splitting is applied.
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • Slice at least one slice set
  • FIG. 13 illustrates syntax elements included in a sequence parameter set (SPS)
  • syntax elements may be included in a picture parameter set (PPS) or a slice set (Slice).
  • syntax elements to be commonly applied to sequence units or picture units for each syntax element may be included in a sequence parameter set (SPS) or a picture parameter set (PPS).
  • the syntax element applied only to the slice is preferably included in the slice set (Slice). Therefore, this can be selected in consideration of encoding performance and efficiency.
  • the syntax element 'Is_used_asymmertic_quad_tree_flag' indicates whether quad tree splitting is performed asymmetrically.
  • FIGS. 11A to 11K may be represented as indexes by 'asymmetric_quadtree_partition_index'.
  • FIG. 14 is a diagram illustrating a partition type allowing quad tree and triple tree division as another embodiment to which the present invention is applied.
  • the coding block may be hierarchically divided based on at least one of a quad tree and a triple tree.
  • quad tree-based partitioning divides a 2Nx2N coding block into four NxN coding blocks (FIG. 14 (a)), and triple tree-based partitioning divides one coding block into three coding blocks. Each can mean. Even if triple tree-based partitioning is performed, there may be a square coding block at a lower depth.
  • Triple tree based splitting may be performed symmetrically (FIG. 14B) or may be performed asymmetrically (FIG. 14C).
  • the coding block divided based on the triple tree may be a square block or a non-square block such as a rectangle.
  • a partition type that allows triple tree-based partitioning is a 2Nx (2N / 3) (horizontal non-square coding unit) that is symmetric with the same width or height, as in the example shown in FIG. 14 (b). ) Or (2N / 3) x2N (a vertical non-square coding unit).
  • a partition type that allows triple tree-based partitioning may be an asymmetric partition type including coding blocks having different widths or heights, as shown in the example illustrated in FIG. 14C.
  • a partition type that allows triple tree-based partitioning may be an asymmetric partition type including coding blocks having different widths or heights, as shown in the example illustrated in FIG. 14C.
  • at least two coding blocks 1401 and 1403 are defined to be located at both sides with k values having the same width (or height) size, and the rest.
  • One block 1402 may be defined to have a value of 2k as a width (or height) size and be located between the same size blocks 1401 and 1403.
  • a method of dividing a CTU or a CU into three sub-partitions having a non-square shape as shown in FIG. 14 is called a triple tree CU partitioning method.
  • a CU divided into triple tree partitioning may be further restricted to not perform partitioning.
  • 15 is a flowchart illustrating a coding block partitioning method based on quadtree and tripletree partitioning as another embodiment to which the present invention is applied.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • the quad tree split is applied to the depth k current block (S1510). If quad tree splitting is applied, the current block is split into four square blocks (S1520). On the other hand, if the quad tree split has not been applied, it is determined whether the triple tree split is applied to the current block (S1530). If triple tree splitting is not applied, the current block becomes a depth k + 1 coding block without splitting.
  • the partition type applied to the current block is determined according to the determination result of S1540 (S1550).
  • the partition type applied to the step S1550 may be any one of the shape of FIG. 14 (b) in the case of symmetry, and one of the shape of FIG. 14 (c) in the case of the asymmetry.
  • the current block is divided into three depth k + 1 coding blocks according to the determined partition type in operation S1560.
  • FIG. 16 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quad tree and triple tree splits are applied.
  • NAL network abstraction layer
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • Slice at least one slice set
  • FIG. 16 illustrates syntax elements included in a sequence parameter set (SPS)
  • syntax elements may be included in a picture parameter set (PPS) or a slice set (Slice).
  • syntax elements to be commonly applied to sequence units or picture units for each syntax element may be included in a sequence parameter set (SPS) or a picture parameter set (PPS).
  • the syntax element applied only to the slice is preferably included in the slice set (Slice). Therefore, this can be selected in consideration of encoding performance and efficiency.
  • 'isUseTripleTreeFlag' indicates whether triple tree partitioning is applied to the current block, and is also a syntax element indicating a split direction of the coding block, and 'hor_triple_flag' indicates whether the coding block has been split in the horizontal direction.
  • 'hor_triple_flag 1
  • this may indicate that the coding block is split in the horizontal direction
  • ver_triple_flag indicating whether a coding block is divided in the vertical direction may be used in the same manner.
  • FIG. 14B may be defined to mean a 2Nx (2N / 3) partition type.
  • partition types of FIGS. 14A to 14C may be represented as indexes by 'asymmetric_tripletree_partition_index'.
  • FIG. 17 is a diagram illustrating a partition type in which multi-tree partitioning is allowed as another embodiment to which the present invention is applied.
  • a method of partitioning a CTU or CU using at least one of the aforementioned quad tree partitioning, binary partitioning, or triple tree partitioning is called multi-tree CU partitioning. Any of the N partitions described above may be used to partition a CTU or a CU. Specifically, for example, as shown in FIG. 17, nine partitions may be used to partition a CTU or a CU.
  • Partitioning may be performed using quad-tree partitioning, binary tree partitioning, or triple-tree partitioning, either in sequence units or in picture units, or the CTU or CU may be partitioned using any one or two partitionings.
  • Quad tree partitioning is used by default, and binary tree partitioning and triple tree partitioning are optional. In this case, it may be signaled whether to use binary tree partitioning and / or triple tree partitioning in a sequence parameter set or a picture parameter set.
  • quad tree partitioning and triple tree partitioning can be used as standard, and binary tree partitioning can be optionally used.
  • the syntax isUseBinaryTreeFlag may be signaled indicating whether to use binary tree partitioning in the sequence header. If isUseBinaryTreeFlag is 1, CTU or CU can be partitioned using binary tree partitioning in the current sequence.
  • the syntax isUseTripleTreeFlag may be signaled indicating whether triple tree partitioning is used in the sequence header. If isUseTripleTreeFlag is 1, CTU or CU can be partitioned using triple tree partitioning in the current sequence header.
  • the partition form divided by multi-tree partitioning can be limited to nine basic partitions shown in Figs. 17A to 17I, for example.
  • (A) shows a quad tree partition form
  • (b)-(c) shows a symmetric binary tree partition form
  • (d)-(e) shows an asymmetric triple tree partition form
  • (f)- (i) shows an asymmetric binary tree partition type.
  • each partition type shown in FIG. 17 in connection with the above description detailed descriptions thereof will be omitted.
  • FIGS. 18 (j) to (u) may be extended to further include 12 partitions shown in FIGS. 18 (j) to (u), for example, in the form of partitions divided by multi-tree partitioning.
  • 18 (j) to (m) show an asymmetric quad tree partition form
  • (n) to (s) show three asymmetric quad tree partition forms
  • (t) to (u) show a symmetric triple tree partition form.
  • each partition type shown in FIG. 18 in the same manner as described above, a detailed description thereof will be omitted.
  • 19 is a flowchart illustrating a coding block partitioning method based on multi-tree partitioning according to another embodiment to which the present invention is applied.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • the quad tree split is applied to the depth k current block (S1910). If the quad tree split has not been applied, it is determined whether the binary tree split is applied to the current block (S1950). In addition, if binary tree splitting is not applied, it is determined whether triple tree splitting is applied to the current block (S1990). If triple tree splitting is not applied as a result of the step S1950, the current block becomes a depth k + 1 coding block without splitting.
  • step S1910 if quad tree splitting is applied, it is checked whether a symmetrical or asymmetric quadtree splitting is performed (S1920). Thereafter, the partition information is checked to determine the block partition type of the current block (S1930), and the current block is divided into four blocks according to the determined partition type (S1940). For example, when the symmetric quad tree is applied, it is divided into the partition form of FIG. 17 (a). In addition, when the asymmetric quad tree is applied, it is divided into any one partition form of FIGS. 18 (j) to (m). Alternatively, when three kinds of asymmetric quad trees are applied, they are divided into any one partition form of Figs. 18 (n) to (s). However, as described above, if only the basic partition type of FIG. 17 is applied to the multi-tree partition type, only the symmetric square block of FIG. 17 (a) may be applied without determining whether the quad tree is asymmetric.
  • step S1950 if binary tree splitting is applied, it is checked whether a symmetric or asymmetric binary tree splitting is performed (S1960). Thereafter, the partition information is determined to determine the block partition type of the current block (S1970), and the current block is divided into two blocks according to the determined partition type (S1980). For example, when the symmetric binary tree is applied, the partition is divided into one of the partitions of FIGS. 17B and 17C. In addition, when an asymmetric binary tree is applied, it divides into any partition form of FIG.17 (f)-(i).
  • step S1990 if triple tree splitting is applied, it is checked whether symmetric or asymmetric triple tree splitting is performed (S1960). Thereafter, the partition information is determined to determine a block partition type of the current block (S1970), and the current block is divided into three blocks according to the determined partition type (S1980). For example, when an asymmetric triple tree is applied, it is divided into any one partition form of FIGS. 17 (d) and (e). In addition, when the symmetric binary tree is applied, it divides into any partition form of FIG. 18 (t)-(u). However, as described above, if the multi-tree partition type applies only the basic partition type of FIG. 17, the asymmetric triple block defined in 17 (d) and (e) is not determined without determining whether the triple tree is asymmetric. Only applicable.
  • 'is_used_Multitree_flag' indicating whether to split a multi-tree may be defined.
  • FIG. 20 and 21 are diagrams for explaining a parallel processing method of coding blocks divided by multi-tree division, as another embodiment to which the present invention is applied.
  • FIG. 20 illustrates a parallel processing method of a first type coding block partitioned by multi-tree partitioning
  • FIG. 21 illustrates a parallel processing method of a second type coding block partitioned by multi-tree partitioning.
  • the first type coding block refers to a non-square block having a longer length in the vertical direction when the width (w) of the parallel processing block is smaller than the height (h).
  • the second type coding block is a case where the height h of the parallel processing block is smaller than the width w, and means a non-square block having a longer length in the horizontal direction.
  • FIG. 20 illustrates a case where a coding block CU is divided into lower depth coding blocks CU0 to CU9.
  • the size of partitioned CU0 and CU1 is 2x4
  • the size of partitioned CU2, CU3 and CU4 is 4x4
  • the size of partitioned CU5 and CU6 is 2x8
  • the size of partitioned CU7 is 4x8, the size of partitioned CU8 and CU9
  • the size shows the case divided by 8x8.
  • the coding block CU is divided into lower depth coding blocks CU10 to CU17, for example.
  • the size of the divided CU10 and CU11 is divided into 8x2
  • the size of the divided CU12, CU15 and CU16 is 8x4
  • the size of the divided CU13 and CU14 is 4x8, the size of the divided CU17 is 8x8.
  • FIGS. 20 and 21 illustrate that the partition of FIG. 20 and FIG. 21 are applied by applying one of the above-described multi-tree partitioning methods, and various partition types different from those of FIGS. 20 and 21 may be possible according to the partition scheme.
  • CU1 2002 when CU1 2002 illustrated in FIG. 20 is encoded in an intra prediction mode, CU1 2002 may be encoded after CU0 2001 is encoded by a conventional HEVC or a legacy legacy codec. That is, conventionally, since the image or samples reconstructed in CU0 2001 are used as an intra reference sample (ie, a reference sample) of CU1 2002, CU0 2001 and CU1 2002 cannot be simultaneously encoded.
  • the CU6 2004 can be encoded after the CU5 2003 is encoded. That is, conventionally, since the image or samples reconstructed in CU5 (2003) are used as an intra reference sample (ie, a reference sample) of CU6 (2004), CU5 (2003) and CU6 (2004) cannot be simultaneously encoded.
  • a non-square coding unit having a small width or height such as 2x16, 16x2, or 2x8, 8x2, can be used, which can effectively compress small objects or fine objects.
  • the data dependency problem caused by the generation of a large number of non-square coding units when multi-tree partitioning is applied causes a long latency in hardware or software implementation, thereby increasing implementation complexity and speed.
  • the present invention proposes an image decoding and encoding method for parallel processing a plurality of independent coding blocks in order to more effectively support the aforementioned multi-tree partitioning scheme.
  • the current CU may perform intra or inter prediction independently of the neighboring CU.
  • the current CU may perform prediction without data dependencies sharing texture data (eg, reconstructed samples, residual samples, prediction samples, etc.) and / or encoding parameters of neighboring CUs.
  • the independent prediction may mean that data with the neighboring CU is not used, or may mean that the current CU and the neighboring CU are performed in parallel according to an implementation method.
  • the neighboring CU may be set as an unavailable block for encoding / decoding of the current CU.
  • the current CU and the neighboring CU may be independently encoded / decoded based on at least one of the width or the height of the coding unit.
  • the number of neighboring CUs may be one or more.
  • the position of the neighboring CU may be continuous in at least one of horizontal, vertical, or diagonal directions with respect to the current CU.
  • the neighboring CU is based on at least one of the directionality of the prediction mode and / or the intra prediction mode of the current CU, the position of the current CU within the upper CU, the shape and size related information of the current CU, or the luminance / color difference component related information. Can be specified.
  • a plurality of adjacent coding units are independent parallel processing CUs may be set according to various criteria. For example, a plurality of coding units may be independently encoded / decoded based on whether the width w or height h of the coding unit is smaller than a specific threshold. Alternatively, the plurality of coding units may be independently encoded / decoded based on whether the width w and height h ratios (ie, w / h or h / w) values of the coding unit are smaller than a specific threshold. Alternatively, the plurality of coding units may be independently encoded / decoded based on whether the sum of the width and height of the coding unit or the number of samples of the coding unit is smaller than a specific threshold.
  • the specific threshold value may be a fixed value preset in the encoder / decoder, or may be determined by an encoder, and may be encoded and signaled by a decoder.
  • the encoded threshold information may be signaled in at least one unit of a sequence, a picture, a slice, and a block.
  • two consecutive coding units when the width or height of the coding unit is smaller than 4 as shown in ⁇ CU0, CU1 ⁇ , ⁇ CU5, CU6 ⁇ of FIG. 20 and ⁇ CU10, CU11 ⁇ of FIG. Can be coded / decoded independently.
  • a CU that precedes the coding scan order is referred to as a corresponding CU
  • a CU that follows the coding scan order is defined as a target CU.
  • the current coding block may be referred to as a current parallel processing block
  • a coding block adjacent to the current parallel processing block may be called a neighbor parallel processing block. That is, referring to FIG. 20, CU0 2001 and CU5 2003 correspond to corresponding CUs, and CU1 2002 and CU6 2004 correspond to target CUs.
  • a CU10 2101 corresponds to a corresponding CU, and a CU11 2102 corresponds to a target CU.
  • the target CU reference sample is not derived from a corresponding CU (eg, CU0, CU5, CU10) region, which is a neighboring parallel processing block that has not yet been restored, and utilizes the reference sample used in the corresponding CU. do.
  • the target CU reference sample may be derived by using a difference between the target CU reference point sample value and the corresponding CU reference point sample value.
  • the reference point sample may be one or more samples adjacent to the target CU or the corresponding CU.
  • the reference point sample may be a sample adjacent to the top, left, or left-top corner of the target CU or the corresponding CU.
  • the location of all or part of the reference point samples may be variably specified according to the size, shape, aspect ratio, location of the encoding / decoding target sample, or the like of the target CU or the corresponding CU.
  • a sample of a fixed position may be used regardless of the target CU or the corresponding CU.
  • the difference may be derived through the difference between the reference point sample value of the target CU and the reference point sample value of the corresponding CU, or may be derived by applying a predetermined weight to each reference point sample value.
  • the difference may be derived by scaling a value generated through the difference with a predetermined scaling factor.
  • the difference may be derived as an offset mapped to a value generated through the difference.
  • FIG. 22 is a diagram for describing a parallel processing coding block partitioned by multi-tree partitioning as another embodiment to which the present invention is applied.
  • the coding unit is partitioned with multi-tree partitioning, it is possible to independently parallel the current CU and the neighboring CU based on at least one of the width or the height of the coding unit.
  • the position of the neighbor parallel CU may be continuous to at least one of horizontal, vertical, or diagonal directions with respect to the current parallel CU.
  • Fig. 22 (a) shows a horizontal parallel processing block
  • Fig. 22 (b) shows a vertical parallel processing block
  • Fig. 22 (c) shows a diagonal parallel processing block
  • Fig. 22 (d) shows a horizontal parallel processing block.
  • the vertical and diagonal parallel processing blocks are included.
  • the determination of the parallel processing block can be selected at the time of encoding / decoding according to the encoding / decoding performance and efficiency of the coding unit.
  • the determination of the parallel processing block may be performed at the time of encoding according to the encoding performance and the efficiency of the corresponding coding unit, and the selected parallel processing information may be signaled and transmitted to the decoder to perform parallel processing on the determined block at the time of decoding. .
  • FIG. 22A illustrates a case where a coding unit is divided into lower depth coding units CU18 to CU29, for example.
  • ⁇ CU27, CU28 ⁇ divided by the third depth may be determined as the horizontally adjacent parallel processing block based on the width or the height of the adjacent horizontal coding unit among the above-described determination methods of the parallel processing blocks.
  • ⁇ CU18, CU19 ⁇ and ⁇ CU21, CU22 ⁇ divided by the third depths of different positions can be determined as parallel processing blocks adjacent in the horizontal direction, respectively.
  • FIG. 22B illustrates a case where a coding unit is divided into lower depth coding units CU30 to CU40, for example.
  • ⁇ CU36, CU37 ⁇ divided by the third depth may be determined as the vertically adjacent parallel processing block based on the width or the height of the adjacent vertical coding unit among the above-described determination methods of the parallel processing blocks.
  • ⁇ CU30, CU31 ⁇ divided by the third depths of different positions can be determined as parallel processing blocks adjacent to each other in the horizontal direction.
  • FIG. 22C illustrates a case where, for example, the coding unit is divided into lower depth coding units CU41 to CU54.
  • ⁇ CU41, CU44 ⁇ divided by the third depth may be determined as the diagonally adjacent parallel processing blocks based on the width or the height of the adjacent diagonal coding unit among the above-described determination methods of the parallel processing blocks.
  • ⁇ CU42, CU43 ⁇ may be determined as diagonally adjacent parallel processing blocks.
  • FIG. 22D illustrates a case where the coding unit is divided into lower depth coding units CU41 to CU54, similarly to FIG. 22C.
  • the parallel processing block may be simultaneously determined based on the width or height size of the coding unit adjacent to at least one of horizontal, vertical, and diagonal directions among the above-described determination methods of the various parallel processing blocks.
  • ⁇ CU52, CU53 ⁇ divided by the third depth may be determined as the parallel processing block adjacent to the horizontal direction
  • ⁇ CU49, CU50 ⁇ divided by the third depth of the other position may be determined as the parallel processing block adjacent to the vertical direction.
  • ⁇ CU41, CU44 ⁇ divided by the third depth of another position may be determined as diagonally adjacent parallel processing blocks.
  • FIG. 23 is a diagram for describing a parallel processing unit processing region (PCUR: Parallel Coding Unit Processing Region) divided by multi-tree partitioning according to another embodiment to which the present invention is applied.
  • PCUR Parallel Coding Unit Processing Region
  • a predetermined block may be limited to process a prediction block (a prediction block generated through an inter prediction encoding mode and an intra prediction encoding mode) in parallel.
  • the predefined specific region is called a "Parallel Coding Unit Processing Region (PCUR)".
  • N and M may be 4, 8, 16, 32 or more, and N and M may be the same or different.
  • FIG. 23 illustrates a case where the size of the PCUR is 8x8.
  • data e.g., sample values, intra reference samples, motion information, reference picture lists, etc.
  • independent parallel processing between CUs can be enabled.
  • a coding unit larger than a PCUR size set as a 16x16 coding unit, or an 8x16 coding unit not completely included in the PCUR, such as CU13 to CU14 of FIG. 23, may not be processed in parallel, but may be processed sequentially or in a neighboring block.
  • encoding can be performed with a dependency. That is, encoding may be performed using the peripheral data (eg, sample value, intra reference sample, motion information, reference picture list, etc.).
  • the parallel coding unit unit PCUR may be a square region or a non-square region.
  • a syntax element isRect_PCUR_flag indicating whether it is a square or non-square area may be signaled in a sequence parameter header, a picture parameter header, a slice header, or the like.
  • the syntax “log2_PCUR_width_minus1” indicating the width and height of the parallel coding unit may be further signaled.
  • the width and height of the parallel coding unit may be defined as 1 ⁇ (log2_PCUR_width_minus1 + 1).
  • ⁇ represents a bit shift operation.
  • the size of the minimum parallel coding unit unit is 4x4 unit.
  • each of the syntaxes representing the width and the height of the parallel coding unit may be signaled.
  • the encoder may determine the size of an optimal parallel coding unit for each sequence, picture, or slice, and encode and signal the same.
  • a fixed sized parallel coding unit pre-defined with the encoder / decoder may be used.
  • FIG. 24 is a diagram for explaining a parallel processing encoding method of a coding block divided by multi-tree division, according to another embodiment to which the present invention is applied.
  • a partition shape of a coding block divided by a multi-partitioning method is determined (S2410).
  • the partition type may be any one of the partition types of FIGS. 11 and 12 described above.
  • the prediction mode of the split coding block is determined (S2420).
  • the prediction mode includes intra prediction or inter prediction. However, the parallel coding method can be applied only to the intra prediction block.
  • a block capable of parallel processing is determined (S2430).
  • the parallel processing block determination criteria may be determined by various methods as described above. For example, it can be determined by the width and height size (below threshold) of the coding block sample, and the position (horizontal, vertical, diagonally adjacent) with adjacent parallel coding blocks.
  • the parallel coding block may be determined by the above-described parallel coding unit unit PCUR setting.
  • step S2430 If, in step S2430, it is not determined to be a parallel processing block, reference samples for each coding block are determined (S2460), and encoding is performed in units of coding blocks (S2470). On the other hand, if it is determined as a parallel processing block by the step S2430, the parallel processing blocks are independently processed simultaneously. To this end, reference samples for each parallel block are determined (S2440), and parallel processing blocks are simultaneously encoded (S2450). Reference sample determination of the parallel block of step S2440 will be described later in detail with reference to FIGS. 26 to 29.
  • FIG. 25 is a diagram for explaining a parallel processing decoding method of a coding block divided by multitree partitioning, according to another embodiment to which the present invention is applied.
  • encoding information is parsed from an input encoded video bitstream (S2510). From the parsed encoding information, a partition type of a coding block divided by a multi-partitioning scheme and a prediction mode of each split coding block are checked (S2520). In addition, from the parsed encoding information, whether or not the above-described parallel coding unit unit PCUR is set and the set PCUR size may be checked (S2520). In this regard, the partition type may be any one of the partition types of FIGS. 11 and 12 described above. In addition, the prediction mode of the coding block includes intra prediction or inter prediction. However, the parallel decoding method can be applied only to the intra prediction block.
  • a block capable of parallel processing is determined according to the determined partition type and prediction mode (S2530).
  • the parallel processing block determination criteria may be determined by various methods as described above. For example, it can be determined by the width and height size (below threshold) of the coding block sample, and the position (horizontal, vertical, diagonally adjacent) with adjacent parallel coding blocks.
  • the parallel coding block may be determined by the above-described parallel coding unit unit PCUR setting.
  • step S2530 If, in step S2530, it is not determined to be a parallel processing block, a reference sample for each coding block is determined (S2560), and decoding is performed in units of coding blocks (S2570). On the other hand, if it is determined as a parallel processing block by the step S2530, the parallel processing blocks are independently processed simultaneously. To this end, reference samples for each parallel block are determined (S2540), and the parallel processing blocks are simultaneously decoded (S2550). Reference sample determination of the parallel block of step S2540 will be described later in detail with reference to FIGS. 26 to 29.
  • neighboring coding units CU5 and CU6 illustrated in FIGS. 26 and 27 correspond to the above-described parallel processing block criteria, and mean coding units in which independent parallel processing decoding and / or encoding is performed.
  • 2x8 size CU5 and CU6 correspond to coding units of the same size horizontally adjacent among the various parallel processing criteria described above, and the width (w) of the coding unit is 4 or less, and the width (w) and height (h) may be determined as a parallel processing block based on the ratio, i.e., whether the w / h value is less than a certain threshold (e.g., 1/2).
  • the parallel processing block determination criteria may be selectively set in consideration of encoding performance and efficiency.
  • a reference sample may be configured by using sample values of the reconstructed region.
  • the reference sample may be configured by using the reconstructed neighboring sample values.
  • the left reference sample R (-1, i) of the CU6 is selected and the reference sample value of the neighboring coding unit CU5 is set.
  • offsets representing the difference in sample values between reference point samples are set.
  • each of the upper left or upper samples of the coding units CU5 and CU6 may be set as reference point samples, and the difference value between these reference point samples may be set as an offset.
  • the reference point of CU5 is set to P (0, -1) 2702
  • the reference point of CU6 is set to P (2, -1) 2704
  • the two coding units CU5 and CU6 are set.
  • the difference of the sample value between the reference point samples of may be set as an offset. That is, the offset f can be set as in the following equation (1).
  • Equation (1) w represents the width of the coding unit, and f represents the difference between the reference point sample value of the target CU and the reference point sample value of the corresponding CU.
  • the reference point position can be determined by various methods.
  • the reference point of CU5 is P (-1, -1) 2701 and the reference point of CU6 is P (1, -1) (2703). It is also possible to obtain the offset f by setting The reference points of CU5 are the average values of P (-1, -1) 2701 and P (0, -1) 2702, and the reference points of CU6 are P (1, -1) 2703 and P (2). It is also possible to set the average value of (-2704) and obtain the offset f.
  • unreconstructed left reference samples R (-1, i) among the reference samples of CU5 may derive the offset f from the left reference sample of CU6 as a differential value, as follows: Can be expressed as
  • neighboring coding units CU10 and CU11 illustrated in FIGS. 28 and 29 correspond to the above-described parallel processing block criteria and refer to coding units in which independent parallel processing decoding and / or encoding is performed.
  • CU10 and CU11 of 8x2 size correspond to coding units of the same size vertically adjacent among the various parallel processing criteria described above, and the coding unit has a height h of 4 or less, width w and height.
  • the ratio may be determined as a parallel processing block based on whether the h / w value is less than a specific threshold (eg, 1/2).
  • the parallel processing block determination criteria may be selectively set in consideration of encoding performance and efficiency.
  • a reference sample may be configured by using sample values of the reconstructed region.
  • the reference sample may be configured by using the reconstructed neighboring sample values.
  • the upper reference sample R (i, -1) of the CU11 is selected and the reference sample value of the neighboring coding unit CU10. Or offsets representing the difference in sample values between reference point samples.
  • each of the upper left or left samples of the coding units CU10 and CU11 may be set as reference point samples, and the difference value between these reference point samples may be set as an offset.
  • the reference point of CU10 is set to P (-1,0) 2902 and the reference point of CU11 is set to P (-1,2) 2904, and the two coding units CU10 and CU11 are used.
  • the difference of the sample value between the reference point samples of may be set as an offset. That is, the offset f can be set as in the following equation (3).
  • Equation (3) h represents the height of the coding unit, and f represents the difference between the reference point sample value of the target CU and the reference point sample value of the corresponding CU.
  • the reference point position can be determined by various methods.
  • the reference point of CU10 is P (-1, -1) 2901 and the reference point of CU11 is P (-1,1) (2903). It is also possible to obtain the offset f by setting
  • the reference points of CU10 are the average values of P (-1, -1) 2901 and P (-1,0) 2902, and the reference points of CU11 are P (-1,1) (2903) and P (-). 1,2) It is also possible to set to the average value of 2904 and obtain the offset f.
  • unreconstructed upper reference samples R (i, -1) among the reference samples of CU11 may derive the offset f from the upper reference sample of CU10 as a differential value, as shown in Equation 4 below.
  • Equation 4 Can be expressed as
  • FIG. 30 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which a parallel processing coding block having multi-tree partitions is applied.
  • NAL network abstraction layer
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • Slice at least one slice set
  • FIG. 30 illustrates an included syntax element included in a picture parameter set (PPS)
  • the syntax element may be included in a sequence parameter set (SPS) or a slice set (Slice).
  • SPS sequence parameter set
  • Slice slice set
  • syntax elements to be commonly applied to sequence units or picture units for each syntax element may be included in a sequence parameter set (SPS) or a picture parameter set (PPS).
  • the syntax element applied only to the slice is preferably included in the slice set (Slice). Therefore, this can be selected in consideration of encoding performance and efficiency.
  • each component for example, a unit, a module, etc. constituting the block diagram may be implemented as a hardware device or software, and a plurality of components are combined into one hardware device or software. It may be implemented.
  • the above-described embodiments may be implemented in the form of program instructions that may be executed by various computer components, and may be recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs, DVDs, and magneto-optical media such as floptical disks. media), and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • the hardware device may be configured to operate as one or more software modules to perform the processing according to the present invention.
  • the present invention can be applied to an electronic device capable of encoding / decoding an image.

Landscapes

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

Abstract

La présente invention concerne un procédé et un dispositif de traitement de signal vidéo. Un procédé de décodage d'image, selon la présente invention, peut comprendre les étapes consistant à : confirmer si un bloc de codage courant est un bloc de traitement parallèle courant adjacent à un bloc de traitement parallèle voisin dans au moins l'une quelconque des directions horizontale, verticale et diagonale, en utilisant des informations de partition de bloc sur le bloc de codage courant ; et décoder le bloc de traitement parallèle courant en parallèle avec le bloc de traitement parallèle voisin. Selon la présente invention, un bloc à coder/décoder est traité indépendamment en parallèle, ce qui permet d'augmenter l'efficacité de codage/décodage d'un signal d'image.
PCT/KR2018/002340 2017-02-24 2018-02-26 Procédé et dispositif de traitement de signal vidéo WO2018155983A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2017-0024640 2017-02-24
KR20170024640 2017-02-24

Publications (1)

Publication Number Publication Date
WO2018155983A1 true WO2018155983A1 (fr) 2018-08-30

Family

ID=63252909

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/002340 WO2018155983A1 (fr) 2017-02-24 2018-02-26 Procédé et dispositif de traitement de signal vidéo

Country Status (2)

Country Link
KR (1) KR20180098158A (fr)
WO (1) WO2018155983A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110958452A (zh) * 2018-09-27 2020-04-03 华为技术有限公司 视频解码方法及视频解码器
CN111418211A (zh) * 2018-11-06 2020-07-14 北京字节跳动网络技术有限公司 用于利用几何分割的帧间预测的多个Merge列表和顺序
CN113225560A (zh) * 2018-09-21 2021-08-06 Oppo广东移动通信有限公司 视频编码/解码方法、视频编码/解码装置和存储介质
CN116112683A (zh) * 2021-11-10 2023-05-12 腾讯科技（深圳）有限公司 视频压缩方法、装置、计算机设备和存储介质
WO2024016171A1 (fr) * 2022-07-19 2024-01-25 Oppo广东移动通信有限公司 Procédé et dispositif de codage vidéo, support de stockage et flux de code

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112236998B (zh) * 2019-01-02 2024-11-22 苹果公司 用于对视频信号进行编码/解码的方法及其装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110134626A (ko) * 2010-06-09 2011-12-15 삼성전자주식회사 매크로블록의 연관관계를 고려하여 영상 데이터의 부호화 및 복호화를 병렬 처리하는 장치 및 방법
US20120134416A1 (en) * 2010-11-29 2012-05-31 Mediatek Inc. Method and Apparatus for Derivation of MV/MVP Candidate for Inter/Skip/Merge Modes
CN103004203A (zh) * 2010-07-15 2013-03-27 夏普株式会社 基于块尺寸的并行视频编码
WO2013051897A1 (fr) * 2011-10-05 2013-04-11 한국전자통신연구원 Procédé de codage d'image et procédé de décodage d'image
CN103108178A (zh) * 2011-11-11 2013-05-15 华为技术有限公司 视频图像编解码的方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110134626A (ko) * 2010-06-09 2011-12-15 삼성전자주식회사 매크로블록의 연관관계를 고려하여 영상 데이터의 부호화 및 복호화를 병렬 처리하는 장치 및 방법
CN103004203A (zh) * 2010-07-15 2013-03-27 夏普株式会社 基于块尺寸的并行视频编码
US20120134416A1 (en) * 2010-11-29 2012-05-31 Mediatek Inc. Method and Apparatus for Derivation of MV/MVP Candidate for Inter/Skip/Merge Modes
WO2013051897A1 (fr) * 2011-10-05 2013-04-11 한국전자통신연구원 Procédé de codage d'image et procédé de décodage d'image
CN103108178A (zh) * 2011-11-11 2013-05-15 华为技术有限公司 视频图像编解码的方法及装置

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113225560A (zh) * 2018-09-21 2021-08-06 Oppo广东移动通信有限公司 视频编码/解码方法、视频编码/解码装置和存储介质
CN113225560B (zh) * 2018-09-21 2023-05-23 Oppo广东移动通信有限公司 视频编码/解码方法、视频编码/解码装置和存储介质
US11758176B2 (en) 2018-09-21 2023-09-12 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Image signal encoding/decoding method and non-transitory computer-readable medium
US12382083B2 (en) 2018-09-21 2025-08-05 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Image signal encoding/decoding method and non-transitory computer-readable medium
CN110958452A (zh) * 2018-09-27 2020-04-03 华为技术有限公司 视频解码方法及视频解码器
CN110958452B (zh) * 2018-09-27 2023-11-03 华为技术有限公司 视频解码方法及视频解码器
CN111418211A (zh) * 2018-11-06 2020-07-14 北京字节跳动网络技术有限公司 用于利用几何分割的帧间预测的多个Merge列表和顺序
CN111418211B (zh) * 2018-11-06 2024-02-27 北京字节跳动网络技术有限公司 用于利用几何分割的帧间预测的多个Merge列表和顺序
CN116112683A (zh) * 2021-11-10 2023-05-12 腾讯科技（深圳）有限公司 视频压缩方法、装置、计算机设备和存储介质
WO2023082834A1 (fr) * 2021-11-10 2023-05-19 腾讯科技（深圳）有限公司 Procédé et appareil de compression de vidéo, dispositif informatique et support de stockage
WO2024016171A1 (fr) * 2022-07-19 2024-01-25 Oppo广东移动通信有限公司 Procédé et dispositif de codage vidéo, support de stockage et flux de code

Also Published As

Publication number Publication date
KR20180098158A (ko) 2018-09-03

Similar Documents

Publication Publication Date Title
WO2018155986A2 (fr) Procédé et appareil de traitement de signaux vidéo
WO2017222326A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018097626A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018026219A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2017176030A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018088805A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018212579A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018056701A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018056703A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2017171370A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018155985A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2019225993A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2020111785A1 (fr) Procédé de codage/décodage de signal vidéo et appareil associé
WO2019050292A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018155984A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018008906A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018093184A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018155983A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2019182295A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018066958A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2020096427A1 (fr) Procédé de codage/décodage de signal d'image et appareil associé
WO2019190201A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2020096428A1 (fr) Procédé de codage/décodage d'un signal d'image et dispositif pour cette technologie
WO2012043989A2 (fr) Procédé destiné à diviser un bloc et dispositif de décodage
WO2019190199A1 (fr) Procédé et dispositif de traitement de signal vidéo

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 25.11.2019)

122 Ep: pct application non-entry in european phase

Ref document number: 18756685

Country of ref document: EP

Kind code of ref document: A1