[go: up one dir, main page]

WO2018155984A1 - Procédé et appareil de traitement de signal vidéo - Google Patents

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

Info

Publication number
WO2018155984A1
WO2018155984A1 PCT/KR2018/002341 KR2018002341W WO2018155984A1 WO 2018155984 A1 WO2018155984 A1 WO 2018155984A1 KR 2018002341 W KR2018002341 W KR 2018002341W WO 2018155984 A1 WO2018155984 A1 WO 2018155984A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
coding
transform
sub
transform block
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/KR2018/002341
Other languages
English (en)
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.)
KT Corp
Original Assignee
KT 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
Application filed by KT Corp filed Critical KT Corp
Publication of WO2018155984A1 publication Critical patent/WO2018155984A1/fr
Anticipated expiration legal-status Critical
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/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/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/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/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/186—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 a colour or a chrominance component
    • 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/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
    • 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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

  • the present invention relates to a video signal processing method and apparatus.
  • High efficiency image compression techniques can be used to solve these problems caused by high resolution and high quality image data.
  • An inter-screen prediction technique for predicting pixel values included in the current picture from a picture before or after the current picture using an image compression technique an intra prediction technique for predicting pixel values included in a current picture using pixel information in the current picture
  • An object of the present invention is to provide a multi-tree partitioning method and apparatus capable of effectively dividing an encoding / decoding target block in encoding / decoding a video signal.
  • An object of the present invention is to provide a method and apparatus for encoding and / or decoding transform coefficients in a transform block corresponding to a coding block divided by multi-tree partitioning.
  • the transform block coding indicator information does not indicate that at least one valid transform coefficient exists in the transform block, all transform coefficients in the transform block are set to a predetermined value.
  • the transform block coding indicator information is checked only when the transform block is determined to be a block generated by the inter prediction mode.
  • the sub-conversion block unit to which the sub-block coding indicator information CSBF is applied has a value smaller than a predetermined size of at least one of width and height.
  • the predetermined size may be defined as 4 or less.
  • the sub transform block units to which the sub block coding indicator information CSBF is applied are classified based on the number of samples included in the sub transform block.
  • a transform block is divided into at least one or more sub transform blocks from an encoded syntax element, and the sub block coding indicator information (CSBF) corresponding to each of the divided sub transform blocks is checked. And if the sub-block coding indicator information (CSBF) indicates that at least one valid transform coefficient exists in the sub transform block, a decoder for decoding the transform coefficient in the sub transform block.
  • CSBF sub block coding indicator information
  • the video signal bitstream included in the recording medium may be configured to be included in the current coding block if the size of the partitioned current coding block is greater than or equal to a reference size.
  • the sub transform block coding indicator information may be encoded by an image encoding method for indicating whether at least one valid transform coefficient exists in the sub transform block.
  • FIG. 11 is a diagram illustrating a partition type in which asymmetric quad tree division is allowed as another embodiment to which the present invention is applied.
  • FIG. 12 is a flowchart illustrating a coding block partitioning method based on asymmetric quad tree partitioning according to another embodiment to which the present invention is applied.
  • FIG. 16 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quad tree and triple tree splits are applied.
  • NAL network abstraction layer
  • FIG. 17 is a diagram illustrating a basic partition type in which multi-tree partitioning is allowed as another embodiment to which the present invention is applied.
  • FIG. 29 is a diagram for describing a subblock coding indicator information provided for each subtransform block by dividing a transform block into a plurality of subtransform blocks as another embodiment to which the present invention is applied.
  • FIG. 33 is a diagram illustrating an image encoding method using subblock coding indicators for each sub transform block, according to another embodiment to which the present invention is applied.
  • unit used in the present application may be replaced with a “block”, and thus, the term “coding tree unit” and “coding tree block”, “coding unit” and “coding block” are used herein. ”,“ Prediction unit ”and“ prediction block ”,“ transform unit ”and“ transform block ”can be interpreted in the same sense.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • the image encoding apparatus 100 may include a picture splitter 110, a predictor 120 and 125, a transformer 130, a quantizer 135, a realigner 160, and an entropy encoder. 165, an inverse quantizer 140, an inverse transformer 145, a filter 150, and a memory 155.
  • each of the components shown in FIG. 1 is independently illustrated to represent different characteristic functions in the image encoding apparatus, and does not mean that each of the components is made of separate hardware or one software component unit.
  • each component is included in each component for convenience of description, and at least two of the components may be combined into one component, or one component may be divided into a plurality of components to perform a function.
  • Integrated and separate embodiments of the components are also included within the scope of the present invention without departing from the spirit of the invention.
  • the components may not be essential components for performing essential functions in the present invention, but may be optional components for improving performance.
  • the present invention can be implemented including only the components essential for implementing the essentials of the present invention except for the components used for improving performance, and the structure including only the essential components except for the optional components used for improving performance. Also included in the scope of the present invention.
  • prediction mode information and motion vector information used for prediction may be encoded by the entropy encoder 165 together with the residual value and transmitted to the decoder.
  • the original block may be encoded as it is and transmitted to the decoder without generating the prediction block through the prediction units 120 and 125.
  • the 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 offset correction unit may correct the offset with respect to the original image on a pixel-by-pixel basis for the deblocking image.
  • the pixels included in the image are divided into a predetermined number of areas, and then, an area to be offset is determined, an offset is applied to the corresponding area, or offset considering the edge information of each pixel. You can use this method.
  • a coding block it is also possible to split a coding block to use a prediction block or transform block having a smaller size than the coding block.
  • BT may be set such that only symmetric division is allowed.
  • the coding efficiency may be lowered.
  • Asymetric Binary Tree Partitioning refers to splitting a coding block into two smaller coding blocks.
  • the coding block may be divided into two asymmetrical coding blocks.
  • Binary tree-based partitioning may be performed on a coding block in which quadtree-based partitioning is no longer performed.
  • Quadtree-based partitioning may no longer be performed on a coding block partitioned based on binary tree.
  • FIG. 5 illustrates an example of hierarchically splitting a coding block based on quad tree and binary tree splitting as an embodiment to which the present invention is applied.
  • the above-described partitioning process allows information about the size / depth of a coding block that allows quad-tree based partitioning, information about the size / depth of the coding block that allows binary tree-based partitioning, or binary-tree based partitioning. It may be limitedly performed based on at least one of information about the size / depth of the coding block that is not.
  • FIG. 6 is a diagram illustrating an example in which only a specific form, for example, a partition based on a symmetric binary tree is allowed.
  • FIG. 6A illustrates an example in which only Nx2N type binary tree based partitioning is allowed.
  • the depth 1 coding block 601 may be divided into two Nx2N blocks 601a and 601b at depth 2
  • the depth 2 coding block 602 may be divided into two Nx2N blocks 602a and 602b at depth 3. .
  • FIG. 6C illustrates an example of dividing a block divided into a symmetric binary tree into a symmetric binary tree.
  • the depth 1 coding block 605 is divided into two Nx2N blocks 605a and 605b at depth 2
  • the depth 2 coding block 605a generated after the division is divided into two Nx2N blocks 605a1, at depth 3. 605a2).
  • the partitioning scheme is equally applicable to 2N ⁇ N coding blocks generated by symmetric binary tree partitioning.
  • At least one of the number of times that a binary tree split is allowed, the depth that allows a binary tree split, or the number of depths that a binary tree split allows may be differently set according to a temporal identifier (Temporal_ID) of a slice or a picture.
  • Temporal_ID may be used to identify each of a plurality of layers of an image having at least one scalability among a view, a spatial, a temporal, or a quality. will be.
  • the transform skip When applying the transform skip to at least one of the horizontal direction and the vertical direction, it is also possible to signal in which direction the transform skip is applied depending on the type of the CU. Specifically, for example, in the case of a 2NxN type CU The transform may be performed in the horizontal direction and the transform skip may be applied in the vertical direction. In the case of an Nx2N type CU, the transform skip may be applied in the horizontal direction and the transform may be performed in the vertical direction.
  • the transform may be at least one of DCT or DST.
  • a left partition having a width of 1 / 4W and a right partition having a width of 3 / 4W may be generated.
  • a partitioned form in which the width of the left partition is smaller than the width of the right partition may be referred to as an nLx2N binary partition.
  • a left partition having a width of 3 / 4W and a right partition having a width of 1 / 4W may be generated.
  • the partition type whose width of the right partition is smaller than the width of the left partition may be referred to as nRx2N binary partition.
  • a top partition having a height of 1 / 4H and a bottom partition having a height of 3 / 4H may be generated.
  • a partition type in which the height of the upper partition is smaller than the height of the lower partition may be referred to as a 2NxnU binary partition.
  • an asymmetric binary partition shape of a coding block may be determined based on information signaled through a bitstream.
  • a partitioning type of a coding block may include information indicating a partitioning direction of a coding block and a coding block. The partition may be determined based on information indicating whether the first partition generated as the partition is smaller than the second partition.
  • a value of hor_binary_flag equal to 0 and a value of is_left_above_small_part_flag equal to 1 indicate an nLx2N binary partition
  • a value of hor_binary_flag equal to 0 and a value of is_left_above_small_part_flag equal to 0 may indicate an nRx2N binary partition.
  • a value of hor_binary_flag equal to 1 and a value of is_left_above_small_part_flag equal to 1 indicate a 2NxnU binary partition
  • a value of hor_binary_flag equal to 1 indicates a 2NxnU binary partition
  • a value of hor_binary_flag equal to 1 indicates a 2NxnD binary partition
  • a value of hor_binary_flag 1
  • a value of is_left_above_small_part_flag equal to 0 may indicate a 2NxnD binary partition.
  • whether the partition type of the coding block is binary tree partitioning or asymmetric binary tree partitioning may be determined by information signaled through the bitstream.
  • the information may be a one-bit flag 'is_asymmetric_split_flag', and based on the flag, it may be determined whether the coding block is divided into symmetrical or asymmetrical forms.
  • Different indexes may be allocated and according to the index information, it may be determined whether a coding block is divided into a symmetrical form or an asymmetrical form.
  • Table 2 shows an example in which different indices are assigned to a symmetric binary partition and an asymmetric binary partition.
  • the coding tree block or coding block may be subdivided into a plurality of coding blocks through quad tree splitting, binary tree splitting or asymmetric binary tree splitting.
  • FIG. 8 is a diagram illustrating an example in which a coding block is divided into a plurality of coding blocks using QTBT and asymmetric binary tree splitting.
  • asymmetric binary tree splitting has been performed in depth 2 partitioning of the first grip, depth 3 partitioning of the second figure, and depth 3 partitioning of the third figure. May be restricted so that it is no longer split.
  • quad-tree, binary tree, or asymmetric binary tree related information may not be encoded / decoded in a coding block generated through asymmetric binary tree partitioning.
  • Information indicating whether asymmetric binary tree partitioning is allowed may be encoded and signaled in units of blocks, slices, or pictures.
  • the information indicating whether asymmetric binary tree partitioning is allowed may be a 1-bit flag.
  • the value of is_used_asymmetric_QTBT_enabled_flag equal to 0 may indicate that asymmetric binary tree partitioning is not used.
  • the value may be set to 0 without signaling is_used_asymmetric_QTBT_enabled_flag.
  • the split type allowed for the coding block may be determined.
  • at least one of the partition type, partition type, or number of partitions allowed between the coding block generated by the quad tree split and the coding block generated by the binary tree split may be different.
  • the asymmetric binary tree splitting may be limited to the coding block. That is, when the coding block is generated based on binary tree partitioning, it may be restricted to apply an asymmetric partition type (nLx2N, nRx2N, 2NxnU, 2NxnD) among the partition types shown in FIG. 7 to the coding block.
  • an asymmetric partition type nLx2N, nRx2N, 2NxnU, 2NxnD
  • FIG. 9 is a flowchart illustrating a coding block partitioning method based on quad tree and binary tree partitioning according to an embodiment to which the present invention is applied.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • quad tree splitting is applied to the depth k current block (S910). If quad tree splitting is applied, the current block is split into four square blocks (S920). On the other hand, if quad tree splitting is not applied, it is determined whether binary tree splitting is applied to the current block (S930). If binary tree splitting is not applied, then the current block becomes a depth k + 1 coding block without splitting.
  • S930 if binary tree partitioning is applied to the current block, it is checked whether either symmetrical binary partitioning or asymmetrical binary partitioning is applied (S940).
  • the partition type applied to the current block is determined (S950).
  • the partition type applied to the step S950 may be any one of the form of FIG. 4 (b) in the case of symmetry, or one of the form of FIG. 4 (c) in case of the asymmetry.
  • the current block is divided into two depth k + 1 coding blocks according to the determined partition type (S960).
  • the compressed image to which the present invention is applied may be packetized in units of a network abstract layer (hereinafter, referred to as NAL) and transmitted through a transmission medium.
  • NAL network abstract layer
  • the present invention is not limited to the NAL, but may be applied to various data transmission schemes to be developed in the future.
  • NAL unit to which the present invention is applied for example, as shown in Figure 10, video parameter set (VPS), sequence parameter set (SPS), picture parameter set (PPS) and at least one slice set (Slice) It may include.
  • 'ver_transform_skip_flag' may be set as a syntax element indicating whether to apply the horizontal transform skip and 'hor_transform_skip_flag' and a syntax element indicating whether to apply the vertical transform skip.
  • the value when binary tree partitioning is not used in picture units or slice units, the value may be set to 0 without signaling is_used_asymmetric_QTBT_enabled_flag.
  • 'asymmetric_binary_tree_flag' may indicate whether asymmetric binary tree partitioning is applied to the current block.
  • the coding unit (or coding tree unit) may be recursively divided by at least one vertical line or horizontal line.
  • quad tree splitting may be divided into a method of splitting a coding block using horizontal lines and vertical lines
  • binary tree splitting may be summarized as a method of splitting coding blocks using a horizontal line or vertical lines.
  • the partition form of the coding block to be quad tree divided and binary tree divided is not limited to the example illustrated in FIGS. 4 to 8, and an extended partition form other than that shown may be used. That is, the coding block may be recursively divided into different forms from those shown in FIGS. 4 to 8.
  • 11 (a) shows a symmetric quad tree split form of a coding block
  • (b) to (k) shows an asymmetric quad tree split form of a coding block
  • 11 (a) shows an example in which both horizontal and vertical lines are used for symmetrical division.
  • 11 (b) and 11 (c) show an example in which horizontal lines are used for symmetrical division, while vertical lines are used for asymmetrical division.
  • 11 (d) and (e) show an example in which vertical lines are used for symmetrical division, while horizontal lines are used for asymmetrical division.
  • the first indicator may be encoded only for at least one of a vertical line or a horizontal line, and another split form in which the first indicator is not encoded may be derived dependently by the first indicator.
  • another split form in which the first indicator is not encoded may have a value opposite to that of the first indicator. That is, when the first indicator indicates that the vertical line is used for asymmetric division, the horizontal line may be set to be used for symmetric division opposite to the first indicator.
  • Quad tree splitting may be performed using a plurality of vertical lines or a plurality of horizontal lines. As an example, it is also possible to divide a coding block into four blocks by combining at least one of one or more vertical lines or one or more horizontal lines.
  • 11 (f) to 11 (k) show an example of dividing a coding block asymmetrically by combining a plurality of vertical lines / horizontal lines and one horizontal line / vertical line.
  • At least one of a horizontal line or a vertical line may be used to divide the coding block into an asymmetric form, and the other may be used to divide the coding block into a symmetric form.
  • a plurality of vertical lines or horizontal lines may be used to split a coding block in a symmetrical form, or one horizontal line or vertical lines may be used to split a coding block in a symmetrical form.
  • horizontal lines or vertical lines may be used to split a coding block in a symmetrical form or may be used to split asymmetrically.
  • the information about the three asymmetric quad tree partitionings may be encoded based on at least one of the aforementioned first indicator or second indicator.
  • the first indicator may indicate whether the splitting form of the coding block is symmetrical or asymmetrical.
  • the first indicator may be encoded in units of blocks or may be encoded for each vertical line or horizontal line.
  • the first indicator may include information indicating whether one or more vertical lines are used for symmetric division and information indicating whether one or more horizontal lines are used for symmetric division.
  • the first indicator may be encoded only for at least one of a vertical line or a horizontal line, and another split form in which the first indicator is not encoded may be derived dependently by the first indicator.
  • the second indicator may be further encoded with respect to the vertical line or the horizontal line.
  • the second indicator may indicate at least one of the position of the vertical line or the horizontal line used for the asymmetric division or the ratio between the blocks divided by the vertical line or the horizontal line.
  • FIG. 12 is a flowchart illustrating a coding block partitioning method based on asymmetric quad tree partitioning according to another embodiment to which the present invention is applied.
  • step S1210 it is determined whether the quad tree split is applied to the depth k current block (S1210). As a result of the determination of step S1210, if quad tree splitting is not applied, the current block becomes a depth k + 1 coding block without splitting. If it is determined in step S1210 that the quad tree split is applied, it is determined whether the asymmetric quad tree split is applied to the current block (S1220). If the asymmetric quad tree split is not applied and the symmetric quad tree split is applied, the current block is split into four square blocks (S1230).
  • an asymmetric quad tree split it is determined whether three asymmetric quad tree splits are applied to the current block (S1240). If three kinds of asymmetric quad tree splits are not applied, the current block is divided into four two kinds of asymmetric blocks (S1250). In this case, the partition information may be divided into any one partition form of FIGS. 11 (b) to (e).
  • the current block is divided into four kinds of three asymmetric blocks (S1260).
  • the partition information may be partitioned into one of the partitions of FIGS. 11 (f) to 11 (k).
  • FIG. 13 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which asymmetric quadtree splitting is applied.
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • Slice at least one slice set
  • the syntax element 'Is_used_asymmertic_quad_tree_flag' indicates whether quad tree splitting is performed asymmetrically.
  • the coding block may be hierarchically divided based on at least one of a quad tree and a triple tree.
  • quad tree-based partitioning divides a 2Nx2N coding block into four NxN coding blocks (FIG. 14 (a)), and triple tree-based partitioning divides one coding block into three coding blocks. Each can mean. Even if triple tree-based partitioning is performed, there may be a square coding block at a lower depth.
  • Triple tree based splitting may be performed symmetrically (FIG. 14B) or may be performed asymmetrically (FIG. 14C).
  • the coding block divided based on the triple tree may be a square block or a non-square block such as a rectangle.
  • a partition type that allows triple tree-based partitioning is a 2Nx (2N / 3) (horizontal non-square coding unit) that is symmetric with the same width or height, as in the example shown in FIG. 14 (b). ) Or (2N / 3) x2N (a vertical non-square coding unit).
  • a method of dividing a CTU or a CU into three sub-partitions having a non-square shape as shown in FIG. 14 is called a triple tree CU partitioning method.
  • a CU divided into triple tree partitioning may be further restricted to not perform partitioning.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • the quad tree split is applied to the depth k current block (S1510). If quad tree splitting is applied, the current block is split into four square blocks (S1520). On the other hand, if the quad tree split has not been applied, it is determined whether the triple tree split is applied to the current block (S1530). If triple tree splitting is not applied, the current block becomes a depth k + 1 coding block without splitting.
  • FIG. 16 illustrates, as another embodiment to which the present invention is applied, a syntax element included in a network abstraction layer (NAL) to which quad tree and triple tree splits are applied.
  • NAL network abstraction layer
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • Slice at least one slice set
  • 'isUseTripleTreeFlag' indicates whether triple tree partitioning is applied to the current block, and is also a syntax element indicating a split direction of the coding block, and 'hor_triple_flag' indicates whether the coding block has been split in the horizontal direction.
  • 'hor_triple_flag 1
  • this may indicate that the coding block is split in the horizontal direction
  • ver_triple_flag indicating whether a coding block is divided in the vertical direction may be used in the same manner.
  • FIG. 14B may be defined to mean a 2Nx (2N / 3) partition type.
  • partition types of FIGS. 14A to 14C may be represented as indexes by 'asymmetric_tripletree_partition_index'.
  • a method of partitioning a CTU or CU using at least one of the aforementioned quad tree partitioning, binary partitioning, or triple tree partitioning is called multi-tree CU partitioning. Any of the N partitions described above may be used to partition a CTU or a CU. Specifically, for example, as shown in FIG. 17, nine partitions may be used to partition a CTU or a CU.
  • Quad tree partitioning is used by default, and binary tree partitioning and triple tree partitioning are optional. In this case, it may be signaled whether to use binary tree partitioning and / or triple tree partitioning in a sequence parameter set or a picture parameter set.
  • quad tree partitioning and triple tree partitioning can be used as standard, and binary tree partitioning can be optionally used.
  • the syntax isUseBinaryTreeFlag may be signaled indicating whether to use binary tree partitioning in the sequence header. If isUseBinaryTreeFlag is 1, CTU or CU can be partitioned using binary tree partitioning in the current sequence.
  • the syntax isUseTripleTreeFlag may be signaled indicating whether triple tree partitioning is used in the sequence header. If isUseTripleTreeFlag is 1, CTU or CU can be partitioned using triple tree partitioning in the current sequence header.
  • the partition form divided by multi-tree partitioning can be limited to nine basic partitions shown in Figs. 17A to 17I, for example.
  • (A) shows a quad tree partition form
  • (b)-(c) shows a symmetric binary tree partition form
  • (d)-(e) shows an asymmetric triple tree partition form
  • (f)- (i) shows an asymmetric binary tree partition type.
  • each partition type shown in FIG. 17 in connection with the above description detailed descriptions thereof will be omitted.
  • FIGS. 18 (j) to (u) may be extended to further include 12 partitions shown in FIGS. 18 (j) to (u), for example, in the form of partitions divided by multi-tree partitioning.
  • 18 (j) to (m) show an asymmetric quad tree partition form
  • (n) to (s) show three asymmetric quad tree partition forms
  • (t) to (u) show a symmetric triple tree partition form.
  • each partition type shown in FIG. 18 in the same manner as described above, a detailed description thereof will be omitted.
  • 19 is a flowchart illustrating a coding block partitioning method based on multi-tree partitioning according to another embodiment to which the present invention is applied.
  • the depth k coding block is divided into the depth k + 1 coding blocks.
  • the quad tree split is applied to the depth k current block (S1910). If the quad tree split has not been applied, it is determined whether the binary tree split is applied to the current block (S1950). In addition, if binary tree splitting is not applied, it is determined whether triple tree splitting is applied to the current block (S1990). If triple tree splitting is not applied as a result of the step S1950, the current block becomes a depth k + 1 coding block without splitting.
  • step S1910 if quad tree splitting is applied, it is checked whether a symmetrical or asymmetric quadtree splitting is performed (S1920). Thereafter, the partition information is checked to determine the block partition type of the current block (S1930), and the current block is divided into four blocks according to the determined partition type (S1940). For example, when the symmetric quad tree is applied, it is divided into the partition form of FIG. 17 (a). In addition, when the asymmetric quad tree is applied, it is divided into any one partition form of FIGS. 18 (j) to (m). Alternatively, when three kinds of asymmetric quad trees are applied, they are divided into any one partition form of Figs. 18 (n) to (s). However, as described above, if only the basic partition type of FIG. 17 is applied to the multi-tree partition type, only the symmetric square block of FIG. 17 (a) may be applied without determining whether the quad tree is asymmetric.
  • 'is_used_Multitree_flag' indicating whether to split a multi-tree may be defined.
  • FIG. 20 is a diagram for explaining transform block coding indicator information of a transform block corresponding to a coding block divided by multi-tree division, according to another embodiment to which the present invention is applied.
  • the above-described FIG. 1 transformer 130 and quantizer 135 may generate a residual coefficient by performing transform and / or quantization on the residual signal based on a predetermined block unit for transform and / or quantization.
  • the residual coefficient may be referred to as quantized transform coefficient, transform coefficient, or the like.
  • the predetermined block unit may be defined differently for each component of the residual signal (for example, a luminance component and a chrominance component).
  • the residual coefficient may be encoded / decoded in independent block units corresponding to the luminance component Luma, the color difference component Cb, and the color difference component Cr.
  • the basic block for performing the conversion is referred to as the above-described "transform block” or "transform unit".
  • the transform block can be square or non-square.
  • a transform block coding indicator (rqt_root_cbf) flag value is detected and confirmed (S2120). That is, when the rqt_root_cbf value is '1', transform coefficient decoding in the transform block is performed (S2130). On the other hand, when the rqt_root_cbf value is '0', the transform coefficient in the transform block is set to a predetermined value without performing transform coefficient decoding in the transform block (S2140). For example, when the rqt_root_cbf value is '0', all of the transform coefficients in the transform block may be set to '0'.
  • the prediction block is inter prediction (S2220), and if the prediction block is not inter prediction, decoding is performed without detecting the transform block coding indicator rqt_root_cbf information.
  • the transform block coding indicator rqt_root_cbf information is detected and decoded in the same manner as in the flowchart of FIG. 21 (S2230). That is, when the rqt_root_cbf value is '1', transform coefficient decoding in the transform block is performed (S2240).
  • the transform coefficient in the transform block is not set, and the transform coefficient in the transform block is set to a predetermined value, for example, '0' (S2250).
  • 23 to 26 illustrate still another embodiment to which the present invention is applied and illustrates an image encoding method using transform block coding indicator information of a transform block.
  • it illustrates a method of signaling syntax elements related to transform block decoding.
  • an rqt_root_cbf value is signaled (S2310).
  • the rqt_root_cbf value is signaled by checking whether there is at least one valid transform coefficient other than '0' in the encoded transform block as described above.
  • the signaled rqt_root_cbf value is checked (S2320). If the value of rqt_root_cbf is '0', other syntax elements cbf_cb, cbf_cr and cbf_luma are terminated without signaling.
  • the cbf_cb and cbf_cr values of the syntax elements are signaled (S2330 and S2340). If the signaled cbf_cb and cbf_cr values are not both '0' (S2350), the other syntax element cbf_luma is signaled (S2360). On the other hand, if at least one of the signaled cbf_cb and cbf_cr has a value of '0', the syntax element cbf_luma is not signaled and ends.
  • the unit in which cbf_luma is first signaled and the unit in which cbf_cb and / or cbf_cr are initially signaled may be the same or different from each other.
  • the unit in which cbf_luma is finally signaled and the unit in which cbf_cb and / or cbf_cr are finally signaled for one coding block (or transform block) may be the same or different from each other.
  • the different units being signaled may mean that at least one of the size, depth, or shape of the unit being signaled is different.
  • steps S2410 to S2460 of FIG. 24 are substantially the same as those of steps S2310 to S2360 of FIG. 23 described above.
  • the size of the coding block is compared with a preset reference size value (eg, M ⁇ N) (S2400). If the size of the coding block is larger than the reference size, the syntax elements rqt_root_cbf and cbf_cb, cbf_cr and cbf_luma may be sequentially signaled through steps S2410 to S2460. On the other hand, when the size of the coding block is smaller than the reference size, the syntax elements cbf_cb, cbf_cr, and cbf_luma may be signaled through steps S2470 to S2490.
  • a preset reference size value eg, M ⁇ N
  • the size of the coding block may be expressed by a width, height, a sum of width and height, the number of samples belonging to the coding block, and the like.
  • the reference size value may be based on a predefined square NxN block size.
  • the present invention is not limited thereto.
  • steps S2510 to S2560 of FIG. 25 are substantially the same as those of steps S2310 to S2360 of FIG. 23 described above.
  • rqt_root_cbf may be selectively encoded according to the type of coding block.
  • rqt_root_cbf may be selectively encoded according to whether the coding block is a non-square coding block or a square coding block.
  • rqt_root_cbf may be selectively signaled based on the shape and prediction mode of the block, and in a non-square coding block, cbf_luma, cbf_cb, and cbf_cr may be signaled without signaling rqt_root_cbf. have.
  • the shape of the coding block is non-square (S2500). If the shape of the coding block corresponds to a square, the syntax elements rqt_root_cbf and cbf_cb, cbf_cr, and cbf_luma may be sequentially signaled through steps S2510 to S2560. On the other hand, if the shape of the coding block corresponds to a non-square, the syntax elements cbf_cb, cbf_cr, and cbf_luma may be signaled through steps S2570 to S2590, respectively.
  • FIG. 26 illustrates an encoding method for selectively signaling syntax elements according to a partitioning scheme according to a shape of a coding block. That is, the syntax element rqt_root_cbf can be selectively encoded according to the partitioning scheme of the coding block. Also, whether the lower syntax elements cbf_cb, cbf_cr, and cbf_luma are signaled may be determined according to the upper syntax element rqt_root_cbf value. That is, steps S2610 to S2660 of FIG. 26 are substantially the same as those of steps S2310 to S2360 of FIG. 23 described above.
  • the syntax elements rqt_root_cbf and cbf_cb, cbf_cr, and cbf_luma may be sequentially signaled through steps S2610 to S2660.
  • the syntax elements cbf_cb, cbf_cr, and cbf_luma may be signaled through steps S2670 to S2690, respectively.
  • FIG. 27 and 28 illustrate another image decoding method using transform block coding indicator information of a transform block according to another embodiment to which the present invention is applied.
  • the decoding method of FIG. 27 corresponds to the encoding method of FIG. 23 described above
  • the decoding method of FIG. 28 corresponds to the encoding method of FIGS. 24 to 26 described above.
  • a decoder receives an encoded bitstream and parses syntax elements included in the bitstream (S2710).
  • the parsed syntax element includes all syntax elements for video signal decoding. In particular, it includes at least one syntax element rqt_root_cbf and cbf_cb, cbf_cr, cbf_luma required for transform block decoding.
  • a transform block coding indicator (rqt_root_cbf) flag value is detected and confirmed (S2720). That is, when the rqt_root_cbf value is '0', the residual signal in the transform block is set to a predetermined value without performing transform coefficient decoding in the transform block (S2730). For example, when the rqt_root_cbf value is '0', all of the transform coefficients in the transform block may be set to '0'.
  • transform coefficient decoding in the transform block is performed. That is, when the parsed syntax element rqt_root_cbf value is '1', it is checked whether the parsed lower syntax elements cbf_cb and cbf_cr are all '0' (S2740). If both of the parsed syntax elements cbf_cb and cbf_cr are not '0', another syntax element cbf_luma is detected (S2750).
  • the cbf_cb, cbf_cr, and cbf_luma values indicate the presence of each corresponding transform coefficient (eg, '1'), the corresponding transform coefficient is detected and decoding is performed (S2760).
  • the cbf_luma value may be automatically set to a pre-defined default value (defualt value, ex, '1'). In this case, the cbf_luma value may be set directly to '1' even if it is not parsed from the bitstream.
  • a decoder receives an encoded bitstream and parses syntax elements included in the bitstream (S2810).
  • the parsed syntax element includes all syntax elements for video signal decoding.
  • the parsed syntax element includes a syntax element indicating the size, shape, and partitioning method of the coding block.
  • at least one syntax element rqt_root_cbf and cbf_cb, cbf_cr, cbf_luma required for transform block decoding may be included according to a syntax element condition regarding the size, shape, and partitioning method of the coding block.
  • the parsed syntax element may determine whether to detect the syntax element rqt_root_cbf by comparing the size, shape, and / or partitioning method of the coding block with a predefined reference value (S2810). For example, through step S2810, the case where it is determined that the syntax element rqt_root_cbf exists may be defined as the first type, and the case where it is determined that the syntax element rqt_root_cbf does not exist may be defined as the second type.
  • step S2850 is the same as the process of performing steps S2720 to S2770 of FIG. 27 described above, a detailed description thereof will be omitted below.
  • FIG. 29 is a diagram for describing a subblock coding indicator information provided for each subtransform block by dividing a transform block into a plurality of subtransform blocks as another embodiment to which the present invention is applied.
  • the size of the transform block is larger than the reference size, for example, 4x4, when decoding the transform block, at least one transform coefficient other than '0' exists in each subblock unit (for example, 4x4) as shown in FIG. 29.
  • the encoding and decoding efficiency can be improved by using a subblock coding indicator “coded_sub_block_flag” (CSBF) value indicating a function as a syntax element.
  • CSBF coded_sub_block_flag
  • the 8x8 transform block 2900 is divided into four 4x4 sub transform blocks 2901 to 2904, and then the syntax element "coded_sub_block_flag" (hereinafter referred to as CSBF) value is set for each sub transform block. For example, if at least one coefficient other than '0' exists in the sub transform block, the CSBF value is set to '1' (2901, 2902, 2903), and all coefficients in the sub transform block are '0'. In step 2904, the CSBF value is set to '0'.
  • the transform coefficients may be encoded based on a transform coefficient level flag indicating whether each transform coefficient in the block is '0' or not '0'. If Coded_sub_block_flag is not 0, at least one non-zero transform coefficient exists, and the transform coefficient levels of all transform coefficients in the block may be encoded. All transform coefficient levels in a block are called a transform coefficient level map. After encoding the significant map, we can encode the absolute value and sign of the nonzero transform coefficients.
  • FIG. 30 to 32 illustrate various embodiments in which a transform block is divided into a plurality of sub transform blocks and a sub block coding indicator for each sub transform block, according to another embodiment to which the present invention is applied.
  • the CSBF flag may be signaled in units of at least one of 2x2 block units, 2x4 block units, or 2x8 block units.
  • the CSBF is signaled in units of at least one of (a) 2 ⁇ 2 blocks, (b) 2 ⁇ 4 blocks, or (c) 2 ⁇ 8 blocks. can do.
  • a very asymmetric coding block having a coding block size of Nx2 as shown in FIG. 31, in units of at least one of (a) 8x2 blocks, (b) 4x2 blocks, or (c) 2x2 blocks.
  • CSBF can be signaled.
  • CU0 and CU2 are 1x16 microsymmetric coding blocks, and when CU1 is a 2x16 microsymmetric coding block, the CSBF may be signaled in units of 16 samples. Specifically, the CSBF may be signaled in CU0 and CU2, and the CSBF flag may be signaled in 2 ⁇ 8 units in CU1.
  • the CSBF when the depth value of the block in which the CSBF is signaled is 0 for a 2N ⁇ 2N sized TU, the CSBF is signaled in units of 2N ⁇ 2N, and when the depth value is 2, (N / 2) x (N / 2) CSBF may be signaled as a unit.
  • the block unit in which the CSBF is signaled may be determined by dividing the TU into a predetermined number of vertical / horizontal lines. At this time, information on the number, spacing, etc. of the vertical / horizontal lines may be signaled.
  • FIG. 34 illustrates a video encoding method using subblock coding indicators for respective sub-conversion blocks corresponding to non-square coding blocks, according to another embodiment to which the present invention is applied.
  • the shape of the current coding block CU is non-square (S3410). If the current coding block is square, the above-described coding method (B: 3310, 3320, 3330) of FIG. 33 is performed. It can be applied (S3440). On the other hand, if the shape of the current coding block CU is a non-square, it determines a new sub-conversion block unit to which the CSBF is applied (S3430).
  • the new sub transform block unit may be square (ex, 2x2, 4x4, 8x8, ...) or non-square (ex, 2x4, 2x8, 4x2, 8x2, ).
  • the new sub-conversion block unit may be determined according to the number of samples rather than a specific block type.
  • FIG. 35 is a view illustrating an image encoding method using subblock coding indicators for respective sub-conversion blocks corresponding to extremely asymmetric coding blocks, according to another embodiment to which the present invention is applied. Referring to FIG. 35, first, it is checked whether a current coding block CU has a non-square shape (S3510).
  • the above-described coding method (B: 3310, 3320, 3330) of FIG. 33 may be applied.
  • the shape of the current coding block CU is a non-square, it is further checked whether it corresponds to a very asymmetric coding block (S3520).
  • step S3510 and step S3520 may be integrated into one process.
  • the above-described encoding method (B: 3310, 3320, 3330) of FIG. 33 may be applied (S3560). That is, as described in steps S3310, S3320, and S3330 of FIG. 33, the size of the CU is compared with the reference size, and according to the result, encoding is performed in units of MxM or NxN (N> M) sub-conversion blocks.
  • the new sub-conversion block unit to which the CSBF is applied is determined (S3530). That is, for a very asymmetric coding block, it is necessary to define a sub transform block of a new size, rather than using the NxN or MxM sub transform block size defined in FIG. 33 as it is.
  • the new sub transform block unit may be square (ex, 2x2, 4x4, 8x8, ...) or non-square (ex, 2x4, 2x8, 4x2, 8x2, ).
  • the new sub-conversion block unit may be determined according to the number of samples rather than a specific block type. In the case of determining the sub transform block based on the number of samples, as shown in FIG. 32, one extremely asymmetric coding block (for example, FIG. 32 CU1) is divided into sub transform blocks of different types including the same number of samples. It becomes possible.
  • FIG. 36 is a view illustrating an image decoding method using subblock coding indicators for each sub transform block corresponding to a coding block type, according to another embodiment to which the present invention is applied.
  • a decoder receives an encoded bitstream and parses syntax elements included in the bitstream (S3610).
  • the parsed syntax element includes all syntax elements for video signal decoding.
  • the parsed syntax element includes syntax elements indicating the size, shape, and partitioning method of the current coding block.
  • the parsed syntax element includes the sub transform block coding indicator CSBF information under a specific condition.
  • the syntax element CSBF # i is detected by comparing the size and / or shape of the current coding block with a predefined reference size or shape (S3620). For example, in operation S3620, a case in which it is determined that syntax element CSBF # i is present in the current coding block is defined as a third type, and a case in which it is determined that syntax element CSBF # i does not exist is determined as the fourth type. Can be defined as a type. For example, referring to the above-described CSBF # i signaling method of FIGS.
  • the third type when the current coding block has a square shape larger than a reference size or has a non-square shape regardless of size, the third type may be used. You can judge. However, the condition for determining whether the current coding block corresponds to the third type may be set to various conditions besides the above scheme according to the definition between the encoder and the decoding.
  • the current coding block does not correspond to the third type but corresponds to the fourth type, it means that the transform block is not divided into sub transform blocks and the syntax element CSBF # i is not included in the bitstream. . Therefore, without detecting CSBF # i, other syntax elements, for example, rqt_root_cbf, cbf_cb, cbf_cr and cbf_luma values, are detected from the bitstream to decode the transform coefficients in the transform block (S3630).
  • the decoding coefficients may be decoded by detecting corresponding signaled syntax elements cbf_cb, cbf_cr, and cbf_luma for each sub-conversion block.
  • FIG. 37 illustrates, by way of example, a syntax element included in a network abstraction layer (NAL) applied to a transform block, as another embodiment to which the present invention is applied.
  • NAL network abstraction layer
  • the NAL unit to which the present invention is applied may include, for example, a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), and at least one slice set (Slice).
  • FIG. 37 illustrates an included syntax element included in a slice set (Slice)
  • the syntax element may be included in a sequence parameter set (SPS) or a picture parameter set (PPS).
  • syntax elements to be commonly applied to sequence units or picture units by syntax elements are included in a sequence parameter set (SPS) or a picture parameter set (PPS), and syntax elements applied only to a specific slice are included in a slice set. It is also possible to classify as much as possible. Therefore, this can be selected in consideration of coding performance and efficiency.
  • syntax elements cbf_cb, cbf_cr, and cbf_luma mean coding indicators of the color difference component Cb, the color difference component Cr, or the luminance component luma in the transform block.
  • the syntax element idx_coded_sub_block may be utilized when indexing and indicating a sub transform block to which CSBF # i is applied.
  • the syntax element width_coded_sub_block may be used to define the width size of the sub transform block to which CSBF # i is applied.
  • the syntax element NumSample_in_coded_sub_block may be utilized to define the number of samples included in the sub transform block to which CSBF # i is applied.
  • each component for example, a unit, a module, etc. constituting the block diagram may be implemented as a hardware device or software, and a plurality of components are combined into one hardware device or software. It may be implemented.
  • the above-described embodiments may be implemented in the form of program instructions that may be executed by various computer components, and may be recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs, DVDs, and magneto-optical media such as floptical disks. media), and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • the hardware device may be configured to operate as one or more software modules to perform the processing according to the present invention.

Landscapes

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

Abstract

La présente invention concerne un procédé et un appareil de traitement de signal vidéo. Le procédé de décodage d'image, selon la présente invention, comprend les étapes consistant à : vérifier des informations d'indicateur de codage de bloc de transformée à partir d'un élément de syntaxe codé ; et si les informations d'indicateur de codage de bloc de transformée indiquent qu'au moins un coefficient de transformée valide est présent dans un bloc de transformée, décoder les coefficients de transformée dans le bloc de transformée. La présente invention permet d'augmenter l'efficacité du codage/décodage de signal d'image au moyen du traitement efficace du bloc de transformée à coder/décoder.
PCT/KR2018/002341 2017-02-24 2018-02-26 Procédé et appareil de traitement de signal vidéo Ceased WO2018155984A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20170024641 2017-02-24
KR10-2017-0024641 2017-02-24
KR20170030281 2017-03-09
KR10-2017-0030281 2017-03-09

Publications (1)

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

Family

ID=63253862

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/002341 Ceased WO2018155984A1 (fr) 2017-02-24 2018-02-26 Procédé et appareil de traitement de signal vidéo

Country Status (2)

Country Link
KR (1) KR102601268B1 (fr)
WO (1) WO2018155984A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111107358A (zh) * 2018-10-26 2020-05-05 北京字节跳动网络技术有限公司 块分割中的冗余降低
CN111327904A (zh) * 2018-12-15 2020-06-23 华为技术有限公司 图像重建方法和装置
CN112868241A (zh) * 2018-11-12 2021-05-28 华为技术有限公司 视频编码器、视频解码器及方法
CN113273198A (zh) * 2018-11-06 2021-08-17 交互数字Vc控股公司 用于视频编码和解码的多个编码单元之间的参数分组
CN113366833A (zh) * 2019-02-01 2021-09-07 北京字节跳动网络技术有限公司 对环路整形的限制
CN113439441A (zh) * 2019-02-15 2021-09-24 北京字节跳动网络技术有限公司 基于块分割的变换参数推导
CN113574879A (zh) * 2019-03-15 2021-10-29 三星电子株式会社 图像编码方法和装置、图像解码方法和装置

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN119277077A (zh) 2019-02-28 2025-01-07 三星电子株式会社 一种用于预测色度分量的视频编码和解码的方法及其装置
CN119996710A (zh) * 2020-03-27 2025-05-13 三星电子株式会社 影像的译码方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130223518A1 (en) * 2012-02-08 2013-08-29 Panasonic Corporation Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus
WO2013161194A1 (fr) * 2012-04-23 2013-10-31 日本電気株式会社 Dispositif de codage vidéo, procédé de codage vidéo et programme
CN103583048A (zh) * 2011-06-30 2014-02-12 松下电器产业株式会社 图像解码方法、图像编码方法、图像解码装置、图像编码装置及图像编码解码装置
KR20150099482A (ko) * 2012-07-02 2015-08-31 삼성전자주식회사 비디오의 엔트로피 부호화 방법 및 장치, 비디오의 엔트로피 복호화 방법 및 장치
KR20150121278A (ko) * 2014-04-17 2015-10-29 충북대학교 산학협력단 Hevc에서의 고속 cu 결정을 통한 부호화방법

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR960013055A (ko) * 1994-09-27 1996-04-20 김광호 조건부 퀴드트리 분할방식의 화상압축방법 및 장치
US10623774B2 (en) 2016-03-22 2020-04-14 Qualcomm Incorporated Constrained block-level optimization and signaling for video coding tools

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103583048A (zh) * 2011-06-30 2014-02-12 松下电器产业株式会社 图像解码方法、图像编码方法、图像解码装置、图像编码装置及图像编码解码装置
US20130223518A1 (en) * 2012-02-08 2013-08-29 Panasonic Corporation Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus
WO2013161194A1 (fr) * 2012-04-23 2013-10-31 日本電気株式会社 Dispositif de codage vidéo, procédé de codage vidéo et programme
KR20150099482A (ko) * 2012-07-02 2015-08-31 삼성전자주식회사 비디오의 엔트로피 부호화 방법 및 장치, 비디오의 엔트로피 복호화 방법 및 장치
KR20150121278A (ko) * 2014-04-17 2015-10-29 충북대학교 산학협력단 Hevc에서의 고속 cu 결정을 통한 부호화방법

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111107358A (zh) * 2018-10-26 2020-05-05 北京字节跳动网络技术有限公司 块分割中的冗余降低
CN113273198A (zh) * 2018-11-06 2021-08-17 交互数字Vc控股公司 用于视频编码和解码的多个编码单元之间的参数分组
CN112868241A (zh) * 2018-11-12 2021-05-28 华为技术有限公司 视频编码器、视频解码器及方法
CN111327904A (zh) * 2018-12-15 2020-06-23 华为技术有限公司 图像重建方法和装置
US11924438B2 (en) 2018-12-15 2024-03-05 Huawei Technologies Co., Ltd. Picture reconstruction method and apparatus
US12284367B2 (en) 2018-12-15 2025-04-22 Huawei Technologies Co., Ltd. Picture reconstruction method and apparatus
CN113366833A (zh) * 2019-02-01 2021-09-07 北京字节跳动网络技术有限公司 对环路整形的限制
CN113439441A (zh) * 2019-02-15 2021-09-24 北京字节跳动网络技术有限公司 基于块分割的变换参数推导
CN113574879A (zh) * 2019-03-15 2021-10-29 三星电子株式会社 图像编码方法和装置、图像解码方法和装置
US11451814B2 (en) 2019-03-15 2022-09-20 Samsung Electronics Co., Ltd. Image encoding method and device, and image decoding method and device
US12079749B2 (en) 2019-03-15 2024-09-03 Samsung Electronics Co., Ltd. Image encoding method and device, and image decoding method and device

Also Published As

Publication number Publication date
KR102601268B1 (ko) 2023-11-10
KR20180098159A (ko) 2018-09-03

Similar Documents

Publication Publication Date Title
WO2018155986A2 (fr) Procédé et appareil de traitement de signaux vidéo
WO2018097626A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2019172705A1 (fr) Procédé et appareil de codage/décodage d'image utilisant un filtrage d'échantillon
WO2018155984A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018056703A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2017222326A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018026219A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2020060364A1 (fr) Procédé permettant de coder/décoder des signaux vidéo et dispositif associé
WO2017171370A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2017176030A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2020111785A1 (fr) Procédé de codage/décodage de signal vidéo et appareil associé
WO2020139008A1 (fr) Procédé de codage/décodage de vidéo, appareil et support d'enregistrement contenant un flux binaire mémorisé
WO2019225993A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2019027241A1 (fr) Procédé et dispositif de codage/décodage d'images et support de mémorisation de stockage de flux binaire
WO2018016823A1 (fr) Dispositif et procédé de codage/décodage d'image, et support d'enregistrement dans lequel le flux binaire est stocké
WO2018124843A1 (fr) Procédé de codage/décodage d'image, appareil et support d'enregistrement pour stocker un train de bits
WO2017222334A1 (fr) Procédé et appareil de codage/décodage d'image par transformée
WO2018155985A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2020060244A1 (fr) Procédé et dispositif de codage/décodage d'images, et support d'enregistrement pour stocker un flux binaire
WO2012043989A2 (fr) Procédé destiné à diviser un bloc et dispositif de décodage
WO2019182295A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2020096427A1 (fr) Procédé de codage/décodage de signal d'image et appareil associé
WO2020162690A1 (fr) Procédé et dispositif de traitement de signal vidéo en utilisant une transformée réduite
WO2019190201A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018056701A1 (fr) Procédé et appareil de traitement de signal vidéo

Legal Events

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

Ref document number: 18756835

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

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

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

122 Ep: pct application non-entry in european phase

Ref document number: 18756835

Country of ref document: EP

Kind code of ref document: A1