WO2021049890A1 - 영상 신호 부호화/복호화 방법 및 이를 위한 장치 - Google Patents

영상 신호 부호화/복호화 방법 및 이를 위한 장치 Download PDF

Info

Publication number
WO2021049890A1
WO2021049890A1 PCT/KR2020/012250 KR2020012250W WO2021049890A1 WO 2021049890 A1 WO2021049890 A1 WO 2021049890A1 KR 2020012250 W KR2020012250 W KR 2020012250W WO 2021049890 A1 WO2021049890 A1 WO 2021049890A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
current block
motion information
coding
intra prediction
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/KR2020/012250
Other languages
English (en)
French (fr)
Korean (ko)
Inventor
이배근
전동산
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Industry Academic Cooperation Foundation of Kyungnam University
Xris Corp
Original Assignee
Industry Academic Cooperation Foundation of Kyungnam University
Xris Corp
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
Priority to JP2022515792A priority Critical patent/JP7700785B2/ja
Application filed by Industry Academic Cooperation Foundation of Kyungnam University, Xris Corp filed Critical Industry Academic Cooperation Foundation of Kyungnam University
Priority to CN202411987721.6A priority patent/CN119835418A/zh
Priority to AU2020347030A priority patent/AU2020347030B2/en
Priority to CN202411987723.5A priority patent/CN119835419A/zh
Priority to CA3150364A priority patent/CA3150364A1/en
Priority to CN202411987734.3A priority patent/CN119835421A/zh
Priority to CN202080028560.1A priority patent/CN113711596B/zh
Priority to CN202411987730.5A priority patent/CN119835420A/zh
Publication of WO2021049890A1 publication Critical patent/WO2021049890A1/ko
Priority to US17/473,714 priority patent/US11425399B2/en
Anticipated expiration legal-status Critical
Priority to US17/847,381 priority patent/US11665357B2/en
Priority to US18/136,297 priority patent/US12063373B2/en
Priority to US18/757,324 priority patent/US12581094B2/en
Priority to JP2025094562A priority patent/JP2025116269A/ja
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/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/117—Filters, e.g. for pre-processing or post-processing
    • 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/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • 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/124—Quantisation
    • 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • 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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform 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/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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation

Definitions

  • the present disclosure relates to a video signal encoding/decoding method and an apparatus therefor.
  • JCT-VC Joint Collaborative Team on Video Coding
  • MPEG Motion Picture Experts Group
  • VCEG Video Coding Experts Group
  • ITU-T International Telecommunication Union-Telecommunication
  • An object of the present disclosure is to provide a method of dividing a picture into a plurality of tiles in encoding/decoding a video signal and an apparatus for performing the method.
  • An object of the present disclosure is to provide a method of determining a slice division structure based on a tile division structure in encoding/decoding a video signal, and an apparatus for performing the method.
  • An object of the present disclosure is to provide a method of dividing a picture into a plurality of subpictures in encoding/decoding a video signal, and an apparatus for performing the method.
  • the video signal decoding method includes the steps of parsing information on the number of tile columns representing a value obtained by subtracting 1 from the number of tile columns included in the i-th slice, and differentiating 1 from the number of tile rows included in the i-th slice. Parsing information on the number of tile rows representing a value, and when the information on the number of tile columns and the information on the number of tile rows are all 0, the height information in the tile including the i-th slice is explicitly signaled. And further parsing the number information related to the number.
  • first height information related to the height of the first slice may be further parsed.
  • the height information may not be parsed for the second slice.
  • the height of the second slice is a first height value derived based on the last signaled height information and a second height excluding an area occupied by previous slices in the tile. It can be set to the minimum value among the values.
  • variable i may be updated to a value obtained by adding a value obtained by subtracting 1 from the number of slices.
  • encoding/decoding efficiency can be improved by dividing a picture into a plurality of tiles.
  • encoding/decoding efficiency can be improved by determining the slice division structure based on the tile division structure.
  • encoding/decoding efficiency can be improved by dividing a picture into a plurality of subpictures.
  • FIG. 1 is a block diagram of an image encoder (encoder) according to an embodiment of the present disclosure.
  • FIG. 2 is a block diagram of an image decoder (decoder) according to an embodiment of the present disclosure.
  • FIG. 3 is a diagram illustrating a basic coding tree unit according to an embodiment of the present disclosure.
  • FIG. 4 is a diagram showing various division types of a coding block.
  • FIG. 5 is a diagram illustrating a partitioning aspect of a coding tree unit.
  • FIG. 6 is a flowchart of an inter prediction method according to an embodiment of the present disclosure.
  • FIG. 7 is a flowchart of a process of inducing motion information of a current block in a merge mode.
  • FIG. 8 is a diagram illustrating candidate blocks used to derive a merge candidate.
  • FIG. 9 is a diagram illustrating candidate blocks used to derive a merge candidate.
  • FIG. 10 is a diagram for describing an update aspect of a motion information table.
  • FIG. 11 is a diagram illustrating an update aspect of a motion information table.
  • FIG. 12 is a diagram illustrating an example in which an index of a previously stored motion information candidate is updated.
  • 13 is a diagram showing positions of representative sub-blocks.
  • FIG. 14 is a diagram illustrating an example in which a redundancy check is performed on only some of merge candidates.
  • 15 is a diagram illustrating an example in which a redundancy check with a specific merge candidate is omitted.
  • 16 is a diagram illustrating an example in which a candidate block included in the same merge processing area as the current block is set to be unavailable as a merge candidate.
  • 17 is a diagram illustrating an example of deriving a merge candidate for a current block when a current block is included in a merge processing area.
  • 18 is a diagram showing a temporary motion information table.
  • 19 is a diagram illustrating an example of merging a motion information table and a temporary motion information table.
  • 20 is a flowchart of an intra prediction method according to an embodiment of the present disclosure.
  • 21 is a diagram illustrating intra prediction modes.
  • 22 and 23 are diagrams illustrating an example of a one-dimensional arrangement in which reference samples are arranged in a line.
  • 24 is a diagram illustrating an angle formed by a straight line parallel to an x-axis by directional intra prediction modes.
  • 25 is a diagram illustrating an aspect in which prediction samples are obtained when the current block has an amorphous shape.
  • 26 is a diagram illustrating wide-angle intra prediction modes.
  • FIG. 27 is a diagram illustrating an example of vertical partitioning and horizontal partitioning.
  • 28 is a diagram illustrating an example of determining a division type of a coding block.
  • 29 is a diagram illustrating an example of determining a division type of a coding block.
  • 30 is a diagram illustrating an example of determining whether to skip transformation for each subblock.
  • 31 is a diagram illustrating an example in which sub-blocks use the same transform type.
  • 32 and 33 are diagrams illustrating an application aspect of a sub transform block encoding method.
  • 34 and 35 illustrate a horizontal direction transformation type and a vertical direction transformation type according to a location of a sub-block to be converted.
  • 36 is a diagram illustrating an encoding aspect of a transform coefficient when the reduction factor is 16.
  • 37 and 38 are diagrams illustrating an area to which the second transform is to be applied.
  • 39 is an example of various separation indivisible transformation matrix candidates.
  • FIG. 40 is a diagram illustrating a picture segmentation method according to an embodiment of the present invention.
  • 41 shows an example in which a picture is divided into a plurality of tiles.
  • FIG. 42 is a diagram for describing an aspect in which slice size information is signaled.
  • 43 and 44 are diagrams for explaining an encoding aspect of slice height information.
  • 45 is a diagram for describing a division type applicable to a picture.
  • 46 is a flowchart of a method of dividing a picture into at least one subpicture according to an embodiment of the present disclosure.
  • Video encoding and decoding are performed in units of blocks. For example, encoding/decoding processing such as transformation, quantization, prediction, in-loop filtering, or reconstruction may be performed on a coding block, a transform block, or a prediction block.
  • encoding/decoding processing such as transformation, quantization, prediction, in-loop filtering, or reconstruction may be performed on a coding block, a transform block, or a prediction block.
  • the current block may represent a coding block, a transform block, or a prediction block according to a current encoding/decoding process step.
  • the term'unit' used in the present specification may be understood to denote a basic unit for performing a specific encoding/decoding process
  • 'block' may be understood to denote a sample array having a predetermined size.
  • 'block' and'unit' may be used interchangeably.
  • the coding block and the coding unit have the same meaning as each other.
  • FIG. 1 is a block diagram of an image encoder (encoder) according to an embodiment of the present disclosure.
  • the image encoding apparatus 100 includes a picture splitter 110, a prediction unit 120, 125, a transform unit 130, a quantization unit 135, a rearrangement unit 160, and an entropy encoder ( 165, an inverse quantization unit 140, an inverse transform unit 145, a filter unit 150, and a memory 155.
  • each of the components shown in FIG. 1 is shown independently to represent different characteristic functions in an image encoding apparatus, and does not mean that each component is formed of separate hardware or a single software component. That is, each constituent part is listed and included as a constituent part for convenience of explanation, and at least two constituent parts of each constituent part are combined to form one constituent part, or one constituent part is divided into a plurality of constituent parts to perform functions Integrated embodiments and separate embodiments of the components are also included in the scope of the present disclosure unless departing from the essence of the present disclosure.
  • the components are not essential components that perform essential functions in the present disclosure, but may be optional components only for improving performance.
  • the present disclosure may be implemented by including only components essential to implement the essence of the present disclosure excluding components used for performance improvement, and a structure including only essential components excluding optional components used for performance improvement Also included in the scope of the present disclosure.
  • 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 splitter 110 divides one picture into a combination of a plurality of coding units, prediction units, and transformation units, and combines one coding unit, a prediction unit, and a transformation unit based on a predetermined criterion (for example, a cost function). You can select to encode the picture.
  • a predetermined criterion for example, a cost function
  • one picture may be divided into a plurality of coding units.
  • a recursive tree structure such as a quad tree structure can be used. Encoding that is split into other coding units based on one image or the largest coding unit as a root. A unit may be divided with as many child nodes as the number of divided 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 splitting is possible for one coding unit, one coding unit may be split into up to four different coding units.
  • a coding unit may be used as a unit that performs encoding or a unit that performs decoding.
  • the prediction unit may be split in a shape such as at least one square or rectangle of the same size within one coding unit, or one prediction unit among the prediction units split within one coding unit is another prediction. It may be divided to have a different shape and/or size from the unit.
  • intra prediction may be performed without dividing into a plurality of prediction units NxN.
  • the prediction units 120 and 125 may include an inter prediction unit 120 that performs inter prediction and an intra prediction unit 125 that performs intra prediction. It is possible to determine whether to use inter prediction or to perform intra prediction for the prediction unit, and determine specific information (eg, intra prediction mode, motion vector, reference picture, etc.) according to each prediction method.
  • a processing unit in which prediction is performed may be different from a processing unit in which a prediction method and specific content are determined. For example, a prediction method and a prediction mode are determined in a prediction unit, and prediction may be performed in a transformation unit. A residual value (residual block) between the generated prediction block and the original block may be input to the transform unit 130.
  • prediction mode information and motion vector information used for prediction may be encoded by the entropy encoder 165 together with a residual value and transmitted to a decoder.
  • a specific encoding mode it is possible to encode an original block as it is and transmit it to a decoder without generating a prediction block through the prediction units 120 and 125.
  • the inter prediction unit 120 may predict a prediction unit based on information of at least one picture of a picture before or after the current picture, and in some cases, predict based on information of a partial region in the current picture that has been encoded. You can also predict the unit.
  • the inter prediction unit 120 may include a reference picture interpolation unit, a motion prediction unit, and a motion compensation unit.
  • the reference picture interpolation unit may receive reference picture information from the memory 155 and may generate pixel information of an integer number of pixels or less from the reference picture.
  • a DCT-based 8-tap interpolation filter with different filter coefficients may be used to generate pixel information of an integer number of pixels or less in units of 1/4 pixels.
  • a DCT-based interpolation filter with different filter coefficients may be used to generate pixel information of an integer number of pixels or less in units of 1/8 pixels.
  • the motion prediction unit may perform motion prediction based on the reference picture interpolated by the reference picture interpolation unit.
  • Various methods such as a full search-based block matching algorithm (FBMA), a three step search (TSS), and a new three-step search algorithm (NTS), can be used as a method for calculating a motion vector.
  • the motion vector may have a motion vector value in units of 1/2 or 1/4 pixels based on the interpolated pixels.
  • the motion prediction unit may predict the current prediction unit by differently predicting the motion.
  • Various methods such as a skip method, a merge method, an advanced motion vector prediction (AMVP) method, and an intra block copy method may be used as a motion prediction method.
  • AMVP advanced motion vector prediction
  • the intra predictor 125 may generate a prediction unit based on reference pixel information around a 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 included in the block that has performed inter prediction is a reference pixel of the block that has performed intra prediction around it. Can be used as a substitute for information. That is, when the reference pixel is not available, information about the reference pixel that is not available may be replaced with at least one reference pixel among the available reference pixels.
  • the prediction mode may have a directional prediction mode in which reference pixel information is used according to a prediction direction, and a non-directional mode in which directional information is not used when prediction is performed.
  • a mode for predicting luminance information and a mode for predicting color difference information may be different, and intra prediction mode information or predicted luminance signal information used to predict luminance information may be used to predict chrominance information.
  • intra prediction When performing intra prediction, if the size of the prediction unit and the size of the transformation unit are the same, intra prediction for the prediction unit is based on a pixel on the left, a pixel on the top left, and a pixel on the top of the prediction unit. You can do it. However, when the size of the prediction unit and the size of the transformation unit are different when performing intra prediction, intra prediction may be performed using a reference pixel based on the transformation unit. In addition, intra prediction using NxN splitting may be used for only the smallest coding unit.
  • a prediction block may be generated 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.
  • mode information predicted from the neighboring prediction units if the intra prediction modes of the current prediction unit and the neighboring prediction units are the same, the current prediction unit and the neighboring prediction units are used using predetermined flag information.
  • Information indicating that the prediction mode of is the same may be transmitted, and if the prediction modes of the current prediction unit and the neighboring prediction units are different, entropy encoding may be performed to encode prediction mode information of the current block.
  • a residual block including a prediction unit that performs prediction based on a prediction unit generated by the prediction units 120 and 125 and residual information that is a difference value from the original block of the prediction unit may be generated.
  • the generated residual block may be input to the transform unit 130.
  • the transform unit 130 transforms the original block and the residual block including residual information of the prediction unit generated through the prediction units 120 and 125, such as Discrete Cosine Transform (DST) or Discrete Sine Transform (DST). You can convert it using the method.
  • the DCT conversion core includes at least one of DCT2 and DCT8, and the DST conversion core includes DST7. Whether to apply DCT or DST to transform the residual block may be determined based on intra prediction mode information of a prediction unit used to generate the residual block. Transformation for the residual block may be skipped. A flag indicating whether to skip transformation of the residual block may be encoded. Transform skip may be allowed for residual blocks whose size is less than or equal to a threshold, luma components, or chroma components under the 4:4:4 format.
  • the quantization unit 135 may quantize values converted by the transform unit 130 into the frequency domain. Quantization coefficients may vary 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 rearrangement unit 160.
  • the rearrangement unit 160 may rearrange coefficient values on the quantized residual values.
  • the rearrangement unit 160 may change the 2-dimensional block shape coefficient into a 1-dimensional vector shape through a coefficient scanning method. For example, the rearrangement unit 160 may scan from a DC coefficient to a coefficient in a high frequency region using a Zig-Zag Scan method, and change it into a one-dimensional vector form.
  • a vertical scan that scans a two-dimensional block shape coefficient in a column direction and a horizontal scan that scans a two-dimensional block shape coefficient in a row direction may be used. That is, according to the size of the transform unit and the intra prediction mode, it is possible to determine which scan method is to be used among zig-zag scan, vertical direction scan, and horizontal direction scan.
  • the entropy encoding unit 165 may perform entropy encoding based on values calculated by the rearrangement unit 160.
  • Entropy coding may use various coding methods such as Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC).
  • the entropy encoding unit 165 includes residual value coefficient information and block type information of a coding unit, prediction mode information, division unit information, prediction unit information and transmission unit information, and motion from the rearrangement unit 160 and the prediction units 120 and 125.
  • Various information such as vector information, reference frame information, block interpolation information, and filtering information may be encoded.
  • the entropy encoder 165 may entropy-encode a coefficient value of a coding unit input from the reordering unit 160.
  • the inverse quantization unit 140 and the inverse transform unit 145 inverse quantize values quantized by the quantization unit 135 and inverse transform the values transformed by the transform unit 130.
  • the residual value generated by the inverse quantization unit 140 and the inverse transform unit 145 is reconstructed by being combined with the prediction units predicted through the motion estimation unit, motion compensation unit, and intra prediction unit included in the prediction units 120 and 125 Blocks (Reconstructed Block) can be created.
  • 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 can remove block distortion caused by the boundary between blocks in the reconstructed picture.
  • it may be determined whether to apply the deblocking filter to the current block based on 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 processed in parallel when performing vertical filtering and horizontal filtering.
  • the offset correction unit may correct an offset from the original image on a pixel-by-pixel basis for the deblocking image.
  • the pixels included in the image are divided into a certain number of areas, and then the area to be offset is determined and the offset is applied to the area, or offset by considering the edge information of each pixel. You can use the method to apply.
  • Adaptive Loop Filtering may be performed based on a value obtained by comparing the filtered reconstructed image and the original image. After dividing the pixels included in the image into predetermined groups, one filter to be applied to the corresponding group may be determined, and filtering may be performed differentially for each group. Information related to whether to apply ALF may be transmitted for each coding unit (CU) of the luminance signal, and the shape and filter coefficient of the ALF filter to be applied may vary according to each block. In addition, the same type (fixed type) ALF filter may be applied regardless of the characteristics of the block to be applied.
  • ALF Adaptive Loop Filtering
  • the memory 155 may store the reconstructed block or picture calculated through the filter unit 150, and the stored reconstructed block or picture may be provided to the prediction units 120 and 125 when performing inter prediction.
  • FIG. 2 is a block diagram of an image decoder (decoder) according to an embodiment of the present disclosure.
  • the image decoder 200 includes an entropy decoding unit 210, a rearrangement unit 215, an inverse quantization unit 220, an inverse transform unit 225, prediction units 230 and 235, and a filter unit. 240) and a memory 245 may be included.
  • the input bitstream may be decoded in a procedure opposite to that of the image encoder.
  • the entropy decoder 210 may perform entropy decoding in a procedure opposite to that of performing entropy encoding in 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 in response 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 in response 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 rearrangement unit 215 may perform rearrangement based on a method of rearranging the bitstream entropy-decoded by the entropy decoder 210 by the encoder.
  • the coefficients expressed in the form of a one-dimensional vector may be reconstructed into coefficients in the form of a two-dimensional block and rearranged.
  • the reordering unit 215 may perform reordering through a method of 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 a quantization parameter provided by an encoder and a coefficient value of a rearranged block.
  • the inverse transform unit 225 may perform an inverse transform, that is, an inverse DCT or an inverse DST, for a transform performed by the transform unit, that is, DCT or DST, on a result of quantization performed by the image encoder.
  • the DCT conversion core may include at least one of DCT2 and DCT8, and the DST conversion core may include DST7.
  • the inverse transformation unit 225 may not perform the inverse transformation.
  • the inverse transformation may be performed based on a transmission unit determined by an image encoder.
  • the inverse transform unit 225 of the image decoder may selectively perform a transformation technique (eg, DCT or DST) according to a plurality of pieces of information such as a prediction method, a size of a current block, and a prediction direction.
  • a transformation technique eg, DCT or DST
  • the prediction units 230 and 235 may generate a prediction block based on information related to prediction block generation provided from the entropy decoder 210 and previously decoded block or picture information provided from the memory 245.
  • the size of the prediction unit and the size of the transformation unit are the same when intra prediction is performed in the same way as the operation of the image encoder, a pixel on the left side of the prediction unit, a pixel on the top left side, and a pixel on the top side. If the size of the prediction unit and the size of the transformation unit are different when performing intra prediction, although intra prediction for the prediction unit is performed based on the pixel to be used, intra prediction is performed using a reference pixel based on the transformation unit. I can. In addition, intra prediction using NxN splitting for only the smallest coding unit may be used.
  • the prediction units 230 and 235 may include a prediction unit determination unit, an inter prediction unit, and an intra prediction unit.
  • the prediction unit determining unit receives various information such as prediction unit information input from the entropy decoder 210, prediction mode information of the intra prediction method, motion prediction related information of the inter prediction method, etc., and classifies the prediction unit from the current coding unit, and makes predictions. It can be determined whether the unit performs inter prediction or intra prediction.
  • the inter prediction unit 230 uses information necessary for inter prediction of the current prediction unit provided from the video encoder, and predicts the current based on information included in at least one picture of a previous picture or a subsequent picture of the current picture containing the current prediction unit. Inter prediction for a unit can be performed. Alternatively, inter prediction may be performed based on information on a partial region previously-restored in the current picture including the current prediction unit.
  • the motion prediction method of the prediction unit included in the coding unit based on the coding unit is skip mode, merge mode, motion vector prediction mode (AMVP mode), and intra block copy. It is possible to determine whether the mode is any of the modes.
  • the intra prediction unit 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 from the image encoder.
  • the intra prediction unit 235 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolation unit, and a DC filter.
  • the AIS filter is a part that performs filtering on a reference pixel of the current block, and may determine whether to apply the filter according to the prediction mode of the current prediction unit and apply it.
  • AIS filtering may be performed on a reference pixel of a current block by using the prediction mode and AIS filter information of the prediction unit provided by the image encoder. When the prediction mode of the current block is a mode in which AIS filtering is not performed, the AIS filter may not be applied.
  • the reference pixel interpolator may interpolate the reference pixel to generate a reference pixel of a pixel unit having an integer value or less. If the prediction mode of the current prediction unit is a prediction mode in which a prediction block is generated without interpolating a reference pixel, the reference pixel may not be interpolated.
  • the DC filter may generate a 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 on whether a deblocking filter is applied to a corresponding block or picture from an image encoder, and when a deblocking filter is applied, information on whether a strong filter or a weak filter is applied may be provided.
  • information related to the deblocking filter provided from the image encoder may be provided, and the image decoder may perform deblocking filtering on a corresponding block.
  • the offset correction unit may perform offset correction on the reconstructed image based on the type of offset correction applied to the image during encoding and information on the offset value, and the like.
  • the ALF may be applied to a coding unit based on information on whether to apply ALF and information on ALF coefficients provided from the encoder. Such ALF information may be provided by being included in a specific parameter set.
  • the memory 245 may store the reconstructed picture or block so that it can be used as a reference picture or a reference block, and may also provide the reconstructed picture to an output unit.
  • FIG. 3 is a diagram illustrating a basic coding tree unit according to an embodiment of the present disclosure.
  • a coding block having a maximum size may be defined as a coding tree block.
  • One picture is divided into a plurality of coding tree units (CTU).
  • the coding tree unit is a coding unit having a maximum size and may be referred to as a large coding unit (LCU).
  • LCU large coding unit
  • 3 shows an example in which one picture is divided into a plurality of coding tree units.
  • the size of the coding tree unit may be defined at the picture level or the sequence level. To this end, information indicating the size of the coding tree unit may be signaled through a picture parameter set or a sequence parameter set.
  • the size of a coding tree unit for all pictures in a sequence may be set to 128x128.
  • either 128x128 or 256x256 at the picture level may be determined as the size of the coding tree unit.
  • the size of the coding tree unit in the first picture, the size of the coding tree unit may be set to 128x128, and in the second picture, the size of the coding tree unit may be set to 256x256.
  • a coding block represents a basic unit for encoding/decoding processing. For example, prediction or transformation may be performed for each coding block, or a prediction coding mode may be determined for each coding block.
  • the predictive encoding mode represents a method of generating a predicted image.
  • the prediction coding mode is intra prediction (Intra Prediction, intra prediction), inter prediction (Inter prediction), current picture referencing (CPR, or Intra Block Copy (IBC)).
  • IBC Intra Block Copy
  • a prediction block for the coding block may be generated by using at least one of intra prediction, inter prediction, current picture reference, and composite prediction.
  • Information indicating the prediction encoding mode of the current block may be signaled through a bitstream.
  • the information may be a 1-bit flag indicating whether the prediction encoding mode is an intra mode or an inter mode. Only when the prediction encoding mode of the current block is determined as the inter mode, a current picture reference or composite prediction may be used.
  • the current picture reference is for setting the current picture as a reference picture and obtaining a prediction block of the current block from an area in the current picture that has already been encoded/decoded.
  • the current picture means a picture including the current block.
  • Information indicating whether the current picture reference is applied to the current block may be signaled through the bitstream. For example, the information may be a 1-bit flag. If the flag is true, the prediction encoding mode of the current block may be determined as a current picture reference, and if the flag is false, the prediction mode of the current block may be determined as inter prediction.
  • the prediction encoding mode of the current block may be determined based on the reference picture index. For example, when the reference picture index indicates the current picture, the prediction encoding mode of the current block may be determined as the current picture reference. When the reference picture index indicates a picture other than the current picture, the prediction encoding mode of the current block may be determined as inter prediction. That is, the current picture reference is a prediction method using information on a region in which encoding/decoding has been completed in the current picture, and inter prediction is a prediction method using information on another picture that has been encoded/decoded.
  • Composite prediction represents an encoding mode in which two or more of intra prediction, inter prediction, and current picture reference are combined. For example, when composite prediction is applied, a first prediction block may be generated based on one of intra prediction, inter prediction, or a current picture reference, and a second prediction block may be generated based on the other. When the first prediction block and the second prediction block are generated, a final prediction block may be generated through an average operation or a weighted sum operation of the first prediction block and the second prediction block.
  • Information indicating whether composite prediction is applied may be signaled through a bitstream. The information may be a 1-bit flag.
  • FIG. 4 is a diagram showing various division types of a coding block.
  • the coding block may be divided into a plurality of coding blocks based on quad tree division, binary tree division, or triple tree division.
  • the divided coding block may also be divided into a plurality of coding blocks again based on quad tree division, byte tree division, or triple tree division.
  • Quad-tree partitioning refers to a partitioning technique that divides the current block into four blocks. As a result of the quad-tree division, the current block may be divided into four square partitions (see'SPLIT_QT' in FIG. 4 (a)).
  • Binary tree partitioning refers to a partitioning technique that divides the current block into two blocks. Dividing the current block into two blocks along the vertical direction (i.e., using a vertical line crossing the current block) can be called vertical binary tree division, and along the horizontal direction (i.e., using a vertical line crossing the current block) Dividing the current block into two blocks can be called horizontal binary tree division. As a result of dividing the binary tree, the current block can be divided into two non-square partitions.
  • (B)'SPLIT_BT_VER' of FIG. 4 shows the result of dividing the binary tree in the vertical direction
  • (c)'SPLIT_BT_HOR' of FIG. 4 shows the result of dividing the binary tree in the horizontal direction.
  • Triple tree partitioning refers to a partitioning technique that divides the current block into three blocks. Dividing the current block into three blocks along the vertical direction (i.e., using two vertical lines crossing the current block) can be referred to as a vertical triple tree division, and along the horizontal direction (i.e., the current block Dividing the current block into three blocks may be referred to as horizontal triple tree division. As a result of the triple tree division, the current block can be divided into three amorphous partitions. In this case, the width/height of the partition located at the center of the current block may be twice the width/height of other partitions.
  • D)'SPLIT_TT_VER' of FIG. 4 shows a result of splitting a triple tree in the vertical direction
  • (e)'SPLIT_TT_HOR' of FIG. 4 shows a result of splitting a triple tree in the horizontal direction.
  • the number of divisions of the coding tree unit may be defined as a partitioning depth.
  • the maximum splitting depth of the coding tree unit may be determined at the sequence or picture level. Accordingly, the maximum splitting depth of the coding tree unit may be different for each sequence or feature.
  • the maximum splitting depth for each of the splitting techniques may be individually determined.
  • the maximum splitting depth allowed for quad tree splitting may be different from the maximum splitting depth allowed for binary tree splitting and/or triple tree splitting.
  • the encoder may signal information indicating at least one of a split type or a split depth of the current block through a bitstream.
  • the decoder may determine the split type and split depth of the coding tree unit based on the information parsed from the bitstream.
  • FIG. 5 is a diagram illustrating a partitioning aspect of a coding tree unit.
  • Partitioning a coding block using a partitioning technique such as quad-tree partitioning, binary tree partitioning, and/or triple tree partitioning may be referred to as multi-tree partitioning.
  • Coding blocks generated by applying multi-tree division to a coding block may be referred to as lower coding blocks.
  • the splitting depth of the coding block is k
  • the splitting depth of the lower coding blocks is set to k+1.
  • a coding block having a splitting depth of k may be referred to as an upper coding block.
  • the partition type of the current coding block may be determined based on at least one of a partition type of an upper coding block or a partition type of a neighboring coding block.
  • the neighboring coding block is adjacent to the current coding block and may include at least one of an upper neighboring block, a left neighboring block, or a neighboring block adjacent to the upper left corner of the current coding block.
  • the division type may include at least one of whether to divide a quad tree, divide a binary tree, divide a binary tree, divide a triple tree, or divide a triple tree.
  • information indicating whether the coding block is divided may be signaled through a bitstream.
  • the information is a 1-bit flag'split_cu_flag', and the fact that the flag is true indicates that the coding block is divided by the head tree splitting technique.
  • split_cu_flag When split_cu_flag is true, information indicating whether the coding block is divided into quad-trees may be signaled through a bitstream.
  • the information is a 1-bit flag split_qt_flag, and when the flag is true, the coding block may be divided into 4 blocks.
  • a coding block having a split depth of 3 may be generated by applying quad-tree splitting to a coding block having a split depth of 2 again.
  • quad-tree division When quad-tree division is not applied to the coding block, binary tree division is performed on the coding block in consideration of at least one of the size of the coding block, whether the coding block is located at the picture boundary, the maximum division depth, or the division type of the neighboring block Alternatively, it is possible to determine whether to perform triple tree partitioning.
  • information indicating a division direction may be signaled through a bitstream.
  • the information may be a 1-bit flag mtt_split_cu_vertical_flag. Based on the flag, it may be determined whether the division direction is a vertical direction or a horizontal direction.
  • information indicating whether binary tree division or triple tree division is applied to the coding block may be signaled through a bitstream.
  • the information may be a 1-bit flag mtt_split_cu_binary_flag. Based on the flag, it may be determined whether binary tree division or triple tree division is applied to the coding block.
  • a vertical direction binary tree division is applied to a coding block having a division depth of 1
  • a vertical direction triple tree division is applied to a left coding block among the coding blocks generated as a result of the division, It is shown that the vertical direction binary tree division is applied to the right coding block.
  • Inter prediction is a prediction coding mode that predicts a current block by using information on a previous picture.
  • a block at the same position as the current block in the previous picture (hereinafter, a collocated block) may be set as a prediction block of the current block.
  • a prediction block generated based on a block at the same position as the current block will be referred to as a collocated prediction block.
  • the current block can be effectively predicted by using the movement of the object.
  • a prediction block (or a predicted image) of the current block may be generated in consideration of motion information of the object.
  • a prediction block generated using motion information may be referred to as a motion prediction block.
  • a residual block may be generated by differentiating the prediction block from the current block.
  • energy of the residual block may be reduced, and accordingly, compression performance of the residual block may be improved.
  • generating a prediction block using motion information may be referred to as motion compensation prediction.
  • a prediction block may be generated based on motion compensation prediction.
  • the motion information may include at least one of a motion vector, a reference picture index, a prediction direction, or a bidirectional weight index.
  • the motion vector represents the moving direction and size of the object.
  • the reference picture index specifies a reference picture of the current block among reference pictures included in the reference picture list.
  • the prediction direction indicates either one-way L0 prediction, one-way L1 prediction, or two-way prediction (L0 prediction and L1 prediction). Depending on the prediction direction of the current block, at least one of motion information in the L0 direction or motion information in the L1 direction may be used.
  • the bidirectional weight index specifies a weight applied to the L0 prediction block and a weight applied to the L1 prediction block.
  • FIG. 6 is a flowchart of an inter prediction method according to an embodiment of the present disclosure.
  • the inter prediction method includes determining an inter prediction mode of a current block (S601), obtaining motion information of a current block according to the determined inter prediction mode (S602), and based on the obtained motion information. Thus, it includes performing motion compensation prediction for the current block (S603).
  • the inter prediction mode represents various techniques for determining motion information of the current block, and may include an inter prediction mode using translation motion information and an inter prediction mode using affine motion information.
  • an inter prediction mode using translational motion information may include a merge mode and a motion vector prediction mode
  • an inter prediction mode using Matte motion information may include an Age merge mode and an Matte motion vector prediction mode.
  • the motion information of the current block may be determined based on information parsed from a neighboring block or a bitstream adjacent to the current block according to the inter prediction mode.
  • Motion information of the current block may be derived from motion information of other blocks of the current block.
  • the other block may be a block encoded/decoded by inter prediction prior to the current block.
  • Setting the motion information of the current block to be the same as the motion information of other blocks may be defined as a merge mode.
  • setting a motion vector of another block as a predicted value of the motion vector of the current block may be defined as a motion vector prediction mode.
  • FIG. 7 is a flowchart of a process of inducing motion information of a current block in a merge mode.
  • a merge candidate of the current block may be derived (S701).
  • the merge candidate of the current block may be derived from a block encoded/decoded by inter prediction prior to the current block.
  • FIG. 8 is a diagram illustrating candidate blocks used to derive a merge candidate.
  • the candidate blocks may include at least one of neighboring blocks including a sample adjacent to the current block or non-neighboring blocks including a sample not adjacent to the current block.
  • samples for determining candidate blocks are defined as reference samples.
  • a reference sample adjacent to the current block is referred to as a neighbor reference sample
  • a reference sample not adjacent to the current block is referred to as a non-neighbor reference sample.
  • the neighbor reference sample may be included in a neighboring column of the leftmost column of the current block or a neighboring row of the topmost row of the current block.
  • the block including the reference sample at the (-1, H-1) position, the reference sample at the (W-1, -1) position A block including, a block including a reference sample at the (W, -1) position, a block including a reference sample at the (-1, H) position, or a block including a reference sample at the (-1, -1) position At least one of them may be used as a candidate block.
  • neighboring blocks of index 0 to index 4 may be used as candidate blocks.
  • the non-neighboring reference sample represents a sample in which at least one of an x-axis distance or a y-axis distance from a reference sample adjacent to the current block has a predefined value.
  • At least one of blocks including non-neighbor samples whose x-axis distance and y-axis distance are predefined values may be used as a candidate block.
  • the predefined value may be a natural number such as 4, 8, 12, 16. Referring to the drawing, at least one of blocks of indexes 5 to 26 may be used as a candidate block.
  • a sample not located on the same vertical line, horizontal line, or diagonal line as the neighboring reference sample may be set as the non-neighboring reference sample.
  • a candidate block including a neighboring reference sample is referred to as a neighboring block
  • a block including a non-neighboring reference sample is referred to as a non-neighboring block.
  • the candidate block When the distance between the current block and the candidate block is greater than or equal to the threshold value, the candidate block may be set to be unavailable as a merge candidate.
  • the threshold value may be determined based on the size of the coding tree unit. For example, the threshold value may be set as a value obtained by adding or subtracting an offset from the height of the coding tree unit (ctu_height) or the height of the coding tree unit (eg, ctu_height ⁇ N).
  • the offset N is a value predefined by the encoder and the decoder, and may be set to 4, 8, 16, 32 or ctu_height.
  • the candidate block may be determined to be unavailable as a merge candidate.
  • a candidate block that does not belong to the same coding tree unit as the current block may be set to be unavailable as a merge candidate.
  • a candidate block including the reference sample may be set to be unavailable as a merge candidate.
  • candidate blocks may be set so that the number of candidate blocks positioned at the left of the current block is greater than the number of candidate blocks positioned at the top of the current block.
  • FIG. 9 is a diagram illustrating candidate blocks used to derive a merge candidate.
  • upper blocks belonging to the upper N block columns of the current block and left blocks belonging to the left M block columns of the current block may be set as candidate blocks.
  • the number of left candidate blocks may be set larger than the number of upper candidate blocks.
  • the difference between the y-axis coordinate of the reference sample in the current block and the y-axis coordinate of the upper block that can be used as a candidate block may not exceed N times the height of the current block.
  • the difference between the x-axis coordinate of the reference sample in the current block and the x-axis coordinate of the left block that can be used as a candidate block may not exceed M times the width of the current block.
  • blocks belonging to the upper two block columns of the current block and blocks belonging to the left five block columns of the current block are set as candidate blocks.
  • a merge candidate may be derived from a temporal neighboring block included in a picture different from the current block.
  • a merge candidate may be derived from a collocated block included in a collocated picture.
  • Any one of the reference pictures included in the reference picture list may be set as a collocated picture.
  • Index information identifying a collocated picture among reference pictures may be signaled through a bitstream.
  • a reference picture having a predefined index among reference pictures may be determined as a collocated picture.
  • the motion information of the merge candidate may be set the same as the motion information of the candidate block.
  • at least one of a motion vector of a candidate block, a reference picture index, a prediction direction, or a bidirectional weight index may be set as motion information of the merge candidate.
  • a merge candidate list including the merge candidate may be generated (S702).
  • Indexes of merge candidates in the merge candidate list may be allocated according to a predetermined order.
  • indexes may be assigned in the order of merge candidates derived from temporal neighboring blocks.
  • At least one of the plurality of merge candidates may be selected (S703).
  • information for specifying any one of a plurality of merge candidates may be signaled through a bitstream.
  • information merge_idx indicating an index of any one of merge candidates included in the merge candidate list may be signaled through a bitstream.
  • the threshold value may be a value obtained by subtracting an offset from the maximum number of merge candidates that can be included in the merge candidate list or the maximum number of merge candidates.
  • the offset may be a natural number such as 1 or 2.
  • the motion information table includes motion information candidates derived from an encoded/decoded block based on inter prediction in a current picture.
  • motion information of a motion information candidate included in the motion information table may be set to be the same as motion information of an encoded/decoded block based on inter prediction.
  • the motion information may include at least one of a motion vector, a reference picture index, a prediction direction, and a bidirectional weight index.
  • the motion information candidate included in the motion information table may be referred to as an inter region merge candidate or a prediction region merge candidate.
  • the maximum number of motion information candidates that the motion information table can include may be predefined in an encoder and a decoder.
  • the maximum number of motion information candidates that the motion information table can include may be 1, 2, 3, 4, 5, 6, 7, 8 or more (eg, 16).
  • information indicating the maximum number of motion information candidates that the motion information table may include may be signaled through a bitstream.
  • the information may be signaled at the sequence, picture, or slice level.
  • the information may indicate the maximum number of motion information candidates that the motion information table can include.
  • the information may indicate a difference between the maximum number of motion information candidates that can be included in the motion information table and the maximum number of merge candidates that can be included in the merge candidate list.
  • the maximum number of motion information candidates that can be included in the motion information table may be determined according to the size of the picture, the size of the slice, or the size of the coding tree unit.
  • the motion information table may be initialized in units of a picture, a slice, a tile, a brick, a coding tree unit, or a coding tree unit line (row or column). For example, when a slice is initialized, a motion information table is also initialized, and the motion information table may not include any motion information candidates.
  • information indicating whether to initialize the motion information table may be signaled through a bitstream.
  • the information may be signaled at the slice, tile, brick, or block level. Until the information indicates to initialize the motion information table, a pre-configured motion information table may be used.
  • information on the initial motion information candidate may be signaled through a picture parameter set or a slice header. Even if the slice is initialized, the motion information table may include an initial motion information candidate. Accordingly, an initial motion information candidate may be used for a block that is the first encoding/decoding object in the slice.
  • a motion information candidate included in the motion information table of the previous coding tree unit may be set as an initial motion information candidate. For example, among motion information candidates included in the motion information table of the previous coding tree unit, a motion information candidate having the smallest index or a motion information candidate having the largest index may be set as the initial motion information candidate.
  • Blocks may be encoded/decoded according to an encoding/decoding order, and blocks encoded/decoded based on inter prediction may be sequentially set as motion information candidates according to an encoding/decoding order.
  • FIG. 10 is a diagram for describing an update aspect of a motion information table.
  • a motion information candidate may be derived based on the current block (S1002).
  • the motion information of the motion information candidate may be set to be the same as the motion information of the current block.
  • a motion information candidate derived based on the current block may be added to the motion information table (S1004).
  • a redundancy check may be performed on the motion information of the current block (or a motion information candidate derived based on the motion information) (S1005).
  • the redundancy check is for determining whether motion information of a motion information candidate previously stored in a motion information table and motion information of a current block are the same.
  • the redundancy check may be performed on all motion information candidates previously stored in the motion information table.
  • a redundancy check may be performed on motion information candidates having an index greater than or equal to a threshold value among motion information candidates previously stored in the motion information table.
  • a redundancy check may be performed on a predefined number of motion information candidates. For example, two motion information candidates having a small index or two motion information candidates having a large index may be determined as targets for redundancy check.
  • a motion information candidate derived based on the current block may be added to the motion information table (S1008). Whether the motion information candidates are the same may be determined based on whether motion information (eg, a motion vector and/or a reference picture index, etc.) of the motion information candidates is the same.
  • the oldest motion information candidate is deleted (S1007), and the motion information candidate derived based on the current block is added to the motion information table. It can be done (S1008).
  • the oldest motion information candidate may be a motion information candidate having the largest index or a motion information candidate having the smallest index.
  • Each of the motion information candidates may be identified by an index.
  • the lowest index eg, 0
  • indexes of previously stored motion information candidates may be increased by one. In this case, when the maximum number of motion information candidates has already been stored in the motion information table, the motion information candidate with the largest index is removed.
  • the largest index may be allocated to the motion information candidate. For example, when the number of motion information candidates pre-stored in the motion information table is smaller than the maximum value, an index having the same value as the number of pre-stored motion information candidates may be allocated to the motion information candidate. Alternatively, when the number of motion information candidates previously stored in the motion information table is equal to the maximum value, an index obtained by subtracting 1 from the maximum value may be assigned to the motion information candidate. In addition, the motion information candidate with the smallest index is removed, and the indexes of the remaining motion information candidates stored in advance are decreased by one.
  • FIG. 11 is a diagram illustrating an update aspect of a motion information table.
  • the motion information candidate derived from the current block is added to the motion information table, and the largest index is allocated to the motion information candidate.
  • the maximum number of motion information candidates are already stored in the motion information table.
  • the motion information candidate HmvpCand[n+1] derived from the current block When adding the motion information candidate HmvpCand[n+1] derived from the current block to the motion information table HmvpCandList, the motion information candidate HmvpCand[0] with the smallest index among the previously stored motion information candidates is deleted, and the remaining motion information candidates are You can decrease the index by 1.
  • the index of the motion information candidate HmvpCand[n+1] derived from the current block may be set to a maximum value (n in the example shown in FIG. 11).
  • the motion information candidate derived based on the current block may not be added to the motion information table (S1009).
  • a previously stored motion information candidate identical to the motion information candidate may be removed.
  • the same effect as the index of the previously stored motion information candidate is newly updated.
  • FIG. 12 is a diagram illustrating an example in which an index of a previously stored motion information candidate is updated.
  • the pre-stored motion information candidate When the index of the pre-stored motion information candidate that is the same as the motion information candidate mvCand derived based on the current block is hIdx, the pre-stored motion information candidate is deleted, and the index of the motion information candidates whose index is greater than hIdx is reduced by 1.
  • I can.
  • HmvpCand[2] identical to mvCand is deleted from the motion information table HvmpCandList, and indexes from HmvpCand[3] to HmvpCand[n] are decreased by one.
  • the motion information candidate mvCand derived based on the current block may be added to the end of the motion information table.
  • the index allocated to the previously stored motion information candidate that is the same as the motion information candidate derived based on the current block may be updated.
  • the index of the previously stored motion information candidate may be changed to a minimum value or a maximum value.
  • Motion information of blocks included in a predetermined area may be set not to be added to the motion information table.
  • a motion information candidate derived based on motion information of a block included in the merge processing region may not be added to the motion information table. Since the coding/decoding order is not defined for blocks included in the merge processing region, it is inappropriate to use motion information of any one of them during inter prediction of another block. Accordingly, motion information candidates derived based on blocks included in the merge processing region may not be added to the motion information table.
  • motion information of a block smaller than a preset size may be set not to be added to the motion information table.
  • motion information candidates derived based on motion information of a coding block having a width or height of less than 4 or 8, or motion information of a coding block having a size of 4x4 may not be added to the motion information table.
  • a motion information candidate When motion compensation prediction is performed in units of sub-blocks, a motion information candidate may be derived based on motion information of a representative sub-block among a plurality of sub-blocks included in the current block. For example, when a sub-block merge candidate is used for a current block, a motion information candidate may be derived based on motion information of a representative sub-block among sub-blocks.
  • the motion vectors of the sub-blocks can be derived in the following order.
  • one of the merge candidates included in the merge candidate list of the current block may be selected, and an initial shift vector (shVector) may be derived based on a motion vector of the selected merge candidate.
  • an initial shift vector to the position (xSb, ySb) of the reference sample (eg, upper left sample or middle position sample) of each subblock in the coding block.
  • the shift subblock in which the position of the reference sample is (xColSb, yColSb) Can induce. Equation 1 below represents an equation for deriving a shift sub-block.
  • the motion vector of the collocated block corresponding to the center position of the sub-block including (xColSb, yColSb) may be set as the motion vector of the sub-block including (xSb, ySb).
  • the representative sub-block may mean a sub-block including an upper left sample, a center sample, a lower right sample, an upper right sample, or a lower left sample of the current block.
  • 13 is a diagram showing positions of representative sub-blocks.
  • FIG. 13A shows an example in which a subblock located at the upper left of the current block is set as a representative subblock
  • FIG. 13B shows an example in which a subblock located at the center of the current block is set as a representative subblock.
  • a motion information candidate of the current block is derived based on the motion vector of the sub-block including the upper left sample of the current block or the sub-block including the center sample of the current block. I can.
  • whether to use the current block as a motion information candidate may be determined based on at least one of whether to apply the motion vector resolution of the current block, whether to apply a merge offset encoding method, whether to apply joint prediction, or whether to apply triangular partitioning. For example, in at least one of a case where the motion information resolution of the current block is 2 integer pels or more, a combined prediction is applied to the current block, a triangular partitioning is applied to the current block, or a merge offset coding method is applied to the current block, The current block may be set to be unavailable as a motion information candidate.
  • a motion information candidate may be derived based on at least one subblock vector among subblocks included in the coded/decoded block based on the affine motion model.
  • a motion information candidate may be derived using a sub-block located at the upper left of the current block, a subblock located at the center, or a subblock located at the upper right of the current block.
  • an average value of sub-block vectors of a plurality of sub-blocks may be set as a motion vector of a motion information candidate.
  • motion information candidates included in the motion information table may be added to the merge candidate list as merge candidates.
  • the addition process is performed according to an order when the indexes of motion information candidates are sorted in ascending or descending order. For example, the motion information candidate having the largest index may be added to the merge candidate list of the current block.
  • a redundancy check may be performed between the motion information candidate and merge candidates previously stored in the merge candidate list. As a result of performing the redundancy check, motion information candidates having the same motion information as the previously stored merge candidates may not be added to the merge candidate list.
  • the redundancy check may be performed on only some of the motion information candidates included in the motion information table. For example, the redundancy check may be performed only on motion information candidates whose index is greater than or equal to a threshold value. Alternatively, the redundancy check may be performed only on the N motion information candidates having the largest index or the N motion information candidates having the smallest index. Alternatively, the redundancy check may be performed on only some of the merge candidates previously stored in the merge candidate list. For example, the redundancy check may be performed only on a merge candidate whose index is greater than or equal to a threshold value or a merge candidate derived from a block at a specific location.
  • the specific location may include at least one of a left neighboring block, an upper neighboring block, an upper right neighboring block, or a lower left neighboring block of the current block.
  • FIG. 14 is a diagram illustrating an example in which a redundancy check is performed on only some of merge candidates.
  • a redundancy check may be performed on the motion information candidate with up to two merge candidates having the smallest indexes. For example, it is possible to check whether mergeCandList[0] and mergeCandList[1] are the same as HmvpCand[j].
  • a redundancy check may be performed only on merge candidates derived from a specific location.
  • a redundancy check may be performed on at least one of a merge candidate derived from a neighboring block positioned to the left of the current block or a merge candidate derived from a neighboring block positioned above the current block. If there is no merge candidate derived from a specific location in the merge candidate list, the motion information candidate may be added to the merge candidate list without checking for redundancy.
  • the redundancy check may be performed on only N motion information candidates having a large index or N motion information candidates having a small index among motion information candidates included in the motion information table.
  • the redundancy check may be performed only on motion information candidates having an index in which the difference between the number of motion information candidates included in the motion information table and the difference is less than or equal to a threshold value.
  • the threshold value is 2
  • the redundancy check may be performed only on three motion information candidates having the largest index values among motion information candidates included in the motion information table. Redundancy check may be omitted for motion information candidates excluding the three motion information candidates.
  • the motion information candidate may be added to the merge candidate list regardless of whether or not the merge candidate has the same motion information as the merge candidate.
  • a redundancy check may be performed only on motion information candidates having an index in which the difference between the number of motion information candidates included in the motion information table and the difference is greater than or equal to a threshold value.
  • the number of motion information candidates for which the redundancy check is performed may be predefined in an encoder and a decoder.
  • the threshold value may be an integer such as 0, 1, or 2.
  • the threshold value may be determined based on at least one of the number of merge candidates included in the merge candidate list or the number of motion information candidates included in the motion information table.
  • the redundancy check with the merge candidate identical to the first motion information candidate may be omitted when checking the redundancy of the second motion information candidate.
  • 15 is a diagram illustrating an example in which a redundancy check with a specific merge candidate is omitted.
  • a redundancy check is performed between the motion information candidate and merge candidates previously stored in the merge candidate list.
  • the motion information candidate HmvpCand[i] is not added to the merge candidate list, and the motion information candidate HmvpCand[i] having an index of i-1 -1] and merge candidates may perform a redundancy check.
  • the redundancy check between the motion information candidate HmvpCand[i-1] and the merge candidate mergeCandList[j] may be omitted.
  • HmvpCand[i] and mergeCandList[2] are the same. Accordingly, HmvpCand[i] is not added to the merge candidate list, and a redundancy check for HmvpCand[i-1] may be performed. In this case, the redundancy check between HvmpCand[i-1] and mergeCandList[2] may be omitted.
  • the pairwise merge candidate refers to a merge candidate having a value obtained by the average of motion vectors of two or more merge candidates as a motion vector
  • the zero merge candidate refers to a merge candidate whose motion vector is 0.
  • a merge candidate may be added to the merge candidate list of the current block in the following order.
  • the spatial merge candidate means a merge candidate derived from at least one of a neighboring block or a non-neighboring block
  • the temporal merge candidate means a merge candidate derived from a previous reference picture.
  • the Matte motion information candidate represents a motion information candidate derived from a block encoded/decoded with the Rane motion model.
  • the motion information table may also be used in the motion vector prediction mode. For example, when the number of motion vector prediction candidates included in the motion vector prediction candidate list of the current block is less than a threshold value, a motion information candidate included in the motion information table may be set as a motion vector prediction candidate for the current block. Specifically, a motion vector of a motion information candidate may be set as a motion vector prediction candidate.
  • the selected candidate When any one of the motion vector prediction candidates included in the motion vector prediction candidate list of the current block is selected, the selected candidate may be set as the motion vector predictor of the current block. Thereafter, after decoding the motion vector residual value of the current block, a motion vector of the current block may be obtained by adding the motion vector predictor and the motion vector residual value.
  • the motion vector prediction candidate list of the current block may be configured in the following order.
  • the spatial motion vector prediction candidate means a motion vector prediction candidate derived from at least one of a neighboring block or a non-neighboring block
  • the temporal motion vector prediction candidate means a motion vector prediction candidate derived from a previous reference picture.
  • e motion information candidate represents a motion information candidate derived from a block encoded/decoded with the Rane motion model.
  • the zero motion vector prediction candidate represents a candidate whose motion vector has a value of 0.
  • a merge processing area having a larger size than the coding block may be defined.
  • Coding blocks included in the merge processing region are not sequentially encoded/decoded, but may be processed in parallel.
  • not sequentially encoding/decoding means that the encoding/decoding order is not defined. Accordingly, a process of encoding/decoding blocks included in the merge processing region can be independently processed.
  • blocks included in the merge processing area may share merge candidates.
  • merge candidates may be derived based on the merge processing area.
  • the merge processing region may be referred to as a parallel processing region, a shared merge region (SMR), or a merge estimation region (MER).
  • SMR shared merge region
  • MER merge estimation region
  • the merge candidate of the current block may be derived based on the coding block. However, when the current block is included in a merge processing area having a size larger than that of the current block, a candidate block included in the merge processing area identical to the current block may be set as unavailable as a merge candidate.
  • 16 is a diagram illustrating an example in which a candidate block included in the same merge processing area as the current block is set to be unavailable as a merge candidate.
  • blocks including reference samples adjacent to CU5 may be set as candidate blocks.
  • candidate blocks X3 and X4 included in the same merge processing area as CU5 may be set to be unavailable as merge candidates of CU5.
  • candidate blocks X0, X1, and X2 that are not included in the same merge processing area as CU5 may be set to be usable as merge candidates.
  • blocks including reference samples adjacent to the CU8 may be set as candidate blocks.
  • candidate blocks X6, X7, and X8 included in the same merge processing area as CU8 may be set to be unavailable as merge candidates.
  • candidate blocks X5 and X9 not included in the same merge area as CU8 may be set to be usable as merge candidates.
  • a neighboring block adjacent to the current block and a neighboring block adjacent to the merge processing area may be set as candidate blocks.
  • 17 is a diagram illustrating an example of deriving a merge candidate for a current block when a current block is included in a merge processing area.
  • neighboring blocks adjacent to the current block may be set as candidate blocks for inducing a merge candidate of the current block.
  • a candidate block included in the same merge processing area as the current block may be set as a merge candidate as unavailable.
  • the upper neighboring block y3 and the upper right neighboring block y4 included in the same merge processing region as the coding block CU3 may be set to be unavailable as merge candidates of the coding block CU3.
  • a merge candidate may be derived by scanning neighboring blocks adjacent to the current block according to a predefined order.
  • the predefined order may be the order of y1, y3, y4, y0, and y2.
  • a merge candidate for the current block may be derived using neighboring blocks adjacent to the merge processing region.
  • neighboring blocks adjacent to the merge processing region including the coding block CU3 may be set as candidate blocks for the coding block CU3.
  • the neighboring blocks adjacent to the merge processing area may include at least one of a left neighboring block x1, an upper neighboring block x3, a lower left neighboring block x0, an upper right neighboring block x4, or an upper left neighboring block x2.
  • a merge candidate may be derived by scanning neighboring blocks adjacent to the merge processing region according to a predefined order.
  • the predefined order may be the order of x1, x3, x4, x0, and x2.
  • a merge candidate for the coding block CU3 included in the merge processing region may be derived by scanning candidate blocks according to the following scan order.
  • the scanning order of the candidate blocks illustrated above is only an example of the present disclosure, and it is possible to scan the candidate blocks according to an order different from that of the above example.
  • the scan order may be adaptively determined based on at least one of the size or shape of the current block or the merge processing area.
  • the merge processing area may be square or non-square.
  • Information for determining the merge processing region may be signaled through a bitstream.
  • the information may include at least one of information indicating the shape of the merge processing area or information indicating the size of the merge processing area.
  • the merge processing area is non-square, at least one of information indicating the size of the merge processing area, information indicating the width and/or height of the merge processing area, or information indicating the ratio between the width and height of the merge processing area is a bit It can be signaled through a stream.
  • the size of the merge processing region may be determined based on at least one of information signaled through a bitstream, a picture resolution, a slice size, or a tile size.
  • a motion information candidate derived based on motion information of a block on which motion compensation prediction is performed may be added to the motion information table.
  • motion information candidate derived from a block included in the merge processing region when added to the motion information table, when encoding/decoding another block in the merge processing region, which is actually slower than the block, is derived from the block.
  • motion information candidates are used. That is, although inter-block dependency should be excluded when encoding/decoding blocks included in the merge processing region, motion prediction compensation may be performed using motion information of other blocks included in the merge processing region. In order to solve such a problem, even if the encoding/decoding of the block included in the merge processing area is completed, motion information of the encoded/decoded block may not be added to the motion information table.
  • the motion information table may be updated using only a block at a predefined position in the merge processing area.
  • the predefined positions are the block located in the upper left corner of the merge processing area, the block located in the upper right corner, the block located in the lower left corner, the block located in the lower right corner, the block located in the center, and the block adjacent to the right boundary.
  • at least one of blocks adjacent to the lower boundary may be included.
  • only motion information of a block adjacent to the lower right corner of the merge processing area may be updated in the motion information table, and motion information of other blocks may not be updated in the motion information table.
  • motion information candidates derived from the blocks may be added to the motion information table. That is, while blocks included in the merge processing region are being encoded/decoded, the motion information table may not be updated.
  • motion information candidates derived from the blocks may be added to the motion information table in a predefined order.
  • the predefined order may be determined according to the scan order of the coding blocks in the merge processing region or the coding tree unit.
  • the scan order may be at least one of a raster scan, a horizontal scan, a vertical scan, or a zigzag scan.
  • the predefined order may be determined based on motion information of each block or the number of blocks having the same motion information.
  • a motion information candidate including unidirectional motion information may be added to the motion information table prior to a motion information candidate including bidirectional motion information.
  • a motion information candidate including bidirectional motion information may be added to the motion information table before the motion information candidate including unidirectional motion information.
  • motion information candidates may be added to the motion information table according to an order of high frequency of use or low frequency of use in the merge processing region or the coding tree unit.
  • motion information candidates included in the motion information table may be added to the merge candidate list.
  • motion information candidates derived from blocks included in the same merge processing area as the current block may be set not to be added to the merge candidate list of the current block.
  • the motion information candidate included in the motion information table may be set not to be used. That is, even if the number of merge candidates included in the merge candidate list of the current block is smaller than the maximum number, the motion information candidates included in the motion information table may not be added to the merge candidate list.
  • a motion information table for a merge processing area or a coding tree unit may be configured. This motion information table serves to temporarily store motion information of blocks included in the merge processing area.
  • a motion information table for a merge processing area or a coding tree unit is referred to as a temporary motion information table.
  • a motion information candidate stored in the temporary motion information table will be referred to as a temporary motion information candidate.
  • 18 is a diagram showing a temporary motion information table.
  • a temporary motion information table for a coding tree unit or a merge processing area can be configured.
  • the motion information of the block may not be added to the motion information table HmvpCandList.
  • the temporary motion information candidate derived from the block may be added to the temporary motion information table HmvpMERCandList. That is, the temporary motion information candidate added to the temporary motion information table may not be added to the motion information table.
  • the motion information table may not include a coding tree unit including the current block or a motion information candidate derived based on motion information of blocks included in the merge processing region.
  • only motion information of some of the blocks included in the head processing area may be added to the temporary motion information table.
  • only blocks at a predefined position in the merge processing area may be used to update the motion information table.
  • the predefined positions are the block located in the upper left corner of the merge processing area, the block located in the upper right corner, the block located in the lower left corner, the block located in the lower right corner, the block located in the center, and the block adjacent to the right boundary.
  • at least one of blocks adjacent to the lower boundary may be included.
  • only motion information of a block adjacent to the lower right corner of the merge processing area may be added to the temporary motion information table, and motion information of other blocks may not be added to the temporary motion information table.
  • the maximum number of temporary motion information candidates that can be included in the temporary motion information table may be set equal to the maximum number of motion information candidates that can be included in the motion information table.
  • the maximum number of temporary motion information candidates that may be included in the temporary motion information table may be determined according to the size of a coding tree unit or a merge processing area.
  • the maximum number of temporary motion information candidates that may be included in the temporary motion information table may be set to be smaller than the maximum number of motion information candidates that may be included in the motion information table.
  • the current block included in the coding tree unit or the merge processing region may be set not to use the temporary motion information table for the corresponding coding tree unit or the merge processing region. That is, when the number of merge candidates included in the merge candidate list of the current block is less than the threshold value, the motion information candidates included in the motion information table are added to the merge candidate list, and the temporary motion information candidates included in the temporary motion information table May not be added to the merge candidate list. Accordingly, motion information of the same coding tree unit as the current block or of another block included in the same merge processing region may not be used for motion compensation prediction of the current block.
  • the motion information table and the temporary motion information table may be merged.
  • 19 is a diagram illustrating an example of merging a motion information table and a temporary motion information table.
  • the temporary motion information candidate included in the temporary motion information table may be updated in the motion information table.
  • the temporary motion information candidates included in the temporary motion information table may be added to the motion information table in the order of insertion into the temporary motion information table (ie, in ascending or descending order of index values).
  • temporary motion information candidates included in the temporary motion information table may be added to the motion information table according to a predefined order.
  • the predefined order may be determined according to the scan order of the coding blocks in the merge processing region or the coding tree unit.
  • the scan order may be at least one of a raster scan, a horizontal scan, a vertical scan, or a zigzag scan.
  • the predefined order may be determined based on motion information of each block or the number of blocks having the same motion information.
  • the temporary motion information candidate including unidirectional motion information may be added to the motion information table before the temporary motion information candidate including bidirectional motion information.
  • the temporary motion information candidate including bidirectional motion information may be added to the motion information table before the temporary motion information candidate including unidirectional motion information.
  • temporary motion information candidates may be added to the motion information table in the order of high frequency of use or low frequency of use in the merge processing region or the coding tree unit.
  • a redundancy check for the temporary motion information candidate may be performed. For example, when a motion information candidate identical to the temporary motion information candidate included in the temporary motion information table is previously stored in the motion information table, the temporary motion information candidate may not be added to the motion information table. In this case, the redundancy check may be performed on some of the motion information candidates included in the motion information table. For example, a redundancy check may be performed on motion information candidates whose index is greater than or equal to a threshold value. For example, when the temporary motion information candidate is the same as the motion information candidate having an index equal to or greater than a predefined value, the temporary motion information candidate may not be added to the motion information table.
  • the motion information candidate derived from the same coding tree unit as the current block or a block included in the same merge processing region may be restricted from being used as a merge candidate of the current block.
  • address information of a block may be additionally stored for the motion information candidate.
  • the block address information includes the location of the block, the address of the block, the index of the block, the location of the merge processing area including the block, the address of the merge processing area including the block, the index of the merge processing area including the block, and the block. It may include at least one of a location of an included coding tree area, an address of a coding tree area including a block, or an index of a coding tree area including a block.
  • Intra prediction is to predict a current block using reconstructed samples that have been encoded/decoded around the current block.
  • a reconstructed sample before the in-loop filter is applied may be used for intra prediction of the current block.
  • the intra prediction technique includes intra prediction based on a matrix and general intra prediction in consideration of a directionality with a surrounding reconstructed sample.
  • Information indicating the intra prediction technique of the current block may be signaled through a bitstream.
  • the information may be a 1-bit flag.
  • the intra prediction technique of the current block may be determined based on at least one of the location, size, and shape of the current block, or an intra prediction technique of a neighboring block. For example, when a current block exists across a picture boundary, it may be set so that intra prediction based on a metric is not applied to the current block.
  • Matrix-based intra prediction is a method of obtaining a prediction block of a current block based on a matrix product between a matrix previously stored in an encoder and a decoder and reconstructed samples around the current block.
  • Information for specifying any one of a plurality of pre-stored matrices may be signaled through a bitstream.
  • the decoder may determine a matrix for intra prediction of the current block based on the information and the size of the current block.
  • General intra prediction is a method of obtaining a prediction block for a current block based on a non-directional intra prediction mode or a directional intra prediction mode.
  • a process of performing intra prediction based on general intra prediction will be described in more detail with reference to the drawings.
  • 20 is a flowchart of an intra prediction method according to an embodiment of the present disclosure.
  • a reference sample line of the current block may be determined (S2001).
  • the reference sample line refers to a set of reference samples included in a line k-th away from the top and/or left of the current block.
  • the reference sample may be derived from a reconstructed sample that has been encoded/decoded around the current block.
  • Index information identifying the reference sample line of the current block among the plurality of reference sample lines may be signaled through the bitstream.
  • index information intra_luma_ref_idx for specifying a reference sample line of the current block may be signaled through a bitstream.
  • the index information may be signaled in units of coding blocks.
  • the plurality of reference sample lines may include at least one of the top and/or left 1st line, 2nd line, and 3rd line in the current block.
  • a reference sample line consisting of a row adjacent to the top of the current block and a column adjacent to the left of the current block among the plurality of reference sample lines is called an adjacent reference sample line, and other reference sample lines are called non-adjacent reference sample lines. It can also be called.
  • Table 1 shows an index allocated to each of the candidate reference sample lines.
  • a reference sample line of the current block may be determined based on at least one of a location, a size, a shape of the current block, or a prediction coding mode of a neighboring block. For example, when the current block contacts the boundary of a picture, tile, slice, or coding tree unit, an adjacent reference sample line may be determined as a reference sample line of the current block.
  • the reference sample line is an upper reference positioned at the top of the current block. Samples and left reference samples positioned to the left of the current block may be included. The upper reference samples and the left reference samples may be derived from reconstructed samples around the current block. The reconstructed samples may be in a state before the in-loop filter is applied.
  • an intra prediction mode of the current block may be determined (S2002).
  • the intra prediction mode of the current block at least one of a non-directional intra prediction mode and a directional intra prediction mode may be determined as the intra prediction mode of the current block.
  • the non-directional intra prediction mode includes a planar and DC, and the directional intra prediction mode includes 33 or 65 modes from a lower left diagonal direction to an upper right diagonal direction.
  • 21 is a diagram illustrating intra prediction modes.
  • FIG. 21A shows 35 intra prediction modes
  • FIG. 21B shows 67 intra prediction modes.
  • More or less intra prediction modes may be defined than those shown in FIG. 21.
  • a Most Probable Mode may be set based on an intra prediction mode of a neighboring block adjacent to the current block.
  • the neighboring block may include a left neighboring block adjacent to the left side of the current block and an upper neighboring block adjacent to the top of the current block.
  • the number of MPMs included in the MPM list may be preset in an encoder and a decoder.
  • the number of MPMs may be 3, 4, 5, or 6.
  • information indicating the number of MPMs may be signaled through a bitstream.
  • the number of MPMs may be determined based on at least one of a prediction encoding mode of a neighboring block, a size and a shape of a current block, or a reference sample line index. For example, when the adjacent reference sample line is determined as the reference sample line of the current block, N MPMs are used, whereas when the non-adjacent reference sample line is determined as the reference sample line of the current block, M MPMs may be used. .
  • M is a natural number less than N, for example, N may be 6, and M may be 5, 4, or 3. Accordingly, when the index of the reference sample line of the current block is 0 and the MPM flag is true, the intra prediction mode of the current block is determined to be one of six candidate intra prediction modes, whereas the index of the reference sample line of the current block When is greater than 0 and the MPM flag is true, the intra prediction mode of the current block may be determined as one of five candidate intra prediction modes.
  • a fixed number eg, 6 or 5
  • MPM candidates may be used regardless of the index of the reference sample line of the current block.
  • the intra prediction mode of the neighboring block is regarded as a planner, and an MPM candidate may be derived.
  • the intra prediction mode of the neighboring block is a default mode, and an MPM candidate may be derived.
  • the default mode may be at least one of DC, planar, vertical direction, and horizontal direction.
  • the intra prediction mode of the neighboring block may be determined based on the direction of applying the intra BDPCM of the neighboring block. For example, when intra BDPCM in a horizontal direction is applied to a neighboring block, it may be considered that the intra prediction mode of the neighboring block is in the horizontal direction. On the other hand, when the intra BDPCM in the vertical direction is applied to the neighboring block, it may be considered that the intra prediction mode of the neighboring block is in the vertical direction.
  • An MPM list including a plurality of MPMs may be generated, and information indicating whether an MPM that is the same as the intra prediction mode of the current block is included in the MPM list may be signaled through a bitstream.
  • the information is a 1-bit flag and may be referred to as an MPM flag.
  • index information identifying one of the MPMs may be signaled through a bitstream. For example, index information mpm_idx specifying any one of a plurality of MPMs may be signaled through a bitstream.
  • the MPM specified by the index information may be set as the intra prediction mode of the current block.
  • residual mode information indicating any one of residual intra prediction modes excluding MPMs may be signaled through a bitstream.
  • the residual mode information indicates an index value corresponding to the intra prediction mode of the current block when the indexes are reallocated to residual intra prediction modes excluding MPMs.
  • the decoder may arrange the MPMs in ascending order and determine the intra prediction mode of the current block by comparing the residual mode information with the MPMs. For example, when the residual mode information is equal to or smaller than the MPM, 1 may be added to the residual mode information to induce an intra prediction mode of the current block.
  • comparison of some of the MPMs and residual mode information may be omitted.
  • MPMs that are non-directional intra prediction modes may be excluded from comparison targets.
  • the intra prediction of the current block is compared with the residual MPMs excluding the non-directional intra prediction modes and residual mode information. Mode can be induced.
  • the resultant value may be compared with the remaining MPMs.
  • information indicating whether the intra prediction mode of the current block is the default mode may be signaled through a bitstream.
  • the information is a 1-bit flag, and the flag may be referred to as a default mode flag.
  • the default mode flag may be signaled only when the MPM flag indicates that the same MPM as the current block is included in the MPM list.
  • the default mode may include at least one of planar, DC, vertical mode, and horizontal mode.
  • the default mode flag may indicate whether the intra prediction mode of the current block is a planner.
  • the default mode flag indicates that the intra prediction mode of the current block is not the default mode, one of the MPMs indicated by the index information may be set as the intra prediction mode of the current block.
  • the intra prediction mode identical to the default mode may be set not to be set to MPM.
  • the intra prediction mode of the current block may be derived using 5 MPMs excluding the MPM corresponding to the planner.
  • index information indicating any one of the default modes may be further signaled.
  • the intra prediction mode of the current block may be set to a default mode indicated by the index information.
  • the index of the reference sample line of the current block is not 0, it may be set not to use the default mode.
  • a non-adjacent reference sample line is determined as a reference sample line of a current block
  • a non-directional intra prediction mode such as a DC mode or a planar mode may be set not to be used.
  • the default mode flag is not signaled, and the value of the default mode flag may be set to a predefined value (ie, false).
  • prediction samples for the current block may be obtained based on the determined intra prediction mode (S2003).
  • prediction samples for the current block are generated based on the average value of the reference samples. Specifically, values of all samples in the prediction block may be generated based on an average value of reference samples. The average value may be derived using at least one of upper reference samples positioned at the top of the current block and left reference samples positioned at the left of the current block.
  • the number or range of reference samples used to derive the average value may vary. For example, when the current block is an amorphous block having a width greater than a height, an average value may be calculated using only upper reference samples. On the other hand, when the current block is an amorphous block whose width is smaller than the height, an average value may be calculated using only the left reference samples. That is, when the width and height of the current block are different, the average value may be calculated using only reference samples adjacent to the longer length. Alternatively, based on the width and height ratio of the current block, it may be determined whether to calculate the average value using only the upper reference samples or to calculate the average value using only the left reference samples.
  • a prediction sample may be obtained using a horizontal direction prediction sample and a vertical direction prediction sample.
  • the horizontal prediction sample is obtained based on a left reference sample and a right reference sample located on the same horizontal line as the prediction sample
  • the vertical prediction sample is an upper reference sample and a lower side located on the same vertical line as the prediction sample. It is obtained on the basis of a reference sample.
  • the right reference sample may be generated by copying a reference sample adjacent to the upper right corner of the current block
  • the lower reference sample may be generated by copying a reference sample adjacent to the lower left corner of the current block.
  • the horizontal direction prediction sample may be obtained based on a weighted sum operation of the left reference sample and the right reference sample
  • the vertical direction prediction sample may be obtained based on a weighted sum operation of the upper reference sample and the lower reference sample.
  • the weight assigned to each reference sample may be determined according to the position of the prediction sample.
  • the prediction sample may be obtained based on an average operation or a weighted sum operation of the horizontal direction prediction sample and the vertical direction prediction sample. When the weighted sum operation is performed, weights applied to the horizontal direction prediction sample and the vertical direction prediction sample may be determined based on the position of the prediction sample.
  • a parameter indicating a prediction direction (or a prediction angle) of the selected directional prediction mode may be determined.
  • Table 2 below shows intraPredAng, an intra direction parameter for each intra prediction mode.
  • PredModeIntra One 2 3 4 5 6 7 IntraPredAng - 32 26 21 17 13 9 PredModeIntra 8 9 10 11 12 13 14 IntraPredAng 5 2 0 -2 -5 -9 -13 PredModeIntra 15 16 17 18 19 20 21 IntraPredAng -17 -21 -26 -32 -26 -21 -17 PredModeIntra 22 23 24 25 26 27 28 IntraPredAng -13 -9 -5 -2 0 2 5 PredModeIntra 29 30 31 32 33 34 IntraPredAng 9 13 17 21 26 32
  • Table 2 shows an intra direction parameter of each of the intra prediction modes having an index of any one of 2 to 34 when 35 intra prediction modes are defined.
  • Table 2 is further subdivided to set the intra direction parameter of each directional intra prediction mode.
  • Upper reference samples and left reference samples of the current block are arranged in a row. After arranging, a prediction sample may be obtained based on the value of the intra direction parameter. In this case, when the value of the intra direction parameter is negative, left reference samples and upper reference samples may be arranged in a line.
  • 22 and 23 are diagrams illustrating an example of a one-dimensional arrangement in which reference samples are arranged in a line.
  • FIG. 22 shows an example of a vertical one-dimensional arrangement in which reference samples are arranged in a vertical direction
  • FIG. 23 shows an example of a horizontal one-dimensional arrangement in which reference samples are arranged in a horizontal direction. Assuming that 35 intra prediction modes are defined, the embodiments of FIGS. 22 and 23 will be described.
  • the intra prediction mode index is any one of 11 to 18, a horizontal one-dimensional array in which upper reference samples are rotated counterclockwise is applied, and when the intra prediction mode index is any one of 19 to 25, left reference samples are A vertical one-dimensional array rotated clockwise can be applied.
  • the intra prediction mode angle may be considered.
  • the reference sample determination parameter may include a reference sample index for specifying a reference sample and a weight parameter for determining a weight applied to the reference sample.
  • the reference sample index iIdx and the weight parameter ifact may be obtained through the following Equations 2 and 3, respectively.
  • P ang represents an intra direction parameter.
  • the reference sample specified by the reference sample index iIdx corresponds to an integer pel.
  • At least one or more reference samples can be specified. Specifically, in consideration of the slope of the prediction mode, the position of the reference sample used to derive the prediction sample may be specified. As an example, a reference sample used to derive a prediction sample may be specified using the reference sample index iIdx.
  • a prediction sample may be generated by interpolating a plurality of reference samples.
  • the slope of the intra prediction mode is a value between the slope between the prediction sample and the first reference sample and the slope between the prediction sample and the second reference sample
  • a prediction sample is obtained by interpolating the first reference sample and the second reference sample.
  • Equation 4 shows an example of obtaining a prediction sample based on reference samples.
  • Equation 4 P denotes a prediction sample, and Ref_1D denotes any one of the one-dimensionally arranged reference samples.
  • the location of the reference sample may be determined by the location (x, y) of the prediction sample and the reference sample index iIdx.
  • Equation 4 can be simplified as shown in Equation 5 below.
  • Intra prediction may be performed on a current block based on a plurality of intra prediction modes. For example, an intra prediction mode may be derived for each prediction sample, and a prediction sample may be derived based on an intra prediction mode allocated to each prediction sample.
  • an intra prediction mode may be derived for each area, and intra prediction for each area may be performed based on the intra prediction mode allocated to each area.
  • the region may include at least one sample. At least one of the size or shape of the region may be adaptively determined based on at least one of the size, shape, or intra prediction mode of the current block. Alternatively, at least one of the size or shape of the region may be predefined in the encoder and the decoder, independently of the size or shape of the current block.
  • 24 is a diagram illustrating an angle formed by a straight line parallel to an x-axis by directional intra prediction modes.
  • the directional prediction modes may exist between a lower left diagonal direction and an upper right diagonal direction.
  • the directional prediction modes may exist between 45 degrees (bottom left diagonal) and -135 degrees (top right diagonal).
  • a reference sample farther from the prediction sample is used instead of a reference sample closer to the prediction sample among the reference samples located on the angular line following the intra prediction angle.
  • a case of inducing a predicted sample may occur.
  • 25 is a diagram illustrating an aspect in which prediction samples are obtained when the current block has an amorphous shape.
  • the current block is an amorphous shape whose width is greater than the height
  • the intra prediction mode of the current block is a directional intra prediction mode having an angle between 0 degrees and 45 degrees. Is assumed to be. In the above case, when deriving the prediction sample A near the right column of the current block, the left reference sample far from the prediction sample instead of the upper reference sample T close to the prediction sample among reference samples located on the angular mode along the angle The use of L may occur.
  • the current block is an amorphous type whose height is greater than the width, and the intra prediction mode of the current block is a directional intra prediction mode between -90 degrees and -135 degrees. Is assumed to be. In the above case, when deriving the prediction sample A near the lower row of the current block, the upper reference sample far from the prediction sample instead of the left reference sample L close to the prediction sample among reference samples located on the angular mode along the angle The use of T may occur.
  • the intra prediction mode of the current block may be replaced with an intra prediction mode in the opposite direction. Accordingly, for an amorphous block, directional prediction modes having a larger or smaller angle than the directional prediction modes illustrated in FIG. 21 may be used. Such a directional intra prediction mode may be defined as a wide angle intra prediction mode.
  • the wide-angle intra prediction mode represents a directional intra prediction mode that does not fall within the range of 45 degrees to -135 degrees.
  • 26 is a diagram illustrating wide-angle intra prediction modes.
  • intra prediction modes with an index of -1 to -14 and intra prediction modes with an index of 67 to 80 represent wide-angle intra prediction modes.
  • 14 wide-angle intra prediction modes (-1 to -14) having an angle greater than 45 degrees and 14 wide-angle intra prediction modes (67 to 80) having an angle smaller than -135 degrees are illustrated.
  • a larger number or a smaller number of wide angle intra prediction modes may be defined.
  • the length of upper reference samples may be set to 2W+1, and the length of left reference samples may be set to 2H+1.
  • sample A shown in FIG. 26A is predicted using reference sample T
  • sample A shown in FIG. 26B is predicted using reference sample L. Can be.
  • Table 3 shows intra direction parameters of intra prediction modes when 20 wide-angle intra prediction modes are defined.
  • the intra prediction mode of the current block may be transformed into a wide-angle intra prediction mode.
  • the conversion range may be determined based on at least one of the size, shape, or ratio of the current block.
  • the ratio may represent a ratio between the width and height of the current block.
  • the transform range is from the intra prediction mode index (e.g., 66) in the upper right diagonal direction. It may be set to (the index of the intra prediction mode in the upper right diagonal direction -N).
  • N may be determined based on the ratio of the current block.
  • the intra prediction mode of the current block falls within the transformation range, the intra prediction mode may be transformed into a wide-angle intra prediction mode.
  • the transformation may be a subtraction of a predefined value from the intra prediction mode, and the predefined value may be the total number of intra prediction modes excluding wide angle intra prediction modes (eg, 67).
  • intra prediction modes 66 to 53 may be converted into wide-angle intra prediction modes between -1 and -14, respectively.
  • the transform range may be set from an intra prediction mode index in the lower left diagonal direction (e.g., 2) to (index of an intra prediction mode in the lower left diagonal direction + M).
  • M may be determined based on the ratio of the current block.
  • the intra prediction mode of the current block falls within the transformation range, the intra prediction mode may be transformed into a wide-angle intra prediction mode.
  • the transformation may be the addition of a predefined value to the intra prediction mode, and the predefined value may be the total number of directional intra prediction modes excluding wide angle intra prediction modes (eg, 65).
  • each of the intra prediction modes 2 through 15 may be converted into wide-angle intra prediction modes between 67 and 80.
  • intra prediction modes belonging to the transform range will be referred to as wide-angle intra replacement prediction modes.
  • the conversion range may be determined based on the ratio of the current block.
  • Tables 4 and 5 each show a transformation range when 35 intra prediction modes excluding wide-angle intra prediction modes are defined and when 67 intra prediction modes are defined.
  • the number of wide-angle intra-substitution prediction modes included in the transform range may be different.
  • the ratio of the current block is further subdivided and shown in Table 6 below. You can also set the conversion range as follows.
  • a wide-angle intra prediction mode is used. It can be set not to be. That is, even if the current block is amorphous and the intra prediction mode of the current block falls within the transformation range, the intra prediction mode of the current block may not be converted to the wide-angle intra prediction mode. Alternatively, the intra prediction mode of the current block may not be converted.
  • a multi-line intra prediction encoding method in which non-adjacent reference sample lines are set as not available as reference sample lines of the current block, or any one of a plurality of reference sample lines is selected You can set it to be disabled.
  • an adjacent reference sample line may be determined as a reference sample line of the current block.
  • refW and refH may be set as the sum of nTbW and nTbH. Accordingly, (nTbW + nTbH + offsetX[i]) upper reference samples and (nTbW + nTbH + offsetY[i]) left reference samples except for the upper left reference sample, and the distance from the current block is i. Samples may be included. That is, a non-adjacent reference sample whose distance from the current block is i may include (2nTbW + 2nTbH + offsetX[i] + offsetY[i] + 1) reference samples.
  • the value of offsetX when the value of whRatio is greater than 1, the value of offsetX may be set to be greater than the value of offsetY. For example, the value of offsetX may be set to 1, and the value of offsetY may be set to 0.
  • the value of whRatio when the value of whRatio is less than 1, the value of offsetY may be set larger than the value of offsetX. For example, the value of offsetX may be set to 0, and the value of offsetY may be set to 1.
  • wide-angle intra prediction modes are used in addition to existing intra prediction modes, resources required for encoding wide-angle intra prediction modes increase, and thus encoding efficiency may be lowered. Accordingly, instead of encoding the wide-angle intra prediction modes as they are, alternative intra prediction modes for the wide-angle intra prediction modes may be encoded, thereby improving encoding efficiency.
  • number 2 which is the 67th wide-angle replacement intra prediction mode
  • 66 which is the -1 wide-angle replacement intra prediction mode
  • the intra prediction mode of the current block when the current block is encoded using the 67th wide-angle intra prediction mode, number 2, which is the 67th wide-angle replacement intra prediction mode, may be encoded as the intra prediction mode of the current block.
  • the decoder may decode the intra prediction mode of the current block and determine whether the decoded intra prediction mode is included in the transformation range.
  • the decoded intra prediction mode is a wide-angle replacement intra prediction mode
  • the intra prediction mode may be converted into a wide-angle intra prediction mode.
  • the wide-angle intra prediction mode may be encoded as it is.
  • the encoding of the intra prediction mode may be performed based on the above-described MPM list. Specifically, when a neighboring block is encoded in the wide-angle intra prediction mode, the MPM may be set based on the wide-angle replacement intra prediction mode corresponding to the wide-angle intra prediction mode.
  • the coding block or transform block may be divided into a plurality of sub-blocks (or sub-partitions).
  • a coding block or a transform block is divided into a plurality of sub-blocks
  • prediction, transform, and quantization may be performed on each of the sub-blocks.
  • Dividing the coding block or transform block into a plurality of sub-blocks may be defined as a sub-partition intra coding method.
  • Information indicating whether the sub-partition intra coding method is applied may be signaled through the bitstream.
  • the information may be a 1-bit flag.
  • a syntax element'intra_subpartitions_mode_flag' indicating whether a coding block or a transform block is divided into a plurality of sub-blocks may be signaled through a bitstream.
  • the sub-partition intra coding method may be determined whether the sub-partition intra coding method is applied based on at least one of the size, shape, or intra prediction mode of the coding block or transform block.
  • the intra prediction mode of the coding block is a non-directional intra prediction mode (eg, planar or DC) or a predefined directional intra prediction mode (eg, an intra prediction mode in a horizontal direction, an intra prediction mode in a vertical direction, or a diagonal direction).
  • intra prediction mode the sub-partition intra coding method may not be applied.
  • the sub-partition intra coding method may be set not to be used.
  • the sub determines whether to apply the partition intra coding method.
  • the intra prediction mode of the coding block is an intra prediction mode in a diagonal direction or a wide angle intra prediction mode
  • a neighboring subblock may be used as a reference sample. If there is no, the sub-partition intra coding method may be set not to be used.
  • the sub-partition intra coding method may be set not to be used.
  • the sub-partition intra coding method may not be used.
  • the threshold value may have a value predefined by an encoder and a decoder. Alternatively, information for determining a threshold value may be signaled through a bitstream.
  • whether to signal a flag indicating whether to apply the sub-partition intra coding method may be determined based on at least one of the size, shape, or intra prediction mode of the coding block or transform block. For example, only when both the height and width of the coding block are less than or equal to the threshold value and/or the size of the coding block is greater than or equal to the threshold value, a flag indicating whether to apply the sub-partition intra coding method may be encoded and signaled. If a flag indicating whether to apply the sub-partition intra coding method is not coded, the sub-partition intra coding method may not be applied.
  • signaling of the syntax element intra_subpartitions_mode_flag may be omitted.
  • the flag may be regarded as indicating that the sub-partition intra coding method is not applied.
  • a division type of a coding block or a transform block may be determined.
  • the division type indicates a division direction of a coding block or a transform block.
  • vertical partitioning may mean dividing a coding block or a transform block using at least one vertical line
  • horizontal partitioning may mean dividing a coding block or a transform block using at least one horizontal line. .
  • FIG. 27 is a diagram illustrating an example of vertical partitioning and horizontal partitioning.
  • FIG. 27(a) shows an example in which a coding block is divided into two sub-blocks
  • FIG. 27(b) shows an example in which a coding block is divided into four sub-blocks.
  • Information for determining a split type of a coding block or a transform block may be signaled through a bitstream. For example, information indicating whether vertical partitioning or horizontal partitioning is applied to a coding block or a transform block may be signaled.
  • the information may be a 1-bit flag intra_subpart_type_flag. The flag value of 1 indicates that the coding block or transform block is partitioned in the horizontal direction, and the flag value of 0 indicates that the coding block or transform block is partitioned in the vertical direction.
  • a division type of the coding block or transform block may be determined based on the size, shape or intra prediction mode of the coding block or transform block. For example, based on the width and height ratio of the coding block, the division type of the coding block may be determined. For example, when a value of whRatio representing the height and width ratio of the coding block is greater than or equal to the first threshold value, vertical partitioning may be applied to the coding block. Otherwise, horizontal partitioning may be applied to the coding block.
  • 28 is a diagram illustrating an example of determining a division type of a coding block.
  • the first threshold value is 2.
  • whRatio of the coding block is 1, which is smaller than the first threshold. Accordingly, it is possible to omit the encoding of information indicating the division type of the coding block and apply horizontal partitioning to the coding block.
  • the division type of the coding block may be determined by using the first threshold value and the second threshold value in which the sign is opposite. For example, when the value of whRatio is less than or equal to the second threshold, horizontal partitioning may be applied to the coding block, and otherwise, vertical partitioning may be applied to the coding block.
  • the absolute values of the first threshold value and the second threshold value are the same, and their signs may be different. For example, when the first threshold value is N (here, N is an integer such as 1, 2, 4, etc.), the second threshold value may be -N.
  • 29 is a diagram illustrating an example of determining a division type of a coding block.
  • the second threshold is -2.
  • whRatio of the coding block is -1, which is greater than the second threshold. Accordingly, it is possible to omit the encoding of information indicating the division type of the coding block and apply vertical partitioning to the coding block.
  • whRatio of the coding block is -2, which is equal to the second threshold. Accordingly, it is possible to omit the encoding of information indicating the division type of the coding block and apply horizontal partitioning to the coding block.
  • a division type of the coding block may be determined based on the first threshold value and the second threshold value. For example, when the value of whRatio is greater than or equal to the first threshold, horizontal partitioning may be applied to the coding block, and when the value of whRatio is less than or equal to the second threshold, vertical partitioning may be applied to the coding block. When the value of whRatio exists between the first threshold value and the second threshold value, information may be parsed from the bitstream to determine a split type of the current block.
  • the first threshold value and the second threshold value may be predefined in an encoder and a decoder. Alternatively, a first threshold value and a second threshold value may be defined for each sequence, picture, or slice.
  • the partition type may be determined based on the size of the coding block or the transform block. For example, when the size of the coding block is Nxn, vertical partitioning may be applied, and when the size of the coding block is nxN, horizontal partitioning may be applied.
  • n may be a natural number smaller than N.
  • N and/or n may be values predefined by an encoder and a decoder.
  • information for determining N and/or n may be signaled through a bitstream. For example, N may be 32, 64, 128 or 256.
  • the size of the coding block is 128xn (where n is a natural number such as 16, 32, or 64), vertical partitioning can be applied, and when the size of the coding block is nx128, horizontal partitioning can be applied. .
  • a division type of the coding block or transform block may be determined. For example, when the intra prediction mode of the coding block is in a horizontal direction or a direction similar to the horizontal direction, vertical partitioning may be applied to the coding block.
  • the intra prediction mode in a direction similar to the horizontal direction is an intra prediction mode in which the index difference value from the intra prediction mode in the horizontal direction (eg, INTRA_ANGULAR18 shown in FIG. 21B) is less than or equal to a threshold value (eg, INTRA_ANGULAR18 ⁇ N) Represents.
  • the intra prediction mode of the coding block is a vertical direction or a direction similar to the vertical direction
  • horizontal partitioning may be applied to the coding block.
  • the intra prediction mode in a direction similar to the vertical direction is an intra prediction mode in which the index difference value from the intra prediction mode in the vertical direction (eg, INTRA_ANGULAR50 shown in FIG. 21B) is less than or equal to a threshold value (eg, INTRA_ANGULAR50 ⁇ N) Represents.
  • the threshold value N may be a value predefined by an encoder and a decoder. Alternatively, information for determining the threshold value N may be signaled at the sequence, picture, or slice level.
  • information indicating the partitioning type of the coding block may be parsed to determine the partitioning type of the coding block.
  • the number of sub-blocks may be determined based on at least one of a size or shape of a coding block or a transform block. For example, when either the width or the height of the coding block is 8 and the other is 4, the coding block may be divided into two sub-blocks. On the other hand, when both the width and height of the coding block are 8 or more, or if any one of the width or height of the coding block is greater than 8, the coding block may be divided into four subblocks. In summary, when the coding block has a size of 4x4, the coding block may not be divided into sub-blocks. When the coding block has a size of 4x8 or 8x4, the coding block may be divided into two sub-blocks. In other cases, the coding block can be divided into four sub-blocks.
  • information indicating the size, shape, or number of sub-blocks may be signaled through a bitstream.
  • the size or shape of the sub-blocks may be determined by information indicating the number of sub-blocks.
  • the number of sub-blocks may be determined based on information indicating the size or shape of the sub-blocks.
  • sub-blocks generated by dividing a coding block or a transform block may use the same intra prediction mode.
  • MPMs for the coding block may be derived based on intra prediction modes of neighboring blocks adjacent to the coding block, and an intra prediction mode for the coding block may be determined based on the derived MPMs.
  • each subblock may perform intra prediction using the determined intra prediction mode.
  • one of the MPMs may be determined as the intra prediction mode of the coding block. That is, when the sub-partition intra coding method is applied, the MPM flag may be considered to be true even if the MPM flag is not signaled.
  • one of predefined candidate intra prediction modes may be determined as the intra prediction mode of the coding block.
  • Any one of the modes eg, at least one of planar and DC
  • Index information specifying any one of predefined candidate intra prediction modes may be signaled through a bitstream.
  • the number and/or type of candidate intra prediction modes may be different according to the division direction of the coding block.
  • a non-directional intra prediction mode when horizontal partitioning is applied to a coding block, at least one of a non-directional intra prediction mode, a vertical intra prediction mode, an intra prediction mode in the upper left diagonal direction, or an intra prediction mode in the upper right diagonal direction is a candidate intra prediction mode. Can be set.
  • a non-directional intra prediction mode when vertical partitioning is applied to a coding block, at least one of a non-directional intra prediction mode, a horizontal intra prediction mode, an intra prediction mode in the upper left diagonal direction, or an intra prediction mode in the lower left diagonal direction is a candidate intra prediction mode. Can be set.
  • Quantization parameters of sub-blocks can be individually determined. Accordingly, a value of the quantization parameter of each sub-block may be set differently.
  • information indicating a difference value from the quantization parameter of the previous sub-block may be encoded. For example, for the N-th sub-block, a difference value between the quantization parameter of the N-th sub-block and the quantization parameter of the N-1 th sub-block may be encoded.
  • Intra prediction of a sub-block may be performed using a reference sample.
  • the reference sample may be derived from reconstructed samples of a neighboring block adjacent to the sub-block.
  • a reference sample of the sub-block may be derived based on the reconstructed sample of the other sub-block.
  • a reference sample of the second sub-block may be derived from the reconstructed sample of the first sub-block.
  • parallel intra prediction may not be applied between sub-blocks. That is, encoding/decoding may be sequentially performed on sub-blocks included in the coding block. Accordingly, after encoding/decoding of the first sub-block is completed, intra prediction for the second sub-block may be performed.
  • the sub-partition intra coding method When the sub-partition intra coding method is applied, it may be set not to use a multi-line intra prediction coding method that selects any one of a plurality of reference sample line candidates. When the multi-line intra prediction coding method is not used, an adjacent reference sample line adjacent to each subblock may be determined as a reference sample line of each subblock. Alternatively, when the index of the reference sample line of the current block is greater than 0, encoding of the syntax element intra_subpartitions_mode_flag indicating whether the sub-partition intra encoding method is applied may be omitted. When encoding of the syntax intra_subpartitions_mode_flag is omitted, the sub-partition intra encoding method may not be applied.
  • Filtering may be performed on samples adjacent to the boundary between sub-blocks.
  • the filter may be performed on a predicted sample or a reconstructed sample. For example, assuming that the second sub-block is adjacent to the right side of the first sub-block, a prediction sample or a reconstructed sample in contact with the left boundary of the second sub-block is used as a reconstructed sample in contact with the right boundary of the first sub-block. Can be filtered.
  • Whether to apply the filter to samples adjacent to the boundary between sub-blocks may be determined based on at least one of an intra prediction mode, a size of a sub-block, or the number of sub-blocks.
  • prediction samples may be updated based on positions of each of the prediction samples included in the prediction block.
  • Such an update method may be referred to as a sample position-based intra-weighted prediction method (or Position Dependent Prediction Combination, PDPC).
  • Whether to use the PDPC may be determined in consideration of the size and shape of the current block, the intra prediction mode, the reference sample line of the current block, the size of the current block, or a color component. For example, when the intra prediction mode of the current block is at least one of a planar, DC, a vertical direction, a horizontal direction, a mode having an index value smaller than the vertical direction, or a mode having an index value larger than the horizontal direction, the PDPC may be used. Alternatively, only when at least one of the width or height of the current block is greater than 4, the PDPC may be used. Alternatively, PDPC may be used only when the index of the reference picture line of the current block is 0.
  • PDPC may be used only when the index of the reference picture line of the current block is greater than or equal to a predefined value.
  • PDPC may be used only for the luminance component. Alternatively, depending on whether two or more of the above-listed conditions are satisfied, whether to use the PDPC may be determined.
  • whether to use the PDPC may be determined according to whether the sub-partition intra coding method is used. For example, when a sub-partition intra coding method is applied to a coding block or a transform block, the PDPC may be set not to be used. Alternatively, when the sub-partition intra coding method is applied to the coding block or transform block, the PDPC may be applied to at least one of the plurality of sub-blocks. In this case, the subblock to which the PDPC is applied may be determined based on at least one of the size, shape, location, intra prediction mode, or reference sample line index of the coding block or subblock.
  • the PDPC may be applied to a subblock adjacent to the upper and/or left boundary of the coding block or to a subblock adjacent to the lower and/or right boundary of the coding block.
  • the PDPC may be applied to all sub-blocks included in the coding block, or the PDPC may not be applied to all sub-blocks included in the coding block.
  • the application of the PDPC may be omitted.
  • PDPC may be applied to all sub-blocks in the coding block.
  • whether to apply the PDPC for each subblock may be determined according to whether at least one of the size, shape, intra prediction mode, or reference picture index of the subblocks generated by dividing the coding block or the transform block satisfies a preset condition. For example, when at least one of the width or height of the sub-block is greater than 4, the PDPC may be applied to the sub-block.
  • information indicating whether the PDPC is applied may be signaled through the bitstream.
  • a region to which the PDPC is applied may be determined based on at least one of the size and shape of the current block, the intra prediction mode, or the location of the prediction sample.
  • the intra prediction mode of the current block has an index larger than the vertical direction
  • a prediction sample in which at least one of the x-axis coordinates or the y-axis coordinates is greater than the threshold value is not corrected, and the x-axis coordinates and y-axis coordinates are the threshold value. Correction may be performed only for the following prediction samples.
  • the intra prediction board of the current block has an index smaller than the horizontal direction
  • prediction samples in which at least one of the x-axis coordinates or y-axis coordinates is greater than the threshold value are not corrected, and the x-axis coordinates or y-axis coordinates are the threshold values. Correction may be performed only for the following prediction samples.
  • the threshold value may be determined based on at least one of the size, shape, and intra prediction mode of the current block.
  • a reference sample used to correct the prediction sample may be determined based on the position of the obtained prediction sample.
  • a residual signal may be obtained by differentiating the prediction sample from the original sample of the current block.
  • the residual signal instead of encoding the residual signal at a specific position as it is, after inducing a difference between the residual signal at a specific position and a neighboring residual signal, the derived difference may be encoded.
  • the residual signal may represent a residual sample, a transform coefficient generated by transforming the residual sample, or a coefficient generated by skipping the transform.
  • the residual signal belonging to the first line and the residual signal belonging to the second line may be differentiated, and then the differential residual value may be encoded.
  • the first line and the second line may be different from at least one of the x-axis coordinates and the y-axis coordinates.
  • the encoder may generate a transform coefficient by transforming a residual sample, and then encode a transform coefficient difference derived by differentiating the generated transform coefficient from a neighboring transform coefficient.
  • the decoder may derive a second transform coefficient by setting a transform coefficient belonging to the first line as a predicted value of the second residual signal and adding the decoded differential transform coefficient to the predicted transform coefficient.
  • Intra BDPCM Block-based Delta Pulse Code Modulation
  • Intra BDPCM can be used only when the prediction encoding mode of the current block is determined as intra prediction.
  • the prediction sample of the current block may be set to 0. That is, when intra BDPCM is applied, a residual sample may be set as a reconstructed sample.
  • a prediction sample of the current block may be derived based on intra prediction.
  • the intra prediction mode of the current block may be determined according to the intra BDPCM direction. For example, when the intra BDPCM direction is horizontal, a prediction sample may be obtained based on an intra prediction mode in the horizontal direction. When the intra BDPCM direction is vertical, a prediction sample may be obtained based on an intra prediction mode in the vertical direction.
  • a prediction sample of the current block may be derived by using the default intra prediction mode.
  • the default intra prediction mode may be any one of DC, planar, horizontal or vertical.
  • the default intra prediction mode may be predefined in an encoder and a decoder. Information specifying one of the default intra prediction modes may be encoded and signaled.
  • an intra prediction mode may be derived from one of a plurality of MPM candidates.
  • intra BDPCM When intra BDPCM is applied to the current block, it is possible to force the use of adjacent reference sample lines. That is, signaling of index information specifying one of the reference sample lines may be omitted, and a prediction sample may be obtained by using an adjacent reference sample line.
  • information for determining the intra BDPCM direction may be signaled through a bitstream.
  • a flag intra_bdpcm_dir_flag indicating an intra BDPCM direction may be signaled through a bitstream.
  • the intra BDPCM direction may be determined based on the size or shape of the current block. For example, when the current block has an amorphous shape whose width is greater than the height, it may be determined that the BDPCM in the horizontal direction is applied. On the other hand, when the current block is an irregular shape whose height is greater than the width, it may be determined that the vertical direction BDPCM is applied.
  • the intra BDPCM direction may be determined in consideration of intra prediction modes of neighboring blocks adjacent to the current block. For example, when at least one intra prediction mode among the left and upper blocks of the current block is in a horizontal direction or a direction similar thereto, the horizontal direction BDPCM may be applied to the current block.
  • a direction similar to the horizontal direction refers to an intra prediction mode in which a difference from the intra prediction mode in the horizontal direction is less than or equal to a threshold value.
  • the vertical direction BDPCM may be applied to the current block.
  • a direction similar to the vertical direction refers to an intra prediction mode in which a difference from the intra prediction mode in the vertical direction is less than or equal to a threshold value.
  • a difference value between a residual signal and a residual signal adjacent to an upper end of the residual signal may be encoded.
  • the decoder may induce a residual signal by adding an upper residual signal to the decoded difference value.
  • a difference value between a residual signal and a residual signal adjacent to the left of the residual signal may be encoded.
  • the decoder may derive the residual signal by adding the left residual signal to the decoded difference value.
  • non-directional BDPCM can be applied.
  • DC BDPCM refers to encoding/decoding a difference between a residual signal at a predetermined position and an average value of neighboring residual signals at a predetermined position.
  • the planner BDPCM includes a horizontal difference value that is a difference between a residual signal at a predetermined position and a residual signal positioned in the horizontal direction of the predetermined position residual signal, and a residual positioned vertically between the residual signal at the predetermined position and the residual signal at the predetermined position. It means encoding/decoding the average or weighted result of the difference value in the vertical direction, which is the difference with the signal.
  • Information for specifying an available BDPCM mode may be signaled through a bitstream.
  • the information may be information indicating whether non-directional BDPCM is applied or information for specifying any one of a plurality of BDPCM candidates applicable to the current block.
  • Information indicating whether to apply intra BDPCM to the current block may be signaled through a bitstream. For example, a flag intra_bdpcm_flag may be signaled through a bitstream. When the syntax intra_bdpcm_flag is 1, it indicates that intra BDPCM is applied to the current block. If the syntax intra_bdpcm_flag is 0, it indicates that intra BDPCM is not applied to the current block.
  • a flag sps_intra_bdpcm_flag indicating the availability of intra BDPCM may be signaled through a sequence parameter set (SPS).
  • SPS sequence parameter set
  • the syntax sps_intra_bdpcm_flag is 1, it indicates that pictures referencing the sequence parameter set can use intra BDPCM.
  • the syntax sps_intra_bdpcm_flag is 0, it indicates that pictures referencing the sequence parameter set cannot use intra BDPCM.
  • the intra_bdpcm_flag indicating whether intra BDPCM is applied to the current block may be signaled only when sps_intra_bdpcm_flag is 1.
  • the PDPC can be set not to be used.
  • intra BDPCM When intra BDPCM is applied to the current block, it may be configured to force application of the transform skip. That is, when intra BDPCM is applied to the current block, the value may be considered to be 1 even if transform_skip_flag indicating whether or not transform skip is applied is not signaled.
  • the combined prediction mode is a method of generating a prediction image by combining two or more prediction modes. For example, when the combined prediction mode is applied, a first prediction block generated based on the first prediction mode and a second prediction block generated based on the second prediction mode are averaged, or a weighted sum operation using them is performed. Blocks can be created.
  • the prediction mode may include at least one of an intra prediction mode, a merge mode, an AMVP mode, a skip mode, an intra block copy mode, or a palette mode.
  • the first prediction mode may be a merge mode
  • the second prediction mode may be an intra prediction mode.
  • the prediction block of the current block is a first prediction block acquired based on motion information and a second prediction block acquired based on a predetermined intra prediction mode. Can be generated by weighted prediction of.
  • the motion information of the current block may be derived from a merge candidate specified by the index merge_idx signaled from the bitstream.
  • the intra prediction mode of the current block may be set to a predefined intra prediction mode.
  • the predefined intra prediction mode may be a planar, DC, horizontal or vertical mode.
  • the intra prediction mode of the neighboring block may be set as the intra prediction mode of the current block.
  • a flag indicating whether the combined prediction mode is applied to the current block may be signaled through the bitstream.
  • the syntax ciip_flag may be signaled through a bitstream.
  • the value of the syntax ciip_flag is 1, it indicates that the combined prediction mode is applied to the current block.
  • the value of the syntax ciip_flag is 0, it indicates that the combined prediction mode is not applied to the current block.
  • at least one of a merge offset coding method and a triangular partitioning method may be applied.
  • the derived residual image can be derived by differentiating the predicted image from the original image.
  • the residual image when the residual image is changed to the frequency domain, subjective image quality of the image does not significantly deteriorate even if high-frequency components among the frequency components are removed. Accordingly, if the values of the high-frequency components are converted to small values or the values of the high-frequency components are set to 0, there is an effect of increasing the compression efficiency without causing significant visual distortion.
  • the current block can be transformed to decompose the residual image into 2D frequency components.
  • the transformation may be performed using a transformation technique such as Discrete Cosine Transform (DST) or Discrete Sine Transform (DST).
  • DCT decomposes (or transforms) a residual image into a 2D frequency component using a cosine transform
  • DST decomposes (or transforms) a residual image into a 2D frequency component using a sine transform.
  • frequency components may be expressed as a base image.
  • N 2 basic pattern components may be obtained.
  • the size of each of the basic pattern components included in the NxN size block may be obtained through transformation.
  • the size of the basic pattern component may be referred to as a DCT coefficient or a DST coefficient.
  • Transformation Technique DCT is mainly used to transform an image in which non-zero low-frequency components are largely distributed.
  • the conversion technique DST is mainly used for images in which high-frequency components are distributed.
  • the residual image may be transformed using a conversion technique other than DCT or DST.
  • transformation of the residual image into 2D frequency components will be referred to as 2D image transformation.
  • the sizes of the basic pattern components obtained as a result of the transformation will be referred to as transformation coefficients.
  • the transform coefficient may mean a DCT coefficient or a DST coefficient.
  • the transform coefficient may mean the size of the basic pattern component generated as a result of the second transform.
  • the residual sample to which the transform skip has been applied is also referred to as a transform coefficient.
  • the conversion technique may be determined in units of blocks.
  • the transformation technique may be determined based on at least one of a prediction encoding mode of the current block, a size of the current block, or a shape of the current block.
  • a prediction encoding mode of the current block e.g., a prediction encoding mode of the current block
  • a size of the current block e.g., a size of the current block
  • a shape of the current block e.g., a prediction encoding mode of the current block, a size of the current block, or a shape of the current block.
  • DST transformation technique
  • DCT conversion technique
  • 2D image transformation may not be performed for some blocks of the residual image. Not performing 2D image transformation may be referred to as transform skip.
  • Transform skip indicates that the first transform and the second transform are not applied to the current block.
  • quantization may be applied to residual values for which the transform is not performed.
  • Whether to allow the transform skip to the current block may be determined based on at least one of the size or shape of the current block. For example, only when the size of the current block is smaller than the threshold value, the transform skip may be applied.
  • the threshold value relates to at least one of the width, height, or number of samples of the current block, and may be defined as 32x32 or the like.
  • transformation skip can be allowed only for square blocks. For example, a transform skip may be allowed for a square block having a size of 32x32, 16x16, 8x8, or 4x4. Alternatively, only when the sub-partition intra coding method is not used, transform skip can be allowed.
  • the sub-partition intra coding method when the sub-partition intra coding method is applied to the current block, it may be determined whether transform skip is applied for each sub-partition.
  • 30 is a diagram illustrating an example of determining whether to skip transformation for each subblock.
  • Transform skip may be applied to only some of a plurality of sub-blocks.
  • a transform skip may be applied to a sub-block positioned at the top of the current block, and a transform skip may be set not to be allowed to a sub-block positioned at the bottom of the current block.
  • a transform type of a subblock in which transform skip is not allowed may be determined based on information signaled from the bitstream.
  • a transformation type may be determined based on tu_mts_idx to be described later.
  • the transform type of the sub-block may be determined based on the size of the sub-block. For example, based on whether the width of the sub-block is greater than or equal to the threshold value and/or is less than or equal to the threshold value, the horizontal direction transformation type is determined, and whether the height of the sub-block is greater than or equal to the threshold value and/or less than or equal to the threshold value is determined. As a basis, it is possible to determine the vertical direction transformation type.
  • information for determining a transform type for the coding block may be signaled, and a transform type specified by the information may be commonly applied to subblocks included in the coding block. That is, the transform types of sub-blocks in the coding block may be set to the same.
  • the converted current block may be converted again.
  • a transform based on DCT or DST may be defined as a first transform
  • a second transform may be defined to transform a block to which the first transform is applied.
  • the first transformation may be performed using any one of a plurality of transformation core candidates.
  • the first conversion may be performed using any one of DCT2, DCT8, or DST7.
  • Different conversion cores may be used for the horizontal and vertical directions.
  • Information indicating a combination of a transformation core in a horizontal direction and a transformation core in a vertical direction may be signaled through a bitstream.
  • the above-described tu_mts_idx may refer to one of combinations of a horizontal direction conversion core and a vertical direction conversion core.
  • Units for performing the first transformation and the second transformation may be different.
  • a first transform may be performed on an 8x8 block
  • a second transform may be performed on a subblock having a size of 4x4 among the transformed 8x8 blocks.
  • the second transform may be performed on transform coefficients belonging to three sub-blocks having a size of 4x4.
  • the three sub-blocks may include a sub-block located at an upper left of the current block, a sub-block adjacent to the right of the sub-block, and a sub-block adjacent to a lower end of the sub-block.
  • the second transform may be performed on a block having a size of 8x8.
  • the transform coefficients of residual regions in which the second transform is not performed may be set to 0.
  • a first transform may be performed on a 4x4 block, and a second transform may be performed on an 8x8 area including the transformed 4x4 block.
  • Information indicating the transformation type of the current block may be signaled through a bitstream.
  • the information may be index information tu_mts_idx indicating one of combinations of a transformation type for a horizontal direction and a transformation type for a vertical direction.
  • a transform core for a vertical direction and a transform core for a horizontal direction may be determined.
  • Table 7 shows conversion type combinations according to tu_mts_idx.
  • the conversion type may be determined as one of DCT2, DST7, or DCT8.
  • a transform skip may be inserted into a transform type candidate.
  • DCT2 may be applied in the horizontal and vertical directions. If tu_mts_idx is 2, DCT8 can be applied in the horizontal direction and DCT7 can be applied in the vertical direction.
  • a transform core of a sub-block may be independently determined. For example, information for specifying a transform type combination candidate for each sub-block may be encoded and signaled. Accordingly, transformation cores may be different between sub-blocks.
  • sub-blocks may use the same transform type.
  • tu_mts_idx specifying a candidate for a transformation type combination may be signaled only for the first subblock.
  • tu_mts_idx is signaled at the coding block level, and the transform type of the sub-blocks may be determined with reference to tu_mts_idx signaled at the coding block level.
  • a transform type may be determined based on at least one of the size, shape, or intra prediction mode of one of the sub-blocks, and the determined transform type may be set to be used for all sub-blocks.
  • 31 is a diagram illustrating an example in which sub-blocks use the same transform type.
  • the transform type of the sub-block (Sub-CU0) located at the top of the coding block and the sub-block (Sub-CU1) located at the bottom of the coding block may be set to be the same.
  • the horizontal direction type and the vertical transform type are determined based on the tu_mts_idx signaled to the upper sub-block, as in the example shown in (a) of FIG. 31, the determined transform type is also applied to the lower sub-block. can do.
  • the transform type of the sub-block (Sub-CU0) located on the left side of the coding block and the sub-block (Sub-CU1) located on the right side of the coding block may be set to be the same.
  • the horizontal direction type and the vertical transformation type are determined based on the tu_mts_idx signaled for the left sub-block, the determined transformation type is also applied to the right sub-block. can do.
  • Whether to encode index information may be determined based on at least one of the size and shape of the current block, the number of non-zero coefficients, whether to perform quadratic transformation, or whether to apply a sub-partition intra coding method. For example, when the sub-partition intra coding method is applied to the current block, or when the number of non-zero coefficients is equal to or smaller than a threshold value, signaling of index information may be omitted. When signaling of index information is omitted, a default transform type may be applied to the current block.
  • the default conversion type may include at least one of DCT2 and DST7.
  • one of the plurality of default transform types is selected in consideration of at least one of the size and shape of the current block, the intra prediction mode, whether the quadratic transformation is performed, or whether the sub-partition intra coding method is applied. You can choose. For example, based on whether the width of the current block falls within a preset range, one of a plurality of transformation types is determined as a horizontal transformation type, and based on whether the height of the current block falls within a preset range , One of a plurality of transformation types may be determined as a vertical transformation type. Alternatively, the default mode may be determined differently according to the size and shape of the current block, the intra prediction mode, or whether the quadratic transformation has been performed.
  • the horizontal direction transform type and the vertical direction transform type may be set as default transform types.
  • the horizontal direction transform type and the vertical direction transform type may be set to DCT2.
  • the threshold value may be determined based on the size or shape of the current block. For example, when the size of the current block is less than or equal to 32x32, the threshold is set to 2, and when the current block is larger than 32x32 (e.g., when the current block is a 32x64 or 64x32 sized coding block), the threshold You can set the value to 4.
  • a plurality of lookup tables may be pre-stored in the encoder/decoder.
  • at least one of an index value allocated to transformation type combination candidates, a type of transformation type combination candidates, or a number of transformation type combination candidates may be different.
  • a lookup table for the current block may be selected based on at least one of the size and shape of the current block, a predictive encoding mode, an intra prediction mode, whether a quadratic transform is applied, or whether a transform skip is applied to a neighboring block.
  • a first lookup table is used, and when the size of the current block is larger than 4x4, or when the current block is encoded by intra prediction
  • a second look-up table may be used for this.
  • information indicating any one of a plurality of lookup tables may be signaled through a bitstream.
  • the decoder may select a lookup table for the current block based on the information.
  • the index allocated to the transform type combination candidate is It can be determined adaptively. For example, when the size of the current block is 4x4, the index allocated to the transform skip may have a smaller value than the index allocated to the transform skip when the size of the current block is greater than 4x4. Specifically, when the size of the current block is 4x4, index 0 may be allocated to the transform skip, and when the current block is greater than 4x4 and 16x16 or less, an index greater than 0 (eg, index 1) may be allocated to the transform skip. When the current block is larger than 16x16, a maximum value (eg, 5) may be assigned to the index of the transform skip.
  • a maximum value eg, 5
  • index 0 may be allocated to the transform skip.
  • index 1 an index greater than 0 (eg, index 1) may be allocated to the transform skip.
  • index 0 may be allocated to the transform skip.
  • index 1 may be allocated to the transform skip.
  • Transform type combination candidates different from the transformation type combination candidates listed in Table 7 may be defined and used.
  • a transformation type combination candidate to which a transformation core such as DCT2, DCT8, or DST7 is applied may be used to apply a transformation skip to either a horizontal direction transformation or a vertical direction transformation, and to the other.
  • it is determined whether to use the transform skip as a transform type candidate for the horizontal direction or the vertical direction based on at least one of the size (e.g., width and/or height), shape, prediction coding mode, or intra prediction mode of the current block. I can.
  • Information indicating whether index information for determining the transformation type of the current block is explicitly signaled may be signaled through a bitstream.
  • Information sps_explicit_inter_mts_flag may be signaled.
  • the conversion type of the current block may be determined based on the index information tu_mts_idx signaled from the bitstream.
  • the transform type may be determined based on at least one of whether or not the sub-partition intra coding method is applied. For example, the horizontal direction transformation type of the current block may be determined based on the width of the current block, and the vertical direction transformation type of the current block may be determined based on the height of the current block.
  • the type of transformation in the horizontal direction may be determined as DCT2. Otherwise, the conversion type in the horizontal direction may be determined as DST7.
  • the type of transformation in the vertical direction may be determined as DCT2. Otherwise, the vertical transform type may be determined as DST7.
  • a threshold value compared with the width and height may be determined based on at least one of the size, shape, and intra prediction mode of the current block.
  • the horizontal direction conversion type and the vertical direction conversion type are set to be the same, while when the current block is an irregular shape with different height and width, the horizontal direction conversion type and the vertical direction
  • the conversion type can be set differently.
  • the horizontal direction transformation type may be determined as DST7
  • the vertical direction transformation type may be determined as DCT2.
  • the vertical direction transformation type may be determined as DST7
  • the horizontal direction transformation type may be determined as DCT2.
  • the number and/or type of transformation type candidates or the number and/or type of transformation type combination candidates may be different depending on whether explicit transformation type determination is allowed. For example, when explicit conversion type determination is allowed, DCT2, DST7, and DCT8 may be used as conversion type candidates. Accordingly, each of the horizontal direction conversion type and the vertical direction conversion type may be set to DCT2, DST8, or DCT8. If explicit conversion type determination is not allowed, only DCT2 and DST7 can be used as conversion type candidates. Accordingly, each of the horizontal direction conversion type and the vertical direction conversion type may be determined as DCT2 or DST7.
  • a coding block or a transform block may be divided into a plurality of sub-blocks, and only some of the plurality of sub-blocks may be transformed. Applying a transform to only some of a plurality of sub-blocks may be defined as a sub-transform block encoding method.
  • 32 and 33 are diagrams illustrating an application aspect of a sub transform block encoding method.
  • FIG. 32 is a diagram illustrating an example in which transformation is performed only on any one of four sub-blocks
  • FIG. 33 is a diagram illustrating an example in which transformation is performed on only one of two sub-blocks. In FIGS. 32 and 33, it is assumed that transformation is performed only on sub-blocks marked with'Target'.
  • transform and quantization may be performed on only any one of them.
  • the transform coefficient of the sub-block on which the transform is not performed may be set to 0.
  • transform and quantization may be performed on only any one of them.
  • the transform coefficient of the sub-block on which the transform is not performed may be set to 0.
  • Information indicating whether the sub transform block encoding method is applied to the coding block may be signaled through the bitstream.
  • the information may be a 1-bit flag cu_sbt_flag. When the flag is 1, the transformation is performed only on some of the plurality of sub-blocks generated by dividing the coding block or the transform block, and when the flag is 0, the coding block or the transform block is divided into sub-blocks. It indicates that the transformation is performed without the presence of
  • a prediction coding mode or a combined prediction mode it may be determined whether a sub transform block coding method is available for the coding block. For example, when at least one of the width or height of the coding block is greater than or equal to the threshold value, when inter prediction is applied to the coding block, or when the combined prediction mode is not applied to the coding block, at least one condition is satisfied. , It is possible to use a sub-transform block coding method for the coding block.
  • the threshold value may be a natural number such as 4, 8, or 16.
  • the sub transform block coding method may not be allowed.
  • the sub-partition intra coding method based on whether the sub-partition intra coding method is applied to the coding block, it may be determined whether the sub transform block coding method is available for the coding block. For example, when the sub-partition intra coding method is applied, it may be determined that the sub transform block coding method is usable.
  • the syntax cu_sbt_flag may be signaled through the bitstream. Whether to apply the sub transform block encoding method may be determined according to the parsed cu_sbt_flag value.
  • signaling of the syntax cu_sbt_flag may be omitted.
  • the signaling of the syntax cu_sbt_flag it may be determined that the sub transform block encoding method is not applied to the coding block.
  • information indicating the split type of the coding block may be signaled through a bitstream.
  • the information indicating the division type of the coding block includes at least one of information indicating whether the coding block is divided to include a sub-block having a size of 1/4, information indicating a division direction of the coding block, or information indicating the number of sub-blocks. Can include.
  • a flag cu_sbt_quadtree_flag indicating whether the coding block is divided to include a sub-block having a size of 1/4 may be signaled.
  • the syntax cu_sbt_quadtree_flag When the syntax cu_sbt_quadtree_flag is 1, it indicates that the coding block is divided to include a sub-block having a size of 1/4. For example, by using one vertical line or one horizontal line, the coding block is divided into a subblock having a size of 1/4 of the width of the coding block and a subblock having a size of 3/4, or having a height of 1 of the coding block height. It can be divided into /4 sized subblocks and 3/4 sized subblocks. Alternatively, the coding block may be divided such that each of the width and height includes sub-blocks having a size of 1/2 of the width and height of the coding block.
  • Dividing the coding block to include a 1/4-sized sub-block may be referred to as quad-type division.
  • the syntax cu_sbt_quad_tree_flag is 1, a subblock having a size of 1/4 of the coding block may be set as a transformation target.
  • the syntax cu_sbt_quadtree_flag When the syntax cu_sbt_quadtree_flag is 0, it indicates that the coding block is divided to include a 1/2 size subblock. As an example, a coding block may be divided into two sub-blocks having a size of 1/2 using one vertical line or one horizontal line. Dividing the coding block into two sub-blocks having a size of 1/2 may be referred to as binary type division. When the syntax cu_sbt_quad_tree_flag is 0, a subblock having a size of 1/2 of the coding block may be included in the coding block.
  • a flag indicating the division direction of the coding block may be signaled through the bitstream.
  • a flag cu_sbt_horizontal_flag indicating whether horizontal partitioning is applied to the coding block may be encoded and signaled.
  • cu_sbt_horizontal_flag indicates that horizontal partitioning using at least one dividing line parallel to the upper and lower sides of the coding block is applied.
  • cu_sbt_horizontal_flag When the value of cu_sbt_horizontal_flag is 0, it indicates that vertical partitioning using at least one dividing line parallel to the left and right sides of the coding block is applied.
  • the division type of the coding block may be determined.
  • quad-type division may be used when at least one of the width or height of the coding block is equal to or greater than a first threshold.
  • the first threshold may be a natural number such as 4, 8, or 16.
  • the first threshold may also be referred to as a quad-type threshold.
  • the syntax cu_sbt_quadtree_flag may be signaled through a bitstream. According to the parsed cu_sbt_quadtree_flag value, it may be determined whether quad-type division is applied to the coding block.
  • signaling of the syntax cu_sbt_quadtree_flag may be omitted.
  • the signaling of the syntax cu_sbt_quadtree_flag it may be determined that binary type division is applied to the coding block.
  • Table 8 illustrates a syntax structure for determining whether to parse the syntax cu_sbt_quadtree_flag.
  • variable allowSbtVerQ is a variable indicating whether quad-type division in the vertical direction is allowed
  • allowSbtHorQ is a variable indicating whether quad-type division in the horizontal direction is allowed.
  • the variable allowSbtVerQ and the variable allowSbtHorQ may be determined based on a quad type threshold. For example, when the quad-type threshold is 16, allowSbtVerQ may be determined based on whether the width of the coding block is 16 or more, and allowSbtHorQ may be determined based on whether the height of the coding block is 16 or more.
  • the syntax cu_sbt_quad_flag can be parsed from the bitstream. For example, when the coding block is 16x8, since the variable allowSbtHorQ is set to false, parsing the syntax cu_sbt_quad_flag may be omitted. Alternatively, when the coding block is 8x16, since the variable allowSbtVerQ is set to false, parsing the syntax cu_sbt_quad_flag may be omitted. When parsing the syntax cu_sbt_quad_flag is omitted, binary type division may be applied to the coding block.
  • the syntax cu_sbt_quad_flag may be set to be parsed. That is, when only one of the width and height of the coding block is greater than or equal to the quad type threshold, quad type division may be used.
  • the second threshold may have a value smaller than the first threshold.
  • the second threshold may be a natural number such as 2, 4, or 8.
  • the variable allowSbtHorH is a variable indicating whether horizontal binary type division can be used.
  • the horizontal direction binary type division may be set to be usable when the height of the coding block is greater than or equal to a threshold value.
  • the variable allowSbtVerH is a variable indicating whether vertical binary type division can be used.
  • the vertical binary type division may be set to be usable when the width of the coding block is greater than or equal to a threshold value.
  • the threshold value may be a natural number such as 4, 8 or 16.
  • the syntax cu_sbt_horizontal_flag may be signaled through the bitstream.
  • horizontal division or vertical division may be applied to the coding block.
  • signaling of the syntax cu_sbt_horizontal_flag may be omitted.
  • signaling of the syntax cu_sbt_horizontal_flag is omitted, a case in which a coding block is available among horizontal quad/binary type division and vertical quad/binary type division may be applied.
  • Information for specifying a sub-block to be transformed among a plurality of sub-blocks may be signaled through a bitstream.
  • the syntax cu_sbt_pos_flag may be signaled through a bitstream.
  • the syntax cu_sbt_pos_flag indicates whether the transformation target is the first subblock in the coding block. For example, when horizontal quad/binary type partitioning is applied to a coding block, if cu_sbt_flag is 1, the leftmost subblock is determined as a transformation target, and if cu_sbt_flag is 0, the rightmost subblock is determined as transformation target.
  • the transform type of the subblock may be determined in consideration of the division direction of the coding block and the location of the subblock. As an example, when a coding block is divided in a vertical direction and transform is performed on a subblock positioned on the left of the subblocks, a horizontal direction transform type and a vertical direction transform type may be set differently.
  • 34 and 35 illustrate a horizontal direction transformation type and a vertical direction transformation type according to a location of a sub-block to be converted.
  • the horizontal direction transform type and the vertical direction transform type may be set to be the same.
  • the horizontal direction transform type and the vertical direction transform type are set to DCT8, and the transform target sub-block is of the coding block.
  • the horizontal direction conversion type and the vertical direction conversion type are set to DST7.
  • the horizontal direction transform type and the vertical direction transform type may be set differently.
  • the horizontal direction transform type is set to DST7 and the vertical direction transform type is set to DCT8.
  • the horizontal direction transform type is set to DCT8 and the vertical direction transform type is set to DST7.
  • the horizontal direction transformation type and the vertical direction transformation type are set differently, and , when the subblock including the upper right sample or the subblock including the lower left sample in the coding block is determined as a transformation target, the horizontal direction transformation type and the vertical direction transformation type may be set to be the same.
  • sub-blocks having a height and a width of 1/2 of a coding block are set as transformation targets.
  • a subblock having the same width as the coding block but having a height of 1/4 or a subblock having the same height as the coding block but having a width of 1/4 may be set as a transformation target.
  • the horizontal direction transform type and the vertical direction transform type may be set differently.
  • the horizontal direction transformation type when a horizontal direction binary type partitioning is applied and an upper sub-block is selected as a transformation target, the horizontal direction transformation type is set to DST7, and the vertical direction direction or type is set to DCT7. I can.
  • the vertical direction binary type partitioning is applied and the left sub-block is selected as a conversion target, the horizontal direction conversion type may be set to DCT8, and the vertical direction conversion type may be set to DST7.
  • the horizontal direction transform type and the vertical direction transform type are set equally, and the transform target subblock is the lower right of the coding block.
  • the horizontal direction transformation type and the vertical direction transformation type may be set differently.
  • the horizontal direction transform type and the vertical direction transform type may be set to be the same.
  • the horizontal direction transformation type and the vertical direction transformation type may be set to DST7.
  • the horizontal direction transformation type and the vertical direction transformation type may be set to DST7.
  • a horizontal direction transformation type and a vertical direction transformation type may be determined according to the position of the subblock to be transformed in the coding block.
  • encoding of CBF may be omitted.
  • CBF encoding it may be determined whether or not a non-zero residual coefficient is included in each sub-block in consideration of the position of the block on which the transformation is performed.
  • the CBF value for the subblock located on the left or the top is derived as 0, and is located on the right or the bottom.
  • the CBF value of the sub-blocks can be derived as 1.
  • the CBF value of the subblock located on the left or the top is derived as 1, and the subblock located on the right or the bottom
  • the CBF value of can be derived to zero.
  • a second transform may be performed on a block in which the first transform has been performed.
  • the second transform may be performed on the upper left region of the transform block to which the first transform is applied.
  • the decoder When the residual coefficients in which the first transformation and the second transformation are performed are encoded, the decoder performs a second inverse transformation of the second transformation in the transform block, and the inverse transformation of the first transformation in the transform block in which the second inverse transformation is performed.
  • a first inverse transform can be performed.
  • Whether the second transform is applied to the current block may be determined based on at least one of the size of the current block, the number of residual coefficients, an encoding mode, an intra prediction mode, or whether a sub-partition intra encoding method is applied.
  • the encoder is a decoder, and can signal by encoding information indicating whether or not the second transform is applied. Alternatively, the encoder and the decoder may determine whether to perform the second transformation based on the same condition.
  • information indicating whether to perform the second transformation may be signaled through a bitstream.
  • a flag indicating whether to perform the second transformation or index information specifying whether to perform the second transformation and a transformation kernel used for the second transformation may be signaled.
  • Table 9 shows an example in which the flag lfnst_flag indicating whether to perform the second transformation is signaled through the bitstream.
  • the flag lfnst_flag When the value of the flag lfnst_flag is 0, it indicates that the second transform has not been performed on the current block. On the other hand, when the value of lfnst_flag is 1, it indicates that the second transformation has been performed on the current block.
  • the syntax lfnst_idx may be signaled through the bitstream.
  • the index lfnst_idx is 0, it indicates that the second transform is not performed on the current block.
  • the index lfnst_idx is greater than 0, it indicates that the second transform is performed on the current block.
  • lfnst_idx may be used to specify a conversion kernel for performing the second conversion.
  • the second transformation it is possible to determine whether to perform the second transformation by comparing at least one of the width or height of the current block with a threshold value. For example, when the minimum value among the width and height of the current block is smaller than the threshold value, the second transformation may not be performed.
  • the threshold value may be a natural number such as 4, 8, or 16.
  • the second transform may not be applied.
  • the second transform may not be applied.
  • whether to perform the second transformation may be determined based on whether the horizontal direction transformation core and the vertical direction transformation core are the same. For example, only when the horizontal direction conversion core and the vertical direction conversion core are the same, the second conversion may be performed. Alternatively, only when the horizontal direction conversion core and the vertical direction conversion core are different from each other, the second conversion may be performed.
  • the second transformation may be allowed only when the transformation in the horizontal direction and the transformation in the vertical direction use a predefined transformation core.
  • the second conversion may be allowed when the DCT2 conversion core is used for horizontal and vertical conversion.
  • the second transform may be allowed only when the DCT2 transform core is used for transform in the horizontal direction and the transform in the vertical direction.
  • the second transform may be determined whether to perform the second transform based on the position of the last non-zero transform coefficient of the current block. For example, when at least one of the x-axis or y-axis coordinates of the last non-zero transformation coefficient of the current block is greater than the threshold value, or the x-axis or y-axis coordinates of the sub-block to which the last non-zero transformation coefficient of the current block belongs When at least one of them is greater than the threshold value, the second transformation may not be performed.
  • the threshold value may be predefined in an encoder and a decoder. Alternatively, the threshold value may be determined based on the size or shape of the current block.
  • the DC component represents a transform coefficient of the upper left position in the current block.
  • Whether to perform the second transform may be determined based on whether the joint prediction encoding mode is applied to the current block. For example, when the joint prediction encoding mode is applied to the current block, it may be set so that the second transform is not performed.
  • whether to perform the second transform may be determined based on at least one of the size, shape, intra prediction mode, or weight of the current block.
  • information indicating whether the second transform is performed on the current block may be set to be signaled.
  • the index lfnst_idx may be signaled.
  • whether to perform the second transform may be determined regardless of whether the joint prediction encoding mode is applied.
  • whether to allow the second transform may be determined based on whether the sub-partition intra coding method is applied to the current block. For example, when the sub-partition intra coding method is applied to the current block, it may be set so that the second transform is not applied to the current block.
  • the second transform when the sub-partition intra coding method is applied to the current block, the second transform may be set to be applicable. For example, when vertical partitioning or horizontal partitioning is applied to the current block, index information indicating whether the second transform is applied to the current block may be signaled. Whether to apply the second transform and/or a transform kernel may be determined based on the index information. On the other hand, when the sub-partition intra encoding method is not applied to the current block, encoding of index information may be omitted. Alternatively, when the sub-partition intra encoding method is not applied to the current block, whether to encode index information indicating whether to apply the second transform may be determined based on whether a preset condition is satisfied.
  • the preset condition may be related to at least one of the position of the non-zero coefficient, the number of the non-zero coefficient, or the size of the current block. For example, if the number of non-zero coefficients is more than one, the number of non-zero coefficients is one, but is not included in the upper left 4x4 area of the current block, or the non-zero coefficient is not included in the 4x4 area of the current block.
  • index information may be encoded and signaled. In the opposite case, encoding of index information may be omitted.
  • the value of the index information may be set to indicate that the second transformation is not applied.
  • whether to apply the second transform may be determined based on at least one of the size, width, height, or shape of the sub-block. For example, when at least one of the size, width, or height of the sub-block is smaller than a threshold value, it may be set so that the second transform is not applied. Specifically, when at least one of the size, width, or height of the sub-block is smaller than the threshold value, encoding of the index information may be omitted. Information indicating whether the second transform is performed may be signaled at the coding block level. It may be determined whether to apply the second transform to subblocks belonging to the coding block based on information signaled at the coding block level.
  • the threshold value may have a value predefined by an encoder and a decoder.
  • the threshold value may be set to 2, 4, or 8.
  • the threshold value may be determined based on at least one of the division direction of the current block or the number of subblocks included in the current block.
  • whether to encode a syntax indicating whether to apply the second transform may be determined using the parameters related to the current block for determining whether to apply the second transform.
  • a syntax indicating whether the second transform is applied can be omitted.
  • encoding of lfnst_flag or lfnst_idx may be omitted, and a value thereof may be derived to be 0. That is, when syntax encoding is omitted, the second transform may not be applied.
  • the second transformation may not be performed.
  • signaling of a syntax element indicating whether the second transformation has been performed may be omitted, and a value thereof may be derived to be 0.
  • Table 10 shows an example in which signaling of lfnst_idx is omitted in a block to which intra BDPCM is applied.
  • a syntax element indicating whether transform skip has been performed for example, signaling of transform_skip_flag may be omitted.
  • signaling of the flag transform_skip_flag may be omitted, and the value may be derived as 1. That is, when intra BDPCM is applied, transformation may not be applied to the current block.
  • neither the first transform nor the second transform may be applied. Accordingly, when the transformation of the current block is skipped, signaling of a syntax element indicating whether the second transformation has been performed may be omitted, and a value thereof may be derived to be 0. Consequently, when intra BDPCM is applied to the current block, signaling of the syntax element lfnst_idx indicating whether the second transformation has been performed may be omitted.
  • the second transformation may be performed on the upper left region of the current block.
  • the region to which the second transformation is to be applied may have a predefined size or a predefined shape.
  • the area to which the second transform is applied may have a square block shape such as 4x4 or 8x8, or an amorphous block shape such as 4x8 or 8x4.
  • N may be a natural number such as 2, 4, 8 or 16.
  • the variable N may be predefined in the encoder and decoder. Alternatively, the variable N may be determined based on the size and/or shape of the current block.
  • the area to be applied may be determined based on the number of transform coefficients. For example, according to a predetermined scan order, a predetermined number of transform coefficients may be determined as an application target area.
  • information for specifying the size and/or shape of the target region to be applied may be encoded and transmitted through a bitstream.
  • the information may include at least one of information indicating the size of the application target region or information indicating the number of 4x4 blocks included in the application target region.
  • the entire current block may be set as an application target area.
  • the entire current block may be set as a target for performing the second transformation.
  • the second transformation may be applied in a non-separable form. Accordingly, the second transform may be referred to as a non-seperable secondary transform (NSST).
  • NSST non-seperable secondary transform
  • the transform coefficients in the region to which the second transform is applied may be arranged in one column.
  • transform coefficients included in the application target region may be transformed into an input matrix having a size of N 2 ⁇ 1.
  • transform coefficients included in the region to be applied may be transformed into an input matrix having a size of 16x1.
  • transform coefficients included in the application target region may be transformed into an input matrix having a size of 64x1.
  • a separation and indivisible transform matrix may be applied to an input matrix generated by arranging transform coefficients included in the application target region in a line.
  • the size of the separation indivisible transformation matrix may be determined differently according to the size of the input matrix.
  • the size of input matrix may be a second conversion performed in the case of N 2 x1, N 2 based on the separation of an integral transformation matrix xN 2 size.
  • N 2 x1, N 2 based on the separation of an integral transformation matrix xN 2 size For example, when the size of the input matrix is 16x1, a separation indivisible transformation matrix having a size of 16x16 may be used, and when the size of the input matrix is 64x1, a separation indivisible transformation matrix having a size of 64x64 may be used.
  • a plurality of separation and indivisible transformation matrices may be stored in an encoder and a decoder. Information for specifying any one of a plurality of separation indivisible transformation matrices may be signaled through a bitstream.
  • the separation indivisible transformation matrix may be specified based on at least one of the size, shape, quantization parameter, intra prediction mode, or transformation type used in the first transformation of the current block.
  • candidates for the separation indivisible transformation matrix that can be used by the current block may be specified.
  • information indicating one of the plurality of separation indivisible transformation matrix candidates may be encoded and signaled.
  • a transformation matrix may be obtained by multiplying the separation indivisible transformation matrix and the input matrix.
  • Equation 6 shows an example of obtaining a transformation matrix A'.
  • T denotes a separation indivisible transformation matrix
  • A denotes an input matrix.
  • the components in the transformation matrix A' may be set as transformation coefficients of an NxN-sized block in the current block.
  • Transform coefficients in the residual region excluding the NxN-sized block may be set as default values.
  • transform coefficients of a region in which the second transform is not performed may be set to 0.
  • the second transformation may also be performed using a separation indivisible transformation matrix in which the number of rows is smaller than the number of columns.
  • a separation-indivisible transformation matrix having a size of (kxN 2 ) may be applied to an input matrix A having a size of (N 2 x1).
  • k may have a value smaller than N 2.
  • k may be N 2 /2, N 2 /4 or 3N 2 /4.
  • k can be called a reduction factor.
  • a transformation matrix having a size (kx1) smaller than the input matrix may be obtained.
  • a second transform in which a transform matrix having a size smaller than the input matrix is output may be referred to as a reduced second transform.
  • Equation 7 shows an application example of the reduced second transform.
  • R denotes a kxN 2 sized separation and indivisible transformation matrix.
  • a separation indivisible transformation matrix in which the number of rows k is less than the number of columns N 2 may be referred to as a reduced separation indivisible transformation matrix.
  • a R represents a transformation matrix of size kx1.
  • the transformation matrix A R having a size smaller than the input matrix A may be referred to as a reduced transformation matrix.
  • components in the reduced transformation matrix A R may be set as transformation coefficients of at least one MxM-sized blocks in the current block.
  • M may be a natural number smaller than N.
  • the number of blocks of MxM size may be determined according to the reduction factor k.
  • a transform coefficient of the residual region excluding at least one MxM sized block may be set to a default value. For example, the transform coefficients in the residual region may be set to 0.
  • 36 is a diagram illustrating an encoding aspect of a transform coefficient when the reduction factor is 16.
  • a transform matrix having a size of 16x1 may be obtained by transforming transform coefficients included in an 8x8-sized area to be applied into an input matrix having a size of 64x1, and using a matrix having a size of 16x64 to be separated and indivisible.
  • a transform matrix having a size of 16x1 may be set as a transform coefficient of a 4x4 block, and transform coefficients in other regions may be set to 0.
  • a transform matrix having a size of 32x1 may be set as a transform coefficient of an 8x4 block or a 4x8 block, and transform coefficients in other regions may be set to 0.
  • a transform matrix having a size of 48x1 may be set as transform coefficients of three 4x4 blocks, and transform coefficients in other regions may be set to 0.
  • the transform matrix may be set as a transform coefficient of a 4x4 block located at the upper left of the current block, a 4x4 block adjacent to the right of the upper left block, and a 4x4 block adjacent to the lower end of the upper left block.
  • the transformation matrix may be determined based on at least one of the size, shape, or intra prediction mode of the current block.
  • a transformation matrix set may be determined based on an intra prediction mode of a current block, and one of a plurality of transformation matrix candidates included in the transformation matrix set may be selected.
  • Index information specifying a transformation matrix applied to a current block among a plurality of transformation matrix candidates may be encoded and signaled.
  • the decoder may determine whether the second transform has been performed based on the position of the last residual coefficient other than 0. For example, when the position of the last residual coefficient is located outside the block in which the transform coefficient generated by the second transform is stored, it may be determined that the second transform has not been performed. That is, the decoder can perform the inverse transform on the second transform only when the last residual coefficient is located in the block in which the transform coefficient generated by the second transform is stored.
  • the threshold value may be a natural number such as 4, 8, or 16.
  • a reduced second transformation may be applied.
  • the second transform may be performed using a separation indivisible transform matrix having a size of 48x64, 32x64, or 16x64 for an area to be applied having a size of 8x8.
  • the size of the output matrix is larger than that of the input matrix.
  • the reduction factor k is 16
  • an output matrix having a size of 64x1 may be obtained by performing inverse transformation on an input matrix having a size of 16x1.
  • the coding block When the sub-partition intra coding method is applied to the coding block, the coding block may be divided into a plurality of sub-blocks. When the sub-partition intra coding method is applied to the coding block, it may be set so that the second transform is not applied.
  • whether to perform the second transformation may be determined based on the shape or size of the sub-partition. For example, when the coding block is divided into sub-partitions having a width or height of 4, the second transform may be applied. That is, only when the sub-partition has a 4xL or Lx4 type, the second transformation may be applied.
  • L represents an integer of 4 or more.
  • the second transformation may be applied only when the minimum value of the width and height of the sub-partition is equal to or greater than a predefined threshold.
  • the threshold value may be an integer such as 4, 8, or 16.
  • information indicating whether to apply the second transform may be signaled through the bitstream.
  • the sub-partition is 4xL or Lx4, or when the minimum value of the width and height of the sub-partition is greater than or equal to a threshold value, a syntax lfnst_idx indicating whether to perform the second transformation may be signaled.
  • encoding/decoding of information indicating whether or not the second change is applied may be omitted.
  • encoding/decoding of the syntax lfnst_idx may be omitted.
  • the value may be derived as 0.
  • the second transform may be applied to a sub-block at a predefined position in the coding block or a sub-block having a partition index smaller than a threshold value.
  • the partition index of the left sub-block may have a value smaller than that of the right sub-block, or the partition index of the upper sub-block may be set to have a smaller value than the partition index of the lower sub-block.
  • the second transform may be applied only to the first sub-block in the coding block.
  • the second transform may be applied to each of all sub-blocks.
  • whether or not the second transform is applied to each sub-block may be adaptively determined based on an attribute of each of the sub-blocks.
  • the attribute of the sub-block may include at least one of the number of residual coefficients included in the sub-block, whether a transform skip is applied to the sub-block, or a transform core applied to the sub-block.
  • the size of the region to which the second transform is applied may be determined based on the size of the sub-block. For example, a 4x4 sized block including 16 samples, 2 4x4 sized blocks including 32 samples, 3 4x4 sized blocks including 48 samples, or 4x4 sized block including 64 samples Four may be set as target regions to which the second transformation is applied. Depending on the size of the area to be applied, a general second transform may be applied or a reduced second transform may be applied.
  • the size of the region to which the second transform is to be applied may be determined based on the size of the sub-block. For example, when at least one of the width or height of the sub-block is smaller than the threshold value, an area including N samples may be set as a target area to which the second transform is applied. On the other hand, when the width and height of the sub-block are greater than or equal to the threshold value, an area including M samples may be set as a target area to which the second transform is applied.
  • M may be a natural number greater than N.
  • N may be 16 or 32
  • M may be 48 or 64.
  • the threshold value may be a natural number such as 2, 4, 8, or 16.
  • the region to which the second transform is applied may be set so as not to deviate from the boundary of the sub-block. That is, when the region to which the second transform is to be applied exists across two or more sub-blocks, it may be set so that the second transform is not performed.
  • 37 and 38 are diagrams illustrating an area to which the second transform is to be applied.
  • the coding block When horizontal partitioning is applied to a coding block having a size of 16x16, the coding block may be divided into subblocks having a size of 16x4. As in the illustrated example, when the sub-block has a size of Nx4 (N is an integer greater than 4), the height of the region to which the second transform is to be applied may be set so as not to exceed 4.
  • the area to be applied to the second transform may be set to a 4x4 or 8x4 size area.
  • the coding block When vertical partitioning is applied to a coding block having a size of 16x16, the coding block may be divided into subblocks having a size of 4x16. As in the illustrated example, when the sub-block has a size of 4xN (N is an integer greater than 4), it may be set such that the width of the area to be applied to the second transform does not exceed 4.
  • the area to be applied to the second transform may be set to a 4x4 or 4x8 sized area.
  • the decoder may decode the residual coefficient from the bitstream and apply inverse quantization to the residual coefficient to derive a transform coefficient.
  • the residual sample may be derived by performing a second inverse transform and a first inverse transform on the transform coefficient.
  • an application target region to which the second inverse transform is applied may be determined.
  • the size of the area to be applied to the second inverse transform may be set to be the same as the area to be applied to the second transform. For example, when the second transform is performed using a 16x16 split-indivisible transform matrix for a 4x4 area, the second inverse transform may also be applied to a 4x4 area.
  • the size of the area to which the second inverse transform is applied may have a value smaller than the size of the area to which the second transform is applied.
  • the second transform is performed using a 64x48 reduced transform matrix for an 8x8 area, the second transform is performed on an area including 48 samples (eg, three 4x4 blocks). Inverse transformation can be performed.
  • the decoder may determine an area to which the second inverse transform is applied based on the size of the current block.
  • the current block may represent a coding block or a transform block to which the second inverse transform is applied.
  • the application target area may be configured to include 16 samples.
  • the area to be applied may be configured to include 48 samples.
  • An input matrix may be generated by arranging transform coefficients included in the application target region in a line.
  • an input matrix may be generated based on transform coefficients of k reduction factors. For example, when the reduction factor k is 16, an input matrix may be generated based on transform coefficients included in an upper left block having a size of 4x4. When the reduction factor k is 32, an input matrix may be generated based on transform coefficients included in an upper left block and a 4x4 neighboring block adjacent to the right or lower portion of the upper left block.
  • an input matrix may be generated based on transform coefficients of an upper left block, a 4x4 sized neighboring block adjacent to the right side of the upper left block, and a neighboring block adjacent to a lower end of the upper left block.
  • the reduction factor k may be predefined in an encoder and a decoder. Alternatively, information for determining the reduction factor k may be signaled through the bitstream. Alternatively, the reduction factor k may be determined based on the size or shape of the current block.
  • a transform matrix may be obtained by multiplying the input matrix and the inseparable inverse transform matrix.
  • the separation indivisible inverse transformation matrix may be a symmetric matrix of the separation indivisible transformation matrix shown in Equations 6 to 7.
  • Equations 8 and 9 show an example of acquiring a transformation matrix by using a separation indivisible inverse transformation matrix.
  • a transform matrix may be derived by multiplying the input matrix A by the inseparable inverse transform matrix T T.
  • a 16x1 transform matrix may be derived by multiplying the 16x16 inverse transform matrix T T and the 16x1 input matrix A.
  • the components in the transformation matrix A' may be set as transformation coefficients of an NxN-sized block in the current block.
  • a transform matrix having a size of 16x1 may be set as a transform coefficient of a 4x4 block.
  • the transformation matrix A' may be derived by multiplying the input matrix A by the reduced separation indispensable inverse transformation matrix R T.
  • a 64x1 transform matrix may be derived by multiplying a 64x16 reduced inseparable inverse transform matrix R T and a 16x1 input matrix A.
  • a 64x1 transform matrix may be derived by multiplying the reduced split-integral inverse transform matrix R T having a size of 64x32 and an input matrix A having a size of 32x1.
  • a transformation matrix having a size of 48x1 may be derived by multiplying the reduced split-integral inverse transform matrix R T having a size of 64x48 and an input matrix A having a size of 48x1.
  • the components in the transformation matrix A' may be set as transformation coefficients of an NxN-sized block in the current block.
  • a transform matrix having a size of 64x1 may be set as a transform coefficient of an 8x8 block.
  • the separation indivisible inverse transform matrix may be determined based on at least one of index information signaled from a bitstream, a size of a current block, or an intra prediction mode.
  • the size of the separation indivisible inverse transform matrix may be determined based on the size of the current block
  • the separation indivisible inverse transform matrix set may be determined based on the intra prediction mode of the current block.
  • the set of separation indivisible inverse transformation matrixes may include a plurality of separation indivisible inverse transformation matrix candidates. In this case, at least one of the types or the number of candidates for the inverse transformation matrix may be different between sets of separation indivisible inverse transformation matrices having different indexes.
  • Table 11 shows an example of determining a set of inverse separation and indivisible transforms based on an intra prediction mode.
  • predModeIntra denotes an index of an intra prediction mode
  • lfnstTrSetIdx denotes an index of a separation indivisible inverse transform set.
  • predModeIntra lfnstTrSetIdx predModeIntra ⁇ 0
  • predModeIntra ⁇ 1 0
  • predModeIntra ⁇ 12
  • predModeIntra ⁇ 23
  • predModeIntra ⁇ 44 3
  • predModeIntra ⁇ 55 2 56
  • predModeIntra ⁇ 80
  • predModeIntra ⁇ 80
  • predModeIntra ⁇ 80
  • predModeIntra ⁇ 83 0
  • a set of separation indivisible inverse transform matrices having an index of 0 may be selected. Thereafter, based on the size of the current block and the value of lfnst_idx, the separation indivisible inverse transform matrix may be determined.
  • Table 11 may be simplified as shown in Table 12 below.
  • a set of separation indivisible inverse transform matrices may be selected by considering only whether the intra prediction mode is directional or non-directional.
  • Table 13 shows an example in which a set of separation indivisible inverse transform matrices is determined based on whether the intra prediction mode is directional or non-directional.
  • a set of separation indivisible inverse transform matrices may be determined using one of the plurality of lookup tables.
  • one of Tables 11 to 13 may be selectively used.
  • Information specifying one of a plurality of lookup tables may be signaled through a bitstream.
  • the information may be signaled at the sequence, picture, slice, or block level.
  • one of the plurality of lookup tables may be selected based on at least one of the size, shape of the current block, or a transform core applied at the time of the first transform.
  • an inverse transform matrix having a predefined size When using an inverse transform matrix having a predefined size, it may be set not to use a method of determining a set of separation indivisible inverse transform matrices based on an intra prediction mode. As an example, when a 48x16 inverse transform matrix is to be used, a process of determining a separation indivisible inverse transform matrix set based on an intra prediction mode may be omitted.
  • each of the separation indivisible transformation matrix candidates may have at least one of a size or a coefficient different from each other.
  • 39 is an example of various separation indivisible transformation matrix candidates.
  • the 4x4 sub-block is a target to which the second inverse transform is applied.
  • a transform matrix having a size of 64x1 can be derived by using a matrix of inverse separation of a size of 64x16.
  • the derived transform matrix may be set with transform coefficients of an 8x8 size block.
  • a transformation matrix having a size of 32 ⁇ 1 may be derived using a matrix of inverse separation of a size of 32 ⁇ 16.
  • the derived transform matrix may be set with transform coefficients of a 4x8 or 8x4 size block.
  • a transformation matrix having a size of 48x1 may be derived by using a matrix of inverse separation of a size of 48x16.
  • the derived transform matrix may be set with transform coefficients of three 4x4 sized blocks. Among these three 4x4 sized blocks, non-zero transform coefficients exist in the upper left block, and the values of intra-block transform coefficients may all be set to zero in other blocks.
  • a separation indivisible inverse transform matrix to be applied to the current block may be determined.
  • the sub-partition intra coding method when it is applied to the current block, it may be set to apply a 32x16-sized inseparable inverse transform matrix.
  • the types or the number of candidates for the separation indivisible inverse transform matrix may be determined differently.
  • a 32x16 inseparable inverse transform matrix may be used as a candidate only when the sub-partition intra coding method is applied to the current block.
  • the size or shape of the block induced as a result of performing the second inverse transform may be different depending on the size or shape of the sub-partition. have.
  • a transformation matrix of size 32x1 obtained as a result of performing the second inverse transform may be set as transform coefficients of a size of 4x8 block.
  • a transform matrix of size 32x1 obtained as a result of performing the second inverse transform may be set as transform coefficients of the block size of 8x4.
  • the second inverse transform and the first inverse transform may be applied to each of a plurality of sub-blocks included in the current block.
  • the second inverse transform and the first inverse transform may be applied to a sub-block at a predefined position among a plurality of sub-blocks or a sub-block having a partition index smaller than a threshold value.
  • the second transform may be applied only to the sub-partition positioned at the top of the current block or the sub-partition positioned at the leftmost of the current block, and the second transform may not be applied to the remaining sub-partition.
  • the area to which the second inverse transform is applied may be determined to have a size of 4x4.
  • the size of the application target region may be adaptively determined according to the size of the sub-block. For example, when the minimum value of the width and height of the sub-partition is 4, a 4x4 area may be set as an application target area.
  • an 8x4 sized area may be set as an application target area.
  • N represents an integer of 8 or more.
  • An input matrix may be generated by arranging transform coefficients included in the application target region in the sub-block in a line. For example, when the target area to be applied is set to have a size of 4x4, transform coefficients included in the target area to be applied may be transformed into an input matrix having a 16x1 format. Alternatively, when the target area to be applied is set to a size of 4x8 or 8x4, transform coefficients included in the target area to be applied may be transformed into a 32x1 input matrix.
  • the transformation matrix can be derived by multiplying the input matrix by the separation and indivisible transformation matrix.
  • a 16x1 transform matrix may be obtained by multiplying a 16x16 sized inseparable transform matrix and a 16x1 sized input matrix.
  • a transformation matrix having a size of 32x1 may be obtained by multiplying a 32x32 sized inseparable transform matrix and an input matrix having a size of 32x1.
  • components in the transformation matrix may be set as transformation coefficients of the sub-block.
  • a 16x1 transform matrix may be set as transform coefficients of an upper left 4x4 block.
  • a transform matrix having a size of 32x1 may be set as transform coefficients of a block having a size of 4x8 or 8x4 in the upper left corner.
  • a predefined transform core may be applied to transform in the horizontal direction and the transform in the vertical direction of the sub-block.
  • a transform core in a horizontal direction and a transform core in a vertical direction of a sub-block to which the second inverse transform is applied may be set to DCT2.
  • Whether to allow the second transform may be determined based on whether the sub transform block encoding method is applied to the coding block. For example, when the sub-transform block encoding method is applied to the coding block, it may be set so that the second transform is not applied.
  • the second transform may be set to be used only in at least one available sub-block among the plurality of sub-blocks.
  • the available sub-block may refer to a block in which the first transformation has been performed among a plurality of sub-blocks.
  • the size of the area to be applied to the second transform in the sub-block may be determined according to the size or shape of the sub-block. For example, when at least one of the height or width of the sub-block is smaller than the threshold value, the second transformation may be performed on a 4x4 area. On the other hand, when at least one of the height or height of the sub-block is equal to or greater than the threshold value, the second transformation may be performed on the 8x8 area.
  • Whether or not the second transform is applied to the sub-block may be determined based on at least one of the size, shape, location, or partition index of the sub-block. As an example, the second transform may be applied only to a subblock including an upper left sample of the coding block. Alternatively, the second transformation may be applied only when at least one of the height or width of the sub-block is greater than the threshold value.
  • information indicating whether the second transform is applied to the sub-block may be signaled through the bitstream.
  • the sub-transform block encoding method When the sub-transform block encoding method is applied, it may be set so that the reduced second transform is not allowed. Alternatively, even when the sub-transform block encoding method is applied, whether to perform the reduced second transform may be determined based on at least one of the size or shape of the sub-block.
  • the reconstructed sample of the sub-block on which the transformation is performed may be derived from the sum of the prediction sample and the residual sample.
  • a prediction sample may be set as a reconstructed sample.
  • Quantization is to reduce the energy of a block, and the quantization process includes a process of dividing a transform coefficient by a specific constant value.
  • the constant value may be derived by a quantization parameter, and the quantization parameter may be defined as a value between 1 and 63.
  • the in-loop filter may include at least one of a deblocking filter, a sample adaptive offset filter (SAO), or an adaptive loop filter (ALF).
  • a reconstructed block before the in-loop filter is applied is referred to as a first reconstructed block
  • a reconstructed block after the in-loop filter is applied is referred to as a second reconstructed block.
  • a second reconstructed block may be obtained by applying at least one of a deblocking filter, an SAO, or an ALF to the first reconstructed block.
  • SAO or ALF may be applied after the deblocking filter is applied.
  • one picture is divided into a plurality of regions, and a plurality of regions are encoded/decoded in parallel. You can consider a plan. Specifically, the picture may be divided into tiles or slices (or tile groups) according to the processing purpose.
  • a tile represents a basic unit of parallel encoding/decoding. Each tile can be processed in parallel.
  • the tile can have a rectangular shape. Alternatively, it is possible to allow non-rectangular shaped tiles.
  • Information indicating whether a non-rectangular type tile is allowed or whether a non-rectangular type tile is present may be signaled through the bitstream.
  • encoding/decoding a tile When encoding/decoding a tile, it may be set not to use data of another tile. By removing inter-tile encoding/decoding dependency, it is possible to support parallel processing of tiles. Specifically, a probability table of a context adaptive binary arithmetic coding (CABAC) context may be initialized for each tile, and an in-loop filter may not be applied at the boundaries of tiles.
  • CABAC context adaptive binary arithmetic coding
  • data in other tiles may not be used as candidates for motion vector derivation.
  • data in another tile may be set not to be used as a merge candidate, a motion vector prediction candidate (AMVP candidate), or a motion information candidate.
  • data in other tiles can be set not to be used for symbol context calculation.
  • Image encoding/decoding information may be signaled through the slice header.
  • Information signaled through the slice header may be commonly applied to coding tree units or tiles included in the slice.
  • Slices may also be referred to as tile groups.
  • FIG. 40 is a diagram illustrating a picture segmentation method according to an embodiment of the present invention.
  • the processing unit may include at least one of a tile or a slice.
  • the syntax no_pic_partition_flag indicating whether the current picture is divided into a plurality of tiles or slices may be signaled through the bitstream.
  • the value of the syntax no_pic_partition_flag is 0, it indicates that the current picture is divided into at least one tile or at least one slice.
  • the value of the syntax no_pic_partiton_flag is 1, it indicates that the current picture is not divided into a plurality of tiles or a plurality of slices.
  • the process of dividing the current picture may be terminated.
  • the current picture is composed of one tile and one slice (or tile group).
  • information indicating whether a plurality of tiles exist in the picture may be signaled through a bitstream.
  • the information may include at least one of a 1-bit flag indicating whether a plurality of tiles exist in the picture or information specifying the number of tiles in the picture. Only when it is determined that there are a plurality of tiles in the picture, a picture dividing process described below may be performed.
  • tile division information may be signaled through a bitstream.
  • the picture may be divided into at least one tile based on the signaled tile division information (S4002).
  • a slice may be determined by merging a plurality of tiles or dividing one tile (S4003).
  • 41 shows an example in which a picture is divided into a plurality of tiles.
  • a tile may include at least one coding tree unit.
  • the boundary of the tile may be set to coincide with the boundary of the coding tree unit. That is, a split type in which one coding tree unit is divided into a plurality may not be allowed.
  • the height of adjacent tiles or the width of adjacent tiles may be set to have the same value.
  • the heights of tiles belonging to the same tile row and/or the widths of tiles belonging to the same tile column may be set to be the same.
  • Tiles belonging to the same tile row may be referred to as a horizontal tile set, and tiles belonging to the same tile column may be referred to as a vertical tile set.
  • information indicating whether the width and/or height of the tile to be encoded/decoded is set equal to the width and/or height of the previous tile may be signaled.
  • Information indicating the division type of the picture may be signaled through a bitstream.
  • the information may be encoded and signaled through a picture parameter set, a sequence parameter set, or a slice header.
  • the information indicating the division type of the picture may include at least one of information indicating whether tiles are divided into equal sizes, information indicating the number of tile columns, or information indicating the number of tile rows.
  • the number of tile columns represents the number of vertical direction tile sets
  • the number of tile rows represents the number of horizontal direction tile sets.
  • each of the tiles belongs to a different column and/or row.
  • information indicating the number of tile columns and/or the number of tile rows may be signaled.
  • information num_tile_row_minus1 indicating the number of tile rows generated by dividing a picture and information num_tile_column_minus1 indicating the number of tile columns may be signaled through a bitstream.
  • the syntax num_tile_row_minus1 represents a value obtained by subtracting 1 from the number of tile rows
  • the syntax num_tile_column_minus1 represents a value obtained by subtracting 1 from the number of tile columns.
  • num_tile_columns_minus1 may represent 3
  • num_tile_rows_minus1 may represent 2.
  • a syntax indicating a width of each tile column and a syntax indicating a height of each tile row may be signaled through a bitstream.
  • tile_cols_width_minus1[i] may represent the width of the i-th tile column
  • tile_rows_height_minus[j] may represent the height of the j-th tile row.
  • the syntax tile_cols_width_minus1[i] represents a value obtained by subtracting 1 from the number of coding tree unit columns constituting the i-th tile column. For the last tile column, signaling of the syntax tile_cols_width_minus1[i] may be omitted.
  • the width of the last tile column may be derived by differentiating the width of the previous tile columns from the width of the current picture.
  • the syntax tile_rows_height_minus1[j] represents a value obtained by subtracting 1 from the number of coding tree unit rows constituting the j-th tile row. For the last tile row, signaling of the syntax tile_rows_height_minus1[j] may be omitted.
  • the height of the last tile row may be derived by differentiating the height of previous tile rows from the height of the current picture.
  • information indicating the number of tile columns for which width information is explicitly signaled through the bitstream and/or information indicating the number of tile rows for which height information is explicitly signaled through the bitstream may be signaled.
  • Table 14 shows a syntax table including the above information.
  • the syntax num_exp_tile_columns_minus1 derived by subtracting 1 from the number of tile columns whose width information is explicitly signaled may be signaled through the bitstream.
  • width information tile_column_width_minus1[i] may be signaled as much as the determined number.
  • i may have a value between 0 and num_exp_tile_columns_minus1.
  • the width of the tile column whose index k is less than or equal to num_exp_tile_columns_minus1 may be determined based on the syntax tile_column_width_minus1[k] signaled for the corresponding tile column. Specifically, the width of a tile column whose index k is less than or equal to num_exp_tile_columns_minus1 may be determined by multiplying the width of the coding tree unit by a value derived by adding 1 to the value of the syntax tile_column_width_minus1[k].
  • the width of the tile column in which the index k is greater than num_exp_tile_columns_minus1 may be determined based on the last signaled width information and the number of residual coding tree unit columns in the picture. For example, the width of the tile column derived by the last signaled width-related syntax tile_column_width_minus1[num_exp_tile_columns_minus1] is LastColWidth (that is, tile_column_width_minus1[num_exp_tile_columns_minus1] + 1), and the remaining tiles excluding the remaining tile areas occupied by the current picture. When the number of coding tree unit columns is remainingWidthInCtbY, the width of the k-th tile column may be set to a smaller value of LastColWidth and remainingWidthInCtbY.
  • Table 15 is an example of a process for determining the width of a tile column.
  • the variable PicWidthInCtbsY represents the total number of coding tree unit columns in a picture.
  • the variable PicWidthInCtbsY may be derived based on Equation 10 below.
  • pic_width_in_luma_samples represents the number of horizontal luma samples in a picture.
  • the variable CtbSizeY may be a value indicating the size of a coding tree unit.
  • variable remaining WidthInCtbY can be derived from the variable PicWidthInCtbsY by differentiating the cumulative amount of the widths of previous tile columns.
  • the syntax num_exp_tile_rows_minus1 derived by subtracting 1 from the number of tile rows whose height information is explicitly signaled may be signaled through a bitstream.
  • height information tile_row_height_minus1[i] may be signaled as much as the determined number.
  • i may have a value between 0 and num_exp_tile_rows_minus1.
  • the height of a tile row whose index k is less than or equal to num_exp_tile_rows_minus1 may be determined based on the syntax tile_row_Height_minus1[k] signaled for the corresponding tile row. Specifically, the height of a tile row whose index k is less than or equal to num_exp_tile_rows_minus1 may be determined by multiplying the height of the coding tree unit by a value derived by adding 1 to the value of the syntax tile_row_Height_minus1[k].
  • the height of a tile row having an index k greater than num_exp_tile_rows_minus1 may be determined based on the last signaled height information and the number of residual coding tree unit rows in the picture.
  • the height of the tile row derived by the last signaled height-related syntax tile_row_height_minus1[num_exp_tile_rows_minus1] is LastRowHeight (that is, tile_row_height_minus1[num_exp_tile_rows_minus1] + 1), and previous tile rows excluding the currently occupied area are occupied.
  • the height of the k-th tile row may be set to a smaller value of LastColHeight and remainingHeightInCtbY.
  • Table 16 is an example describing the process of determining the height of the tile row.
  • variable PicHeightInCtbsY represents the total number of coding tree unit rows in a picture.
  • the variable PicHeightInCtbsY may be derived based on Equation 11 below.
  • pic_height_in_luma_samples represents the number of vertical luma samples in a picture.
  • the variable CtbSizeY may be a value indicating the size of a coding tree unit.
  • variable remaining heightInCtbY can be derived from the variable PicHeightInCtbsY by differentiating the cumulative amount of the heights of previous tile rows.
  • each of the four tile columns is composed of two coding tree unit columns. Accordingly, for only the first tile column, the syntax tile_column_width_minus1[0] is set to 1 to signal, and the widths of the remaining tile columns may be set equal to tile_column_width_minus1[0]. Since the number of the signaled syntax tile_column_width_minus1 is 1, a value of the syntax num_exp_tile_columns_minus1 may be set to 0.
  • a first tile row is composed of three coding tree unit rows
  • a second tile row and a third tile row are composed of two coding tree unit rows. Since the height of the third tile row can be derived based on the height information of the second tile row, height information can be signaled only for the first tile row and the second tile row.
  • the signal may be performed by setting the syntax tile_row_height_minus1[0] for the first tile row to 2, and signaling by setting the syntax tile_row_height_minus1[1] for the second tile row to 1. Since the number of the signaled syntax tile_row_width_minus1 is 2, a value of the syntax num_exp_tile_rows_minus1 may be set to 1.
  • information indicating the size of the coding tree unit may be signaled through a sequence parameter set or a picture parameter set.
  • One tile may consist of at least one coding tree unit.
  • the remaining tiles excluding the tiles adjacent to the right or lower boundary of the picture may be set not to include an area smaller than the coding tree unit. That is, the boundary of the tile matches the boundary of the coding tree unit.
  • the syntax loop_filter_across_tiles_enabled_flag indicates whether it is allowed to apply an in-loop filter at the boundaries of tiles in a picture referencing the picture parameter set.
  • the in-loop filter may include at least one of a deblocking filter, ALF, or SAO.
  • a value of 1 of the flag loop_filter_across_tiles_enabled_flag indicates that an in-loop filter crossing the boundary of tiles in a picture referring to the picture parameter set can be applied.
  • the value of the flag loop_filter_across_tiles_enabled_flag is 0, it indicates that it is not allowed to apply the in-loop filter at the boundaries of tiles in the picture referencing the picture parameter set.
  • the syntax loop_filter_across_slices_enabled_flag indicates whether it is allowed to apply an in-loop filter at the boundary of slices in a picture referring to the picture parameter set.
  • the in-loop filter may include at least one of a deblocking filter, ALF, or SAO.
  • a value of 1 of the flag loop_filter_across_slices_enabled_flag indicates that an in-loop filter crossing the boundary of slices in a picture referring to the picture parameter set can be applied.
  • the value of the flag loop_filter_across_slices_enabled_flag is 0, it indicates that the in-loop filter is not allowed to be applied at the boundary of the slices in the picture referring to the picture parameter set.
  • Table 17 illustrates a syntax table including a flag no_pic_partiiton_flag indicating whether a picture is divided into a plurality of regions.
  • flag no_pic_partiton_flag When the flag no_pic_partiton_flag is 1, it indicates that the picture or subpicture is not divided into a plurality of tiles or a plurality of slices.
  • the value of the flag no_pic_partition_flag is 1, encoding of the syntax related to the tile division structure and/or the slice division structure may be omitted.
  • no_pic_partiton_flag when no_pic_partiton_flag is 0, it indicates that the picture or subpicture can be divided into a plurality of tiles or a plurality of slices.
  • the syntax pps_log2_ctu_size_minus5 for determining the size of the coding tree unit may be signaled.
  • a rectangular area composed of a plurality of coding tree units may be defined as one tile. That is, it may be set so that one coding tree unit is not defined as one tile.
  • the range of the syntax tile_row_height_minus1 may be determined according to the value of the syntax tile_column_width_minus1, or the range of the syntax tile_column_width_minus1 may be determined according to the value of the syntax tile_row_height_minus1.
  • tile_row_height_minus1 indicating the height of the tile must have a value greater than 0. That is, when the syntax tile_column_width_minus1 is encoded and signaled before the syntax tile_row_height_minus1, and the value of the syntax tile_column_width_minus1 is 0, the syntax tile_row_height_minus1 must be set to a value of 1 or more.
  • the syntax tile_column_width_minus1 when the syntax tile_row_height_minus1 is encoded and signaled before the syntax tile_column_width_minus1, and the value of the syntax tile_row_height_minus1 is 0, the syntax tile_column_width_minus1 must be set to a value of 1 or more.
  • the number of coding tree rows included in the tile must be plural. That is, when the value of the syntax tile_column_width_minus1[i] representing the width of the i-th tile is 0, the value of the syntax tile_row_height_minus1[i] representing the height of the i-th tile must be set to 1 or more.
  • the number of coding tree columns included in the tile must be plural. That is, when the value of the syntax tile_row_height_minus1[i] representing the height of the i-th tile is 0, the value of the syntax tile_row_height_minus1[i] representing the width of the i-th tile should be set to 1 or more.
  • each syntax may be defined as shown in Table 18 below.
  • tile_column_width_minus1 [i] plus 1 specifies the width of the i-th tile column in units of CTBs for i in the range of 0 to num_exp_tile_columns_minus1-1, inclusive.
  • tile_column_width_minus1[ num_exp_tile_columns_minus1] is used to derive the width of the tile columns with index greater than or equal to num_exp_tile_columns_minus1 as specified in clause 6.5.1.
  • the value of tile_column_width_minus1[ 0] is inferred to be equal to PicWidthInCtbsY-1.
  • tile_row_height_minus1 [i] plus 1 specifies the height of the i-th tile row in units of CTBs for i in the range of 0 to num_exp_tile_rows_minus1 -1, inclusive.
  • tile_row_height_minus1[ num_exp_tile_rows_minus1] is used to derive the height of the tile rows with index greater than or equal to num_exp_tile_rows_minus1 as specified in clause 6.5.1.
  • tile_row_height_minus1[ 0] When not present, the value of tile_row_height_minus1[ 0] is inferred to be equal to PicHeightInCtbsY-1.When one of the values of tile_column_width_minus1[ i] is equal to 0, all values of tile_row_height_minus1[ i] shall be greater than or equal to One.
  • each syntax can be defined as shown in Table 19 below.
  • tile_column_width_minus1 [i] plus 1 specifies the width of the i-th tile column in units of CTBs for i in the range of 0 to num_exp_tile_columns_minus1-1, inclusive.
  • tile_column_width_minus1[ num_exp_tile_columns_minus1] is used to derive the width of the tile columns with index greater than or equal to num_exp_tile_columns_minus1 as specified in clause 6.5.1.
  • tile_column_width_minus1[ 0] When not present, the value of tile_column_width_minus1[ 0] is inferred to be equal to PicWidthInCtbsY-1.When one of the values of tile_row_height_minus1 [i] is equal to 0, all values of tile_column_width_minus1 [i] shall be greater than or equal to 1.
  • tile_row_height_minus1 [i] plus 1 specifies the height of the i-th tile row in units of CTBs for i in the range of 0 to num_exp_tile_rows_minus1-1, inclusive.
  • tile_row_height_minus1[ num_exp_tile_rows_minus1] is used to derive the height of the tile rows with index greater than or equal to num_exp_tile_rows_minus1 as specified in clause 6.5.1.
  • the value of tile_row_height_minus1[ 0] is inferred to be equal to PicHeightInCtbsY-1.
  • syntax tile_row_height_minus2[i] may be encoded.
  • the syntax tile_row_height_minus2[i] may be derived by dividing 2 from the number of coding tree unit rows included in the i-th tile.
  • syntax tile_column_width_minus2[i] may be encoded.
  • the syntax tile_column_width_minus2[i] may be derived by dividing 2 from the number of coding tree unit columns included in the i-th tile.
  • At least one tile may be defined as one processing unit.
  • a plurality of tiles may be defined as one slice.
  • Slices may also be referred to as tile groups.
  • one tile may be divided into a plurality of processing units.
  • one tile may be divided into a plurality of slices.
  • one slice may include at least one row of coding tree units.
  • information indicating the height of each slice may be signaled through a bitstream.
  • At least one of the four surfaces constituting the slice may coincide with a picture boundary and/or a tile boundary.
  • a left boundary or an upper boundary of a slice may be set to coincide with a left boundary or an upper boundary of a picture.
  • at least one of the four sides of the slice may be located at the boundary of the tile.
  • Image encoding/decoding information may be signaled through the slice header.
  • Information signaled through the slice header may be commonly applied to tiles and/or blocks belonging to the slice.
  • Information indicating the slice type may be signaled through a bitstream.
  • the information indicates a method of defining a slice in a current picture.
  • a syntax rect_slice_flag indicating a slice type may be signaled through a bitstream.
  • rec_slice_flag indicates whether a slice is defined based on the raster scan order of tiles or whether a slice is defined in a rectangular shape. For example, when rec_slice_flag is 0, it indicates that a slice is defined based on the raster scan order of tiles. On the other hand, when rec_slice_flag is 1, it indicates that a slice is defined in a square shape.
  • the definition method based on raster scan is for defining at least one or more tiles as a slice after specifying at least one or more tiles according to a raster scan order. If the definition method based on raster scan is followed, one or more consecutive tile(s) may be defined as a slice. In this case, consecutive tiles may be determined according to the raster scan order. When a raster scan slice is applied, a non-rectangular slice may be generated.
  • information indicating the number of tiles included in each slice may be signaled.
  • signaling of information indicating the number of tiles included in the slice may be omitted.
  • the widths or heights of the tiles included in the slice may be different.
  • the square-shaped slice definition method is a division method that allows only rectangular-shaped slices.
  • tiles located at four corners of the slice belong to the same row or the same column.
  • one tile may be divided into a plurality of square-shaped slices.
  • a square-shaped slice definition method eg, when rect_slice_flag is 1
  • information indicating whether a picture is composed of a single slice may be signaled.
  • a syntax one_slice_in_pic_flag indicating whether the number of slices in a picture is one may be signaled through a bitstream.
  • the flag one_slice_in_pic_flag is 1, it indicates that the picture is composed of one slice.
  • the flag one_slice_in_pic_flag is 0, it indicates that the picture is composed of at least two or more slices.
  • information indicating whether each of the subpictures is composed of one slice may be signaled.
  • a flag single_slice_per_subpic indicating whether each of the subpictures is composed of one slice may be signaled.
  • the flag single_slice_per_subpic is 1, it indicates that each subpicture is composed of a single slice.
  • the slice division structure may be determined in the same manner as the subpicture division structure determined with reference to the sequence parameter set.
  • single_slice_per_subpic when single_slice_per_subpic is 0, it indicates that the subpicture division structure and the slice division structure are different.
  • the value of the flag single_slice_per_subpic information for determining the slice splitting structure may be additionally signaled.
  • the size of the slice may be determined based on the number of tile columns and/or the number of tile rows included in the slice.
  • the syntax slice_height_in_tiles_minus1[i] indicating the height of the i-th slice may be signaled through a bitstream.
  • the syntax slice_height_in_tiles_minus1[i] may represent a value obtained by subtracting 1 from the number of tile rows included in the i-th slice. In this case, the height of the i-th slice may be derived by summing the heights of each of the tile rows included in the i-th slice.
  • the syntax slice_width_in_tiles_minus1[i] indicating the width of the i-th slice may be signaled through the bitstream.
  • the syntax slice_width_in_tiles_minus1[i] may represent a value obtained by subtracting 1 from the number of tile columns included in the i-th slice. In this case, it may be derived by summing the width of the i-th slice and the height of each of the tile columns included in the i-th slice.
  • FIG. 42 is a diagram for describing an aspect in which slice size information is signaled.
  • a slice with an index of 4 (slice 4) is composed of two tile columns and two tile rows. Accordingly, the syntax slice_width_in_tiles_minus1[4] representing the slice width for slice 4 and the syntax slice_height_in_tiles_minus1[4] representing the slice height may be set to 1, respectively.
  • One tile can be divided into a plurality of slices.
  • one tile may be divided into a plurality of slices using at least one vertical line.
  • width information and height information for the i-th slice may be set to 0, respectively.
  • the syntax slice_width_in_tiles_minus1[i] representing the width of the i-th slice and the syntax slice_slice_in_tiles_minus1[i] representing the height of the i-th slice are all 0, the syntax num_slices_in_tiles_minus1[i] representing the number of slices included in the tile is Can be signaled.
  • the syntax num_slices_in_tiles_minus1[i] represents a value obtained by subtracting 1 from the number of slices included in the tile.
  • the syntax slice_height_in_ctu_minus1[i][j] may be derived by dividing 1 from the number of coding tree unit rows included in the j-th slice in the corresponding tile. For the last slice in the corresponding tile, encoding of the syntax slice_height_in_ctu_minus1 may be omitted. The height of the last slice may be determined based on the height of the remaining coding tree unit rows in the tile.
  • difference information for specifying an index of a tile included in a slice may be encoded and signaled.
  • the syntax tile_idx_delta[i] indicating a difference between the index of the predetermined position tile in the i+1th slice and the index of the predetermined position tile in the i-th slice may be encoded.
  • the predetermined location tile may be an upper left tile or a lower right tile within a slice.
  • encoding of the difference information may be omitted.
  • information indicating a sign of the difference information may be further encoded and signaled.
  • the syntax tile_idx_delta_sign[i] indicating whether the value of the syntax tile_idx_delta[i] is positive or negative may be signaled through the bitstream.
  • encoding of the syntax tile_idx_delta_sign[i] may be omitted in the first slice.
  • the absolute value of the tile index difference between the i-th and i+1-th slices always has a value greater than 1. Accordingly, the syntax tile_idx_delta_minus1[i] derived by dividing 1 from the absolute value of the tile index difference between the i-th slice and the i+1-th slice may be encoded and signaled.
  • Table 20 illustrates a syntax table including difference information.
  • one tile includes a plurality of slices
  • the plurality of slices are all included in the same tile, and a tile index difference value between the plurality of slices is 0. Accordingly, encoding of a difference value between a plurality of slices included in one tile may be omitted. Since the encoding of difference information between slices belonging to the same tile is omitted, the syntax tile_idx_delta_minus1[i] may always be set to a value of 0 or more.
  • difference information may be encoded for only one of the plurality of slices.
  • the syntax tile_idx_delta_minus1[i] may be encoded only for the first slice or the last slice among a plurality of slices included in one tile.
  • the i-th slice which is specified by the syntax tile_idx_delta_minus1[i] represents the first or the last slice among a plurality of slices belonging to the first tile, and the i+1-th slice is a second different from the first tile. Represents a slice including a tile.
  • the syntax tile_idx_delta_sign[i] represents the sign of the tile index difference value.
  • the code of the tile index difference value TileIdxDeltaSign may be determined as in Equation 12 below.
  • the tile index difference may be derived by multiplying the absolute value of the tile index difference (eg, tile_idx_delta_minus1[i]+1) derived by the syntax tile_idx_delta_minus1[i] by a code value derived by the syntax tile_idx_delta_sign[i].
  • the syntax tile_idx_delta_sign[i ] May be omitted.
  • its value may be considered to be 1.
  • encoding of the sign information of the tile index difference value may be omitted, and the tile index difference value may be set to always have a positive value.
  • Whether to encode the tile index difference information may be determined based on the location of the slice.
  • Table 21 exemplifies an example in which it is determined whether to parse the tile index difference information based on the slice position.
  • variable tileIdx represents the index of the upper left tile in the i-th tile.
  • the value of the syntax tile_idx_delta_minus1[i] may be regarded as the same as the value of the syntax slice_width_in_tiles_minus1[i].
  • the syntax tile_idx_delta_sign[i] indicating the sign of the tile index difference value Encoding/decoding may be omitted.
  • a value of the syntax tile_idx_delta_sign[i] may be considered as 1.
  • the tile to which the i-th slice belongs includes a plurality of slices, it has been illustrated that information indicating the number of slices belonging to the tile and height information of each of the slices are signaled.
  • the height information is signaled with information on the number of slices for which height information is explicitly signaled, and then the height information is signaled only as much as the number indicated by the number information. You can ring.
  • Table 22 illustrates a syntax table including information on the number of height information to be explicitly signaled.
  • rect_slice_flag u(1) if( rect_slice_flag) single_slice_per_subpic_flag u(1) if( rect_slice_flag && !single_slice_per_subpic_flag) ⁇ num_slices_in_pic_minus1 ue(v) tile_idx_delta_present_flag u(1) multiple_slices_in_tile_present_flag u(1) for( i 0; i ⁇ num_slices_in_pic_minus1; i++) ⁇ if (multiple_slice_in_tile_present_flag) multiple_slices_in_tile_flag[i] u(1) if (!multiple_slices_in_tile_flag[i]
  • the syntax exp_num_slices_in_tile_minus1[i] represents the number of slices for which height information in a tile including the i-th slice is explicitly signaled. Specifically, the syntax exp_num_slices_in_tile_minus1[i] may be derived by subtracting 1 from the number of slices for which height information is explicitly signaled.
  • variable numExpSlicesInTile represents the explicit number derived by adding 1 to the value of the syntax exp_num_slices_in_tile_minus1[i].
  • slice height information may be encoded and signaled as much as the determined number.
  • the syntax slice_height_in_ctu_minus1[i][j] represents a value obtained by subtracting 1 from the number of coding tree unit rows included in the j-th slice in the tile including the i-th slice.
  • the variable i is a value calculated based on the number of slices in the picture
  • the variable j is a value calculated based on the number of slices in the tile.
  • the height of a slice whose index k is smaller than the explicit number may be determined based on the syntax slice_height_in_ctu_minus1[k] signaled through the bitstream.
  • the height of the slice having the index k equal to or greater than the explicit number may be determined based on the last signaled height information and the number of remaining coding tree unit rows in the tile. As an example, when the width of the slice derived from the last signaled height-related syntax slice_height_in_ctu_minus1[exp_num_slices_in_tile_minus1] is LastSliceHeight, and the number of remaining coding tree unit rows excluding areas occupied by previous slices in the tile is remainingHeightInCtbY, k The height of the second slice may be set to a smaller value among LastSliceHeight and remainingHeightInCtbY.
  • the syntax num_exp_slices_in_tile_minus1[i] derived by dividing 1 from the number of slices for which height information is explicitly signaled is encoded/decoded.
  • the explicit number determined by the syntax num_exp_slices_in_tile_minus1[i] is at least one. Accordingly, even when one tile is composed of one slice, a problem in that the height of the tile must be explicitly signaled may occur.
  • syntax num_exp_slices_in_tile[i] which is explicitly set as the number of slices for which height information is signaled, may be encoded/decoded.
  • Table 23 illustrates a syntax table including the syntax num_exp_slices_in_tile[i].
  • the syntax slice_height_in_ctu_minus1 indicating the height of the slice may be encoded/decoded.
  • 43 and 44 are diagrams for explaining an encoding aspect of slice height information.
  • FIG. 43 an example in which one tile is divided into four slices is illustrated.
  • all three slices except the first slice are illustrated as having the same height (ie, three coding tree unit rows).
  • the syntax indicating the height of the first slice (slice 0) in the tile is encoded by setting slice_height_in_ctu_minus1[0] to 2, and the syntax indicating the height of the second slice (slice 1) is set to 1 and encoding is performed. I can. Since the third slice (slice 2) and the fourth slice (slice 3) have the same value as the height induced by the last-encoded syntax slice_height_in_ctu_minus1[1], the height information of these may not be separately encoded.
  • the number of slices for which height information is explicitly signaled may be determined as two.
  • a value of the syntax num_exp_slices_in_tile[i] may be set to 2.
  • FIG. 44 an example in which one tile is divided into five slices is illustrated.
  • the first slice is composed of three coding tree unit rows
  • the second to fourth slices are composed of two coding tree unit rows
  • the last slice is composed of one coding tree unit row.
  • the syntax indicating the height of the first slice (slice 0) in the tile is encoded by setting slice_height_in_ctu_minus1[0] to 2, and the syntax indicating the height of the second slice (slice 1) is set to 1 and encoding is performed. I can.
  • the third slice (slice 2) and the fourth slice (slice 3) have the same value as the height derived by the last-encoded syntax slice_height_in_ctu_minus1[1].
  • the remaining height remainingHeightInCtbY excluding the region occupied by previous slices in the tile has a value smaller than the height value LastSliceHeight derived by the last encoded syntax slice_height_in_ctu_minus1[1]. Accordingly, even if the height information of the third slice, the fourth slice, and the fifth slice is not separately encoded, the respective heights can be derived.
  • the number of slices for which height information is explicitly signaled may be determined as two.
  • a value of the syntax num_exp_slices_in_tile[i] may be set to 2.
  • a variable i is set between 0 and a value subtracting 1 from the number of slices in a picture
  • a variable j is set between 0 and a value subtracting 1 from the number of slices in a tile.
  • variable i relates to the total number of slices in the picture
  • the partition structure for n slices in a predetermined tile when the partition structure for n slices in a predetermined tile is determined, when determining the slice size for the next tile, the variable i must be increased by (n-1). do.
  • variable i when it is determined that a plurality of slices in a predetermined tile are included, after determining the height of each of the plurality of slices, the variable i may be changed to the index of the last slice in the predetermined tile.
  • the variable RemNumSlicesMinus1 may be derived by dividing the explicit number determined by the syntax num_exp_slices_in_tile and 1 from the total number of slices in a predetermined tile.
  • the variable RemNumSlicesMinus1 can be derived as follows. First, at the height of a predetermined tile, the sum of the heights of slices for which height information is explicitly signaled may be differentiated to derive the number of remaining coding tree unit rows (RemHeight).
  • a value obtained by subtracting 1 from Ceil (RemHeight / LastSliceHeight) calculated based on the number of remaining coding tree unit rows RemHeight and the last signaled height LastSliceHeight may be set as the value of the variable RemNumSlicesMinus1.
  • the height of the tile is 9 (9 CTUs), and the sum of the heights of slices for which height information is explicitly signaled is 5. Accordingly, the number of remaining coding tree rows RemHeight is set to 4.
  • the height LastSliceHeight of the slice to which the height information is signaled last is 2. Accordingly, the value of the variable RemNumSliceMinus1 can be derived to 1 by dividing the variable RemHeight by the variable LastSliceHeight by 1 by dividing it.
  • variable RemHeight is not a multiple of the variable LastSliceHeight
  • the quotient derived as a result of division can be set as the variable RemNumSliceMinus1.
  • the variable RemHeight is 5, and the variable LastSliceHeight is 2.
  • the variable RemNumSlice may be set to 2, which is the quotient obtained when the variable RemHeight is divided by the variable LastSliceHeight.
  • Table 24 shows an example of inducing the variable RemNumSlicesMinus1.
  • ⁇ tileX tileIdx%
  • ctbY
  • variable RemNumSlicesMinus1 may be derived.
  • ⁇ tileX tileIdx%
  • One picture may be divided into at least one subpicture.
  • the sub picture may be a rectangular area including at least one slice.
  • Encoding or decoding may be performed on a sub-picture basis. Alternatively, a partial bitstream may be generated for each subpicture.
  • the decoder may parse only a part of the multiplexed partial bitstream. For example, a partial bitstream corresponding to a user's viewing area may be parsed, and an image may be rendered based on the parsing.
  • a picture parameter set may be encoded/decoded for each sub-picture. Accordingly, picture parameter sets referenced for each sub-picture may be different. Alternatively, tile partitioning may be independently performed for each sub-picture.
  • Subpictures may be composed of contiguous areas. This indicates that two slices that are not spatially adjacent cannot constitute one subpicture. For example, slices that are adjacent to each other may be defined as one sub-picture, whereas slices that are not adjacent to each other cannot be defined as one sub-picture.
  • the sub picture may be defined in a rectangular shape including one or more slices.
  • a division shape in which the subpicture has a non-rectangular shape is not allowed.
  • 45 is a diagram for describing a division type applicable to a picture.
  • each square represents a slice.
  • the number assigned to each slice indicates the index of the subpicture to which the slice belongs.
  • an index of a subpicture to which each slice belongs may be signaled.
  • FIG. 45 it may be understood that slices to which the same index is allocated are included in the same subpicture.
  • each subpicture is defined in a rectangular shape. Accordingly, a division type as in the example shown in (a) of FIG. 45 may be applied to the picture.
  • subpicture 3 is defined as a non-rectangular shape. Since it is not allowed to define a sub-picture in a non-rectangular form, a split form such as the example shown in FIG. 45B cannot be applied to the picture.
  • subpicture 0 is defined as two spatially separated regions. It is not allowed for one sub-picture to include a plurality of regions that are not spatially contiguous. Accordingly, the division type as in the example shown in (c) of FIG. 45 cannot be applied to the picture.
  • 46 is a flowchart of a method of dividing a picture into at least one subpicture according to an embodiment of the present disclosure.
  • Subpicture related information may be signaled at the sequence level.
  • at least one of a syntax indicating whether to divide a subpicture, a syntax related to picture division information, or a syntax related to subpicture independence may be included in the sequence parameter set.
  • the subpicture related information may be commonly applied to pictures referencing the sequence parameter set. Accordingly, pictures referencing one sequence parameter set may have the same division type.
  • some of the subpicture related information may be signaled at the sequence level, and some may be signaled at the picture level.
  • a syntax indicating whether or not to divide a subpicture may be included in a sequence parameter set, whereas a syntax related to picture division information and a syntax related to subpicture independence may be included in a picture parameter set.
  • a syntax indicating whether or not to divide a subpicture and a syntax related to picture division information may be included in the sequence parameter set, while a syntax related to subpicture independence may be included in the picture parameter set. In this case, at least one of a division type or independence of subpictures may be different for each picture.
  • subpicture related information is signaled through a sequence parameter set.
  • the syntax subpics_present_flag may be signaled through a bitstream.
  • the syntax subpics_present_flag When the syntax subpics_present_flag is 1, it indicates that the picture can be divided into at least one sub-picture.
  • a subpicture parameter When the syntax subpics_present_flag is 1, a subpicture parameter may be included in a bitstream, for example, a sequence parameter set.
  • the syntax subpics_present_flag is 0, it indicates that the picture is not divided into subpictures.
  • the subpicture parameter includes information indicating the number of subpictures (e.g., max_subpics_minus1), information indicating the size of the subpicture (e.g., subpic_grid_col_width_minus1, subpic_grid_row_height_minus1), information indicating a subpicture index (e.g., subpic_grid_idx) It may include at least one of information indicating whether to handle (eg, subpic_treated_as_pic_flag) or information indicating whether to apply an in-loop filter at a sub-picture boundary (eg, loop_filter_across_subpic_enabled_flag).
  • the subpicture parameters will be described in detail below.
  • sub-picture division information may be obtained (S4602).
  • the picture division information may include at least one of information indicating the number of subpictures included in the picture, information indicating the position of each subpicture, or information indicating the size of each subpicture.
  • syntax sps_num_subpics_minus1 indicating the number of subpictures may be signaled through the bitstream.
  • the syntax sps_num_subpics_minus1 may represent a value obtained by subtracting 1 from the number of subpictures included in the picture.
  • a syntax max_subpics_minus1 indicating the number of subpictures may be signaled through the bitstream.
  • the syntax max_subpics_minus1 represents the maximum value among the number of subpictures of each of the pictures referring to the sequence parameter set.
  • the value of the syntax max_subpics_minus1 is 2 (at the maximum value of 3). 1 can be set as a subtractive value).
  • the size of the sub picture may be determined based on a square block.
  • the square block may be a block of a predefined size derived by applying a lattice structure to a picture.
  • a square block, which is a basic unit for determining the size of a sub picture, may be referred to as a grid.
  • the size of the grid may be predefined in an encoder and a decoder.
  • the grid may have a size of 8x8, 16x16, 32x32, or 64x64.
  • information indicating the size of the grid may be signaled through a bitstream.
  • one coding tree unit or a plurality of coding tree units may be set as a grid.
  • the size of the coding tree unit can be signaled at the sequence level. That is, the size information of the coding tree unit included in the sequence parameter set may be parsed, and the position and size of the subpicture may be determined using the parsed coding tree unit size information.
  • a subpicture For each grid, a subpicture may be defined by allocating an index of a subpicture to which each grid belongs.
  • Table 26 shows an example in which subpicture indexes are allocated for each grid.
  • the syntax subpic_grid_col_width_minus1 represents the width of the grid.
  • the syntax subpic_grid_col_width_miuns1 may be derived by dividing the width of the grid by a predetermined constant value N by dividing 1 by difference.
  • N may be an integer such as 2, 4, 8, or 16.
  • N may be determined according to the size of the coding tree unit.
  • the syntax subpic_grid_row_height_minus1 represents the height of the grid.
  • the syntax subpic_grid_row_height_minus1 may be derived by dividing the height of the grid by a predetermined constant value N by dividing one.
  • a sub picture index For each grid, a sub picture index can be allocated.
  • the syntax subpic_grid_idx[i][j] represents a subpicture index of a grid belonging to an i-th column and a j-th row.
  • Grids to which the same sub picture index is assigned may be understood as belonging to the same sub picture.
  • Whether to signal grid size information may be determined based on the maximum number of subpictures.
  • Table 27 shows an example in which whether to parse grid size information is determined based on a value of the syntax max_subpics_minus1.
  • syntax subpic_grid_col_width_minus1 and syntax subpic_grid_col_height_minus1 can be signaled only when the syntax max_subpics_minus1 value is greater than 0 (that is, when the maximum number of subpictures is 2 or more). have.
  • the size of the sub-picture may be determined based on at least one of position information of the sub-picture or size information of the sub-picture.
  • the location information of the sub-picture may include information on a horizontal location (ie, x-axis coordinate) of the sub-picture and information on a vertical location (ie, y-axis coordinate) of the sub-picture.
  • position information may be signaled for each of the subpictures.
  • the syntax subpic_ctu_top_left_x[i] for determining the horizontal position of the sub picture may be signaled through the bitstream.
  • the syntax subpic_ctu_top_left_x[i] represents the horizontal position of the i-th subpicture in the picture.
  • subpic_ctu_top_left_x[i] represents a horizontal position of a grid (eg, a coding tree unit) located at the upper left of the i-th sub-picture.
  • the horizontal position may be a value determined based on the size of the coding tree unit.
  • the horizontal position may be derived by dividing the x-coordinate of the coding tree unit located at the upper left of the i-th subpicture by the size (eg, width) of the coding tree unit. Accordingly, the upper left x-coordinate of the i-th coding tree unit can be derived by multiplying the value of the syntax subpic_ctu_top_left_x[i] by the size of the coding tree unit.
  • the syntax subpic_ctu_top_left_y[i] for determining the vertical position of the sub picture may be signaled through the bitstream.
  • the syntax subpic_ctu_top_left_y[i] represents the vertical position of the i-th subpicture in the picture.
  • subpic_ctu_top_left_y[i] represents a vertical position of a grid (eg, a coding tree unit) located at the upper left of the i-th subpicture.
  • the vertical position may be a value determined based on the size of the coding tree unit.
  • the vertical position may be derived by dividing the y-coordinate of the coding tree unit located at the upper left of the i-th subpicture by the size (eg, height) of the coding tree unit. Accordingly, the upper left y-coordinate of the i-th coding tree unit can be derived by multiplying the value of the syntax subpic_ctu_top_left_y[i] by the size of the coding tree unit.
  • signaling of information indicating the position of the subpicture may be omitted for the first subpicture.
  • the size information of the sub-picture may include width information of the sub-picture and height information of the sub-picture.
  • size information may be signaled for each of the subpictures.
  • the syntax subpic_width_minus1[i] for determining the width of the subpicture may be signaled through the bitstream.
  • the syntax subpic_width_minus1[i] may represent a value obtained by subtracting 1 from a value obtained by dividing the width of the i-th subpicture in the picture by the size of the grid (eg, the width of a coding tree unit).
  • the syntax subpic_width_minus1[i] may be set to a value derived by dividing the width of the i-th subpicture by 4 by 1 and a value derived.
  • the syntax subpic_width_minus1[i] may be set as a value derived by dividing the width of the i-th subpicture by the size of the coding tree unit by dividing 1 have. That is, the syntax subpic_width_minus1 represents a value obtained by subtracting 1 from the number of grid columns (eg, coding tree unit columns) included in the i-th subpicture.
  • the decoder may derive the width of the subpicture as shown in Equation 13 below.
  • Equation 13 subpicWidth represents the width of the i-th subpicture, and CtbSize represents the size of the coding tree unit.
  • the variable CtbSize may be a value derived by taking Log_2 to the product of the width and height of the coding tree unit.
  • the syntax subpic_height_minus1[i] for determining the height of the sub picture may be signaled through the bitstream.
  • the syntax subpic_height_minus1[i] may represent a value obtained by subtracting 1 from a value obtained by dividing the height of the i-th subpicture in the picture by the size of the grid (eg, the height of the coding tree unit). For example, when the size of the grid is 4x4, the syntax subpic_height_minus1[i] may be set to a value derived by dividing the height of the i-th subpicture by 4 by 1 and a value derived.
  • the syntax subpic_height_minus1[i] may be set as a value derived by dividing the height of the i-th subpicture by the size of the coding tree unit by dividing 1 have. That is, the syntax subpic_height_minus1 represents a value obtained by subtracting 1 from the number of grid columns (eg, coding tree unit columns) included in the i-th subpicture.
  • the decoder may derive the height of the subpicture as shown in Equation 14 below.
  • subpicHeight represents the height of the i-th subpicture.
  • subpicture independence information When a picture can be divided into at least one subpicture, subpicture independence information may be obtained.
  • the subpicture independence information indicates whether subpictures are independently encoded/decoded.
  • the sub-picture independence information may include at least one of information indicating whether a sub-picture is processed like a picture or information indicating whether to apply a loop filter at a sub-picture boundary.
  • the syntax subpic_treated_as_pic_flag[i] indicates whether the i-th subpicture is treated like a picture.
  • the value of the syntax subpic_treated_as_pic_flag[i] of 1 indicates that the subpicture can be independently coded/decoded during encoding/decoding of the subpicture excluding the loop filter process.
  • a sub-picture When a sub-picture is treated like a picture, it may not be allowed to refer to information of other sub-pictures during encoding/decoding except for an in-loop filter. That is, the boundary of the subpicture can be treated the same as the picture boundary. For example, in a process of deriving a temporal motion prediction vector or an encoding/decoding process such as interpolation, it is assumed that a boundary of a subpicture is a picture boundary, and encoding/decoding may be performed.
  • a temporal motion prediction vector candidate or a temporal merge candidate may be derived based on a motion vector of a collocated block in a collocated picture.
  • a block including the coordinates of the lower right corner of the block having the same position and size as the current block in the collocated picture may be set as the collocated block. If a block including the coordinates of the lower right corner is not available, a block including the center coordinates of a block having the same position and size as the current block in the collocated picture may be set as the collocated block.
  • the collocated picture It can be derived from a motion vector of a block including the center coordinates of the block having the same position and size as the current block.
  • whether the lower right corner exists in the picture boundary or out of the picture boundary may be determined based on the picture boundary, not the sub-picture boundary.
  • whether a lower right corner exists in a picture boundary or out of a picture boundary may be determined based on the sub-picture boundary. For example, when the lower right corner of a block having the same position and size as the current block in the collocated picture exists at the sub-picture boundary or is outside the sub-picture boundary, the same position and size as the current block in the collocated picture A block including the center coordinates of the own block can be set as a collocated block.
  • the luma component pixels at integer positions of the current picture and the reference picture are limited so as not to deviate from the left boundary, the right boundary, the upper boundary, and the lower boundary of the picture.
  • the boundary of the sub-picture is regarded as the same as the picture boundary, and the luma component pixels at the integer position can be restricted so as not to deviate from the left boundary, the right boundary, the upper boundary, and the lower boundary of the sub picture. .
  • the syntax loop_filter_across_subpic_enabled_flag[i] indicates whether or not to apply the in-loop filter in the i-th subpicture. For example, when the value of the syntax loop_filter_across_subpic_enabled_flag[i] is 1, it indicates that the in-loop filter is allowed to be applied at the i-th sub-picture boundary.
  • the in-loop filter may include at least one of a deblocking filter, SAO, or ALF.
  • SAO deblocking filter
  • ALF ALF
  • variable NumSubPics represents the number of subpictures.
  • the variable NumSubPics may have a value equal to or smaller than the value obtained by adding 1 in the syntax max_subpics_minus1.
  • Subpicture independence information for example, subpic_treated_as_pic_flag[i] and loop_filter_across_subpic_enabled_flag[i] may be signaled for subpictures having an i value between 0 and NumSubPics.
  • One slice or a plurality of slices may be set as a grid. For example, when a slice is set as a grid, a subpicture index to which the slice belongs may be signaled for each slice. Tables 28 and 29 show examples in which subpicture information allocated to each slice is signaled when the square shape slice definition method is used.
  • slice_header() Descriptor slice_pic_parameter_set_id ue(v) if( rect_slice_flag
  • the syntax slice_address represents an address allocated to an i-th slice in a picture.
  • the syntax subpic_grid_idx[slice_address] represents a subpicture index value allocated to a slice whose address value is slice_address. Slices to which the same sub picture index is allocated may be understood as belonging to the same sub picture.
  • the syntax slice_id[i] represents an identifier assigned to an i-th slice in a picture.
  • the syntax subpic_grid_idx[slice_id[i]] represents a subpicture index value allocated to an i-th slice (ie, a slice having an identifier slice_id[i]). Slices to which the same sub picture index is allocated may be understood as belonging to the same sub picture.
  • One tile or a plurality of tiles may be set as a grid. For example, when a tile is set as a grid, a subpicture index to which the tile belongs may be signaled for each tile.
  • each of the components (eg, units, modules, etc.) constituting the block diagram in the above-described embodiment may be implemented as a hardware device or software, or a plurality of components are combined to form one hardware device or software. It can also be implemented.
  • the above-described embodiments may be implemented in the form of program instructions that can be executed through various computer components and recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include program instructions, data files, data structures, and the like alone or in combination.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magnetic-optical media such as floptical disks. media), and a hardware device specially 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 processing according to the present disclosure, and vice versa.
  • the present disclosure can be applied to an electronic device that encodes/decodes an image.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
PCT/KR2020/012250 2019-09-10 2020-09-10 영상 신호 부호화/복호화 방법 및 이를 위한 장치 Ceased WO2021049890A1 (ko)

Priority Applications (13)

Application Number Priority Date Filing Date Title
CN202411987730.5A CN119835420A (zh) 2019-09-10 2020-09-10 图像信号编码/解码方法及其装置
CN202411987721.6A CN119835418A (zh) 2019-09-10 2020-09-10 图像信号编码/解码方法及其装置
AU2020347030A AU2020347030B2 (en) 2019-09-10 2020-09-10 Image signal encoding/decoding method and device therefor
CN202411987723.5A CN119835419A (zh) 2019-09-10 2020-09-10 图像信号编码/解码方法及其装置
CA3150364A CA3150364A1 (en) 2019-09-10 2020-09-10 Image signal encoding/decoding method and device therefor
CN202411987734.3A CN119835421A (zh) 2019-09-10 2020-09-10 图像信号编码/解码方法及其装置
CN202080028560.1A CN113711596B (zh) 2019-09-10 2020-09-10 图像信号编码/解码方法及其装置
JP2022515792A JP7700785B2 (ja) 2019-09-10 2020-09-10 映像信号符号化／復号化方法及びそのための装置
US17/473,714 US11425399B2 (en) 2019-09-10 2021-09-13 Image signal encoding/decoding method and device therefor
US17/847,381 US11665357B2 (en) 2019-09-10 2022-06-23 Image signal encoding/decoding method and device therefor
US18/136,297 US12063373B2 (en) 2019-09-10 2023-04-18 Image signal encoding/decoding method and device therefor
US18/757,324 US12581094B2 (en) 2019-09-10 2024-06-27 Image signal encoding/decoding method and device therefor
JP2025094562A JP2025116269A (ja) 2019-09-10 2025-06-06 映像信号符号化／復号化方法及びそのための装置

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
KR20190112465 2019-09-10
KR10-2019-0112465 2019-09-10
KR10-2019-0175282 2019-12-26
KR20190175282 2019-12-26
KR10-2019-0179609 2019-12-31
KR20190179609 2019-12-31

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/473,714 Continuation US11425399B2 (en) 2019-09-10 2021-09-13 Image signal encoding/decoding method and device therefor

Publications (1)

Publication Number Publication Date
WO2021049890A1 true WO2021049890A1 (ko) 2021-03-18

Family

ID=74865906

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2020/012250 Ceased WO2021049890A1 (ko) 2019-09-10 2020-09-10 영상 신호 부호화/복호화 방법 및 이를 위한 장치

Country Status (7)

Country Link
US (4) US11425399B2 (https=)
JP (2) JP7700785B2 (https=)
KR (1) KR20210030889A (https=)
CN (5) CN119835418A (https=)
AU (1) AU2020347030B2 (https=)
CA (1) CA3150364A1 (https=)
WO (1) WO2021049890A1 (https=)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN119835418A (zh) * 2019-09-10 2025-04-15 皇家飞利浦有限公司 图像信号编码/解码方法及其装置
EP4035372A4 (en) 2019-09-23 2022-11-23 Telefonaktiebolaget LM Ericsson (publ) SEGMENT POSITION SIGNALING WITH SUB-PICTURE SLICE POSITION DERIVATION
CN114747223B (zh) * 2019-10-07 2023-11-14 Lg电子株式会社 基于子画面结构执行环路内滤波的图像编码/解码方法和装置及发送比特流的方法
CN114731443A (zh) 2019-11-22 2022-07-08 索尼集团公司 图像处理装置和方法
JP7460784B2 (ja) 2020-02-21 2024-04-02 北京字節跳動網絡技術有限公司 スライスおよびタイルを含むピクチャのコーディング
KR20260023606A (ko) * 2020-02-21 2026-02-20 두인 비전 컴퍼니 리미티드 비디오 코딩의 슬라이스 및 타일 파티셔닝
US20230142928A1 (en) * 2020-04-02 2023-05-11 Lg Electronics Inc. Transform-based image coding method and device therefor
WO2023128489A1 (ko) * 2021-12-28 2023-07-06 주식회사 케이티 영상 부호화/복호화 방법 및 장치

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170238001A1 (en) * 2014-09-30 2017-08-17 Microsoft Technology Licensing, Llc Rules for intra-picture prediction modes when wavefront parallel processing is enabled
KR20180005185A (ko) * 2015-05-12 2018-01-15 삼성전자주식회사 샘플 값 보상을 위한 영상 부호화 방법과 그 장치, 및 샘플값 보상을 위한 영상 복호화 방법과 그 장치
US20180041779A1 (en) * 2016-08-02 2018-02-08 Qualcomm Incorporated Geometry transformation-based adaptive loop filtering
KR20180131454A (ko) * 2017-05-30 2018-12-10 주식회사 케이티 비디오 신호 처리 방법 및 장치
JP2019515570A (ja) * 2016-05-02 2019-06-06 漢陽大学校産学協力団Ｉｎｄｕｓｔｒｙ−Ｕｎｉｖｅｒｓｉｔｙ Ｃｏｏｐｅｒａｔｉｏｎ Ｆｏｕｎｄａｔｉｏｎ Ｈａｎｙａｎｇ Ｕｎｉｖｅｒｓｉｔｙ 画面内予測を利用した映像符号化／復号化方法および装置

Family Cites Families (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100246683A1 (en) * 2009-03-27 2010-09-30 Jennifer Lois Harmon Webb Error Resilience in Video Decoding
WO2012033327A2 (ko) * 2010-09-08 2012-03-15 엘지전자 주식회사 참조 픽쳐 리스트 구성 방법을 포함하는 영상 복호화 방법 및 장치
US8612491B2 (en) * 2011-10-25 2013-12-17 The United States Of America, As Represented By The Secretary Of The Navy System and method for storing a dataset of image tiles
US9247258B2 (en) * 2011-10-26 2016-01-26 Qualcomm Incorporated Unified design for picture partitioning schemes
CN108600753B (zh) * 2011-12-29 2020-10-27 Lg 电子株式会社 视频编码和解码方法和使用该方法的装置
US9332259B2 (en) * 2012-01-18 2016-05-03 Qualcomm Incorporated Indication of use of wavefront parallel processing in video coding
JP6295951B2 (ja) * 2012-06-25 2018-03-20 ソニー株式会社 画像復号装置及び画像復号方法
GB2530751A (en) * 2014-09-30 2016-04-06 Sony Corp Video data encoding and decoding
WO2016090568A1 (en) * 2014-12-10 2016-06-16 Mediatek Singapore Pte. Ltd. Binary tree block partitioning structure
US10623767B2 (en) * 2015-10-19 2020-04-14 Lg Electronics Inc. Method for encoding/decoding image and device therefor
CN116170588A (zh) * 2016-03-30 2023-05-26 韩国电子通信研究院 使用画面划分信息对视频进行编码和解码的方法和设备
US10419768B2 (en) * 2016-03-30 2019-09-17 Qualcomm Incorporated Tile grouping in HEVC and L-HEVC file formats
CN116647680A (zh) * 2016-10-28 2023-08-25 韩国电子通信研究院 视频编码/解码方法和设备以及存储比特流的记录介质
WO2018112254A1 (en) 2016-12-14 2018-06-21 C. Light Technologies, Inc. Binocular retinal imaging device, system, and method for tracking fixational eye motion
FI3847817T3 (fi) * 2018-09-14 2024-06-26 Huawei Tech Co Ltd Viipalointi ja ruudukointi videokoodauksessa
US11463712B2 (en) * 2018-11-21 2022-10-04 Interdigital Vc Holdings, Inc. Residual coding with reduced usage of local neighborhood
CN113273193A (zh) * 2018-12-31 2021-08-17 华为技术有限公司 用于分块配置指示的编码器，解码器及对应方法
JP7285857B2 (ja) * 2019-01-16 2023-06-02 テレフオンアクチーボラゲット エルエム エリクソン（パブル） リマインダをもつ均一なタイルスプリットを含むビデオコーディング
JP7403245B2 (ja) * 2019-06-21 2023-12-22 キヤノン株式会社 画像復号装置、画像復号方法
KR20220088844A (ko) * 2019-08-06 2022-06-28 오피 솔루션즈, 엘엘씨 서브-프레임들을 사용한 적응적 해상도 관리
KR20210019387A (ko) * 2019-08-12 2021-02-22 한국항공대학교산학협력단 하이 레벨 영상 분할과 영상 부호화/복호화 방법 및 장치
CN119835418A (zh) * 2019-09-10 2025-04-15 皇家飞利浦有限公司 图像信号编码/解码方法及其装置
CN120343286A (zh) * 2019-11-28 2025-07-18 Lg 电子株式会社 图像/视频编译方法和装置
KR20250117834A (ko) * 2019-11-28 2025-08-05 엘지전자 주식회사 영상/비디오 인코딩/디코딩 시스템에서 슬라이스에 관한 정보의 시그널링 방법 및 장치
CN120568071A (zh) * 2020-03-26 2025-08-29 阿里巴巴（中国）有限公司 用信号通知视频编码数据的方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170238001A1 (en) * 2014-09-30 2017-08-17 Microsoft Technology Licensing, Llc Rules for intra-picture prediction modes when wavefront parallel processing is enabled
KR20180005185A (ko) * 2015-05-12 2018-01-15 삼성전자주식회사 샘플 값 보상을 위한 영상 부호화 방법과 그 장치, 및 샘플값 보상을 위한 영상 복호화 방법과 그 장치
JP2019515570A (ja) * 2016-05-02 2019-06-06 漢陽大学校産学協力団Ｉｎｄｕｓｔｒｙ−Ｕｎｉｖｅｒｓｉｔｙ Ｃｏｏｐｅｒａｔｉｏｎ Ｆｏｕｎｄａｔｉｏｎ Ｈａｎｙａｎｇ Ｕｎｉｖｅｒｓｉｔｙ 画面内予測を利用した映像符号化／復号化方法および装置
US20180041779A1 (en) * 2016-08-02 2018-02-08 Qualcomm Incorporated Geometry transformation-based adaptive loop filtering
KR20180131454A (ko) * 2017-05-30 2018-12-10 주식회사 케이티 비디오 신호 처리 방법 및 장치

Also Published As

Publication number Publication date
US12581094B2 (en) 2026-03-17
CA3150364A1 (en) 2021-03-18
AU2020347030A1 (en) 2022-03-31
US11665357B2 (en) 2023-05-30
US20240357133A1 (en) 2024-10-24
US20220007035A1 (en) 2022-01-06
US12063373B2 (en) 2024-08-13
CN113711596A (zh) 2021-11-26
CN113711596B (zh) 2025-02-18
KR20210030889A (ko) 2021-03-18
AU2020347030B2 (en) 2025-10-02
CN119835418A (zh) 2025-04-15
JP2025116269A (ja) 2025-08-07
US11425399B2 (en) 2022-08-23
JP2022548220A (ja) 2022-11-17
JP7700785B2 (ja) 2025-07-01
US20230269381A1 (en) 2023-08-24
US20220329827A1 (en) 2022-10-13
CN119835420A (zh) 2025-04-15
CN119835421A (zh) 2025-04-15
CN119835419A (zh) 2025-04-15

Similar Documents

Publication Publication Date Title
WO2020185022A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020076125A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020096389A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020159198A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020256442A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020096388A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020111785A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020060185A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2021040321A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020076116A1 (ko) 영상 부호화/복호화 방법 및 장치
WO2020139006A2 (ko) 화면 내 예측 모드 유도 방법 및 장치
WO2020222617A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020060328A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020060184A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020050600A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2021049890A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020060316A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020184977A1 (ko) 화면 내 블록 복사 기반 부호화/복호화 방법, 장치 및 비트스트림 저장매체
WO2020060329A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020060242A1 (ko) 화면 내 예측 모드 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020184979A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020141816A1 (ko) 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
WO2020096426A1 (ko) 영상 신호 부호화/복호화 방법 및 이를 위한 장치
WO2020004978A1 (ko) 비디오 신호 처리 방법 및 장치
WO2019225994A1 (ko) 비디오 신호 처리 방법 및 장치

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 3150364

Country of ref document: CA

ENP Entry into the national phase

Ref document number: 2022515792

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020347030

Country of ref document: AU

Date of ref document: 20200910

Kind code of ref document: A

122 Ep: pct application non-entry in european phase

Ref document number: 20863648

Country of ref document: EP

Kind code of ref document: A1

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 09-09-2022)

122 Ep: pct application non-entry in european phase

Ref document number: 20863648

Country of ref document: EP

Kind code of ref document: A1

WWG Wipo information: grant in national office

Ref document number: 202080028560.1

Country of ref document: CN

WWD Wipo information: divisional of initial pct application

Ref document number: 202518060086

Country of ref document: IN

Ref document number: 202518061392

Country of ref document: IN

WWP Wipo information: published in national office

Ref document number: 202518060086

Country of ref document: IN