WO2019188845A1 - Systèmes et procédés de partitionnement de blocs vidéo pour un codage vidéo reposant sur des valeurs seuil - Google Patents

Systèmes et procédés de partitionnement de blocs vidéo pour un codage vidéo reposant sur des valeurs seuil Download PDF

Info

Publication number
WO2019188845A1
WO2019188845A1 PCT/JP2019/012255 JP2019012255W WO2019188845A1 WO 2019188845 A1 WO2019188845 A1 WO 2019188845A1 JP 2019012255 W JP2019012255 W JP 2019012255W WO 2019188845 A1 WO2019188845 A1 WO 2019188845A1
Authority
WO
WIPO (PCT)
Prior art keywords
video
coding
partitioning
parameter
threshold value
Prior art date
Application number
PCT/JP2019/012255
Other languages
English (en)
Inventor
Kiran Mukesh MISRA
Christopher Andrew Segall
Original Assignee
Sharp Kabushiki Kaisha
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 Sharp Kabushiki Kaisha filed Critical Sharp Kabushiki Kaisha
Publication of WO2019188845A1 publication Critical patent/WO2019188845A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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/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
    • 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/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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • This disclosure relates to video coding and more particularly to techniques for partitioning a picture of video data.
  • Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, laptop or desktop computers, tablet computers, digital recording devices, digital media players, video gaming devices, cellular telephones, including so-called smartphones, medical imaging devices, and the like.
  • Digital video may be coded according to a video coding standard.
  • Video coding standards may incorporate video compression techniques. Examples of video coding standards include ISO/IEC MPEG-4 Visual and ITU-T H.264 (also known as ISO/IEC MPEG-4 AVC) and High-Efficiency Video Coding (HEVC).
  • HEVC is described in High Efficiency Video Coding (HEVC), Rec. ITU-T H.265, December 2016, which is incorporated by reference, and referred to herein as ITU-T H.265.
  • ITU-T H.265 Extensions and improvements for ITU-T H.265 are currently being considered for the development of next generation video coding standards.
  • ITU-T Video Coding Experts Group (VCEG) and ISO/IEC (Moving Picture Experts Group (MPEG) are studying the potential need for standardization of future video coding technology with a compression capability that significantly exceeds that of the current HEVC standard.
  • JVET Joint Video Exploration Team
  • JEM 7 Joint Exploration Model 7
  • JEM 7 Algorithm Description of Joint Exploration Test Model 7
  • JEM 7 is implemented in JEM reference software.
  • JEM may collectively refer to algorithms included in JEM 7 and implementations of JEM reference software.
  • Video compression techniques enable data requirements for storing and transmitting video data to be reduced. Video compression techniques may reduce data requirements by exploiting the inherent redundancies in a video sequence. Video compression techniques may sub-divide a video sequence into successively smaller portions (i.e., groups of frames within a video sequence, a frame within a group of frames, slices within a frame, coding tree units (e.g., macroblocks) within a slice, coding blocks within a coding tree unit, etc.). Intra prediction coding techniques (e.g., intra-picture (spatial)) and inter prediction techniques (i.e., inter-picture (temporal)) may be used to generate difference values between a unit of video data to be coded and a reference unit of video data.
  • Intra prediction coding techniques e.g., intra-picture (spatial)
  • inter prediction techniques i.e., inter-picture (temporal)
  • Residual data may be coded as quantized transform coefficients.
  • Syntax elements may relate residual data and a reference coding unit (e.g., intra-prediction mode indices, motion vectors, and block vectors).
  • Residual data and syntax elements may be entropy coded. Entropy encoded residual data and syntax elements may be included in a compliant bitstream.
  • a method of partitioning video data for video coding comprises determining a parameter threshold value, determining whether a parameter associated with a current video block is greater than the parameter threshold value, and disabling one or more partitioning modes for the current video block based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • a method of reconstructing video data comprises determining a parameter threshold value, determining whether a parameter associated with a current video block is greater than the parameter threshold value, receiving signaling corresponding to a partitioning associated the current video block, and determining partitioning associated the current video block based on the received signaling and based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • FIG. 1 is a conceptual diagram illustrating an example of a group of pictures coded according to a quad tree binary tree partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 2 is a conceptual diagram illustrating an example of a quad tree binary tree in accordance with one or more techniques of this disclosure.
  • FIG. 3 is a conceptual diagram illustrating video component quad tree binary tree partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 4 is a conceptual diagram illustrating an example of a video component sampling format in accordance with one or more techniques of this disclosure.
  • FIG. 5 is a conceptual diagram illustrating possible coding structures for a block of video data according to one or more techniques of this disclosure.
  • FIGS. 1 is a conceptual diagram illustrating an example of a group of pictures coded according to a quad tree binary tree partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 2 is a conceptual diagram illustrating an example of a quad tree binary tree in accordance with one or more techniques of this disclosure.
  • FIG. 6A is a conceptual diagrams illustrating examples of coding a block of video data in accordance with one or more techniques of this disclosure.
  • FIGS. 6B is a conceptual diagrams illustrating examples of coding a block of video data in accordance with one or more techniques of this disclosure.
  • FIG. 7 is a conceptual diagram illustrating partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 8A is a conceptual diagram illustrating temporal layers of video in accordance with one or more techniques of this disclosure.
  • FIG. 8B is a conceptual diagram illustrating an example low-delay prediction structure in accordance with one or more techniques of this disclosure.
  • FIG. 9 is a block diagram illustrating an example of a system that may be configured to encode and decode video data according to one or more techniques of this disclosure.
  • FIG. 9 is a block diagram illustrating an example of a system that may be configured to encode and decode video data according to one or more techniques of this disclosure.
  • FIG. 10 is a block diagram illustrating an example of a video encoder that may be configured to encode video data according to one or more techniques of this disclosure.
  • FIG. 11 is a block diagram illustrating an example of a video decoder that may be configured to decode video data according to one or more techniques of this disclosure.
  • this disclosure describes various techniques for coding video data.
  • this disclosure describes techniques for partitioning a picture of video data.
  • this disclosure describes techniques of this disclosure with respect to ITU-T H.264, ITU-T H.265, and JEM, the techniques of this disclosure are generally applicable to video coding.
  • the coding techniques described herein may be incorporated into video coding systems, (including video coding systems based on future video coding standards) including block structures, intra prediction techniques, inter prediction techniques, transform techniques, filtering techniques, and/or entropy coding techniques other than those included in ITU-T H.265 and JEM.
  • ITU-T H.264, ITU-T H.265, and/or JEM is for descriptive purposes and should not be construed to limit the scope of the techniques described herein.
  • incorporation by reference of documents herein is for descriptive purposes and should not be construed to limit or create ambiguity with respect to terms used herein.
  • the term should be interpreted in a manner that broadly includes each respective definition and/or in a manner that includes each of the particular definitions in the alternative.
  • a device for partitioning video data for video coding comprises one or more processors configured to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, and disable one or more partitioning modes for the current video block based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • a non-transitory computer-readable storage medium comprises instructions stored thereon that, when executed, cause one or more processors of a device to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, and disable one or more partitioning modes for the current video block based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • an apparatus comprises means for determining a parameter threshold value, means for determining whether a parameter associated with a current video block is greater than the parameter threshold value, and means for disabling one or more partitioning modes for the current video block based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • a device for reconstructing video data comprises one or more processors configured to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, receive signaling corresponding to a partitioning associated the current video block, and determine partitioning associated the current video block based on the received signaling and based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • a non-transitory computer-readable storage medium comprises instructions stored thereon that, when executed, cause one or more processors of a device to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, receive signaling corresponding to a partitioning associated the current video block, and determine partitioning associated the current video block based on the received signaling and based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • an apparatus comprises means for determining a parameter threshold value, means for determining whether a parameter associated with a current video block is greater than the parameter threshold value, means for receiving signaling corresponding to a partitioning associated the current video block, and means for determining partitioning associated the current video block based on the received signaling and based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • Video content typically includes video sequences comprised of a series of frames (or pictures).
  • a series of frames may also be referred to as a group of pictures (GOP).
  • Each video frame or picture may include a plurality of slices or tiles, where a slice or tile includes a plurality of video blocks.
  • video block may generally refer to an area of a picture or may more specifically refer to the largest array of sample values that may be predictively coded, sub-divisions thereof, and/or corresponding structures.
  • the term current video block may refer to an area of a picture being encoded or decoded.
  • a video block may be defined as an array of sample values that may be predictively coded.
  • pixels values may be described as including sample values for respective components of video data, which may also be referred to as color components, (e.g., luma (Y) and chroma (Cb and Cr) components or red, green, and blue components). It should be noted that in some cases, the terms pixel values and sample values are used interchangeably.
  • Video blocks may be ordered within a picture according to a scan pattern (e.g., a raster scan).
  • a video encoder may perform predictive encoding on video blocks and sub-divisions thereof. Video blocks and sub-divisions thereof may be referred to as nodes.
  • ITU-T H.264 specifies a macroblock including 16x16 luma samples. That is, in ITU-T H.264, a picture is segmented into macroblocks.
  • ITU-T H.265 specifies an analogous Coding Tree Unit (CTU) structure. In ITU-T H.265, pictures are segmented into CTUs. In ITU-T H.265, for a picture, a CTU size may be set as including 16x16, 32x32, or 64x64 luma samples.
  • a CTU is composed of respective Coding Tree Blocks (CTB) for each component of video data (e.g., luma (Y) and chroma (Cb and Cr).
  • CTB Coding Tree Blocks
  • a CTU may be partitioned according to a quadtree (QT) partitioning structure, which results in the CTBs of the CTU being partitioned into Coding Blocks (CB). That is, in ITU-T H.265, a CTU may be partitioned into quadtree leaf nodes. According to ITU-T H.265, one luma CB together with two corresponding chroma CBs and associated syntax elements are referred to as a coding unit (CU). In ITU-T H.265, a minimum allowed size of a CB may be signaled. In ITU-T H.265, the smallest minimum allowed size of a luma CB is 8x8 luma samples. In ITU-T H.265, the decision to code a picture area using intra prediction or inter prediction is made at the CU level.
  • QT quadtree
  • ITU-T H.265 a CU is associated with a prediction unit (PU) structure having its root at the CU.
  • PU structures allow luma and chroma CBs to be split for purposes of generating corresponding reference samples. That is, in ITU-T H.265, luma and chroma CBs may be split into respect luma and chroma prediction blocks (PBs), where a PB includes a block of sample values for which the same prediction is applied.
  • PBs chroma prediction blocks
  • a CB may be partitioned into 1, 2, or 4 PBs.
  • ITU-T H.265 supports PB sizes from 64x64 samples down to 4x4 samples.
  • ITU-T H.265 square PBs are supported for intra prediction, where a CB may form the PB or the CB may be split into four square PBs (i.e., intra prediction PB types include MxM or M/2xM/2, where M is the height and width of the square CB).
  • intra prediction PB types include MxM or M/2xM/2, where M is the height and width of the square CB.
  • rectangular PBs are supported for inter prediction, where a CB may by halved vertically or horizontally to form PBs (i.e., inter prediction PB types include MxM, M/2xM/2, M/2xM, or MxM/2).
  • ITU-T H.265 for inter prediction, four asymmetric PB partitions are supported, where the CB is partitioned into two PBs at one quarter of the height (at the top or the bottom) or width (at the left or the right) of the CB (i.e., asymmetric partitions include M/4xM left, M/4xM right, MxM/4 top, and MxM/4 bottom).
  • Intra prediction data e.g., intra prediction mode syntax elements
  • inter prediction data e.g., motion data syntax elements
  • JEM specifies a CTU having a maximum size of 256x256 luma samples.
  • JEM specifies a quadtree plus binary tree (QTBT) block structure.
  • the QTBT structure enables quadtree leaf nodes to be further partitioned by a binary tree (BT) structure. That is, in JEM, the binary tree structure enables quadtree leaf nodes to be recursively divided vertically or horizontally.
  • FIG. 1 illustrates an example of a CTU (e.g., a CTU having a size of 256x256 luma samples) being partitioned into quadtree leaf nodes and quadtree leaf nodes being further partitioned according to a binary tree. That is, in FIG.
  • FIG. 1 dashed lines indicate additional binary tree partitions in a quadtree.
  • the binary tree structure in JEM enables square and rectangular leaf nodes, where each leaf node includes a CB.
  • a picture included in a GOP may include slices, where each slice includes a sequence of CTUs and each CTU may be partitioned according to a QTBT structure.
  • FIG. 1 illustrates an example of QTBT partitioning for one CTU included in a slice.
  • FIG. 2 is a conceptual diagram illustrating an example of a QTBT corresponding to the example QTBT partition illustrated in FIG. 1.
  • a QTBT is signaled by signaling QT split flag and BT split mode syntax elements.
  • a QT split flag has a value of 1
  • a QT split is indicated.
  • a QT split flag has a value of 0
  • no binary splitting is indicated.
  • a BT split mode syntax element has a value of binary value of 11
  • a vertical split mode is indicated.
  • a BT split mode syntax element has a binary value of 10
  • a horizontal split mode is indicated. Further, BT splitting may be performed until a maximum BT depth is reached.
  • a combinations of BT partitions may be used to partition a square QT leaf node in to one of: a T-shape (e.g., if a square is split horizontally and one node is further split vertically) or four parallel rectangles (e.g., if a square is split horizontally and both nodes are further split horizontally).
  • QT split flag syntax elements and BT split mode syntax elements are associated with a depth, where a depth of zero corresponds to a root of a QTBT and higher value depths correspond to subsequent depths beyond the root.
  • luma and chroma components may have separate QTBT partitions. That is, in JEM luma and chroma components may be partitioned independently by signaling respective QTBTs.
  • FIG. 3 illustrates an example of a CTU being partitioned according to a QTBT for a luma component and an independent QTBT for chroma components. As illustrated in FIG.
  • JEM includes the following parameters for signaling of a QTBT tree:
  • MinQTSize, MaxBTSize, MaxBTDepth, and/or MinBTSize may be different for the different components of video.
  • JEM CBs are used for prediction without any further partitioning. That is, in JEM, a CB may be a block of sample values on which the same prediction is applied.
  • a JEM QTBT leaf node may be analogous a PB in ITU-T H.265.
  • a video sampling format which may also be referred to as a chroma format, may define the number of chroma samples included in a CU with respect to the number of luma samples included in a CU.
  • the sampling rate for the luma component is twice that of the chroma components for both the horizontal and vertical directions.
  • the width and height of an array of samples for the luma component are twice that of each array of samples for the chroma components.
  • FIG. 4 is a conceptual diagram illustrating an example of a coding unit formatted according to a 4:2:0 sample format.
  • a 16x16 CU formatted according to the 4:2:0 sample format includes 16x16 samples of luma components and 8x8 samples for each chroma component.
  • the relative position of chroma samples with respect to luma samples for video blocks neighboring the 16x16 CU are illustrated.
  • the width of an array of samples for the luma component is twice that of the width of an array of samples for each chroma component, but the height of the array of samples for the luma component is equal to the height of an array of samples for each chroma component.
  • an array of samples for the luma component has the same width and height as an array of samples for each chroma component.
  • intra prediction data or inter prediction data is used to produce reference sample values for a block of sample values.
  • the difference between sample values included in a current PB, or another type of picture area structure, and associated reference samples (e.g., those generated using a prediction) may be referred to as residual data.
  • Residual data may include respective arrays of difference values corresponding to each component of video data. Residual data may be in the pixel domain.
  • a transform such as, a discrete cosine transform (DCT), a discrete sine transform (DST), an integer transform, a wavelet transform, or a conceptually similar transform, may be applied to an array of difference values to generate transform coefficients.
  • a CU is associated with a transform unit (TU) structure having its root at the CU level. That is, in ITU-T H.265, an array of difference values may be sub-divided for purposes of generating transform coefficients (e.g., four 8x8 transforms may be applied to a 16x16 array of residual values). For each component of video data, such sub-divisions of difference values may be referred to as Transform Blocks (TBs).
  • TBs are not necessarily aligned with PBs.
  • FIG. 5 illustrates examples of alternative PB and TB combinations that may be used for coding a particular CB. Further, it should be noted that in ITU-T H.265, TBs may have the following sizes 4x4, 8x8, 16x16, and 32x32.
  • JEM residual values corresponding to a CB are used to generate transform coefficients without further partitioning. That is, in JEM a QTBT leaf node may be analogous to both a PB and a TB in ITU-T H.265. It should be noted that in JEM, a core transform and a subsequent secondary transforms may be applied (in the video encoder) to generate transform coefficients. For a video decoder, the order of transforms is reversed. Further, in JEM, whether a secondary transform is applied to generate transform coefficients may be dependent on a prediction mode.
  • a quantization process may be performed on transform coefficients.
  • Quantization essentially scales transform coefficients in order to vary the amount of data required to represent a group of transform coefficients.
  • Quantization may include division of transform coefficients by a quantization scaling factor and any associated rounding functions (e.g., rounding to the nearest integer).
  • Quantized transform coefficients may be referred to as coefficient level values.
  • Inverse quantization (or “dequantization”) may include multiplication of coefficient level values by the quantization scaling factor.
  • the value of a quantization scaling factor may be determined by a quantization parameter, QP.
  • the QP can take 52 values from 0 to 51 and a change of 1 for QP generally corresponds to a change in the value of the quantization scaling factor by approximately 12%.
  • a QP value for a set of transform coefficients may be derived using a predictive quantization parameter value (which may be referred to as a predictive QP value or a QP predictive value) and an optionally signaled quantization parameter delta value (which may be referred to as a QP delta value or a delta QP value).
  • a quantization parameter may be updated for each CU and a quantization parameter may be derived for each of luma (Y) and chroma (Cb and Cr) components.
  • a predictive QP value is inherited for the CU (i.e., a QP signaled at the slice level or a QP from a previous CU) and a delta QP value may be optionally signaled for each TU within the CU.
  • quantization process in some instances may refer to division by a scaling factor to generate level values and multiplication by a scaling factor to recover transform coefficients in some instances. That is, a quantization process may refer to quantization in some cases and inverse quantization in some cases.
  • FIGS. 6A-6B are conceptual diagrams illustrating examples of coding a block of video data.
  • a current block of video data e.g., a CB corresponding to a video component
  • a current block of video data is encoded by generating a residual by subtracting a set of prediction values from the current block of video data, performing a transformation on the residual, and quantizing the transform coefficients to generate level values.
  • the current block of video data is decoded by performing inverse quantization on level values, performing an inverse transform, and adding a set of prediction values to the resulting residual. It should be noted that in the examples in FIGS.
  • the sample values of the reconstructed block differs from the sample values of the current video block that is encoded. In this manner, coding may said to be lossy. However, the difference in sample values may be considered acceptable or imperceptible to a viewer of the reconstructed video. Further, as illustrated in FIGS. 6A-6B, scaling is performed using an array of scaling factors.
  • Quantized transform coefficients are coded into a bitstream.
  • Quantized transform coefficients and syntax elements may be entropy coded according to an entropy coding technique.
  • entropy coding techniques include content adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), probability interval partitioning entropy coding (PIPE), and the like.
  • Entropy encoded quantized transform coefficients and corresponding entropy encoded syntax elements may form a compliant bitstream that can be used to reproduce video data at a video decoder.
  • An entropy coding process may include performing a binarization on syntax elements.
  • Binarization refers to the process of converting a value of a syntax value into a series of one or more bits. These bits may be referred to as “bins.” Binarization is a lossless process and may include one or a combination of the following coding techniques: fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding. For example, binarization may include representing the integer value of 5 for a syntax element as 00000101 using an 8-bit fixed length binarization technique or representing the integer value of 5 as 11110 using a unary coding binarization technique.
  • each of the terms fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding may refer to general implementations of these techniques and/or more specific implementations of these coding techniques.
  • a Golomb-Rice coding implementation may be specifically defined according to a video coding standard, for example, ITU-T H.265.
  • An entropy coding process further includes coding bin values using lossless data compression algorithms.
  • a context model may be selected from a set of available context models associated with the bin.
  • a context model may be selected based on a previous bin and/or values of previous syntax elements.
  • a context model may identify the probability of a bin having a particular value. For instance, a context model may indicate a 0.7 probability of coding a 0-valued bin and a 0.3 probability of coding a 1-valued bin. It should be noted that in some cases the probability of coding a 0-valued bin and probability of coding a 1-valued bin may not sum to 1.
  • a CABAC entropy encoder may arithmetically code a bin based on the identified context model. The context model may be updated based on the value of a coded bin.
  • the context model may be updated based on an associated variable stored with the context, e.g., adaptation window size, number of bins coded using the context.
  • an associated variable stored with the context e.g., adaptation window size, number of bins coded using the context.
  • a CABAC entropy encoder may be implemented, such that some syntax elements may be entropy encoded using arithmetic encoding without the usage of an explicitly assigned context model, such coding may be referred to as bypass coding.
  • intra prediction data or inter prediction data may associate an area of a picture (e.g., a PB or a CB) with corresponding reference samples.
  • an intra prediction mode may specify the location of reference samples within a picture.
  • defined possible intra prediction modes include a planar (i.e., surface fitting) prediction mode (predMode: 0), a DC (i.e., flat overall averaging) prediction mode (predMode: 1), and 33 angular prediction modes (predMode: 2-34).
  • defined possible intra-prediction modes include a planar prediction mode (predMode: 0), a DC prediction mode (predMode: 1), and 65 angular prediction modes (predMode: 2-66).
  • planar and DC prediction modes may be referred to as non-directional prediction modes and that angular prediction modes may be referred to as directional prediction modes.
  • angular prediction modes may be referred to as directional prediction modes. It should be noted that the techniques described herein may be generally applicable regardless of the number of defined possible prediction modes.
  • a motion vector For inter prediction coding, a motion vector (MV) identifies reference samples in a picture other than the picture of a video block to be coded and thereby exploits temporal redundancy in video. For example, a current video block may be predicted from reference block(s) located in previously coded frame(s) and a motion vector may be used to indicate the location of the reference block.
  • a motion vector and associated data may describe, for example, a horizontal component of the motion vector, a vertical component of the motion vector, a resolution for the motion vector (e.g., one-quarter pixel precision, one-half pixel precision, one-pixel precision, two-pixel precision, four-pixel precision), a prediction direction and/or a reference picture index value.
  • a coding standard such as, for example ITU-T H.265, may support motion vector prediction.
  • Motion vector prediction enables a motion vector to be specified using motion vectors of neighboring blocks.
  • Examples of motion vector prediction include advanced motion vector prediction (AMVP), temporal motion vector prediction (TMVP), so-called “merge” mode, and “skip” and “direct” motion inference.
  • JEM supports advanced temporal motion vector prediction (ATMVP) and Spatial-temporal motion vector prediction (STMVP).
  • ITU-T H.265 supports four asymmetric PB partitions for inter prediction. Further, it should be noted that with respect to JEM, techniques have been proposed for partitioning CUs according to asymmetric binary tree partitioning.
  • the four additionally defined BT split modes for a CU include: horizontal partitioning at one quarter of the height (at the top for one mode or at the bottom for one mode) or vertical partitioning at one quarter of the width (at the left for one mode or the right for one mode).
  • the four additionally defined BT split modes in Le Leannec are illustrated in FIG. 7 as Hor_Up, Hor_Down, Ver_Left, and Ver_Right.
  • Table 1 provides a summary of the bin coding tree signaling used in Le Leannec for signaling possible partitions. It should be noted that in some examples, binary split modes that do not partition a block into equal halves may be referred to as asymmetric binary tree (ABT) partitions.
  • ABT symmetric binary tree
  • Li describes an example where in addition to the symmetric vertical and horizontal BT split modes, two additional triple tree (TT) split modes are defined. It should be noted that in some cases, partitioning a node into three blocks about a direction may be referring to as triple tree (TT) partitioning.
  • the two additionally defined TT split modes for a node include: (1) horizontal TT partitioning at one quarter of the height from the top edge and the bottom edge of a node; and (2) vertical TT partitioning at one quarter of the width from the left edge and the right edge of a node.
  • the two additionally defined TT split modes in Li are illustrated in FIG. 7 as Vertical TT and Horizontal TT. Table 2 provides a summary of the bin coding tree signaling used in Li for signaling possible partitions.
  • Video coding standards may support temporal scalability. That is, video coding standards may enable a bitstream of encoded video data to be decoded at different frame (or picture) rates (e.g., 60 Hz or 120 Hz).
  • ITU-T H.265 describes a sub-bitstream extraction process where encoded video frames within a sequence of encoded video data include respective temporal identifiers such that a particular subset of encoded video frames can be extracted for decoding.
  • each picture may be associated with a temporal identifier (i.e., a TemporalId variable in ITU-T H.265 or more generally, TempID).
  • ITU-T H.265 defines a sub-bitstream extraction process where pictures in a bitstream that do not belong to a target set, as determined by a target highest TemporalId and a target layer identifier list, are removed from the bitstream, with the output sub-bitstream consisting of the NAL units in the bitstream that belong to the target set.
  • FIG. 8A is a conceptual diagram illustrating temporal layers of video in accordance with one or more techniques of this disclosure.
  • FIG. 8A illustrates a typical prediction structure used in a random access configuration with GOP size of 8.
  • pictures may be included in layers having a TempID value.
  • One or more layers may be used to form video having a particular frame rate.
  • a POC value includes a picture order count value indicating the presentation order of the pictures. That is, for example, the picture identified as POC 0 is displayed before the picture identified as POC 1. It should be noted that the order in which pictures are displayed are not necessarily the same as the order in which pictures are coded.
  • a picture may only use information (e.g., syntax element values, derived variable values, decoded sample values, etc.) from same or lower temporal layers.
  • information e.g., syntax element values, derived variable values, decoded sample values, etc.
  • the arrows indicate whether a picture may reference another picture, where a picture has arrows pointing to pictures which may reference it.
  • the level of parallelism i.e., the potential number of pictures that may be coded simultaneously
  • POC 2 may not be coded until POC 0, POC 4, and POC 8 are coded.
  • a layer is more generically defined as a set of pictures with the same layer identifier.
  • a layer may be a representation of the video which differs from other representations in terms of spatial resolution or quality.
  • the term layer may be used to refer to one or more pictures having a common coding parameter and sets of layers may be used to form a presentation of video data.
  • the term layer may be used to distinguish a first set of pictures forming a video sequence (i.e., a first layer) and a second group of pictures forming the video sequence (e.g., a second layer), where the second group of pictures has one or more coding parameters which are different from the first layer.
  • a second group of pictures may have one or more coding features that are enabled for the first layer disabled (e.g., QP delta signaling may be enabled for the first layer and disabled for the second layer).
  • QP delta signaling may be enabled for the first layer and disabled for the second layer.
  • different layers may be distinguished by referencing different parameter sets (e.g., each layer may reference a different picture parameter set (PPS)). Layers may be arranged in a rank order according to parameter distinctions.
  • a layer with a basic set of coding features enabled may be a base layer (e.g., layer 0) and additional layers may be ordered according to the number of coding features in the basic set which are enabled or disabled (e.g., layer 1 may have N features disabled and layer 2 may have N+1 features disabled).
  • layer 1 may have N features disabled
  • layer 2 may have N+1 features disabled.
  • constraints with respect to predictions dependencies between layers may or may not be imposed. For example, is some cases a layer may be required to be independently decodable and in some cases, layers may be restricted with respect to which layers may be referenced for prediction purposes.
  • FIG. 8A illustrates a typical prediction structure used in a random access configuration with GOP size of 8.
  • Another typical prediction structure includes a low-delay configuration where the order in which pictures are coded is typically the same as order in which pictures are displayed. Further, in a low delay configuration the maximum number of pictures buffered is smaller (i.e., there are few pictures to reference for coding).
  • FIG. 8B illustrates a typical low delay prediction structure. In FIG. 8B, the decoding order is the same as the display order. As illustrated in FIG. 8B, each picture, expect POC 0, which starts the sequence, and POC 1, which only has one available picture, references the two prior decoded pictures. Thus, in prediction structure illustrated in FIG. 8B, parallelism is difficult to achieve due to the prediction structure employed.
  • quantization may be used in order to vary the amount of data required to represent a group of transform coefficients.
  • the degree of quantization or quantization/dequantization step size
  • the amount of distortion may be increased (e.g., reconstructed video data may appear more “blocky” to a user).
  • the amount of data required to code video data is expressed as a bit-rate and, as such, the tradeoff between the amount of data required to code video data and the amount of distortion may be referred to as a rate-distortion.
  • a rate-distortion search may refer to a process of comparing coding parameters in order to determine which coding parameters provide a better rate-distortion tradeoff. It should be noted that one way to compare different coding parameter values is by computing the Lagrangian cost as a function distortion and rate. Typically, the coding parameter value with the lowest Lagrangian cost is selected by a video encoder. In one example, the Lagrangian cost may be computed as the sum of distortion and rate multiplied by a Lagrange multiplier, lambda. The Lagrange multiplier may decrease in value with decreasing QP.
  • the QP value may be described as controlling the amount of error in a region of reconstructed video when compared to a source video, where finer quantization results in less error and a relatively higher bit-rate and coarser quantization results in more error and a relatively lower bit-rate.
  • QP adjustments may be used to achieve a desired bit-rate.
  • rate control (RC) algorithms may refer to algorithms that code video data according to a specified bit-rate.
  • a rate control algorithm may seek to minimize error for a maximum allowable bit-rate (e.g., 5 Megabits per Second (Mb/s)).
  • a lower QP typically causes more coding modes to become competitive. That is, for example, more possible partitionings of a current video block and corresponding predictions (e.g., intra prediction modes and motion vectors) may be considered for possible coding of a current video block, as a lower QP value allows more data to be included in the residual correct a prediction to align with a current video block.
  • a video encoder typically performs more comparisons of coding modes during a rate-distortion search when a QP value is lowered. It should be noted that low bit-rate consumption modes, such as, a so-called early skip mode, are often used to terminate a rate-distortion search early and increase the speed of a video encoder. However, these types of approaches become less effective as QP is decreased.
  • the rate at which a video encoder performs encoding of video data may be increased.
  • it may be desirable to reduce the distortion in low latency applications e.g., low latency applications, such as, remote controlled robotic surgery.
  • the temporal prediction structure employed prevents the use of such parallel encoding techniques. According to the techniques described herein, the speed at which a video encoder encodes video data may be increased.
  • FIG. 9 is a block diagram illustrating an example of a system that may be configured to code (i.e., encode and/or decode) video data according to one or more techniques of this disclosure.
  • System 100 represents an example of a system that may perform video coding using partitioning techniques described according to one or more techniques of this disclosure.
  • system 100 includes source device 102, communications medium 110, and destination device 120.
  • source device 102 may include any device configured to encode video data and transmit encoded video data to communications medium 110.
  • Destination device 120 may include any device configured to receive encoded video data via communications medium 110 and to decode encoded video data.
  • Source device 102 and/or destination device 120 may include computing devices equipped for wired and/or wireless communications and may include set top boxes, digital video recorders, televisions, desktop, laptop, or tablet computers, gaming consoles, mobile devices, including, for example, “smart” phones, cellular telephones, personal gaming devices, and medical imagining devices.
  • Communications medium 110 may include any combination of wireless and wired communication media, and/or storage devices.
  • Communications medium 110 may include coaxial cables, fiber optic cables, twisted pair cables, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that may be useful to facilitate communications between various devices and sites.
  • Communications medium 110 may include one or more networks.
  • communications medium 110 may include a network configured to enable access to the World Wide Web, for example, the Internet.
  • a network may operate according to a combination of one or more telecommunication protocols. Telecommunications protocols may include proprietary aspects and/or may include standardized telecommunication protocols.
  • Examples of standardized telecommunications protocols include Digital Video Broadcasting (DVB) standards, Advanced Television Systems Committee (ATSC) standards, Integrated Services Digital Broadcasting (ISDB) standards, Data Over Cable Service Interface Specification (DOCSIS) standards, Global System Mobile Communications (GSM) standards, code division multiple access (CDMA) standards, 3rd Generation Partnership Project (3GPP) standards, European Telecommunications Standards Institute (ETSI) standards, Internet Protocol (IP) standards, Wireless Application Protocol (WAP) standards, and Institute of Electrical and Electronics Engineers (IEEE) standards.
  • DVD Digital Video Broadcasting
  • ATSC Advanced Television Systems Committee
  • ISDB Integrated Services Digital Broadcasting
  • DOCSIS Data Over Cable Service Interface Specification
  • GSM Global System Mobile Communications
  • CDMA code division multiple access
  • 3GPP 3rd Generation Partnership Project
  • ETSI European Telecommunications Standards Institute
  • IP Internet Protocol
  • WAP Wireless Application Protocol
  • IEEE Institute of Electrical and Electronics Engineers
  • Storage devices may include any type of device or storage medium capable of storing data.
  • a storage medium may include a tangible or non-transitory computer-readable media.
  • a computer readable medium may include optical discs, flash memory, magnetic memory, or any other suitable digital storage media.
  • a memory device or portions thereof may be described as non-volatile memory and in other examples portions of memory devices may be described as volatile memory.
  • Examples of volatile memories may include random access memories (RAM), dynamic random access memories (DRAM), and static random access memories (SRAM).
  • Examples of non-volatile memories may include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories.
  • Storage device(s) may include memory cards (e.g., a Secure Digital (SD) memory card), internal/external hard disk drives, and/or internal/external solid state drives. Data may be stored on a storage device according to a defined file format
  • source device 102 includes video source 104, video encoder 106, and interface 108.
  • Video source 104 may include any device configured to capture and/or store video data.
  • video source 104 may include a video camera and a storage device operably coupled thereto.
  • Video encoder 106 may include any device configured to receive video data and generate a compliant bitstream representing the video data.
  • a compliant bitstream may refer to a bitstream that a video decoder can receive and reproduce video data therefrom. Aspects of a compliant bitstream may be defined according to a video coding standard.
  • video encoder 106 may compress video data. Compression may be lossy (discernible or indiscernible) or lossless.
  • Interface 108 may include any device configured to receive a compliant video bitstream and transmit and/or store the compliant video bitstream to a communications medium.
  • Interface 108 may include a network interface card, such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can send and/or receive information.
  • interface 108 may include a computer system interface that may enable a compliant video bitstream to be stored on a storage device.
  • interface 108 may include a chipset supporting Peripheral Component Interconnect (PCI) and Peripheral Component Interconnect Express (PCIe) bus protocols, proprietary bus protocols, Universal Serial Bus (USB) protocols, I 2 C, or any other logical and physical structure that may be used to interconnect peer devices.
  • PCI Peripheral Component Interconnect
  • PCIe Peripheral Component Interconnect Express
  • USB Universal Serial Bus
  • destination device 120 includes interface 122, video decoder 124, and display 126.
  • Interface 122 may include any device configured to receive a compliant video bitstream from a communications medium.
  • Interface 108 may include a network interface card, such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can receive and/or send information.
  • interface 122 may include a computer system interface enabling a compliant video bitstream to be retrieved from a storage device.
  • interface 122 may include a chipset supporting PCI and PCIe bus protocols, proprietary bus protocols, USB protocols, I 2 C, or any other logical and physical structure that may be used to interconnect peer devices.
  • Video decoder 124 may include any device configured to receive a compliant bitstream and/or acceptable variations thereof and reproduce video data therefrom.
  • Display 126 may include any device configured to display video data.
  • Display 126 may comprise one of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display.
  • Display 126 may include a High Definition display or an Ultra High Definition display. It should be noted that although in the example illustrated in FIG. 9, video decoder 124 is described as outputting data to display 126, video decoder 124 may be configured to output video data to various types of devices and/or sub-components thereof. For example, video decoder 124 may be configured to output video data to any communication medium, as described herein.
  • FIG. 10 is a block diagram illustrating an example of video encoder 200 that may implement the techniques for encoding video data described herein. As illustrated in FIG. 10, video encoder 200 receives source video blocks and outputs a bitstream. It should be noted that although example video encoder 200 is illustrated as having distinct functional blocks, such an illustration is for descriptive purposes and does not limit video encoder 200 and/or sub-components thereof to a particular hardware or software architecture. Functions of video encoder 200 may be realized using any combination of hardware, firmware, and/or software implementations. In one example, video encoder 200 may be configured to encode video data according to the techniques described herein. Video encoder 200 may perform intra prediction coding and inter prediction coding of picture areas, and, as such, may be referred to as a hybrid video encoder.
  • video encoder 200 receives source video blocks.
  • source video blocks may include areas of picture that has been divided according to a coding structure.
  • source video data may include macroblocks, CTUs, CBs, sub-divisions thereof, and/or another equivalent coding unit.
  • video encoder 200 may be configured to perform additional sub-divisions of source video blocks. It should be noted that some techniques described herein may be generally applicable to video coding, regardless of how source video data is partitioned prior to and/or during encoding. In the example illustrated in FIG.
  • video encoder 200 includes summer 202, transform coefficient generator 204, coefficient quantization unit 206, inverse quantization/transform processing unit 208, summer 210, intra prediction processing unit 212, inter prediction processing unit 214, filter unit 216, and entropy encoding unit 218.
  • video encoder 200 may be configured to increase the speed at which an implementation thereof can encode source video data by selectively disabling coding modes. Further, video encoder 200 may be configured to communicate selectively disabled coding modes to a corresponding video decoder via explicit signaling and/or implicit/inferred signaling.
  • the signaling may be included in parameter sets, slice headers, profiles/levels, etc. As described in further detail below, the signaling may include one or more thresholds at which coding modes may be disabled.
  • the term layer may be used to refer to one or more pictures having common coding parameters and sets of layers may be used to form a presentation of video data, where each layer within a set of layers may corresponds to a rank order.
  • video encoder 200 may be configured to generate a ranked a set of layers. For example, referring to FIG.
  • video encoder 200 may be configured to group POC 0, POC 2, POC 4, POC 6 and POC 8 in a first layer (e.g., layer 0) based on each picture being associated with a relatively low level of quantization and group POC 1, POC 3, POC 5, and POC 7 in a second layer (e.g., layer 1) based on each picture being associated with a relatively high level of quantization. That is, the first layer may be a high quality layer and the second layer may be a low quality layer.
  • video encoder 200 may be configured to generate a ranked a set of layers according to the following QP assignment rules:
  • pictures coded using QPd may be assigned the highest layer (e.g., layer 3), pictures coded using QPc may be assigned the next lowest layer (e.g., layer 2), pictures coded using QPb may be assigned the next lowest layer (e.g., layer 1), and pictures coded using QPa may be assigned the lowest layer (e.g., layer 0).
  • N, M, X, and Y may be equal (e.g., 4).
  • video encoder 200 may be configured to encode pictures occurring at specified presentation and/or decoding order intervals according to a specified quality and generate a ranked set of layers according to relatively encoding quality. It should be noted that such a fluctuation in quality of pictures typically goes unnoticed by the human eye when the video is presented.
  • video encoder 200 may be configured to selectively disable (i.e., turn off) TT partitioning.
  • TT partitioning the example bin coding signaling illustrated in Table 3 may be modified. That is, the signaling may be simplified to exclude the TT partitionings which are disabled.
  • Table 4 illustrates an example of bin coding signaling used for a node where TT partitioning is disabled.
  • video encoder 200 may be configured to selectively disable ABT partitioning.
  • the example bin coding signaling illustrated in Table 3 may be modified. That is, the signaling may be simplified to exclude the ABT partitionings which are disabled.
  • Table 5 illustrates an example of bin coding signaling used for a node where TT partitioning and ABT partitioning is disabled.
  • video encoder 200 may be further configured to selectively disable TT partitioning and ABT partitioning.
  • the example bin coding signaling illustrated in Table 3 may be modified. That is, the signaling may be simplified to exclude the partitionings which are disabled.
  • Table 6 illustrates an example of bin coding signaling used for a node where TT partitioning and ABT partitioning are disabled.
  • video encoder 200 may be configured to signal which partitioning modes are enabled or disabled.
  • video encoder 200 may be configured to indicate a layer threshold (for example, a quality layer threshold, a temporal layer threshold, or another coding parameter layer threshold) such that one or more partitioning modes are disabled for pictures having a layer identifier greater than or equal to a threshold.
  • video encoder 200 may be configured to indicate a quantization parameter threshold such that one or more partitioning modes are disabled for pictures (or slices) having a quantization parameter greater than or equal to a threshold.
  • an indicated a quantization parameter threshold for disabling partition modes for a slice may be compared to a QP value signaled at the slice level.
  • an indicated a quantization parameter threshold for disabling partition modes for pictures may be compared to a quantization parameter generated as a function of all of the QP values signaled at the slice level in the picture.
  • a QP threshold value may be compared to the minimum (or maximum or an average value) of the slice level QP values.
  • video encoder 200 may be configured to determine a QP value for each quadtree leaf node and selectively disable partitioning modes that may be used to subsequently partition the quadtree leaf node based on a quantization parameter threshold value.
  • video encoder 200 may be configured to signal whether a particular set of partitioning modes form a base set of partitioning modes (e.g., QT, BT, and ABT) and may further be configured to indicate whether a particular mechanism (e.g., one or more threshold values) is used to further enable or disable partitioning modes. That is, for example, a corresponding video decoder may evaluate one or more parameter set and/or slice header values to determine how to evaluate a particular set of split flags signaled by video encoder 200 in order to determine partitioning for a current video block.
  • a base set of partitioning modes e.g., QT, BT, and ABT
  • TT partitioning modes may be disabled for pictures (or slices) that have a layer greater than or equal to a layer threshold value and having a QP value less than or equal to a QP threshold value.
  • TT partitioning modes may be disabled for pictures (or slices) that have a layer identifier greater than or equal to a first layer identifier threshold value and having a QP value less than or equal to a first QP threshold value
  • ABT partitioning modes may be disabled for pictures (or slices) that have a layer identifier greater than or equal to a second layer identifier threshold value and having a QP value less than or equal to a second QP threshold value.
  • first and second threshold values may be distinct and in some examples, the first and second threshold values may be the same.
  • video encoder 200 may be configured to signal the threshold values.
  • one or more partitioning modes may be disabled on a layer-by-layer basis and/or on a layer subset-by-layer subset basis.
  • video encoder 200 represents an example of a device configured to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, and disable one or more partitioning modes for the current video block based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • video encoder 200 may generate residual data by subtracting a predictive video block from a source video block.
  • Summer 202 represents a component configured to perform this subtraction operation.
  • the subtraction of video blocks occurs in the pixel domain.
  • Transform coefficient generator 204 applies a transform, such as a discrete cosine transform (DCT), a discrete sine transform (DST), or a conceptually similar transform, to the residual block or sub-divisions thereof (e.g., four 8x8 transforms may be applied to a 16x16 array of residual values) to produce a set of residual transform coefficients.
  • Transform coefficient generator 204 may be configured to perform any and all combinations of the transforms included in the family of discrete trigonometric transforms.
  • transform coefficient generator 204 may be configured to perform transformations according to arrays having sizes of 4x4, 8x8, 16x16, and 32x32.
  • transform coefficient generator 204 may be further configured to perform transformations according to arrays having other dimensions. In particular, in some cases, it may be useful to perform transformations on rectangular arrays of difference values.
  • transform coefficient generator 204 may be configured to perform transformations according to the following sizes of arrays: 2x2, 2x4N, 4Mx2, and/or 4Mx4N.
  • a 2-dimensional (2D) MxN inverse transform may be implemented as 1-dimensional (1D) M-point inverse transform followed by a 1D N-point inverse transform.
  • a 2D inverse transform may be implemented as a 1D N-point vertical transform followed by a 1D N-point horizontal transform.
  • a 2D inverse transform may be implemented as a 1D N-point horizontal transform followed by a 1D N-point vertical transform.
  • Transform coefficient generator 204 may output transform coefficients to coefficient quantization unit 206.
  • Coefficient quantization unit 206 may be configured to perform quantization of the transform coefficients. As described above, the degree of quantization may be modified by adjusting a quantization parameter. Coefficient quantization unit 206 may be further configured to determine quantization parameters and output QP data (e.g., data used to determine a quantization group size and/or delta QP values) that may be used by a video decoder to reconstruct a quantization parameter to perform inverse quantization during video decoding. It should be noted that in other examples, one or more additional or alternative parameters may be used to determine a level of quantization (e.g., scaling factors). The techniques described herein may be generally applicable to determining a level of quantization for transform coefficients corresponding to a component of video data based on a level of quantization for transform coefficients corresponding another component of video data.
  • QP data e.g., data used to determine a quantization group size and/or delta QP values
  • quantized transform coefficients are output to inverse quantization/transform processing unit 208.
  • Inverse quantization/transform processing unit 208 may be configured to apply an inverse quantization and an inverse transformation to generate reconstructed residual data.
  • reconstructed residual data may be added to a predictive video block.
  • Video encoder 200 may be configured to perform multiple coding passes (e.g., perform encoding while varying one or more of a prediction, transformation parameters, and quantization parameters). The rate-distortion of a bitstream or other system parameters may be optimized based on evaluation of reconstructed video blocks. Further, reconstructed video blocks may be stored and used as reference for predicting subsequent blocks.
  • a video block may be coded using an intra prediction.
  • Intra prediction processing unit 212 may be configured to select an intra prediction mode for a video block to be coded.
  • Intra prediction processing unit 212 may be configured to evaluate a frame and/or an area thereof and determine an intra prediction mode to use to encode a current block.
  • intra prediction processing unit 212 outputs intra prediction data (e.g., syntax elements) to entropy encoding unit 218 and transform coefficient generator 204.
  • intra prediction data e.g., syntax elements
  • a transform performed on residual data may be mode dependent.
  • possible intra prediction modes may include planar prediction modes, DC prediction modes, and angular prediction modes.
  • a prediction for a chroma component may be inferred from an intra prediction for a luma prediction mode.
  • Inter prediction processing unit 214 may be configured to perform inter prediction coding for a current video block.
  • Inter prediction processing unit 214 may be configured to receive source video blocks and calculate a motion vector for PUs of a video block.
  • a motion vector may indicate the displacement of a PU (or similar coding structure) of a video block within a current video frame relative to a predictive block within a reference frame.
  • Inter prediction coding may use one or more reference pictures. Further, motion prediction may be uni-predictive (use one motion vector) or bi-predictive (use two motion vectors).
  • Inter prediction processing unit 214 may be configured to select a predictive block by calculating a pixel difference determined by, for example, sum of absolute difference (SAD), sum of square difference (SSD), or other difference metrics. As described above, a motion vector may be determined and specified according to motion vector prediction. Inter prediction processing unit 214 may be configured to perform motion vector prediction, as described above. Inter prediction processing unit 214 may be configured to generate a predictive block using the motion prediction data. For example, inter prediction processing unit 214 may locate a predictive video block within a frame buffer (not shown in FIG. 10). It should be noted that inter prediction processing unit 214 may further be configured to apply one or more interpolation filters to a reconstructed residual block to calculate sub-integer pixel values for use in motion estimation.
  • SAD sum of absolute difference
  • SSD sum of square difference
  • Inter prediction processing unit 214 may output motion prediction data for a calculated motion vector to entropy encoding unit 218. As illustrated in FIG. 10, inter prediction processing unit 214 may receive reconstructed video block via filter unit 216. Filter unit 216 may be configured to perform deblocking and/or Sample Adaptive Offset (SAO) filtering. Deblocking refers to the process of smoothing the boundaries of reconstructed video blocks (e.g., make boundaries less perceptible to a viewer). SAO filtering is a non-linear amplitude mapping that may be used to improve reconstruction by adding an offset to reconstructed video data.
  • SAO Sample Adaptive Offset
  • entropy encoding unit 218 receives quantized transform coefficients and predictive syntax data (i.e., intra prediction data, motion prediction data, QP data, etc.). It should be noted that in some examples, coefficient quantization unit 206 may perform a scan of a matrix including quantized transform coefficients before the coefficients are output to entropy encoding unit 218. In other examples, entropy encoding unit 218 may perform a scan. Entropy encoding unit 218 may be configured to perform entropy encoding according to one or more of the techniques described herein. Entropy encoding unit 218 may be configured to output a compliant bitstream, i.e., a bitstream that a video decoder can receive and reproduce video data therefrom.
  • a compliant bitstream i.e., a bitstream that a video decoder can receive and reproduce video data therefrom.
  • FIG. 11 is a block diagram illustrating an example of a video decoder that may be configured to decode video data according to one or more techniques of this disclosure.
  • video decoder 300 may be configured to reconstruct video data based on one or more of the techniques described above. That is, video decoder 300 may operate in a reciprocal manner to video encoder 200 described above.
  • Video decoder 300 may be configured to perform intra prediction decoding and inter prediction decoding and, as such, may be referred to as a hybrid decoder.
  • video decoder 300 includes an entropy decoding unit 302, inverse quantization unit 304, inverse transformation processing unit 306, intra prediction processing unit 308, inter prediction processing unit 310, summer 312, filter unit 314, and reference buffer 316.
  • Video decoder 300 may be configured to decode video data in a manner consistent with a video encoding system, which may implement one or more aspects of a video coding standard. It should be noted that although example video decoder 300 is illustrated as having distinct functional blocks, such an illustration is for descriptive purposes and does not limit video decoder 300 and/or sub-components thereof to a particular hardware or software architecture. Functions of video decoder 300 may be realized using any combination of hardware, firmware, and/or software implementations.
  • entropy decoding unit 302 receives an entropy encoded bitstream.
  • Entropy decoding unit 302 may be configured to decode quantized syntax elements and quantized coefficients from the bitstream according to a process reciprocal to an entropy encoding process.
  • Entropy decoding unit 302 may be configured to perform entropy decoding according any of the entropy coding techniques described above.
  • Entropy decoding unit 302 may parse an encoded bitstream in a manner consistent with a video coding standard.
  • Video decoder 300 may be configured to parse an encoded bitstream where the encoded bitstream is generated based on the techniques described above.
  • video decoder 300 may be configured to determine partitioning structures generated and/or signaled based on one or more of the techniques described above for purposes of reconstructing video data. For example, video decoder 300 may be configured to parse syntax elements and/or evaluate properties of video data in order to determine a partitioning. That is, for example video decoder 300 may be configured to determine whether one or more partitioning modes for a picture (or slice) have been disabled based on whether a layer is greater than or equal to a layer threshold value and/or whether a QP value is less than or equal to a QP threshold value.
  • inverse quantization unit 304 receives quantized transform coefficients (i.e., level values) and quantization parameter data from entropy decoding unit 302.
  • Quantization parameter data may include any and all combinations of delta QP values and/or quantization group size values and the like described above.
  • Video decoder 300 and/or inverse quantization unit 304 may be configured to determine QP values used for inverse quantization based on values signaled by a video encoder and/or through video properties and/or coding parameters. That is, inverse quantization unit 304 may operate in a reciprocal manner to coefficient quantization unit 206 described above.
  • Inverse quantization unit 304 may be configured to apply an inverse quantization.
  • Inverse transform processing unit 306 may be configured to perform an inverse transformation to generate reconstructed residual data.
  • the techniques respectively performed by inverse quantization unit 304 and inverse transform processing unit 306 may be similar to techniques performed by inverse quantization/transform processing unit 208 described above.
  • Inverse transform processing unit 306 may be configured to apply an inverse DCT, an inverse DST, an inverse integer transform, Non-Separable Secondary Transform (NSST), or a conceptually similar inverse transform processes to the transform coefficients in order to produce residual blocks in the pixel domain. Further, as described above, whether a particular transform (or type of particular transform) is performed may be dependent on an intra prediction mode. As illustrated in FIG. 11, reconstructed residual data may be provided to summer 312.
  • Summer 312 may add reconstructed residual data to a predictive video block and generate reconstructed video data.
  • a predictive video block may be determined according to a predictive video technique (i.e., intra prediction and inter frame prediction).
  • video decoder 300 and the filter unit 314 may be configured to determine QP values and use them for post filtering (e.g., deblocking).
  • other functional blocks of the video decoder 300 which make use of QP may determine QP based on received signaling and use that for decoding.
  • Intra prediction processing unit 308 may be configured to receive intra prediction syntax elements and retrieve a predictive video block from reference buffer 316.
  • Reference buffer 316 may include a memory device configured to store one or more frames of video data.
  • Intra prediction syntax elements may identify an intra prediction mode, such as the intra prediction modes described above.
  • intra prediction processing unit 308 may reconstruct a video block using according to one or more of the intra prediction coding techniques described herein.
  • Inter prediction processing unit 310 may receive inter prediction syntax elements and generate motion vectors to identify a prediction block in one or more reference frames stored in reference buffer 316.
  • Inter prediction processing unit 310 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters.
  • Inter prediction processing unit 310 may use interpolation filters to calculate interpolated values for sub-integer pixels of a reference block.
  • Filter unit 314 may be configured to perform filtering on reconstructed video data.
  • filter unit 314 may be configured to perform deblocking and/or SAO filtering, as described above with respect to filter unit 216.
  • filter unit 314 may be configured to perform proprietary discretionary filter (e.g., visual enhancements).
  • a reconstructed video block may be output by video decoder 300.
  • video decoder 300 may be configured to generate reconstructed video data according to one or more of the techniques described herein.
  • video decoder 300 represents an example of a device configured to determine a parameter threshold value, determine whether a parameter associated with a current video block is greater than the parameter threshold value, receive signaling corresponding to a partitioning associated the current video block, and determine partitioning associated the current video block based on the received signaling and based on whether the parameter associated with the current video block is greater than the parameter threshold value.
  • Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol.
  • Computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave.
  • Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure.
  • a computer program product may include a computer-readable medium.
  • such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • any connection is properly termed a computer-readable medium.
  • a computer-readable medium For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium.
  • DSL digital subscriber line
  • Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
  • processors such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable logic arrays
  • processors may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein.
  • the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.
  • the techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set).
  • IC integrated circuit
  • a set of ICs e.g., a chip set.
  • Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.
  • each functional block or various features of the base station device and the terminal device used in each of the aforementioned embodiments may be implemented or executed by a circuitry, which is typically an integrated circuit or a plurality of integrated circuits.
  • the circuitry designed to execute the functions described in the present specification may comprise a general-purpose processor, a digital signal processor (DSP), an application specific or general application integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic, or a discrete hardware component, or a combination thereof.
  • the general-purpose processor may be a microprocessor, or alternatively, the processor may be a conventional processor, a controller, a microcontroller or a state machine.
  • the general-purpose processor or each circuit described above may be configured by a digital circuit or may be configured by an analogue circuit. Further, when a technology of making into an integrated circuit superseding integrated circuits at the present time appears due to advancement of a semiconductor technology, the integrated circuit by this technology is also able to be used.

Landscapes

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

Abstract

La présente invention concerne le codage vidéo et, plus particulièrement, des techniques de partitionnement d'une image de données vidéo. Selon un aspect de l'invention, un ou plusieurs modes de partitionnement pour un bloc vidéo courant sont désactivés sur la base du fait qu'un paramètre associé au bloc vidéo courant est supérieur à une valeur seuil de paramètre.
PCT/JP2019/012255 2018-03-27 2019-03-22 Systèmes et procédés de partitionnement de blocs vidéo pour un codage vidéo reposant sur des valeurs seuil WO2019188845A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862648914P 2018-03-27 2018-03-27
US62/648,914 2018-03-27

Publications (1)

Publication Number Publication Date
WO2019188845A1 true WO2019188845A1 (fr) 2019-10-03

Family

ID=68058936

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2019/012255 WO2019188845A1 (fr) 2018-03-27 2019-03-22 Systèmes et procédés de partitionnement de blocs vidéo pour un codage vidéo reposant sur des valeurs seuil

Country Status (1)

Country Link
WO (1) WO2019188845A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016125604A1 (fr) * 2015-02-06 2016-08-11 ソニー株式会社 Dispositif et procédé de codage d'image
WO2017123980A1 (fr) * 2016-01-15 2017-07-20 Qualcomm Incorporated Structure arborescente à types multiples pour le codage vidéo
WO2018037853A1 (fr) * 2016-08-26 2018-03-01 シャープ株式会社 Appareil de décodage d'images et appareil de codage d'images

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016125604A1 (fr) * 2015-02-06 2016-08-11 ソニー株式会社 Dispositif et procédé de codage d'image
WO2017123980A1 (fr) * 2016-01-15 2017-07-20 Qualcomm Incorporated Structure arborescente à types multiples pour le codage vidéo
WO2018037853A1 (fr) * 2016-08-26 2018-03-01 シャープ株式会社 Appareil de décodage d'images et appareil de codage d'images

Similar Documents

Publication Publication Date Title
US12095991B2 (en) Systems and methods for partitioning video blocks for video coding
AU2018311926B2 (en) Systems and methods for partitioning video blocks in an inter prediction slice of video data
US11259021B2 (en) Systems and methods for partitioning video blocks at a boundary of a picture for video coding
AU2017397390B2 (en) Systems and methods for scaling transform coefficient level values
WO2019230670A1 (fr) Systèmes et procédés de partitionnement de blocs vidéo dans une tranche d'interprédiction de données vidéo
US11889123B2 (en) Systems and methods for partitioning video blocks at a boundary of a picture
WO2019151257A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs de vidéo pendant le codage de vidéo
WO2019004364A1 (fr) Systèmes et procédés de partitionnement géométriquement adaptatif d'une image en blocs vidéo pour un codage vidéo
WO2019194147A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs vidéo durant un codage vidéo
US11778182B2 (en) Device for decoding video data, device for encoding video data, and method for decoding video data
WO2020129950A1 (fr) Systèmes et procédés de réalisation d'une prédiction inter dans un codage vidéo
WO2020090841A1 (fr) Systèmes et procédés de signalisation de décalage de référence en codage vidéo
WO2018142795A1 (fr) Systèmes et procédés de mise en oeuvre de codage vidéo avec prédiction intra-image planaire
WO2020149298A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs vidéo durant un codage vidéo
US11330260B2 (en) Systems and methods for adaptively partitioning video blocks for video coding
WO2019188845A1 (fr) Systèmes et procédés de partitionnement de blocs vidéo pour un codage vidéo reposant sur des valeurs seuil

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19774488

Country of ref document: EP

Kind code of ref document: A1