EP3298777B1 - Verfahren für bedingte binäre baumblockpartitionierungsstruktur für bild- und videocodierung - Google Patents

Verfahren für bedingte binäre baumblockpartitionierungsstruktur für bild- und videocodierung Download PDF

Info

Publication number
EP3298777B1
EP3298777B1 EP16823825.1A EP16823825A EP3298777B1 EP 3298777 B1 EP3298777 B1 EP 3298777B1 EP 16823825 A EP16823825 A EP 16823825A EP 3298777 B1 EP3298777 B1 EP 3298777B1
Authority
EP
European Patent Office
Prior art keywords
block
constraint
partitioning
binary
conditional
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.)
Active
Application number
EP16823825.1A
Other languages
English (en)
French (fr)
Other versions
EP3298777A4 (de
EP3298777A1 (de
Inventor
Kai Zhang
Jicheng An
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.)
MediaTek Singapore Pte Ltd
Original Assignee
MediaTek Singapore Pte Ltd
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 MediaTek Singapore Pte Ltd filed Critical MediaTek Singapore Pte Ltd
Publication of EP3298777A1 publication Critical patent/EP3298777A1/de
Publication of EP3298777A4 publication Critical patent/EP3298777A4/de
Application granted granted Critical
Publication of EP3298777B1 publication Critical patent/EP3298777B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/40—Tree coding, e.g. quadtree, octree
    • 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/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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame 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/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/46—Embedding additional information in the video signal during the compression process
    • 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
    • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with 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/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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/162—User input

Definitions

  • the invention relates generally to image and video processing.
  • the present invention relates to block partitioning structure with restrictions to reduce or remove redundancy associated with the block partitioning structure in video and image coding.
  • the High Efficiency Video Coding (HEVC) standard is developed under the joint video project of the ITU-T Video Coding Experts Group (VCEG) and the ISO/IEC Moving Picture Experts Group (MPEG) standardization organizations, and is especially with partnership known as the Joint Collaborative Team on Video Coding (JCT-VC).
  • VCEG Video Coding Experts Group
  • MPEG Moving Picture Experts Group
  • one slice is partitioned into multiple coding tree units (CTU).
  • CTU coding tree units
  • SPS sequence parameter set
  • the allowed CTU size can be 8x8, 16x16, 32x32, or 64x64.
  • the CTUs within the slice are processed according to a raster scan order.
  • the CTU is further partitioned into multiple coding units (CU) to adapt to various local characteristics.
  • a quadtree denoted as the coding tree, is used to partition the CTU into multiple CUs.
  • CTU size be MxM, where M is one of the values of 64, 32, or 16.
  • the CTU can be a single CU or can be split into four smaller units of equal sizes (i.e., M/2xM/2), which are nodes of coding tree. If units are leaf nodes of coding tree, the units become CUs. Otherwise, the quadtree splitting process can be iterated until the size for a node reaches a minimum allowed CU size as specified in the SPS.
  • This representation results in a recursive structure as specified by a coding tree (also referred to as a partition tree structure) 120 in Fig. 1 .
  • the CTU partition 110 is shown in Fig. 1 , where the solid lines indicate CU boundaries.
  • the decision whether to code a picture area using Inter-picture (temporal) or Intra-picture (spatial) prediction is made at the CU level. Since the minimum CU size can be 8x8, the minimum granularity for switching between different basic prediction types is 8x8.
  • One or more prediction units are specified for each CU. Coupled with the CU, the PU works as a basic representative block for sharing the prediction information. Inside each PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis.
  • a CU can be split into one, two, or four PUs according to the PU splitting type.
  • HEVC defines eight shapes for splitting a CU into PU as shown in Fig. 2 . Unlike the CU, the PU may only be split once.
  • the partitions shown in the second row correspond to asymmetric partitions, where the two partitioned parts have different sizes.
  • a CU After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quadtree structure, which is analogous to the coding tree for the CU.
  • the solid lines in block 110 indicate CU boundaries
  • dotted lines in block 110 indicate TU boundaries.
  • the solid lines for the partition tree structure 120 corresponds to the CU partition tree structure
  • the dashed lines for the partition tree structure 120 corresponds to the TU partition tree structure.
  • the TU is a basic representative block of residual or transform coefficients for applying the integer transform and quantization. For each TU, one integer transform with the same size is applied to the TU to obtain residual coefficients. These coefficients are transmitted to the decoder after quantization on a TU basis.
  • CTB coding tree block
  • CB coding block
  • PB prediction block
  • T transform block
  • the tree partitioning is generally applied simultaneously to both the luma and chroma components, although exceptions may apply when certain minimum sizes are reached for the chroma component.
  • the coding efficiency may not be sufficient to cope with the ever increasing demands for larger storage and transmission of video contents.
  • the restrictions of the current HEVC block partitioning structure exist in the quadtree based partitioning from CTU to CU and from CU to TU and the limited depth of PU partitioning.
  • a binary tree structure has been disclosed by some common inventors for partitioning a unit into multiple smaller units, such as partitioning a slice into CTUs, a CTU into CUs, a CU into PUs, or a CU into TUs in the PCT Patent Application, No. PCT/CN2015/096761 .
  • a block can be recursively split into two smaller blocks.
  • a flag is signalled to indicate whether a block is split into two smaller blocks. If yes, another syntax element is signalled to indicate which splitting type is used. If the horizontal splitting is used then it is split into two blocks of size MxN/2. Otherwise, it is vertical split into two blocks of size M/2xN.
  • the binary tree splitting process can be iterated until the size (i.e., width or height) for a splitting block reaches a minimum allowed block size.
  • the minimum allowed block size can be defined in high level syntax such as SPS (sequence parameter set). Since the binary tree has two splitting types (i.e., horizontal and vertical), the minimum allowed block width and height should be both indicated. Non-horizontal splitting is implicit when splitting would result in a block height smaller than the indicated minimum. Non-vertical splitting is implicit when splitting would result in a block width smaller than the indicated minimum.
  • Fig. 4 illustrates an example of block partitioning 410 and its corresponding binary tree structure 420. In each splitting (i.e., non-leaf) node of the binary tree structure, one flag is used to indicate which splitting type (i.e., horizontal or vertical) is used, where 0 indicates horizontal splitting and 1 indicates vertical splitting.
  • the proposed binary tree structure can be used for partitioning a block into multiple smaller blocks such as partitioning a slice into CTUs, a CTU into CUs, a CU into PUs, or a CU into TUs, and so on.
  • the binary tree is used for partitioning a CTU into CUs.
  • the root node of the binary tree is a CTU and the leaf nodes of the binary tree are CUs.
  • the leaf nodes are further processed by prediction and transform coding.
  • the binary tree structure is more flexible than the quadtree structure, since the binary tree structure allows more partition shapes, which is also the source of coding efficiency improvement.
  • the encoding complexity will also increase due to the increased selections for choosing the best partition shape.
  • the PCT Patent Application, No. PCT/CN2015/096761 discloses a method to combine the quadtree and binary tree structure, which is called as quadtree plus binary tree (QTBT) structure.
  • QTBT binary tree
  • the leaf quadtree block is not larger than the maximum allowed binary tree root node size, it can be further partitioned by a binary tree structure.
  • the binary tree splitting can be iterated until the size (i.e., width or height) for a splitting block reaches the minimum allowed binary tree leaf node size (i.e., width or height) or the binary tree depth reaches the maximum allowed binary tree depth.
  • the minimum allowed quadtree leaf node size, the maximum allowed binary tree root node size, the minimum allowed binary tree leaf node width and height, and the maximum allowed binary tree depth can be indicated in a high level syntax such as the SPS.
  • Fig. 5 illustrates an example of block partitioning 510 and its corresponding QTBT structure 520.
  • the solid lines indicate quadtree splitting and dotted lines indicate binary tree splitting.
  • each splitting (i.e., non-leaf) node of the binary tree one flag is signalled to indicate which splitting type (i.e., horizontal or vertical) is used, where 0 indicates horizontal splitting and 1 indicates vertical splitting.
  • the QTBT structure can be used for partitioning a block into multiple smaller blocks, such as partitioning a slice into CTUs, a CTU into CUs, a CU into PUs, or a CU into TUs, and so on.
  • the QTBT is used for partitioning a CTU into CUs, where the root node of the QTBT is a CTU that is partitioned into multiple CUs by a QTBT structure.
  • the CUs are further processed by prediction and transform coding. To simplify the partition process, there is no further partitioning from CU to PU or from CU to TU. This implies that each CU is equal to a PU as well as a TU.
  • the leaf node of the QTBT structure is the basic unit for prediction and transform.
  • system parameters are set as follows: a CTU with size 128x128, the allowed quadtree leaf node size equal to 16x16, the maximum allowed binary tree root node size equal to 64x64, the minimum allowed binary tree leaf node width and height both equal to 4, and the maximum allowed binary tree depth equal to 4.
  • the CTU is partitioned by a quadtree structure and the leaf quadtree unit may have size from 16x16 (i.e., the minimum allowed quadtree leaf node size) up to 128x128 (i.e., CTU size with no split). If the leaf quadtree unit is 128x128, it cannot be further split by binary tree since the size exceeds the maximum allowed binary tree root node size, 64x64.
  • the leaf quadtree unit can be further split by binary tree, and each leaf quadtree unit is also the root binary tree unit and has binary tree depth as 0.
  • the binary tree depth reaches 4 (i.e., the indicated maximum)
  • no further splitting is implicit.
  • the binary tree node has width equal to 4
  • non-horizontal splitting is implicit
  • the binary tree node has height equal to 4
  • non-vertical splitting is implicit.
  • the leaf nodes of the QTBT are further processed by prediction (e.g. Intra-picture or Inter-picture prediction) and transform coding.
  • the tree structure is applied separately to luma and chroma for I slice, and applied simultaneously to both luma and chroma for P- and B-slice except when certain minimum sizes are reached for the chroma component.
  • the luma CTB has its QTBT block partitioning
  • the two chroma CTBs has another QTBT block partitioning.
  • the two chroma CTBs can also have their own QTBT block partitioning.
  • Fig. 6A through Fig. 6C illustrate examples of redundant structures.
  • a block is split into 4 sub-blocks directly using quad-partition.
  • Fig. 6B a block is split into an above block and a below block using horizontal binary partition, and each block is further split into a left block and a right block using vertical binary partition.
  • Fig. 6C a block is split into a left block and a right block using vertical binary partition, and each block is further split into an above block and a below block using horizontal binary partition. All splitting paths in Fig. 6A through Fig. 6C result in the same partitions, i.e., four sub-blocks.
  • a method of block partitioning for video encoding or decoding for a video encoder or a video decoder according to the preamble portion of claim 1 is known from US patent application US2013/0148729A1 . Further methods for video encoding or decoding for a video encoder or a video decoder are known from US2015/0103906A1 and from the IEEE article "Block Partitioning Structure in HEVC Standard", XP011487154.
  • a method and apparatus of block partition for video encoding or decoding for a video encoder or a video decoder respectively according to the independent claims are disclosed. Enabling disclosure for the invention is found in the embodiment of Figures 7 and 8 . The remaining embodiments are to be understood as examples which do not describe parts of the present invention.
  • a partitioning tree structure corresponding to a conditional partitioning process is determined for partitioning the current block of video data into one or more final sub-blocks.
  • the conditional partitioning process comprises a conditional binary partitioning process that uses at least a first constraint if a given block of the partitioning tree structure (e.g., the current block) is partitioned into an above block and a below block, or a second constraint if the given block of the partitioning tree structure is partitioned into a left block and a right block.
  • the below block is disallowed to be split into a first lower-left block and a first lower-right block according to the first constraint
  • the right block is disallowed to be split into a secondupper-right block and a second lower-right block according to the second constraint.
  • An encoding or decoding process comprising prediction process, transform process or both is then applied to the current block of video data by applying the encoding or decoding process at a level corresponding to the final sub-blocks.
  • the partitioning tree structure is determined by the video encoder and information associated with the partitioning tree structure is signalled from the video encoder to a video decoder.
  • the partitioning tree structure is determined by the video decoder based on information associated with the partitioning tree structure signalled in a bitstream.
  • the conditional binary partitioning process can be applied to the given block recursively to generate binary tree leaf nodes belonging to said one or more final sub-blocks.
  • conditional binary partitioning process may use both first constraint and the second constraint.
  • conditional binary partitioning process uses only the first constraint or the second constraint.
  • a flag can be signalled for the left block to indicate whether the left block is split into a second upper-left block and a second lower-left block, and no flag is signalled for the right block to indicate whether the right block is split into the second upper-right block and the second lower-right block.
  • one flag is signalled for the above block to indicate whether the above block is split into a first upper-left block and a first upper-right block
  • no flag is signalled for the below block to indicate whether the below block is split into the first lower-left block and the first lower-right block.
  • conditional binary partitioning process uses the first constraint, the second constraint or both can be based on a slice type of a current slice covering the current block of video data. For example, the conditional binary partitioning process uses only the first constraint or the second constraint if the current slice is a P-slice or B-slice, and the conditional binary partitioning process uses neither the first constraint nor the second constraint if the current slice is an I-slice. In another example, the conditional binary partitioning process uses only the first constraint or the second constraint if the current slice is an I-slice, and the conditional binary partitioning process uses neither the first constraint nor the second constraint if the current slice is a P-slice or B-slice.
  • conditional binary partitioning process uses the first constraint, the second constraint or both can be based on a colour component type of the current block of video data. For example, the conditional binary partitioning process uses only the first constraint or the second constraint if the current block of video data is a luma component, and the conditional binary partitioning process uses neither the first constraint nor the second constraint if the current block of video data is a chroma component. In another example, the conditional binary partitioning process uses only the first constraint or the second constraint if the current block of video data is a chroma component, and the conditional binary partitioning process uses neither the first constraint nor the second constraint if the current block of video data is a luma component.
  • At least one flag can be signalled in VPS (video parameter set), SPS (sequence parameter set), PPS (picture parameter set), slice header, or CU (coding unit) to indicate whether the first constraint, the second constraint, or both is included for the conditional binary partitioning process.
  • VPS video parameter set
  • SPS sequence parameter set
  • PPS picture parameter set
  • slice header or CU (coding unit)
  • constraint I This constraint is named constraint I or first constraint in this disclosure as illustrated in Fig. 7 .
  • the first constraint is used if the above block is split into an upper-left block and an upper-right block.
  • a block when a block is split into a left block and a right block using vertical binary partition (partition 810) and the left block is split into an above block and a below block using horizontal binary partition (partition820), then the right block is not allowed to be split into an above block and a below block (partition 830 is not allowed).
  • This constraint is named constraint II or second constraint in this disclosure as illustrated in Fig. 8 .
  • the second constraint is used if the left block is split into an upper-left block and a lower-left block.
  • constraint I and constraint II adaptively depending on the block to be partitioned. For example, when a block can be split into either four or two sub-blocks (i.e., both quad-partition and binary partition are allowed for this block), both constraint I and constraint II are applied. In another example, when a block can only be split into two sub-blocks (i.e., only binary partition is allowed for this block), constraint I is applied and constraint II is not applied. In yet another example, when a block can only be split into two sub-blocks, constraint II is applied and constraint I is not applied.
  • constraint I When constraint I is applied, only one flag is signalled to indicate the splitting mode for the above block since there is no need to signal for the below block (according to constraint I, the below block is disallowed to be split into a lower-left block and a lower-right block). The flag indicates whether the above block is not split, or is further split into an upper-left block and an upper-right block.
  • constraint II when constraint II is applied, only one flag is signalled to indicate the splitting mode for the left block. The flag indicates whether the left block is not split, or is further split into an upper-left block and a lower-left block.
  • constraint I can be applied for the P/B-slice, but not for the I-slice.
  • constraint I is used for the block in the P/B-slice, but is not used for the block in the I-slice.
  • constraint II can be applied for the P/B-slice, but not for the I-slice.
  • constraint II is used for the block in the P/B-slice, but is not used for the block in the I-slice.
  • the constraint I can also be applied for the I-slice, but not for the P/B-slice.
  • constraint II can be applied for the I-slice, but not for the P/B-slice.
  • constraint I can be applied for the luma component, but not for the chroma component.
  • constraint I is used for the luma block, but is not used for the chroma block.
  • constraint II can be applied for the luma component, but not for the chroma component.
  • constraint II is used for the luma block, but is not used for the chroma block.
  • the constraint I may also be applied for the chroma component, but not for the luma component.
  • constraint II can be applied for the chroma component, but not for the luma component.
  • a flag is signalled from the encoder to the decoder to indicate whether constraint I is applied.
  • the flag can be signalled in VPS (video parameter set), SPS (sequence parameter set), PPS (picture parameter set), slice header, or CU.
  • a flag may be signalled from the encoder to the decoder to indicate whether constraint II is applied.
  • the flag can be signalled in VPS, SPS, PPS, slice header, or CU.
  • a flag may be signalled from the encoder to the decoder to indicate whether both of constraint I and constraint II are applied.
  • Fig. 9 illustrates a flowchart for an exemplary coding system incorporating conditional binary partitioning according to an embodiment of the present invention.
  • input data associated with a current block of video data is received in step 910.
  • the input data may correspond to pixel data to be coded or predicted or residual data to be processed by transform.
  • the input data correspond to coded transform data to be inverse-transformed or coded pixel data to be decoded or to be predicted.
  • the partitioning tree structure corresponding to a conditional partitioning process for partitioning the current block of video data into one or more final sub-blocks is determined in step 920.
  • the encoder determines the partitioning tree structure based on, for example, the attribute of the video data and signals the information associated therewith in the bitstream.
  • the decoder can determines the partitioning tree structure based on the information associated with the partitioning tree structure signalled in the bitstream.
  • the conditional partitioning process comprises a conditional binary partitioning process that uses at least a first constraint if a given block of the partitioning tree structure (e.g., the current block) is partitioned into an above block and a below block, or a second constraint if the given block of the partitioning tree structure (e.g., the current block) is partitioned into a left block and a right block.
  • the below block is disallowed to be split into a lower-left block and a lower-right block according to the first constraint
  • the right block is disallowed to be split into a upper-right block and a lower-right block according to the second constraint.
  • the conditional binary partitioning process is applied to the given block (e.g., the current block) recursively to generate binary tree leaf nodes belonging to the final sub-blocks.
  • the encoding or decoding process comprising prediction process, transform process or both are applied to the current block of video data by applying the encoding or decoding process at a level corresponding to the final sub-blocks as shown in step 930.
  • Embodiment of the present invention as described above may be implemented in various hardware, software codes, or a combination of both.
  • an embodiment of the present invention can be one or more circuit circuits integrated into a video compression chip or program code integrated into video compression software to perform the processing described herein.
  • An embodiment of the present invention may also be program code to be executed on a Digital Signal Processor (DSP) to perform the processing described herein.
  • DSP Digital Signal Processor
  • the invention may also involve a number of functions to be performed by a computer processor, a digital signal processor, a microprocessor, or field programmable gate array (FPGA).
  • These processors can be configured to perform particular tasks according to the invention, by executing machine-readable software code or firmware code that defines the particular methods embodied by the invention.
  • the software code or firmware code may be developed in different programming languages and different formats or styles.
  • the software code may also be compiled for different target platforms.

Claims (15)

  1. Verfahren einer Blockpartitionierung für eine Video-Codierung oder -Decodierung jeweils für einen Video-Codierer oder einen Video-Decodierer, wobei das Verfahren umfasst:
    Empfangen (910) von Eingangsdaten, die zu einem aktuellen Block von Videodaten gehören;
    Bestimmen (920) einer Partitionierungsbaumstruktur, die zu einem abhängigen Partitionierungsprozess zum Partitionieren des aktuellen Blocks von Videodaten in einen oder mehrere finale Unterblöcke korrespondiert; und
    Anwenden (930) eines Codierungs- oder Decodierungs-Prozesses, der einen Prädiktionsprozess, einen Transformationsprozess oder beide umfasst, auf den aktuellen Block von Videodaten durch Anwenden des Codierungs- oder Decodierungs-Prozesses auf einer Ebene, die zu den finalen Unterblöcken korrespondiert;
    dadurch gekennzeichnet, dass
    der abhängige Partitionierungsprozess einen abhängigen binären Partitionierungsprozess umfasst, der mindestens verwendet
    eine erste Bedingung, die definiert, dass, wenn ein gegebener Block der Partitionierungsbaumstruktur unter Verwendung einer horizontalen binären Partition in einen oberen Block und einen unteren Block partitioniert ist, und der obere Block unter Verwendung einer vertikalen binären Partition in einen linken Block und einen rechten Block geteilt ist, der untere Block nicht in einen linken Block und einen rechten Block geteilt werden darf, oder
    eine zweite Bedingung, die definiert, dass, wenn der gegebene Block der Partitionierungsbaumstruktur unter Verwendung einer vertikalen binären Partition in einen linken Block und einen rechten Block partitioniert ist, und der linke Block unter Verwendung einer horizontalen binären Partition in einen oberen Block und einen unteren Block geteilt ist, der rechte Block nicht in einen oberen Block und einen unteren Block geteilt werden darf.
  2. Verfahren gemäß Anspruch 1, wobei das Bestimmen der Partitionierungsbaumstruktur durch den Video-Codierer ausgeführt wird und Informationen, die zu der Partitionierungsbaumstruktur gehören, von dem Video-Codierer zu dem Video-Decodierer signalisiert werden.
  3. Verfahren gemäß Anspruch 1, wobei das Bestimmen der Partitionierungsbaumstruktur durch den Video-Decodierer basierend auf Informationen ausgeführt wird, die zu der Partitionierungsbaumstruktur gehören, die in einem Bitstrom signalisiert wird.
  4. Verfahren gemäß Anspruch 1, wobei der abhängige binäre Partitionierungsprozess rekursiv auf den gegebenen Block angewendet wird, um binäre Baumendknoten zu generieren, die zu dem einen oder den mehreren finalen Unterblöcken gehören.
  5. Verfahren gemäß Anspruch 1, wobei, wenn sowohl eine Quad-Partition als auch eine Binärpartition für den gegebenen Block der Partitionierungsbaumstruktur erlaubt sind, der abhängige binäre Partitionierungsprozess sowohl die erste Bedingung als auch die zweite Bedingung verwendet.
  6. Verfahren gemäß Anspruch 1, wobei wenn nur eine binäre Partition für den gegebenen Block der Partitionierungsbaumstruktur erlaubt ist, der abhängige binäre Partitionierungsprozess nur die erste Bedingung verwendet oder nur die zweite Bedingung verwendet.
  7. Verfahren gemäß Anspruch 1, wobei, wenn der abhängige binäre Partitionierungsprozess die zweite Bedingung verwendet, ein Kennzeichen für den linken Block signalisiert wird, um anzuzeigen, ob der linke Block in einen zweiten oberen linken Block und einen zweiten unteren linken Block geteilt ist, und kein Kennzeichen für den rechten Block signalisiert wird, um anzuzeigen, ob der rechte Block in den zweiten oberen rechten Block und den zweiten unteren rechten Block geteilt ist.
  8. Verfahren gemäß Anspruch 1, wobei, wenn der abhängige binäre Partitionierungsprozess die erste Bedingung verwendet, ein Kennzeichen für den oberen Block signalisiert wird, um anzuzeigen, ob der obere Block in einen ersten oberen linken Block und einen ersten oberen rechten Block geteilt ist, und kein Kennzeichen für den unteren Block signalisiert wird, um anzuzeigen, ob der untere Block in den ersten unteren linken Block und den ersten unteren rechten Block geteilt ist.
  9. Verfahren gemäß Anspruch 1, wobei, ob der abhängige binäre Partitionierungsprozess die erste Bedingung, die zweite Bedingung oder beide verwendet, auf einem Slice-Typ einer aktuellen Slice basiert, die den aktuellen Block von Videodaten abdeckt, wobei bevorzugt:
    der abhängige binäre Partitionierungsprozess die erste Bedingung oder die zweite Bedingung verwendet, wenn die aktuelle Slice eine P-Slice oder B-Slice ist, und wobei der abhängige binäre Partitionierungsprozess weder die erste Bedingung noch die zweite Bedingung verwendet, wenn die aktuelle Slice eine I-Slice ist; oder
    der abhängige binäre Partitionierungsprozess die erste Bedingung oder die zweite Bedingung verwendet, wenn die aktuelle Slice eine I-Slice ist, und wobei der abhängige binäre Partitionierungsprozess weder die erste Bedingung noch die zweite Bedingung verwendet, wenn die aktuelle Slice eine P-Slice oder eine B-Slice ist.
  10. Verfahren gemäß Anspruch 1, wobei, ob der abhängige binäre Partitionierungsprozess die erste Bedingung, die zweite Bedingung oder beide verwendet, auf einem Farbkomponententyp des aktuellen Blocks von Videodaten basiert, wobei bevorzugt:
    der abhängige binäre Partitionierungsprozess die erste Bedingung oder die zweite Bedingung verwendet, wenn der aktuelle Block von Videodaten eine Luminanz-Komponente ist, und wobei der abhängige binäre Partitionierungsprozess weder die erste Bedingung noch die zweite Bedingung verwendet, wenn der aktuelle Block von Videodaten eine Chrominanz-Komponente ist; oder
    der abhängige binäre Partitionierungsprozess die erste Bedingung oder die zweite Bedingung verwendet, wenn der aktuelle Block von Videodaten eine Chrominanz-Komponente ist, und wobei der abhängige binäre Partitionierungsprozess weder die erste Bedingung noch die zweite Bedingung verwendet, wenn der aktuelle Block von Videodaten eine Luminanz-Komponente ist.
  11. Verfahren gemäß Anspruch 1, wobei mindestens ein Kennzeichen in einem VPS (Videoparametersatz), SPS (Sequenzparametersatz), PPS (Bildparametersatz), einem Slice-Kopf oder einer CU (Codierungseinheit) signalisiert wird, um anzuzeigen, ob die erste Bedingung, die zweite Bedingung oder sowohl die erste Bedingung als auch die zweite Bedingung für den abhängigen binären Partitionierungsprozess eingeschlossen sind.
  12. Verfahren gemäß Anspruch 1, wobei der abhängige binäre Partitionierungsprozess die erste Bedingung verwendet, wenn der obere Block in einen ersten oberen linken Block und einen ersten oberen rechten Block geteilt ist.
  13. Verfahren gemäß Anspruch 1, wobei der abhängige binäre Partitionierungsprozess die zweite Bedingung verwendet, wenn der linke Block in einen zweiten oberen linken Block und einen zweiten unteren linken Block geteilt ist.
  14. Vorrichtung für eine Blockpartitionierung für eine Video-Codierung oder -Decodierung, die jeweils durch einen Video-Codierer oder einen Video-Decodierer ausgeführt wird, wobei die Vorrichtung eine oder mehrere Elektronikschaltungen oder einen Prozessor aufweist, eingerichtet zum:
    Empfangen von Eingangsdaten, die zu einem aktuellen Block von Videodaten gehören;
    Bestimmen einer Partitionierungsbaumstruktur, die zu einem abhängigen Partitionierungsprozess zum Partitionieren des aktuellen Blocks von Videodaten in einen oder mehrere finale Unterblöcke korrespondiert; und
    Anwenden eines Codierungs- oder Decodierungs-Prozesses, der einen Prädiktionsprozess, einen Transformationsprozess oder beide umfasst, auf den aktuellen Block von Videodaten durch Anwenden des Codierungs- oder Decodierungs-Prozesses auf einer Ebene, die zu den finalen Unterblöcken korrespondiert;
    dadurch gekennzeichnet, dass
    der abhängige Partitionierungsprozess einen abhängigen binären Partitionierungsprozess umfasst, der mindestens verwendet
    eine erste Bedingung, die definiert, dass, wenn ein gegebener Block der Partitionierungsbaumstruktur unter Verwendung einer horizontalen binären Partition in einen oberen Block und einen unteren Block partitioniert ist, und der obere Block unter Verwendung einer vertikalen binären Partition in einen linken Block und einen rechten Block geteilt ist, der untere Block nicht in einen linken Block und einen rechten Block geteilt werden darf, oder
    eine zweite Bedingung, die definiert, dass, wenn der gegebene Block der Partitionierungsbaumstruktur unter Verwendung einer vertikalen binären Partition in einen linken Block und einen rechten Block partitioniert ist, und der linke Block unter Verwendung einer horizontalen binären Partition in einen oberen Block und einen unteren Block geteilt ist, der rechte Block nicht in einen oberen Block und einen unteren Block geteilt werden darf.
  15. Vorrichtung gemäß Anspruch 14, wobei wenn sowohl eine Quad-Partition als auch eine Binärpartition für den gegebenen Block der Partitionierungsbaumstruktur erlaubt sind, der abhängige binäre Partitionierungsprozess sowohl die erste Bedingung als auch die zweite Bedingung verwendet; oder
    wenn nur eine binäre Partition für den gegebenen Block der Partitionierungsbaumstruktur erlaubt ist, der abhängige binäre Partitionierungsprozess nur die erste Bedingung oder nur die zweite Bedingung verwendet.
EP16823825.1A 2015-07-15 2016-07-07 Verfahren für bedingte binäre baumblockpartitionierungsstruktur für bild- und videocodierung Active EP3298777B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
PCT/CN2015/084062 WO2017008263A1 (en) 2015-07-15 2015-07-15 Conditional binary tree block partitioning structure
PCT/CN2016/089106 WO2017008678A1 (en) 2015-07-15 2016-07-07 Method of conditional binary tree block partitioning structure for video and image coding

Publications (3)

Publication Number Publication Date
EP3298777A1 EP3298777A1 (de) 2018-03-28
EP3298777A4 EP3298777A4 (de) 2018-10-31
EP3298777B1 true EP3298777B1 (de) 2020-02-05

Family

ID=57756725

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16823825.1A Active EP3298777B1 (de) 2015-07-15 2016-07-07 Verfahren für bedingte binäre baumblockpartitionierungsstruktur für bild- und videocodierung

Country Status (6)

Country Link
US (1) US10334281B2 (de)
EP (1) EP3298777B1 (de)
CN (1) CN107836117B (de)
MX (1) MX2018000623A (de)
RU (1) RU2689182C1 (de)
WO (2) WO2017008263A1 (de)

Families Citing this family (49)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11223852B2 (en) * 2016-03-21 2022-01-11 Qualcomm Incorporated Coding video data using a two-level multi-type-tree framework
US10567808B2 (en) * 2016-05-25 2020-02-18 Arris Enterprises Llc Binary ternary quad tree partitioning for JVET
US10326989B2 (en) * 2016-05-25 2019-06-18 Arris Enterprises Llc General block partitioning method
KR102531386B1 (ko) * 2016-10-04 2023-05-12 주식회사 비원영상기술연구소 영상 데이터 부호화/복호화 방법 및 장치
CN115883826A (zh) * 2016-10-10 2023-03-31 三星电子株式会社 用于对图像进行编码/解码的方法和设备
JP6565885B2 (ja) 2016-12-06 2019-08-28 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム、並びに画像復号化装置、画像復号化方法及び画像復号化プログラム
MX2019008789A (es) * 2017-01-31 2019-09-11 Sharp Kk Sistemas y metodos para particionar una imagen en bloques de video para codificacion de video.
PL3477949T3 (pl) 2017-02-06 2024-02-19 Huawei Technologies Co., Ltd. Sposób i urządzenie do dekodowania obrazu z zastosowaniem informacji o podziale jednostki drzewa kodowania
KR102354628B1 (ko) * 2017-03-31 2022-01-25 한국전자통신연구원 부호화 트리 유닛 및 부호화 유닛의 처리를 수행하는 영상 처리 방법, 그를 이용한 영상 복호화, 부호화 방법 및 그 장치
CN116684602A (zh) * 2017-03-31 2023-09-01 松下电器（美国）知识产权公司 图像编码装置及方法、图像解码装置及方法、存储介质
JP6680260B2 (ja) 2017-04-28 2020-04-15 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム、並びに画像復号化装置、画像復号化方法及び画像復号化プログラム
KR102435881B1 (ko) 2017-05-26 2022-08-24 에스케이텔레콤 주식회사 영상 부호화 또는 복호화하기 위한 장치 및 방법
CN117201819A (zh) 2017-05-26 2023-12-08 Sk电信有限公司 对视频数据进行编码或解码的方法和存储比特流的方法
US11228757B2 (en) 2017-05-31 2022-01-18 Interdigital Vc Holdings, Inc. Method and a device for picture encoding and decoding
CN112601084A (zh) * 2017-06-28 2021-04-02 华为技术有限公司 一种图像数据的编码、解码方法及装置
CN109510987B (zh) 2017-09-15 2022-12-06 华为技术有限公司 编码树节点划分方式的确定方法、装置及编码设备
CN109510997B (zh) * 2017-09-15 2022-09-23 华为技术有限公司 图像编码方法及设备
EP3725083A1 (de) * 2017-12-14 2020-10-21 InterDigital VC Holdings, Inc. Verfahren und vorrichtung zur codierung eines bildblocks
WO2019147403A1 (en) 2018-01-29 2019-08-01 Interdigital Vc Holdings, Inc. Encoding and decoding with refinement of the reconstructed picture
EP3777147B1 (de) * 2018-03-29 2023-02-01 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Vorrichtung und verfahren zur codierung und decodierung eines bildes mittels bildgrenzenhandhabung
WO2019191218A1 (en) 2018-03-30 2019-10-03 Interdigital Vc Holdings, Inc. Chroma quantization parameter adjustment in video encoding and decoding
US10972758B2 (en) * 2018-04-02 2021-04-06 Qualcomm Incorporated Multi-type-tree framework for transform in video coding
CN108737819B (zh) * 2018-05-20 2021-06-11 北京工业大学 一种基于四叉树二叉树结构的灵活编码单元划分方法
WO2019225991A1 (ko) * 2018-05-23 2019-11-28 주식회사 케이티 비디오 신호 처리 방법 및 장치
WO2019234613A1 (en) 2018-06-05 2019-12-12 Beijing Bytedance Network Technology Co., Ltd. Partition tree with partition into 3 sub-blocks by horizontal and vertical splits
CN113225564B (zh) 2018-07-12 2022-11-11 华为技术有限公司 视频译码中的边界块分割
CN112385220B (zh) * 2018-07-14 2022-12-09 寰发股份有限公司 对具有分割约束的视频图像进行编码或解码的方法和装置
EP3843391A4 (de) 2018-08-24 2022-06-01 Samsung Electronics Co., Ltd. Videodekodierungsverfahren und -apparat, und videokodierungsverfahren und -apparat
TWI820197B (zh) * 2018-08-28 2023-11-01 大陸商北京字節跳動網絡技術有限公司 與擴展四叉樹相關的分割的二值化
CN116208767B (zh) 2018-09-03 2023-11-28 华为技术有限公司 一种对码流进行解码的方法、装置以及存储码流的设备
CA3111340A1 (en) * 2018-09-03 2020-03-12 Huawei Technologies Co., Ltd. A video encoder, a video decoder and corresponding methods
CN112740689B (zh) 2018-09-18 2024-04-12 华为技术有限公司 视频编码器、视频解码器及对应方法
WO2020057530A1 (en) 2018-09-18 2020-03-26 Huawei Technologies Co., Ltd. Coding method, device, system
WO2020084476A1 (en) 2018-10-22 2020-04-30 Beijing Bytedance Network Technology Co., Ltd. Sub-block based prediction
WO2020084554A1 (en) 2018-10-24 2020-04-30 Beijing Bytedance Network Technology Co., Ltd. Searching based motion candidate derivation for sub-block motion vector prediction
WO2020084601A1 (en) * 2018-10-26 2020-04-30 Beijing Bytedance Network Technology Co., Ltd. Redundancy reduction in block partition
WO2020098643A1 (en) 2018-11-12 2020-05-22 Beijing Bytedance Network Technology Co., Ltd. Simplification of combined inter-intra prediction
US20210377553A1 (en) * 2018-11-12 2021-12-02 Interdigital Vc Holdings, Inc. Virtual pipeline for video encoding and decoding
CN113170171B (zh) 2018-11-20 2024-04-12 北京字节跳动网络技术有限公司 组合帧间帧内预测模式的预测细化
EP3861742A4 (de) 2018-11-20 2022-04-13 Beijing Bytedance Network Technology Co., Ltd. Differenzberechnung basierend auf einer räumlichen position
JP7319365B2 (ja) 2018-11-22 2023-08-01 北京字節跳動網絡技術有限公司 サブブロックに基づくインター予測のための調整方法
WO2020164479A1 (en) * 2019-02-11 2020-08-20 Beijing Bytedance Network Technology Co., Ltd. Video block partition based on quinary tree
WO2020177756A1 (en) 2019-03-06 2020-09-10 Beijing Bytedance Network Technology Co., Ltd. Size dependent inter coding
EP3922014A4 (de) 2019-04-02 2022-04-06 Beijing Bytedance Network Technology Co., Ltd. Decodiererseitige bewegungsvektorableitung
JP2022530287A (ja) 2019-06-19 2022-06-28 エルジー エレクトロニクス インコーポレイティド クロマブロックのサイズを制限する画像符号化／復号化方法、装置、及びビットストリームを伝送する方法
JP7481430B2 (ja) 2019-08-13 2024-05-10 北京字節跳動網絡技術有限公司 サブブロックに基づくインター予測における動き精度
CN114762330A (zh) 2019-09-22 2022-07-15 北京字节跳动网络技术有限公司 视频的子图片编码和解码
US11418804B2 (en) * 2019-12-31 2022-08-16 Tencent America LLC Method for wrap around motion compensation with reference picture resampling
JP7276549B2 (ja) * 2020-12-18 2023-05-18 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム、並びに画像復号化装置、画像復号化方法及び画像復号化プログラム

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MXPA06013193A (es) * 2004-05-13 2007-02-14 Qualcomm Inc Compresion de encabezado de datos de multimedia transmitidos sobre un sistema de comunicacion inalambrica.
CN1589022A (zh) 2004-08-26 2005-03-02 中芯联合（北京）微电子有限公司 多模式运动估计中由朝向树决定的宏块分割模式选择方法
KR101484280B1 (ko) 2009-12-08 2015-01-20 삼성전자주식회사 임의적인 파티션을 이용한 움직임 예측에 따른 비디오 부호화 방법 및 장치, 임의적인 파티션을 이용한 움직임 보상에 따른 비디오 복호화 방법 및 장치
CN102118615B (zh) * 2010-01-05 2012-08-22 香港应用科技研究院有限公司 采用可变块大小略过模式的视频编/解码方法和装置
US20110310976A1 (en) * 2010-06-17 2011-12-22 Qualcomm Incorporated Joint Coding of Partition Information in Video Coding
US8654860B2 (en) * 2010-11-01 2014-02-18 Mediatek Inc. Apparatus and method for high efficiency video coding using flexible slice structure
US8526495B2 (en) * 2010-11-22 2013-09-03 Mediatek Singapore Pte. Ltd. Apparatus and method of constrained partition size for high efficiency video coding
ES2691743T3 (es) * 2010-12-06 2018-11-28 Sun Patent Trust Método de codificación de imágenes, método de decodificación de imágenes, dispositivo de codificación de imágenes y dispositivo de decodificación de imágenes
US9049452B2 (en) * 2011-01-25 2015-06-02 Mediatek Singapore Pte. Ltd. Method and apparatus for compressing coding unit in high efficiency video coding
EP4228264A1 (de) 2011-06-23 2023-08-16 Sun Patent Trust Bilddekodierungsvorrichtung, bildkodierungsvorrichtung
US9332283B2 (en) * 2011-09-27 2016-05-03 Broadcom Corporation Signaling of prediction size unit in accordance with video coding
US9451252B2 (en) * 2012-01-14 2016-09-20 Qualcomm Incorporated Coding parameter sets and NAL unit headers for video coding
US9591331B2 (en) * 2012-03-28 2017-03-07 Qualcomm Incorporated Merge signaling and loop filter on/off signaling
CN102801976B (zh) * 2012-08-03 2014-10-22 山东省科学院情报研究所 基于三维小波视频编码的帧间块模式选择方法
US9544601B2 (en) * 2013-10-15 2017-01-10 Qualcomm Incorporated Wedgelet pattern extension for depth intra coding
CA3050482C (en) * 2013-11-14 2021-02-16 Hfi Innovation Inc. Method of video coding using prediction based on intra picture block copy
US9693077B2 (en) * 2013-12-13 2017-06-27 Qualcomm Incorporated Controlling sub prediction unit (sub-PU) motion parameter inheritance (MPI) in three dimensional (3D) HEVC or other 3D coding
WO2016090568A1 (en) 2014-12-10 2016-06-16 Mediatek Singapore Pte. Ltd. Binary tree block partitioning structure
US9775141B2 (en) 2015-07-14 2017-09-26 Motorola Mobility Llc Method and apparatus for reducing latency of LTE uplink transmissions

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
MX2018000623A (es) 2018-05-11
RU2689182C1 (ru) 2019-05-24
US20180213264A1 (en) 2018-07-26
WO2017008678A1 (en) 2017-01-19
CN107836117A (zh) 2018-03-23
US10334281B2 (en) 2019-06-25
WO2017008263A1 (en) 2017-01-19
EP3298777A4 (de) 2018-10-31
CN107836117B (zh) 2020-07-31
BR112018000549A2 (pt) 2018-09-18
EP3298777A1 (de) 2018-03-28

Similar Documents

Publication Publication Date Title
EP3298777B1 (de) Verfahren für bedingte binäre baumblockpartitionierungsstruktur für bild- und videocodierung
EP3363199B1 (de) Verfahren und vorrichtung zur entropiecodierung und kontextmodellierung zur video- und bildcodierung
EP3731527B1 (de) Verfahren und vorrichtung einer palettenmoduscodierung für farbvideodaten
US10375393B2 (en) Method of video coding using binary tree block partitioning
US11039147B2 (en) Method and apparatus of palette mode coding for colour video data
US20170244964A1 (en) Method and Apparatus of Flexible Block Partition for Video Coding
WO2020140876A1 (en) Method and apparatus of luma-chroma separated coding tree coding with constraints
EP4102837A1 (de) Verfahren und vorrichtung für alternativen transformationsüberspringmodus für die bild- und videocodierung
US11785258B2 (en) Methods and apparatus for signaling coding unit partitioning of video data
WO2021036939A1 (en) Method and apparatus of partitioning small size coding units with partition constraints
US11665345B2 (en) Method and apparatus of luma-chroma separated coding tree coding with constraints
WO2017088170A1 (en) Entropy coding the binary tree block partitioning structure
WO2017114450A1 (en) Method and apparatus of prediction binary tree structure for video and image coding
US20220224890A1 (en) Method and Apparatus of Partitioning Small Size Coding Units with Partition Constraints
WO2023197832A1 (en) Method and apparatus of using separate splitting trees for colour components in video coding system
WO2023198013A1 (en) Methods and apparatus of cu partition using signalling predefined partitions in video coding

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20171222

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602016029243

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04N0019122000

Ipc: H04N0019176000

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20180927

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/96 20140101ALI20180922BHEP

Ipc: H04N 19/119 20140101ALI20180922BHEP

Ipc: H04N 19/176 20140101AFI20180922BHEP

Ipc: H04N 19/70 20140101ALI20180922BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20190722

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

GRAL Information related to payment of fee for publishing/printing deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR3

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

GRAR Information related to intention to grant a patent recorded

Free format text: ORIGINAL CODE: EPIDOSNIGR71

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

INTC Intention to grant announced (deleted)
INTG Intention to grant announced

Effective date: 20191220

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1230728

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200215

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016029243

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20200205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200505

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200628

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200605

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200506

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016029243

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1230728

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200205

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20201106

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20200731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200707

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200731

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200731

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200707

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200205

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230627

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230727

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230727

Year of fee payment: 8